Abstract

Path planning for quadcopters has been proven to be one kind of NP-hard problem with huge search space and tiny feasible solution range. Metaheuristic algorithms are widely used in such types of problems for their flexibility and effectiveness. Nevertheless, most of them cannot meet the needs in terms of efficiency and suffer from the limitations of premature convergence and local minima. This paper proposes a novel algorithm named Heuristic Hybrid Particle Swarm Optimization (HHPSO) to address the path planning problem. On the heuristic side, we use the control points of cubic b-splines as variables instead of waypoints and establish some heuristic rules during algorithm initialization to generate higher-quality particles. On the hybrid side, we introduce an iteration-varying penalty term to shrink the search range gradually, a Cauchy mutation operator to improve the exploration ability, and an injection operator to prevent population homogenization. Numerical simulations, physical model-based simulations, and a real-world experiment demonstrate the proposed algorithm’s superiority, effectiveness and robustness.

Full Text
Published version (Free)

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