Abstract

In the application of data collection of the Internet of Things by unmanned aerial vehicle (UAV), UAV multi-target path planning (MPP) has an important impact. Aiming at the disadvantage of classic particle swarm optimization algorithm that is easy to fall into local optimum when solving the problem of UAV-MPP, this paper introduces the annealing mechanism and Metropolis criterion to update the particle state through simulated annealing probability jump strategy. The simulated annealing-particle swarm optimization (SA-PSO) algorithm reduces the probability of particles falling into a local optimum and improves the performance of the particle swarm algorithm in dealing with the UAV-MPP problem. The simulation results indicate that the proposed SA-PSO algorithm has the characteristics of strong ability to avoid local optima and the faster convergence speed.

Full Text

Published Version

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.