Global Path Planning for A Vessel Based on Improved Ant Colony Algorithm
This study presents a global path planning algorithm utilizing an enhanced ant colony algorithm to overcome challenges like vulnerability to local optima, inadequate pheromone update, and suboptimal paths in traditional ant colony algorithms for global path planning of vessels. First, an improved heuristic function is introduced to overcome the problem of local optima. Subsequently, an adaptive pheromone evaporation coefficient is employed to balance the convergence of the algorithm in different stages. Finally, an adjacent node detection algorithm for obstacles is designed to ensure that the optimized path aligns with maritime practice. The simulation results confirm the proposed algorithm's effectiveness. This research provides valuable insights and practical recommendations for global path planning in maritime navigation.
Authors
- Xiaori Gao (ORCID: https://orcid.org/0000-0002-6280-822X)
- Lidong Wang (ORCID: https://orcid.org/0000-0003-4699-7937)
- Pengfei Xu (ORCID: https://orcid.org/0000-0001-8701-2669)
- Changqing Wang (ORCID: https://orcid.org/0000-0002-1358-7731)
Institutions
- Dalian Maritime University (CN)
Publication Details
- Published
- 2024-11-01
- DOI
- https://doi.org/10.1109/iccbd-ai65562.2024.00107
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Fundamental Research Funds for the Central Universities