An Intelligently Enhanced Ant Colony Optimization Algorithm for Global Path Planning of Mobile Robots in Engineering Applications
Global path planning remains a critical challenge in mobile robots, with ant colony optimization (ACO) being widely adopted for its swarm intelligence characteristics. To address the inherent limitations of ACO, this study proposes an intelligently enhanced ACO (IEACO) incorporating six innovative s...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-02-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1424-8220/25/5/1326 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Global path planning remains a critical challenge in mobile robots, with ant colony optimization (ACO) being widely adopted for its swarm intelligence characteristics. To address the inherent limitations of ACO, this study proposes an intelligently enhanced ACO (IEACO) incorporating six innovative strategies. First, the early search efficiency is improved by implementing a non-uniform initial pheromone distribution. Second, the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ε</mi></semantics></math></inline-formula>-greedy strategy is employed to adjust the state transition probability, thereby balancing exploration and exploitation. Third, adaptive dynamic adjustment of the exponents <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>α</mi></semantics></math></inline-formula> and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>β</mi></semantics></math></inline-formula> is realized, dynamically balancing the pheromone and heuristic function. Fourth, a multi-objective heuristic function considering both target distance and turning angle is constructed to enhance the quality of node selection. Fifth, a dynamic global pheromone update strategy is designed to prevent the algorithm from prematurely converging to local optima. Finally, by introducing multi-objective performance indicators, the path planning problem is transformed into a multi-objective optimization problem, enabling more comprehensive path optimization. Systematic simulations and experimentation were performed to validate the effectiveness of IEACO. The simulation results confirm the efficacy of each improvement in IEACO and demonstrate its performance advantages over other algorithms. The experimental results further highlight the practical value of IEACO in solving global path planning problems for mobile robots. |
|---|---|
| ISSN: | 1424-8220 |