Abstract

This paper considers using drones to conduct the last-mile parcel delivery. To enable the beyond-battery-lifetime flight, drone stations are considered to replace or recharge the battery for drones. We focus on the flight planning problem with the goal of minimizing the total travel time from the depot to a customer, a key indicator of the quality of service. We investigate four typical ways for the drone to get extra energy at drone stations: 1) replacing the battery with a fresh one, 2) recharging the battery to the full capacity, 3) recharging the battery to the optimal level, and 4) recharging the battery to the optimal level accounting for the availability of drone stations (i.e., whether a drone station is occupied by other drones). While the first two scenarios can be formulated following the framework of integer linear programming, the last two scenarios turn into mixed-integer nonlinear programming problems. To address the later problems, we present a framework in which discretized state graphs are constructed first and then the optimal paths are found by graph searching algorithms. We propose a dynamic version of Dijkstra’s algorithm to deal with the unavailability issue of drone stations. The algorithm can quickly find the optimal flight path for a drone, and extensive computer-based experimental results have been presented to demonstrate the effectiveness of the proposed method. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —Multi-rotary unmanned aerial vehicles (UAVs), also known as drones, have been regarded as a promising means to reshape future logistics. To save human labour and reduce cost, many giant logistics companies have been dedicated to developing various drones to deliver light and small parcels during the past decade. However, due to the limitation of payload, the battery capacity is constrained, which prevents drones from long-distance flights. Practitioners have tried the drone-vehicle collaboration method, but this still requires human labour to participate. In this paper, we present a framework where drones autonomously conduct long-distance delivery with the assistance of drone stations. It is worth pointing out that such a framework is not to replace the ground delivery method but to serve as an alternative to the ground counterpart for small and light parcels. A particular focus is on the flight planning from the depot to a destination, which includes not only a sequence of drone stations to stop at but also the corresponding rest time to recharge the battery. Several typical scenarios about battery recharging are discussed, and a dynamic version of Dijkstra’s algorithm is presented to deal with the challenging case where drone station resources are limited. The presented approach is able to find out the optimal flight plan quickly.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call