• DocumentCode
    3201081
  • 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
  • fYear
    2007
  • fDate
    25-28 Nov. 2007
  • Firstpage
    31
  • Lastpage
    36
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • 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
  • Type

    conf

  • DOI
    10.1109/ICIAS.2007.4658343
  • Filename
    4658343
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3201081