Online Route Planning Based on Particle Swarm Optimization with Convex Optimization
CSTR:
Author:
Affiliation:

College of Communications Engineering, PLA Army Engineering University, Nanjing 210007, China

Clc Number:

TP18

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Aiming at the path planning problem of unmanned aerial vehicle (UAV) with limited view ability in unknown environment, a particle swarm optimization (PSO) algorithm based on convex optimization is proposed to select path points. In the iterative optimization process, the fitness function of particle swarm is designed based on the trajectory, obstacle avoidance and the distance to the end point solved by the convex optimization. The trajectory between the path points is displayed after the optimal path point is obtained. The obtained trajectory is used as a part of simultaneous localization and mapping (SLAM) to build a more reliable environment map. Theoretical analysis and experimental simulation results show that compared with other intelligent algorithms and sample-based path planning algorithms, the proposed PSO based on convex optimization can effectively improve the efficiency of path planning and reduce the length of the planned path.

    Reference
    Related
    Cited by
Get Citation

Gu Chuan, Guo Daoxing, WU Bingbing. Online Route Planning Based on Particle Swarm Optimization with Convex Optimization[J].,2023,38(5):1180-1190.

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 02,2022
  • Revised:February 17,2023
  • Adopted:
  • Online: September 25,2023
  • Published:
Article QR Code