论文标题
城市空气交付的路线网络计划方法
A Route Network Planning Method for Urban Air Delivery
论文作者
论文摘要
高科技巨头和初创企业正在投资无人机技术,以提供城市空运服务,这有望解决最后一英里的问题并减轻道路交通拥堵。但是,如果没有适当的交通管理人员在密集的城市环境中的无人机进行适当的交通管理,则不会扩大空间。目前,研究人员,运营商和监管机构提出和评估了无人飞机系统交通管理(UTM)的一系列操作概念(CONOP)。其中,基于管子的(或基于走廊)的Conops已在世界某些地区进行无人机交付的运营中出现,并有望继续服务某些情况,这些方案具有密集且复杂的空域,并需要将来需要集中的控制。朝基于管的Conops开发了一种路线网络规划方法,以在本文复杂的城市环境中设计路线(管)。在这种方法中,我们提出了一个优先结构,将网络计划问题(即NP-HARD)解除为单路计划问题。我们还引入了一种新颖的空间成本功能,以实现网络中密集和对齐路线的设计。在各种情况下对所提出的方法进行了测试,并将其与其他最先进的方法进行了比较。结果表明,我们的方法可以生成具有大量计算时间的近乎最佳路由网络。
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.