4.6 Article

Path Planning and Obstacle Avoiding of the USV Based on Improved ACO-APF Hybrid Algorithm With Adaptive Early-Warning

期刊

IEEE ACCESS
卷 9, 期 -, 页码 40728-40742

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3062375

关键词

Heuristic algorithms; Path planning; Navigation; Vehicle dynamics; Simultaneous localization and mapping; Collision avoidance; Convergence; Unmanned surface vehicles (USVs); path planning; improved ant colony optimization-artificial potential filed (ACO-APF) algorithm; unknown obstacle avoidance; field experiment

资金

  1. Jilin Province Key Science and Technology Research and Development Project [20180201040GX]
  2. Aeronautical Science Foundation of China [2019ZA0R4001]
  3. National Natural Science Foundation of China [51505174]
  4. Scientific and Technological Development Program of Jilin Province of China [20170101206JC]
  5. Foundation of Education Bureau of Jilin Province [JJKH20170789KJ]
  6. Doctoral Program of Higher Education of China [20130061120038]
  7. National Key Research and Development Program of China [2017YFC0602002]

向作者/读者索取更多资源

This study proposes an improved ACO-APF algorithm for path planning of USVs, which combines ant colony optimization and artificial potential field algorithms to enhance efficiency and safety in dynamic environments.
Path planning is important to the efficiency and navigation safety of USV autonomous operation offshore. To improve path planning, this study proposes the improved ant colony optimization-artificial potential field (ACO-APF) algorithm, which is based on a grid map for both local and global path planning of USVs in dynamic environments. The improved ant colony optimization (ACO) mechanism is utilized to search for a globally optimal path from the starting point to the endpoint for a USV in a grid environment, and the improved artificial potential field (APF) algorithm is subsequently employed to avoid unknown obstacles during USV navigation. The primary contributions of this article are as follows: (1) this article proposes a new heuristic function, pheromone update rule, and dynamic pheromone volatilization factor to improve convergence and mitigate finding local optima with the traditional ant colony algorithm; (2) we propose an equipotential line outer tangent circle and redefine potential functions to eliminate goals unreachable by nearby obstacles (GNRONs) and local minimum problems, respectively; (3) to adapt the USV to a complex environment, this article proposes a dynamic early-warning step-size adjustment strategy in which the moving distance and safe obstacle avoidance range in each step are adjusted based on the complexity of the surrounding environment; (4) the improved ant colony optimization algorithm and artificial potential field algorithm are effectively combined to form the algorithm proposed in this article, which is verified as an effective solution for USV local and global path planning using a series of simulations. Finally, in contrast to most papers, we successfully perform field experiments to verify the feasibility and effectiveness of the proposed algorithm.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据