Advertisement

Constraint Programming for Path Planning with Uncertainty

Solving the Optimal Search Path Problem
  • Michael Morin
  • Anika-Pascale Papillon
  • Irène Abi-Zeid
  • François Laviolette
  • Claude-Guy Quimper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7514)

Abstract

The optimal search path (OSP) problem is a single-sided detection search problem where the location and the detectability of a moving object are uncertain. A solution to this \(\mathcal{NP}\)-hard problem is a path on a graph that maximizes the probability of finding an object that moves according to a known motion model. We developed constraint programming models to solve this probabilistic path planning problem for a single indivisible searcher. These models include a simple but powerful branching heuristic as well as strong filtering constraints. We present our experimentation and compare our results with existing results in the literature. The OSP problem is particularly interesting in that it generalizes to various probabilistic search problems such as intruder detection, malicious code identification, search and rescue, and surveillance.

Keywords

Path Planning Motion Model Constraint Programming Malicious Code Incumbent Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Trummel, K., Weisinger, J.: The complexity of the optimal searcher path problem. Operations Research 34(2), 324–327 (1986)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Stone, L.: Theory of Optimal Search. Academic Press, New York (2004)Google Scholar
  3. 3.
    Kranakis, E., Krizanc, D., Rajsbaum, S.: Computing with mobile agents in distributed networks. In: Rajasedaran, S., Reif, J. (eds.) Handbook of Parallel Computing: Models, Algorithms, and Applications, pp. 1–26. CRC Press (2007)Google Scholar
  4. 4.
    Chandramouli, R.: Web search steganalysis: Some challenges and approaches. In: Proceedings of IEEE International Symposium on Circuits and Systems, pp. 576–579 (2004)Google Scholar
  5. 5.
    Verkama, M.: Optimal paging - a search theory approach. In: Proceedings of the International Conference on Universal Personal Communications, pp. 956–960 (1996)Google Scholar
  6. 6.
    Stewart, T.: Search for a moving target when the searcher motion is restricted. Computers and Operations Research 6, 129–140 (1979)CrossRefGoogle Scholar
  7. 7.
    Eagle, J.: The optimal search for a moving target when the search path is constrained. Operations Research 32(5), 1107–1115 (1984)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Eagle, J., Yee, J.: An optimal branch-and-bound procedure for the constrained path, moving target search problem. Naval Research Logistics 38(1), 110–114 (1990)MathSciNetMATHGoogle Scholar
  9. 9.
    Washburn, A.: Branch and bound methods for a search problem. Naval Research Logistics 45, 243–257 (1998)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Lau, H., Huang, S., Dissanayake, G.: Discounted mean bound for the optimal searcher path problem with non-uniform travel times. European Journal of Operational Research 190(2), 383–397 (2008)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Martins, G.: A new branch-and-bound procedure for computing optimal search paths. Tech. rep., Naval Postgraduate School (1993)Google Scholar
  12. 12.
    Abi-Zeid, I., Nilo, O., Lamontagne, L.: Resource allocation algorithms for planning search and rescue operations. INFOR 49(1), 15–30 (2011)MathSciNetGoogle Scholar
  13. 13.
    Brown, K.M., Miguel, I.: Uncertainty and change. In: Rossi, F., Beek, P.V., Walsh, T. (eds.) Handbook of Constraint Programming, pp. 44–58. Springer (2006)Google Scholar
  14. 14.
    Tarim, S., Manandhar, S., Walsh, T.: Stochastic constraint programming: A scenario-based approach. Constraints 11(1), 53–80 (2006)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Brown, S.: Optimal search for a moving target in discrete time and space. Operations Research 28(6), 1275–1289 (1980)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Verfaillie, G., Jussien, N.: Constraint solving in uncertain and dynamic environments: A survey. Constraints 10, 253–281 (2005)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Mathematics 43(2-3), 235–239 (1983)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Laburthe, F., Jussien, N.: Choco Solver Documentation (2012), http://www.emn.fr/z-info/choco-solver/
  19. 19.
    O’Madadhain, J., Fisher, D., Nelson, T., White, S., Boey, Y.: Jung: Java universal network/graph framework (2010), http://jung.sourceforge.net

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Michael Morin
    • 1
  • Anika-Pascale Papillon
    • 2
  • Irène Abi-Zeid
    • 3
  • François Laviolette
    • 1
  • Claude-Guy Quimper
    • 1
  1. 1.Department of Computer Science and Software EngineeringUniversité LavalQuébecCanada
  2. 2.Department of Mathematics and StatisticsUniversité LavalQuébecCanada
  3. 3.Department of Operations and Decision SystemsUniversité LavalQuébecCanada

Personalised recommendations