The ant search algorithm: an ant colony optimization algorithm for the optimal searcher path problem with visibility

Authors:
Michael Morin;Luc Lamontagne;Irène Abi-Zeid;Patrick Maupin
Affiliations:
Department of Computer Science and Software Engineering, Université Laval, Québec, QC, Canada;Department of Computer Science and Software Engineering, Université Laval, Québec, QC, Canada;Department of Operations and Decision Systems, Université Laval, Québec, QC, Canada;Defence Research and Development Canada, Valcartier, QC, Canada
Venue:
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Year:
2010

Citing 5
Cited 0

The complexity of the optimal searcher path problem

Operations Research
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Ant colony optimization theory: a survey

Theoretical Computer Science
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Search in the physical world

Search in the physical world

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the first part of this paper, we present the Optimal Searcher Path problem with Visibility, a novel path planning approach that models inter-region visibility and that uses concepts from search theory to model uncertainty on the goal's (i.e., the search object) detectability and location In the second part, we introduce the Ant Search algorithm, a solving technique based on ant colony optimization Our results, when compared with a general mixed-integer programming model and solver, show that Ant Search is a promising technique for handling this particular complex problem.