A refined ant colony algorithm for optimal path planning

Duc Hien Nguyen, Jyh-Chin Juang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings 2011 International Conference on System Science and Engineering, ICSSE 2011
Pages125-130
Number of pages6
DOIs
Publication statusPublished - 2011 Aug 24
Event2011 International Conference on System Science and Engineering, ICSSE 2011 - Macao, China
Duration: 2011 Jun 82011 Jun 10

Publication series

NameProceedings 2011 International Conference on System Science and Engineering, ICSSE 2011

Other

Other2011 International Conference on System Science and Engineering, ICSSE 2011
CountryChina
CityMacao
Period11-06-0811-06-10

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'A refined ant colony algorithm for optimal path planning'. Together they form a unique fingerprint.

Cite this