The Ant Search Algorithm: An Ant Colony Optimization Algorithm for the Optimal Searcher Path Problem with Visibility

  • Michael Morin
  • Luc Lamontagne
  • Irène Abi-Zeid
  • Patrick Maupin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6085)

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.

Keywords

Ant search optimal searcher path problem path planning search theory ant colony optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Benkoski, S., Weisinger, J.R., Monticino, M.G.: A Survey of the Search Theory Literature. Naval Research Logistics 38, 469–494 (1991)MATHCrossRefGoogle Scholar
  2. 2.
    de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry, Algorithms and Applications, 3rd edn. Springer, Berlin (2008)MATHGoogle Scholar
  3. 3.
    Dorigo, M., Blum, C.: Ant Colony Optimization Theory: a Survey. Theoretical Computer Science 344, 243–278 (2005)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Eagle, J.N.: The Optimal Search for a Moving Target when the Search Path is Constrained. Operations Research 32(5), 1107–1115 (1984)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Frost, J.R.: Principles of Search Theory, part I-IV (2000)Google Scholar
  6. 6.
    Garfinkel, R.S., Nemhauser, G.L.: Integer Programming. John Wiley & Sons, New York (1972)MATHGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Hollinger, G.A.: Search in the Physical World. Proposal for Ph.D. Thesis, Robotics Institute, Carnegie Mellon Univ., Pittsburgh, PA, USA (2008)Google Scholar
  9. 9.
    Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, The Netherlands (2004)Google Scholar
  10. 10.
    Koopman, B.O.: Search and Screening: General Principles with Historical Applications. Pergamon Press, New York (1980)MATHGoogle Scholar
  11. 11.
    Lau, H.: Optimal Search in Structured Environments. Ph.D. Thesis. The University of Technology, Sydney, Australia (2007)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Stewart, T.J.: Search for a Moving Target when the Searcher Motion Is Restricted. Computers and Operations Research 6, 129–140 (1979)CrossRefGoogle Scholar
  14. 14.
    Stone, L.D.: Theory of Optimal Search. Topics in Operations Research, INFORMS (2004)Google Scholar
  15. 15.
    Trummel, K.E., Weisinger, J.R.: The Complexity of the Optimal Searcher Path Problem. Operations Research 34(2), 324–327 (1986)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Washburn, A.R.: Branch and Bound Methods for a Search Problem. Naval Research Logistics 45, 243–257 (1998)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Michael Morin
    • 1
  • Luc Lamontagne
    • 1
  • Irène Abi-Zeid
    • 2
  • Patrick Maupin
    • 3
  1. 1.Department of Computer Science and Software EngineeringUniversité LavalQuébecCanada
  2. 2.Department of Operations and Decision SystemsUniversité LavalQuébecCanada
  3. 3.Defence Research and Development CanadaValcartierCanada

Personalised recommendations