基于多智能体系统的飞机滑行路线规划

2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC) Pub Date : 2016-10-01 DOI:10.1109/IMCEC.2016.7867448

F. Chen

{"title":"基于多智能体系统的飞机滑行路线规划","authors":"F. Chen","doi":"10.1109/IMCEC.2016.7867448","DOIUrl":null,"url":null,"abstract":"This paper proposes a route planning method based on multi-agent system for the NP-hard problem in aircraft taxiing route planning. Route planning is made according to the flight schedule in sequence for one aircraft each time. The post-planned route does not damage the existing one and route planning is made by utilizing the free time window of the taxiing road section. The artificial intelligence algorithm based on multi-agent system is designed to search the free time windows so as to find out the optimal taxiing routes for the aircrafts. The simulation results show that the average taxiing time of aircrafts is significantly reduced by comparing with the fixed pre-selected taxiing path algorithm, and the taxiing time may be saved up to 19.6% at maximum.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Aircraft taxiing route planning based on multi-agent system\",\"authors\":\"F. Chen\",\"doi\":\"10.1109/IMCEC.2016.7867448\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a route planning method based on multi-agent system for the NP-hard problem in aircraft taxiing route planning. Route planning is made according to the flight schedule in sequence for one aircraft each time. The post-planned route does not damage the existing one and route planning is made by utilizing the free time window of the taxiing road section. The artificial intelligence algorithm based on multi-agent system is designed to search the free time windows so as to find out the optimal taxiing routes for the aircrafts. The simulation results show that the average taxiing time of aircrafts is significantly reduced by comparing with the fixed pre-selected taxiing path algorithm, and the taxiing time may be saved up to 19.6% at maximum.\",\"PeriodicalId\":218222,\"journal\":{\"name\":\"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCEC.2016.7867448\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCEC.2016.7867448","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

针对飞机滑行航线规划中的np困难问题，提出了一种基于多智能体系统的航线规划方法。航路规划是根据飞行计划按顺序进行的，每次一架飞机。规划后的路线在不破坏现有路线的情况下，利用滑行路段的空闲时间窗口进行路线规划。设计了一种基于多智能体系统的人工智能算法，对飞机的空闲时间窗进行搜索，找出飞机的最优滑行路线。仿真结果表明，与固定预选滑行路径算法相比，该算法显著缩短了飞机的平均滑行时间，滑行时间最多可节省19.6%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Aircraft taxiing route planning based on multi-agent system

This paper proposes a route planning method based on multi-agent system for the NP-hard problem in aircraft taxiing route planning. Route planning is made according to the flight schedule in sequence for one aircraft each time. The post-planned route does not damage the existing one and route planning is made by utilizing the free time window of the taxiing road section. The artificial intelligence algorithm based on multi-agent system is designed to search the free time windows so as to find out the optimal taxiing routes for the aircrafts. The simulation results show that the average taxiing time of aircrafts is significantly reduced by comparing with the fixed pre-selected taxiing path algorithm, and the taxiing time may be saved up to 19.6% at maximum.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)

自引率

0.00%

发文量