Application of the Ant Colony Algorithm for the Path Planning
The paper presents the ant colony algorithm and its application for the path planning. Ant algorithms were designed on the base of the behaviour of real ant colonies. Real ants can always find the shortest way between the nest and the food so one of the most “natural” is the application of the ant colony algorithm in the path planning. Described algorithm was implemented in some off-line experiments.
Key wordsAnt colony optimisation ant algorithms trajectory planning natural computation
Unable to display preview. Download preview PDF.
- Dorigo M., Di Caro G., Gambardella L.M.: Ant algorithms for discrete optimization, Artificial Life, vol. 5, No. 2, pp. 137–172, 1999Google Scholar
- Krishnaiyer K., Cheraghi S.H.: Ant algorithms: review and future applications, Industrial Engineering Research Conference ERC’02, Orlando, Florida, USA, May 2002Google Scholar
- Parpinelli R.S., Lopes H.S., Freitas A.A.: An ant colony algorithm for classification rule discovery, H Abbass, R. Sarker, C. Newton (Eds.): Data Mining: a Heuristic Approach, pp. 191–208, London: Idea Group Publishing, 2002Google Scholar
- Śmierzchalski R.: Evolutionary algorithm in problem of avoidance collision at sea, Proceedings of the 9th International Conference ‘Advanced Computer Systems’ ACS’2002, Międzyzdroje, Poland, October 23–25, 2002Google Scholar