关键词: 空闲时间窗, 多Agent系统, 滑行路由规划, 航空器优先级, 先进场面活动引导与控制系统

Abstract:

Aircraft taxi routes planning for advanced surface movement guidance and control system (A-SMGCS) is a typical NP-Hard problem. To solve the contradiction between taxi routes planning optimization and the great amount of calculation, a taxi routes planning method based on free time windows is proposed and a multi-agent system (MAS) is designed to implement the algorithm. Firstly, a taxi resource graph is established to model airport taxi area. Then, any aircraft is appointed a priority according to flight schedule. Aircraft taxi route is planned sequentially according to the order of aircraft priority. Aircraft can only use free time windows of a taxiway to plan taxi route and the previous planned taxi routes cannot be destroyed. The difficulty of solving aircraft taxi routes planning problem is reduced to that we only need to find a single aircraft taxi route every time. Overall optimization of the taxi route planning is guaranteed because airport surface traffic is balanced through searching free time windows to get taxi routes. Finally, since it is a complex centralized solution process to establish, maintain and search a free time window graph, an MAS is established which makes it simplified through the route management Agent, aircraft Agent and resource node Agent, collaboratively to solve aircraft taxi route planning problem distributively. Simulation results show that the MAS can quickly find the optimal solution of free time windows. Aircraft average taxiing time decreases significantly and up to 19.6% aircraft taxiing time can be saved compared to preselection fixed-path set algorithm.

Key words: free time windows, multi-agent system, taxi routes planning, aircraft priority, A-SMGCS