An Ant Colony System algorithm for path planning in sparse graphs

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.