Low Repetition Coverage Path Planning Model Based on Improved ACO Algorithm
Aiming at the special needs of the covering operation of the coating floor paint robot, an improved ACO algorithm using the repetition rate as the optimization evaluation index is proposed in this paper. The algorithm improves the path selection method of the traditional ACO algorithm by introducing a second-level vision strategy, which reduces the impact of the uncertainty of the path repetition rate on the planning process. Meanwhile, the updating method of the global pheromone of the ACO algorithm is optimized, which enhances the searchability of the algorithm in the early stage as well as the convergence of the algorithm in the later stage. The simulation experiment results show that compared with the traditional ACO algorithm, the proposed improved ACO algorithm can realize the coverage path planning with low repetition rate and has good convergence.
Authors
- Junqiang Li (ORCID: https://orcid.org/0000-0002-3644-133X)
- Ziqi Yang (ORCID: https://orcid.org/0000-0002-1364-9234)
Institutions
- Hebei University of Technology (CN)
Publication Details
- Published
- 2025-03-21
- DOI
- https://doi.org/10.1109/icaace65325.2025.11018948
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00