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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benkoski, S., Weisinger, J.R., Monticino, M.G.: A Survey of the Search Theory Literature. Naval Research Logistics 38, 469–494 (1991)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry, Algorithms and Applications, 3rd edn. Springer, Berlin (2008)
Dorigo, M., Blum, C.: Ant Colony Optimization Theory: a Survey. Theoretical Computer Science 344, 243–278 (2005)
Eagle, J.N.: The Optimal Search for a Moving Target when the Search Path is Constrained. Operations Research 32(5), 1107–1115 (1984)
Frost, J.R.: Principles of Search Theory, part I-IV (2000)
Garfinkel, R.S., Nemhauser, G.L.: Integer Programming. John Wiley & Sons, New York (1972)
Hansen, S.R.: Applications of Search Theory to Coordinated Searching by Unmanned Aerial Vehicles. Master’s thesis. Dept. of Mechanical Engineering, Brigham Young Univ., Provo, Utah, USA (2007)
Hollinger, G.A.: Search in the Physical World. Proposal for Ph.D. Thesis, Robotics Institute, Carnegie Mellon Univ., Pittsburgh, PA, USA (2008)
Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, The Netherlands (2004)
Koopman, B.O.: Search and Screening: General Principles with Historical Applications. Pergamon Press, New York (1980)
Lau, H.: Optimal Search in Structured Environments. Ph.D. Thesis. The University of Technology, Sydney, Australia (2007)
Morin, M., Lamontagne, L., Abi-Zeid, I., Lang, P., Maupin, P.: The Optimal Searcher Path Problem with a Visibility Criterion in Discrete Time and Space. In: Proceedings of the 12th International Conference on Information Fusion, pp. 2217–2224. ISIF IEEE (2009)
Stewart, T.J.: Search for a Moving Target when the Searcher Motion Is Restricted. Computers and Operations Research 6, 129–140 (1979)
Stone, L.D.: Theory of Optimal Search. Topics in Operations Research, INFORMS (2004)
Trummel, K.E., Weisinger, J.R.: The Complexity of the Optimal Searcher Path Problem. Operations Research 34(2), 324–327 (1986)
Washburn, A.R.: Branch and Bound Methods for a Search Problem. Naval Research Logistics 45, 243–257 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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: Farzindar, A., Kešelj, V. (eds) Advances in Artificial Intelligence. Canadian AI 2010. Lecture Notes in Computer Science(), vol 6085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13059-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-13059-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13058-8
Online ISBN: 978-3-642-13059-5
eBook Packages: Computer ScienceComputer Science (R0)