Honey-pot constrained searching with local sensory information

In this paper we investigate the problem of searching for a hidden target in a bounded region of the plane using an autonomous robot which is only able to use local sensory information. The problem is naturally formulated in the continuous domain but the solution proposed is based on an aggregation/refinement approach in which the continuous search space is partitioned into a finite collection of regions on which we define a discrete search problem. A solution to the original problem is obtained through a refinement procedure that lifts the discrete path into a continuous one. We show that the discrete optimization is computationally difficult (NP-hard) but there are computationally efficient approximation algorithms for solving it. The resulting solution to the continuous problem is in general not optimal but one can construct bounds to gauge the cost penalty incurred due to (i) the discretization of the problem and (ii) the attempt to approximately solve the NP-hard problem in polynomial time. Numerical simulations show that the algorithms proposed behave significantly better than naive approaches such as a random walk or a greedy algorithm. (c) 2006 Elsevier Ltd. All rights reserved.

[1]  Joao P. Hespanha,et al.  E cient Computation of Dynamic Probabilistic Maps , 2002 .

[2]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[3]  Editors , 1986, Brain Research Bulletin.

[4]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

[5]  Sanjeev Arora,et al.  A 2+epsilon approximation algorithm for the k-MST problem , 2000, SODA.

[6]  J R Frost,et al.  REVIEW OF SEARCH THEORY: ADVANCES AND APPLICATIONS TO SEARCH AND RESCUE DECISION SUPPORT: FINAL REPORT , 2001 .

[7]  B. O. Koopman.  Search and Screening: General Principles and Historical Applications , 1980 .

[8]  T. J. Stweart.  Experience with a Branch-and-Bound Algorithm for Constrained Searcher Motion , 1980 .

[9]  P. Kokotovic,et al.  A singular perturbation approach to modeling and control of Markov chains , 1981 .

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

[11]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

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

[13]  BurgardWolfram,et al.  A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots , 1998 .

[14]  Lawrence D. Stone.  Feature Article - The Process of Search Planning: Current Approaches and Continuing Problems , 1983, Oper. Res..

[15]  Naveen Garg,et al.  A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[16]  J. Hespanha,et al.  Discrete approximations to continuous shortest-path: application to minimum-risk path planning for groups of UAVs , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[17]  Sebastian Thrun,et al.  Robotic mapping: a survey , 2003 .

[18]  Franz Aurenhammer,et al.  Handbook of Computational Geometry , 2000 .

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

[20]  João P. Hespanha.  An Efficient MATLAB Algorithm for Graph Partitioning Technical Report , 2004 .

[21]  Antony R. Unwin.  Search Theory and Applications , 1982 .

[22]  Gerhard Lakemeyer,et al.  Exploring artificial intelligence in the new millennium , 2003 .

[23]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[24]  Joseph S. B. Mitchell,et al.  An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane , 1997, Discret. Comput. Geom..

[25]  Wolfram Burgard,et al.  A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots , 1998, Auton. Robots.

[26]  S. Sastry,et al.  Probabilistic pursuit-evasion games: a one-step Nash approach , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

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

[28]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[29]  Ingo Wegener,et al.  Discrete Sequential Search with Positive Switch Cost , 1982, Math. Oper. Res..

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

[31]  P. Hespanha,et al.  An Efficient MATLAB Algorithm for Graph Partitioning , 2006 .

[32]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..