Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Pheromone-Focused Ant Colony Optimization algorithm for path planning

Yi Liu, Hongda Zhang, Zhongxue Gan, Yuning Chen, Ziqing Zhou, Chunlei Meng, Chun Ouyang

TL;DR

The paper presents PFACO, a pheromone-focused enhancement to Ant Colony Optimization for path planning. PFACO introduces ADPI to non-uniformly initialize pheromones toward promising regions, PSPRS to reinforce high-quality solutions via replication and global elite tracking, and LTOS to penalize excessive turning for smoother paths. Empirical results across 10×10 to 20×20 grid maps show PFACO delivers faster convergence and shorter, more stable paths than multiple ACO variants and A*, with notable gains on smaller maps. The work advances practical ACO-based path planning by guiding pheromone distribution with instance-aware initializations and lookahead refinements, though scalability to very large or dynamic environments is identified as future work.

Abstract

Ant Colony Optimization (ACO) is a prominent swarm intelligence algorithm extensively applied to path planning. However, traditional ACO methods often exhibit shortcomings, such as blind search behavior and slow convergence within complex environments. To address these challenges, this paper proposes the Pheromone-Focused Ant Colony Optimization (PFACO) algorithm, which introduces three key strategies to enhance the problem-solving ability of the ant colony. First, the initial pheromone distribution is concentrated in more promising regions based on the Euclidean distances of nodes to the start and end points, balancing the trade-off between exploration and exploitation. Second, promising solutions are reinforced during colony iterations to intensify pheromone deposition along high-quality paths, accelerating convergence while maintaining solution diversity. Third, a forward-looking mechanism is implemented to penalize redundant path turns, promoting smoother and more efficient solutions. These strategies collectively produce the focused pheromones to guide the ant colony's search, which enhances the global optimization capabilities of the PFACO algorithm, significantly improving convergence speed and solution quality across diverse optimization problems. The experimental results demonstrate that PFACO consistently outperforms comparative ACO algorithms in terms of convergence speed and solution quality.

Pheromone-Focused Ant Colony Optimization algorithm for path planning

TL;DR

The paper presents PFACO, a pheromone-focused enhancement to Ant Colony Optimization for path planning. PFACO introduces ADPI to non-uniformly initialize pheromones toward promising regions, PSPRS to reinforce high-quality solutions via replication and global elite tracking, and LTOS to penalize excessive turning for smoother paths. Empirical results across 10×10 to 20×20 grid maps show PFACO delivers faster convergence and shorter, more stable paths than multiple ACO variants and A*, with notable gains on smaller maps. The work advances practical ACO-based path planning by guiding pheromone distribution with instance-aware initializations and lookahead refinements, though scalability to very large or dynamic environments is identified as future work.

Abstract

Ant Colony Optimization (ACO) is a prominent swarm intelligence algorithm extensively applied to path planning. However, traditional ACO methods often exhibit shortcomings, such as blind search behavior and slow convergence within complex environments. To address these challenges, this paper proposes the Pheromone-Focused Ant Colony Optimization (PFACO) algorithm, which introduces three key strategies to enhance the problem-solving ability of the ant colony. First, the initial pheromone distribution is concentrated in more promising regions based on the Euclidean distances of nodes to the start and end points, balancing the trade-off between exploration and exploitation. Second, promising solutions are reinforced during colony iterations to intensify pheromone deposition along high-quality paths, accelerating convergence while maintaining solution diversity. Third, a forward-looking mechanism is implemented to penalize redundant path turns, promoting smoother and more efficient solutions. These strategies collectively produce the focused pheromones to guide the ant colony's search, which enhances the global optimization capabilities of the PFACO algorithm, significantly improving convergence speed and solution quality across diverse optimization problems. The experimental results demonstrate that PFACO consistently outperforms comparative ACO algorithms in terms of convergence speed and solution quality.
Paper Structure (11 sections, 8 equations, 4 figures, 2 tables, 1 algorithm)

This paper contains 11 sections, 8 equations, 4 figures, 2 tables, 1 algorithm.

Table of Contents

  1. INTRODUCTION
  2. PRELIMINARY
  3. Pheromone-Focused Ant Colony Optimization algorithm (PFACO)
  4. Adaptive Distance Pheromone Initialization (ADPI)
  5. Promising Solutions Pheromone Reinforcement Strategy (PSPRS)
  6. Lookahead Turning Optimization Strategy (LTOS)
  7. EXPERIMENTS
  8. Data sets
  9. Experimental setups
  10. Results and Discussion
  11. CONCLUSION

Figures (4)

  • Figure 1: An example of the map dataset.
  • Figure 2: The path planning results and the final pheromone concentration distribution of ACO algorithms in Instance 1.
  • Figure 3: The initial pheromone concentration distribution for different strategies on Instance 1 is depicted. The vertical and horizontal axes represent the $x$ and $y$ coordinates of the grid map, respectively. The color gradient indicates pheromone concentration values, where warmer colors correspond to higher concentrations and cooler colors to lower concentrations. The concentration values range from [0, 1].
  • Figure 4: Path length variation curves of PFACO and other benchmark algorithms during the iteration process on Instance 1.