Hostname: page-component-77c78cf97d-tlp4c Total loading time: 0 Render date: 2026-04-24T01:18:46.327Z Has data issue: false hasContentIssue false

Research on mobile robot path planning based on multi-strategy improved ant colony algorithm

Published online by Cambridge University Press:  01 October 2025

Xinghua Wang*
Affiliation:
School of Mechanical Engineering, Shanghai Institute of Technology, Shanghai, China
Jie Wang
Affiliation:
School of Mechanical Engineering, Shanghai Institute of Technology, Shanghai, China
Jiawen Cao
Affiliation:
School of Mechanical Engineering, Shanghai Institute of Technology, Shanghai, China
Ruijin Sun
Affiliation:
School of Engineering Innovation, Shanghai Institute of Technology, Shanghai, China
*
Corresponding author: Xinghua Wang; Email: xhwang526@163.com

Abstract

Aiming at the issues of traditional ant colony algorithm (ACO) in mobile robot path planning, including initial search blindness, susceptibility to local optima, and slow convergence, this paper proposes a multi-strategy improved ant colony algorithm (MS-ACO). Firstly, dynamic non-uniform distribution of initial pheromones is implemented by integrating the repulsive field from artificial the potential field method. Secondly, the heuristic information is enhanced to improve global search capability while constraining unnecessary path turns. Thirdly, an improved pheromone update strategy is developed by adopting distinct updating mechanisms for different evolutionary phases. Finally, dynamic parameter adaptation is achieved through optimized weight coefficients and volatility coefficients that coordinate with the pheromone update strategy, better aligning with the iterative characteristics of ant colony optimization. Experimental results demonstrate that MS-ACO effectively addresses the limitations of traditional ACO. Under identical experimental conditions, it achieves a 30.4% reduction in path length, 37.8% decrease in pathfinding time, and 71% fewer turns compared to conventional methods, verifying the feasibility and superiority of the proposed algorithm.

Information

Type
Research Article
Copyright
© The Author(s), 2025. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable