A route network planning method for urban air delivery

被引:29
作者
He, Xinyu [1 ]
He, Fang [1 ,2 ]
Li, Lishuai [1 ,3 ]
Zhang, Lei [4 ]
Xiao, Gang [2 ]
机构
[1] City Univ Hong Kong, Sch Data Sci, Hong Kong, Peoples R China
[2] Shanghai Jiao Tong Univ, Sch Aeronaut & Astronaut, Shanghai, Peoples R China
[3] Delft Univ Technol, Fac Aerosp Engn, Air Transport & Operat, Delft, Netherlands
[4] Antwork Technol Co Ltd, Hangzhou, Peoples R China
关键词
Urban air delivery; Urban air mobility; Unmanned aircraft system traffic management; Multi-path planning; TRAVELING SALESMAN PROBLEM; MOBILE ROBOT NAVIGATION; CONFLICT-BASED SEARCH; ALGORITHMS; SAFETY;
D O I
10.1016/j.tre.2022.102872
中图分类号
F [经济];
学科分类号
02 ;
摘要
High-tech giants and start-ups are investing in drone technologies to provide urban air delivery service, which is expected to solve the last-mile problem and mitigate road traffic congestion. However, air delivery service will not scale up without proper traffic management for drones in dense urban environment. Currently, a range of Concepts of Operations (ConOps) for unmanned aircraft system traffic management (UTM) are being proposed and evaluated by researchers, operators, and regulators. Among these, the tube-based (or corridor-based) ConOps has emerged in operations in some regions of the world for drone deliveries and is expected to continue serving certain scenarios that with dense and complex airspace and requires centralized control in the future. Towards the tube-based ConOps, we develop a route network planning method to design routes (tubes) in a complex urban environment in this paper. In this method, we propose a priority structure to decouple the network planning problem, which is NP-hard, into single-path planning problems. We also introduce a novel space cost function to enable the design of dense and aligned routes in a network. The proposed method is tested on various scenarios and compared with other state-of-the-art methods. Results show that our method can generate near-optimal route networks with significant computational time-savings.
引用
收藏
页数:25
相关论文
共 101 条
[1]   A complete multi-robot path-planning algorithm [J].
Alotaibi, Ebtehal Turki Saho ;
Al-Rawi, Hisham .
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2018, 32 (05) :693-740
[2]  
[Anonymous], 2020, CITYPOPULATION
[3]  
[Anonymous], 2017, P GLOBAL UTM C
[4]  
[Anonymous], 2006, P 5 INT JOINT C AUT, DOI [DOI 10.1145/1160633.1160735, 10.1145/1160633.1160735]
[5]   Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem [J].
Barer, Max ;
Sharon, Guni ;
Stern, Roni ;
Felner, Ariel .
21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 :961-+
[6]   Designing airspace for urban air mobility: A review of concepts and approaches [J].
Bauranov, Aleksandar ;
Rakas, Jasenka .
PROGRESS IN AEROSPACE SCIENCES, 2021, 125
[7]  
Bertram J., 2021, AIAA SCITECH 2021 FO
[8]  
Bhattacharya S, 2011, ROBOTICS: SCIENCE AND SYSTEMS VI, P177
[9]  
Bnaya Z, 2014, IEEE INT CONF ROBOT, P3743, DOI 10.1109/ICRA.2014.6907401
[10]  
Cekmez U, 2014, INT CONF UNMAN AIRCR, P347, DOI 10.1109/ICUAS.2014.6842273