UAV mission scheduling with completion time, flight distance, and resource consumption constraints

Abstract

Unmanned aerial vehicles (UAVs) are widely used in various military and civilian applications. UAV mission scheduling is a key issue in UAV applications and a central topic in UAV research. UAV task scheduling should include several constraints into consideration, such as completion time constraint, flight distance constraint, and resource consumption constraint. Furthermore, UAV task scheduling should be studied within the traditional framework of combinatorial optimisation. In this paper, we consider optimal mission scheduling for heterogeneous UAVs with completion time, flight distance, and resource consumption constraints. The contributions of the paper are summarised as follows. We define two combinatorial optimisation problems, namely, the NFTM (number of finished tasks maximisation) problem and the RFTM (reward of finished tasks maximisation) problem. We construct an algorithmic framework for both NFTM and RFTM problems, so that our heuristic algorithms (four for NFTM and two for RFTM) can be presented in a unified way. We derive upper bounds for optimal solutions, so that our heuristic solutions can be compared with optimal solutions. We experimentally evaluate the performance of our heuristic algorithms. To the best of our knowledge, this is the first paper studying UAV mission scheduling with time, distance, and resource constraints as combinatorial optimisation problems.

Keywords:

• Algorithmic framework
• combinatorial optimisation
• heterogeneous UAVs
• heuristic algorithm
• mission scheduling

Disclosure statement

No potential conflict of interest was reported by the author(s).