Abstract

This paper addresses the task assignment and path planning problem of multiple UAVs. As one of the strategies for a SEAD(Suppressions of Enemy Air Defense) mission, an efficiency strategy for assignment and path planning of homogeneous UAVs is developed. There are many path planning methods (e.g. potential function method or probabilistic roadmap method) to avoid obstacles, but the Voronoi diagram is used for the path planning with avoiding the “No fly zones” in this study. Since several candidate-paths are needed to solve the problem of timing constraints, the flyable paths in the shape of net is generated by using Voronoi diagram and multiple paths are found as the candidate paths from each UAV to each target. The objective function is determined as accumulated sum of the required time to finish the tasks on each target and the optimization is achieved by using genetic algorithm with appropriate representation of chromosome and genetic operators.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.