Aggregation-based approaches to honey-pot searching with local sensory information

We investigate the problem of searching for a hidden target in a bounded region by an autonomous agent that is only able to use limited local sensory information. We propose an aggregation-based approach to solve this problem, 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 then obtained through a refinement procedure that lifts the discrete path into a continuous one. The resulting solution is in general not optimal but one can construct bounds to gauge the cost penalty incurred.

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

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

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

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

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

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

[7]  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).

[8]  E. Sontag,et al.  Computational complexities of honey-pot searching with local sensory information , 2004, Proceedings of the 2004 American Control Conference.

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

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

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

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

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

[14]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

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

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

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

[18]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

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

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