Title :
An Ant Colony System algorithm for path planning in sparse graphs
Author :
Chen, X.S. ; Lim, M.H. ; Ong, Y.S.
Author_Institution :
Sch. of EEE, Nanyang Technol. Univ., Singapore
Abstract :
The general problem of path planning can be modeled as a travelling salesman problem which assumes a graph is fully connected. Full connectivity is however not realistic in many practical path planning problems. The graphs are typically sparse graphs such as for Unmanned Reconnaissance Aerial Vehicles (URAV). This paper describes an Ant Colony System algorithm proposed for path planning in sparse graphs.
Keywords :
graph theory; path planning; sparse matrices; travelling salesman problems; ant colony system algorithm; path planning; sparse graphs; travelling salesman problem; unmanned reconnaissance aerial vehicles; Ant colony optimization; Cities and towns; Competitive intelligence; Computational intelligence; Design optimization; Intelligent systems; Path planning; Reconnaissance; Traveling salesman problems; Unmanned aerial vehicles;
Conference_Titel :
Intelligent and Advanced Systems, 2007. ICIAS 2007. International Conference on
Conference_Location :
Kuala Lumpur
Print_ISBN :
978-1-4244-1355-3
Electronic_ISBN :
978-1-4244-1356-0
DOI :
10.1109/ICIAS.2007.4658343
