An optimal solution to the linear search problem for a robot with dynamics

In this paper we derive the control policy that minimizes the total expected time for a point mass with bounded acceleration, starting from the origin at rest, to find and return to an unknown target that is distributed uniformly on the unit interval. We apply our result to proof-of-concept hardware experiments with a planar robot arm searching for a metal object using an inductive proximity sensor. In particular, we show that our approach easily extends to optimal search along arbitrary curves, such as raster-scan patterns that might be useful in other applications like robot search-and-rescue.

[1]  M. L. Chambers.  The Mathematical Theory of Optimal Processes , 1965 .

[2]  L. S. Pontryagin,et al.  Mathematical Theory of Optimal Processes , 1962 .

[3]  Erik D. Demaine,et al.  Online searching with turn cost , 2004, Theor. Comput. Sci..

[4]  M. Spong,et al.  Robot Modeling and Control , 2005 .

[5]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[6]  Arthur E. Bryson,et al.  Applied Optimal Control , 1969 .

[7]  Alejandro López-Ortiz,et al.  On-line target searching in bounded and unbounded domains , 1996 .

[8]  Nicholas Roy,et al.  Trajectory Optimization using Reinforcement Learning for Map Exploration , 2008, Int. J. Robotics Res..

[9]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[10]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

[11]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[12]  Hugh F. Durrant-Whyte,et al.  Optimal Search for a Lost Target in a Bayesian World , 2003, FSR.

[13]  S. Kahne,et al.  Optimal control: An introduction to the theory and ITs applications , 1967, IEEE Transactions on Automatic Control.

[14]  Timothy H. Chung.  On Probabilistic Search Decisions under Searcher Motion Constraints , 2008, WAFR.

[15]  J. R. Weisinger,et al.  A survey of the search theory literature , 1991 .

[16]  Sándor P. Fekete,et al.  Online Searching with an Autonomous Robot , 2004, WAFR.

[17]  Seth Hutchinson,et al.  A Sampling Hyperbelief Optimization Technique for Stochastic Systems , 2008, WAFR.

[18]  S. Shankar Sastry,et al.  Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation , 2002, IEEE Trans. Robotics Autom..

[19]  R. Bellman.  An Optimal Search , 1963 .

[20]  Steve Alpern,et al.  Searching symmetric networks with Utilitarian-Postman paths , 2009 .

[21]  A. Beck.  On the linear search problem , 1964 .

[22]  Sebastian Thrun,et al.  Visibility-based Pursuit-evasion with Limited Field of View , 2004, Int. J. Robotics Res..

[23]  David Hsu,et al.  SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces , 2008, Robotics: Science and Systems.

[24]  Steve Alpern,et al.  Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance , 2000, Oper. Res..

[25]  Tomonari Furukawa,et al.  Coordinated pursuer control using particle filters for autonomous search-and-capture , 2009, Robotics Auton. Syst..

[26]  Sampath Kannan,et al.  Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.