Scheduling and sequence reshuffle for autonomous aerial refueling of multiple UAVs

In this paper, we formulate the autonomous aerial refueling of multiple unmanned aerial vehicles (UAVs) as a scheduling problem. In order to find the optimal refueling sequence of UAVs, an efficient dynamic programming algorithm is introduced. When UAVs leave or join the queue, the optimal sequence needs to be recalculated. A systematic reshuffling method is developed such that the UAV sequence can be reconfigured by using the least amount of shuffle steps, where only one UAV changes its position in each step. By introducing a metric over UAV sequences, this reconfiguration effort is quantified and is treated as an additional cost which can be integrated into the dynamic programming algorithm