Efficient Large-Scale Multi-Drone Delivery Using Transit Networks

被引:20
作者
Choudhury, Shushman [1 ]
Solovey, Kiril [1 ]
Kochenderfer, Mykel J. [1 ]
Pavone, Marco [1 ]
机构
[1] Stanford Univ, Stanford, CA 94305 USA
来源
2020 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA) | 2020年
基金
美国国家科学基金会;
关键词
TRAVELING SALESMAN PROBLEM; OPTIMIZATION; ALGORITHMS;
D O I
10.1109/icra40945.2020.9197313
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the problem of controlling a large fleet of drones to deliver packages simultaneously across broad urban areas. To conserve energy, drones hop between public transit vehicles (e.g., buses and trams). We design a comprehensive algorithmic framework that strives to minimize the maximum time to complete any delivery. We address the multifaceted complexity of the problem through a two-layer approach. First, the upper layer assigns drones to package delivery sequences with a near-optimal polynomial-time task allocation algorithm. Then, the lower layer executes the allocation by periodically routing the fleet over the transit network while employing efficient bounded-suboptimal multi-agent pathfinding techniques tailored to our setting. Experiments demonstrate the efficiency of our approach on settings with up to 200 drones, 5000 packages, and transit networks with up to 8000 stops in San Francisco and Washington DC. Our results show that the framework computes solutions within a few seconds (up to 2 minutes at most) on commodity hardware, and that drones travel up to 450% of their flight range with public transit.
引用
收藏
页码:4543 / 4550
页数:8
相关论文
共 47 条
[1]   Optimization Approaches for the Traveling Salesman Problem with Drone [J].
Agatz, Niels ;
Bouman, Paul ;
Schmidt, Marie .
TRANSPORTATION SCIENCE, 2018, 52 (04) :965-981
[2]  
[Anonymous], 2005, AIIDE 05
[3]  
[Anonymous], 1990, COMPUT INTRACTABILIT
[4]  
[Anonymous], 2016, Improved solvers for bounded-suboptimal multi-agent path finding
[5]   An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem [J].
Asadpour, Arash ;
Goemans, Michel X. ;
Madry, Aleksander ;
Gharan, Shayan Oveis ;
Saberi, Amin .
OPERATIONS RESEARCH, 2017, 65 (04) :1043-1061
[6]   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-+
[7]  
Bast H, 2016, LECT NOTES COMPUT SC, V9220, P19, DOI 10.1007/978-3-319-49487-6_2
[8]   The multiple traveling salesman problem: an overview of formulations and solution procedures [J].
Bektas, T .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (03) :209-219
[9]   Rich Vehicle Routing Problem: Survey [J].
Caceres-Cruz, Jose ;
Arias, Pol ;
Guimarans, Daniel ;
Riera, Daniel ;
Juan, Angel A. .
ACM COMPUTING SURVEYS, 2015, 47 (02)
[10]   Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path Problems [J].
Carlyle, W. Matthew ;
Royset, Johannes O. ;
Wood, R. Kevin .
NETWORKS, 2008, 52 (04) :256-270