Reliable Path Planning for Drone Delivery Using a Stochastic Time-Dependent Public Transportation Network

被引:79
作者
Huang, Hailong [1 ]
Savkin, Andrey, V [1 ]
Huang, Chao [2 ]
机构
[1] Univ New South Wales, Sch Elect Engn & Telecommun, Sydney, NSW 2052, Australia
[2] Univ Wollongong, Sch Elect Comp & Telecommun Engn, Wollongong, NSW 2522, Australia
基金
澳大利亚研究理事会;
关键词
Drones; Public transportation; Reliability; Stochastic processes; Path planning; Batteries; Logistics; Parcel delivery; drones; unmanned aerial vehicles (UAVs); path planning; public transportation network; stochastic time-dependent network; FACILITY LOCATION PROBLEM; SHORTEST-PATH; TRAVEL-TIME; OPTIMIZATION; CITY; BUS;
D O I
10.1109/TITS.2020.2983491
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Drones have been regarded as a promising means for future delivery industry by many logistics companies. Several drone-based delivery systems have been proposed but they generally have a drawback in delivering customers locating far from warehouses. This paper proposes an alternative system based on a public transportation network. This system has the merit of enlarging the delivery range. As the public transportation network is actually a stochastic time-dependent network, we focus on the reliable drone path planning problem (RDPP). We present a stochastic model to characterize the path traversal time and develop a label setting algorithm to construct the reliable drone path. Furthermore, we consider the limited battery lifetime of the drone to determine whether a path is feasible, and we account this as a constraint in the optimization model. To accommodate the feasibility, the developed label setting algorithm is extended by adding a simple operation. The complexity of the developed algorithm is analyzed and how it works is demonstrated via a case study.
引用
收藏
页码:4941 / 4950
页数:10
相关论文
共 33 条
[1]  
Ahuja R., 1993, Network flows: theory, algorithms, and applications
[2]  
Amazon, AMAZON PRIME AIR
[3]  
[Anonymous], 2006, ICAPS
[4]   Finding the Shortest Path in Stochastic Vehicle Routing: A Cardinality Minimization Approach [J].
Cao, Zhiguang ;
Guo, Hongliang ;
Zhang, Jie ;
Niyato, Dusit ;
Fastenrath, Ulrich .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2016, 17 (06) :1688-1702
[5]   Shortest Path Finding Problem in Stochastic Time-Dependent Road Networks With Stochastic First-In-First-Out Property [J].
Chen, Bi Yu ;
Lam, William H. K. ;
Li, Qingquan ;
Sumalee, Agachai ;
Yan, Ke .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2013, 14 (04) :1907-1917
[6]   Bus travel time modelling using GPS probe and smart card data: A probabilistic approach considering link travel time and station dwell time [J].
Dai, Zhuang ;
Ma, Xiaolei ;
Chen, Xi .
JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 23 (02) :175-190
[7]  
Dijkstra EW., 1959, Numer Math (Heidelb), V1, P271, DOI [DOI 10.1007/BF01386390, 10.1007/BF01386390]
[8]  
Ding B., 2008, Proceedings of the 11th international conference on Extending database technology: Advances in database technology, P205
[9]   Vehicle Routing Problems for Drone Delivery [J].
Dorling, Kevin ;
Heinrichs, Jordan ;
Messier, Geoffrey G. ;
Magierowski, Sebastian .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2017, 47 (01) :70-85
[10]   SHORTEST PATHS IN PROBABILISTIC GRAPHS [J].
FRANK, H .
OPERATIONS RESEARCH, 1969, 17 (04) :583-&