Online Replanning in Belief Space for Partially Observable Task and Motion Problems

To solve multi-step manipulation tasks in the real world, an autonomous robot must take actions to observe its environment and react to unexpected observations. This may require opening a drawer to observe its contents or moving an object out of the way to examine the space behind it. Upon receiving a new observation, the robot must update its belief about the world and compute a new plan of action. In this work, we present an online planning and execution system for robots faced with these challenges. We perform deterministic cost-sensitive planning in the space of hybrid belief states to select likely-to-succeed observation actions and continuous control actions. After execution and observation, we replan using our new state estimate. We initially enforce that planner reuses the structure of the unexecuted tail of the last plan. This both improves planning efficiency and ensures that the overall policy does not undo its progress towards achieving the goal. Our approach is able to efficiently solve partially observable problems both in simulation and in a real-world kitchen.

[1]  Caelan Reed Garrett,et al.  PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning , 2018, ICAPS.

[2]  Dieter Fox,et al.  Representing Robot Task Plans as Robust Logical-Dynamical Systems , 2019, 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[3]  Christopher Amato,et al.  Online Planning for Target Object Search in Clutter under Partial Observability , 2019, 2019 International Conference on Robotics and Automation (ICRA).

[4]  Marc Toussaint,et al.  Combined Task and Motion Planning under Partial Observability: An Optimization-Based Approach , 2019, 2019 International Conference on Robotics and Automation (ICRA).

[5]  Yi Li,et al.  DeepIM: Deep Iterative Matching for 6D Pose Estimation , 2018, International Journal of Computer Vision.

[6]  Leslie Pack Kaelbling,et al.  STRIPStream: Integrating Symbolic Planners and Blackbox Samplers , 2018, ArXiv.

[7]  Shlomo Zilberstein,et al.  An Anytime Algorithm for Task and Motion MDPs , 2018, ArXiv.

[8]  Swarat Chaudhuri,et al.  Bounded Policy Synthesis for POMDPs with Safe-Reachability Objectives , 2018, AAMAS.

[9]  Dieter Fox,et al.  PoseCNN: A Convolutional Neural Network for 6D Object Pose Estimation in Cluttered Scenes , 2017, Robotics: Science and Systems.

[10]  Leslie Pack Kaelbling,et al.  FFRob: Leveraging symbolic planning for efficient task and motion planning , 2016, Int. J. Robotics Res..

[11]  Leslie Pack Kaelbling,et al.  Sampling-based methods for factored task and motion planning , 2017, Robotics: Science and Systems.

[12]  Siddhartha S. Srinivasa,et al.  Unobservable Monte Carlo planning for nonprehensile rearrangement tasks , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[13]  David Hsu,et al.  Act to See and See to Act: POMDP planning for objects search in clutter , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[14]  Leslie Pack Kaelbling,et al.  Implicit belief-space pre-images for hierarchical planning and execution , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[15]  Patrick Beeson,et al.  TRAC-IK: An open-source library for improved solving of generic inverse kinematics , 2015, 2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids).

[16]  Dylan Hadfield-Menell,et al.  Modular task and motion planning in belief space , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[17]  Siddhartha S. Srinivasa,et al.  The YCB object and Model set: Towards common benchmarks for manipulation research , 2015, 2015 International Conference on Advanced Robotics (ICAR).

[18]  Marc Toussaint,et al.  Logic-Geometric Programming: An Optimization-Based Approach to Combined Task and Motion Planning , 2015, IJCAI.

[19]  Pieter Abbeel,et al.  Combined task and motion planning through an extensible planner-independent interface layer , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[20]  Dieter Fox,et al.  DART: Dense Articulated Real-Time Tracking , 2014, Robotics: Science and Systems.

[21]  David Hsu,et al.  DESPOT: Online POMDP Planning with Regularization , 2013, NIPS.

[22]  Leslie Pack Kaelbling,et al.  Integrated task and motion planning in belief space , 2013, Int. J. Robotics Res..

[23]  Russ Tedrake,et al.  Non-Gaussian belief space planning as a convex program , 2011 .

[24]  Joel Veness,et al.  Monte-Carlo Planning in Large POMDPs , 2010, NIPS.

[25]  Leslie Pack Kaelbling,et al.  Hierarchical Planning in the Now , 2010, Bridging the Gap Between Task and Motion Planning.

[26]  Leslie Pack Kaelbling,et al.  Belief space planning assuming maximum likelihood observations , 2010, Robotics: Science and Systems.

[27]  Takeo Kanade,et al.  Automated Construction of Robotic Manipulation Programs , 2010 .

[28]  Subbarao Kambhampati,et al.  Probabilistic Planning via Determinization in Hindsight , 2008, AAAI.

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

[30]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[31]  Bernhard Nebel,et al.  In Defense of PDDL Axioms , 2003, IJCAI.

[32]  Rachid Alami,et al.  aSyMov: A Planner That Deals with Intricate Symbolic and Geometric Problems , 2003, ISRR.

[33]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[34]  John Langford,et al.  Probabilistic Planning in the Graphplan Framework , 1999, ECP.

[35]  Anne Condon,et al.  On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems , 1999, AAAI/IAAI.

[36]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[37]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

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

[39]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.