Hybrid ant colony algorithms for path planning in sparse graphs

Authors:
Kwee Kim Lim;Yew-Soon Ong;Meng Hiot Lim;Xianshun Chen;Amit Agarwal
Affiliations:
Nanyang Technological University, School of Computer Engineering, 639798, Singapore, Singapore;Nanyang Technological University, School of Computer Engineering, 639798, Singapore, Singapore;Nanyang Technological University, School of Electrical and Electronic Engineering, 639798, Singapore, Singapore;Nanyang Technological University, School of Computer Engineering, 639798, Singapore, Singapore;Nanyang Technological University, School of Electrical and Electronic Engineering, 639798, Singapore, Singapore
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2008

Citing 0
Cited 4

An object-oriented framework with corresponding graphical user interface for developing ant colony optimization based algorithms

WSEAS Transactions on Computers
Finding multiple first order saddle points using a valley adaptive clearing genetic algorithm

CIRA'09 Proceedings of the 8th IEEE international conference on Computational intelligence in robotics and automation
Research frontier: memetic computation-past, present & future

IEEE Computational Intelligence Magazine
Multi-modal valley-adaptive memetic algorithm for efficient discovery of first-order saddle points

SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The general problem of path planning can be modeled as a traveling salesman problem which assumes that a graph is fully connected. Such a scenario of full connectivity is however not always realistic. One such motivating example for us is the application of path planning for unmanned reconnaissance aerial vehicles (URAVs). URAVs are widely deployed for photography or imagery gathering missions of sites of interest. These sites can be targets in a combat zone to be investigated or sites inaccessible by ground transportation, such as those hit by forest fires, earthquake or other forms of natural disasters. The navigation environment is one where the overall configuration of the problem is a sparse graph. Unlike graphs that are fully connected, sparse graphs are not always Hamiltonian. In this paper, we describe hybrid ant colony algorithms (HACAs) proposed for path planning in sparse graphs since existing ant colony solvers designed for solving TSP do not apply to the present context directly. HACAs represent ant inspired algorithms incorporated with a local search procedure and some heuristic techniques for uncovering feasible route(s) or path(s) in a sparse graph within tractable time. Empirical results conducted on a set of generated sparse graphs demonstrate the excellent convergence property and robustness of HACAs in uncovering low risk and Hamiltonian visitation paths. Further, the obtained results also indicate that HACAs converge to secondary closed paths in situations where a Hamiltonian cycle does not exist theoretically or is not attainable within the bounded computational time window.