A hierarchical mission planning method for simultaneous arrival of multi-UAV coalition

21Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

A hierarchical mission planning method was proposed to solve a simultaneous attack mission planning problem for multi-unmanned aerial vehicles (UAVs). The method consisted of three phases aiming to decouple and solve the mission planning problem. In the first phase, the Pythagorean hodograph (PH) curve was used in the path estimation process for each UAV, which also served as the input for the task allocation process. In the second phase, a task allocation algorithm based on a negotiation mechanism was proposed to assign the targets. Considering the resource requirement, time-dependent value of targets and resource consumption of UAVs, the proposed task allocation algorithm can generate a feasible allocation strategy and get the maximum system utility. In the last phase, a path planning method was proposed to generate a simultaneous arrival PH path for each UAV considering UAV's kinematic constraint and collision avoidance with obstacles. The comparison simulations showed that the path estimation process using the PH curve and the proposed task allocation algorithm improved the system utility, and the hierarchical mission planning method has potential in a real mission.

Cite

CITATION STYLE

APA

Yan, F., Zhu, X., Zhou, Z., & Chu, J. (2019). A hierarchical mission planning method for simultaneous arrival of multi-UAV coalition. Applied Sciences (Switzerland), 9(10). https://doi.org/10.3390/app9101986

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free