Constraint Programming for Path Planning with Uncertainty - Solving the Optimal Search Path Problem

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.

[1]  James N. Eagle The Optimal Search for a Moving Target When the Search Path Is Constrained , 1984, Oper. Res..

[2]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[3]  Rajarathnam Chandramouli Web search steganalysis: some challenges and approaches , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[4]  Toby Walsh,et al.  Stochastic Constraint Programming: A Scenario-Based Approach , 2009, Constraints.

[5]  Gustavo H. A. Martins A New Branch-and-Bound Procedure for Computing Optimal Search Paths , 1993 .

[6]  T. J. Stewart Search for a moving target when searcher motion is restricted , 1979, Comput. Oper. Res..

[7]  Gérard Verfaillie,et al.  Constraint Solving in Uncertain and Dynamic Environments: A Survey , 2005, Constraints.

[8]  Kenneth N. Brown,et al.  Uncertainty and Change , 2006, Handbook of Constraint Programming.

[9]  Alan R. Washburn,et al.  Branch and bound methods for a search problem , 1998 .

[10]  L. Stone Theory of Optimal Search , 1975 .

[11]  K E Trummel,et al.  Technical Note - The Complexity of the Optimal Searcher Path Problem , 1986, Oper. Res..

[12]  Luc Lamontagne,et al.  A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations , 2011, INFOR Inf. Syst. Oper. Res..

[13]  Scott Shorey Brown,et al.  Optimal Search for a Moving Target in Discrete Time and Space , 1980, Oper. Res..

[14]  M. Verkama Optimal paging-a search theory approach , 1996, Proceedings of ICUPC - 5th International Conference on Universal Personal Communications.

[15]  Peter Winkler,et al.  Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[16]  Gamini Dissanayake,et al.  Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times , 2008, Eur. J. Oper. Res..

[17]  Evangelos Kranakis,et al.  Computing with Mobile Agents in Distributed Networks , 2007, Handbook of Parallel Computing.

[18]  James N. Eagle,et al.  An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem , 1990, Oper. Res..