A Novel Simulated Annealing Based Strategy for Balanced UAV Task Assignment and Path Planning

Abstract

The unmanned aerial vehicle (UAV) has drawn increasing attention in recent years, especially in executing tasks such as natural disaster rescue and detection, and battlefield cooperative operations. Task assignment and path planning for multiple UAVs in the above scenarios are essential for successful mission execution. But, effectively balancing tasks to better excavate the potential of UAVs remains a challenge, as well as efficiently generating feasible solutions from the current one in constrained explosive solution spaces with the increase in the scale of optimization problems. This paper proposes an efficient approach for task assignment and path planning with the objective of balancing the tasks among UAVs and achieving satisfactory temporal resolutions. To be specific, we add virtual nodes according to the number of UAVs to the original model of the vehicle routing problem (VRP), thus make it easier to form a solution suitable for heuristic algorithms. Besides, the concept of the universal distance matrix is proposed to transform the temporal constraints to spatial constraints and simplify the programming model. Then, a Swap-and-Judge Simulated Annealing (SJSA) algorithm is therefore proposed to improve the efficiency of generating feasible neighboring solutions. Extensive experimental and comparative studies on different scenarios demonstrate the efficiency of the proposed algorithm compared with the exact algorithm and meta-heuristic algorithms. The results also inspire us about the characteristics of a population-based algorithm in solving combinatorial discrete optimization problems.

A Consolidated Review of Path Planning and Optimization Techniques: Technical Perspectives and Future Directions

“…Lisu Huo et al [199] worked on path planning and task assignment of multiple UAVs. To effectively balance the task for producing feasible solutions, the author developed the task assignment approach for balancing the UAV's objectives involving an in-flight journey.…”

A Modified Sparrow Search Algorithm with Application in 3d Route Planning for UAV

“…The three-dimensional (3d) route planning for unmanned aerial vehicle (UAV) can be considered as a multi-constraint global optimization problem [ 1 ], and the main purpose of this problem is to search for the optimal route from the departure point to the target point autonomously according to the task requirements and the flight constraints. In recent years, with the broad use of different kinds of UAV, this problem has drawn widespread attention from researchers.…”

Autonomous Vehicle Path Planning Using MPC and APF

“…Heuristic approaches are presented to overcome the limitations of conventional methods. Probabilistic Roadmap [4], Simulated Annealing [5], Ant Colony Optimization [6], Particle Swarm Optimization [7], and Grasshopper optimization [8] are a few examples of heuristic methods. However, these algorithms have problems in static and dynamic environments.…”