Abstract
This paper proposed a new method for unmanned aerial vehicle (UAV) path planning based on K-means algorithm and simulated annealing (SA) algorithm, which solves the problem for multi-UAVs with multi-mission under complicated constraints. Firstly, the model is established for the no-fly zone, the target zone and the valid zone for cruise within it in the mission area. Then, the decomposition technique decomposes the valid area into multiple sub-target points reasonably. Secondly, the K-means algorithm is used to cluster the target points of UAV cruise, which solves the problem for UAV cruise range and scheduling issues. Combining the SA algorithm for the similar sub-target route planning, this technique increases the coverage of the UAVs in the sub-target area of cruise valid area. Finally, taking the real data of UAV s in earthquake relief as an example, the effectiveness and robustness of the proposed method is validated by simulation experiments.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
