Skip to main navigation Skip to search Skip to main content

Study of novel heterogeneous ant colony optimization algorithm for global path planning

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

This paper presents a novel ACO algorithm to solve the global path planning problem, called Heterogeneous ACO (HACO) algorithm. We proposed HACO algorithm to improve the performance of ACO for global path planning in the previous paper. The HACO algorithm differs from the Conventional ACO (CACO) algorithm for the path planning in three respects. First, we proposed modified Transition Probability Function (TPF) and Pheromone Update Rule (PUR). Second, we newly introduced the Path Crossover (PC) in the PUR. Finally, we also proposed the first introduction of the heterogeneous ants in the ACO algorithm. We apply the proposed HACO algorithm to general path planning problem and we verify the effect of the each scheme through the simulation.

Original languageEnglish
Title of host publicationISIE 2010 - 2010 IEEE International Symposium on Industrial Electronics
Pages1961-1966
Number of pages6
DOIs
StatePublished - 2010
Event2010 IEEE International Symposium on Industrial Electronics, ISIE 2010 - Bari, Italy
Duration: 4 Jul 20107 Jul 2010

Publication series

NameIEEE International Symposium on Industrial Electronics

Conference

Conference2010 IEEE International Symposium on Industrial Electronics, ISIE 2010
Country/TerritoryItaly
CityBari
Period4/07/107/07/10

Fingerprint

Dive into the research topics of 'Study of novel heterogeneous ant colony optimization algorithm for global path planning'. Together they form a unique fingerprint.

Cite this