A refined ant colony algorithm for optimal path planning

Duc Hien Nguyen, Jyh Ching Juang

研究成果: Conference contribution

4 引文 斯高帕斯(Scopus)

摘要

To solve optimization problems in path planning, many methods have been proposed. One of these methods is to mimic ant's behavior in path finding, formally named as Ant Colony Optimization (ACO) algorithm. Since first proposed in the nineties of the last century, this algorithm has attracted a lot of attention of researchers and scientists. Many modified versions of the algorithm have been investigated to accelerate the decision process for the determination of the optimal solution. This paper presents a refined ACO algorithm, which is an integration in principle of several approaches of ACO algorithm, with Multiple Ant Colonies Algorithm plays the main role. Some simulations are performed to show its overwhelming performance in solving path finding problem.

原文English
主出版物標題Proceedings 2011 International Conference on System Science and Engineering, ICSSE 2011
頁面125-130
頁數6
DOIs
出版狀態Published - 2011
事件2011 International Conference on System Science and Engineering, ICSSE 2011 - Macao, China
持續時間: 2011 6月 82011 6月 10

出版系列

名字Proceedings 2011 International Conference on System Science and Engineering, ICSSE 2011

Other

Other2011 International Conference on System Science and Engineering, ICSSE 2011
國家/地區China
城市Macao
期間11-06-0811-06-10

All Science Journal Classification (ASJC) codes

  • 控制與系統工程

指紋

深入研究「A refined ant colony algorithm for optimal path planning」主題。共同形成了獨特的指紋。

引用此