Finding objects through stochastic shortest path problems

This paper presents a novel formulation for the problem of finding objects in a known environment while minimizing the search cost. Our approach consists in formalizing this class of problems as Stochastic Shortest Path (SSP) problems, a decision-theoretic framework for probabilistic environments. The obtained problems are solved by using off-the-shelf domain-independent probabilistic planners. The advantages of this approach includes: (i) a well defined optimization problem in which the probability of finding the object is maximized while minimizing the cost of searching for the object; and (ii) being able to take advantage, without any modifications to our model, of any (future) technique in the field of domain-independent probabilistic planners, such as better algorithms and better heuristics. We also contribute by empirically comparing three probabilistic planners algorithms, namely FF-Replan, UCT and SSiPP, using our proposed class of problems.

[1]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[2]  John Folkesson,et al.  Search in the real world: Active visual object search based on spatial relations , 2011, 2011 IEEE International Conference on Robotics and Automation.

[3]  Blai Bonet,et al.  Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming , 2003, ICAPS.

[4]  Nicholas Roy,et al.  Utilizing object-object and object-scene context when planning to find things , 2009, 2009 IEEE International Conference on Robotics and Automation.

[5]  Manuela M. Veloso,et al.  Using the Web to Interactively Learn to Find Objects , 2012, AAAI.

[6]  Thomas Keller,et al.  PROST: Probabilistic Planning Based on UCT , 2012, ICAPS.

[7]  Håkan L. S. Younes,et al.  PPDDL 1 . 0 : An Extension to PDDL for Expressing Planning Domains with Probabilistic Effects , 2004 .

[8]  Albert S. Huang,et al.  Planning to Perceive: Exploiting Mobility for Robust Object Detection , 2011, ICAPS.

[9]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..

[10]  Scott Sanner,et al.  A Survey of the Seventh International Planning Competition , 2012, AI Mag..

[11]  Craig Boutilier,et al.  Decision-Theoretic Planning: Structural Assumptions and Computational Leverage , 1999, J. Artif. Intell. Res..

[12]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[13]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[14]  Manuela M. Veloso,et al.  Short-Sighted Stochastic Shortest Path Problems , 2012, ICAPS.

[15]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[16]  Robert Givan,et al.  FF-Replan: A Baseline for Probabilistic Planning , 2007, ICAPS.

[17]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[18]  Håkan L. S. Younes,et al.  The First Probabilistic Track of the International Planning Competition , 2005, J. Artif. Intell. Res..

[19]  Stephanie Rosenthal,et al.  An effective personal mobile robot agent through symbiotic human-robot interaction , 2010, AAMAS.