dorsal/arxiv
View SchemaPheromone-Focused Ant Colony Optimization algorithm for path planning
| Authors | Yi Liu, Hongda Zhang, Zhongxue Gan, Yuning Chen, Ziqing Zhou, Chunlei Meng, Chun Ouyang |
|---|---|
| Categories | |
| ArXiv ID | 2601.07597vv1 |
| URL | https://arxiv.org/abs/2601.07597 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
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.
{
"annotation_id": "800461f5-034e-4894-a21d-c82c58f3fe71",
"date_created": "2026-02-17T05:53:12.384000Z",
"date_modified": "2026-02-17T05:53:12.384000Z",
"file_hash": "05785483d286efa431094cd610e40f149f0e93ab2338e1ecb47600c99756e417",
"private": false,
"record": {
"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\u0027s 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.",
"arxiv_id": "2601.07597",
"authors": [
"Yi Liu",
"Hongda Zhang",
"Zhongxue Gan",
"Yuning Chen",
"Ziqing Zhou",
"Chunlei Meng",
"Chun Ouyang"
],
"categories": [
"cs.NE",
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Pheromone-Focused Ant Colony Optimization algorithm for path planning",
"url": "https://arxiv.org/abs/2601.07597",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "1a7c85ec-16db-4ba7-a722-3c34368dc2ae",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}