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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Morin, M., Lamontagne, L., Abi-Zeid, I., & Maupin, P. (2010). The Ant Search algorithm: An ant colony optimization algorithm for the optimal searcher path problem with visibility. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6085 LNAI, pp. 196–207). https://doi.org/10.1007/978-3-642-13059-5_20
Mendeley helps you to discover research relevant for your work.