自由飞行
启发式
路径(计算)
计算机科学
运筹学
空中交通管理
运动规划
功能(生物学)
冲突解决
空中交通管制
运输工程
模拟
工程类
航空航天工程
计算机网络
人工智能
进化生物学
法学
政治学
生物
机器人
作者
Wei Dai,Bizhao Pang,Kin Huat Low
标识
DOI:10.1016/j.ast.2021.107154
摘要
Urban air mobility (UAM) has attracted the attention of aircraft manufacturers, air navigation service providers and governments in recent years. Preventing the conflict among urban aircraft is crucial to UAM traffic safety, which is a key in enabling large scale UAM operation. Pre-flight conflict-free path planning can provide a strategic layer in the maintenance of safety performance, thus becomes an important element in UAM. This paper aims at tackling conflict-free path planning problem for UAM operation with a consideration of four-dimensional airspace management. In the paper, we first introduce AirMatrix, previously developed by the team, and extend it as a four-dimensional airspace management concept. On the basis of AirMatrix, we formulate the shortest flight time path planning problem considering resolution of conflicts with both static and dynamic obstacles. A Conflict-Free A* (CFA*) algorithm is developed for planning four-dimensional paths based on first-come-first-served scheme. The algorithm contains a novel design of heuristic function as well as a conflict detection and resolution strategy. Numerical simulation was carried out using the building information in a typical urban area in Singapore. The results show that the algorithm can generate paths resolving a significant number of potential conflicts in airspace utilization, with acceptable computational time and flight delay. The findings of this study will provide references for stakeholders to support the development of UAM.
科研通智能强力驱动
Strongly Powered by AbleSci AI