Extended Task and Motion Planning of Long-horizon Robot Manipulation

Task and Motion Planning (TAMP) requires the integration of symbolic reasoning with metric motion planning that accounts for the robot’s actions’ geometric feasibility. This hierarchical structure inevitably prevents the symbolic planners from accessing the environment’s low-level geometric description, vital to the problem’s solution. Most TAMP approaches fail to provide feasible solutions when there is missing knowledge about the environment at the symbolic level. The incapability of devising alternative high-level plans leads existing planners to a dead end. We propose a novel approach for decision-making on extended decision spaces over plan skeletons and action parameters. We integrate top-k planning for constructing an explicit skeleton space, where a skeleton planner generates a variety of candidate skeleton plans. Moreover, we effectively combine this skeleton space with the resultant motion parameter spaces into a single extended decision space. Accordingly, we use Monte-Carlo Tree Search (MCTS) to ensure an exploration-exploitation balance at each decision node and optimize globally to produce minimumcost solutions. The proposed seamless combination of symbolic top-k planning with streams, with the proved optimality of MCTS, leads to a powerful planning algorithm that can handle the combinatorial complexity of long-horizon manipulation tasks. We empirically evaluate our proposed algorithm in challenging manipulation tasks with different domains that require multistage decisions and show how our method can overcome deadends through its effective alternate plans compared to its most competitive baseline method.

[1]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[2]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[3]  Daniel Bryce,et al.  Planning and Acting in Incomplete Domains , 2011, ICAPS.

[4]  Siddharth Srivastava,et al.  Anytime Integrated Task and Motion Policies for Stochastic Environments , 2020, 2020 IEEE International Conference on Robotics and Automation (ICRA).

[5]  David Auger,et al.  Continuous Upper Confidence Trees with Polynomial Exploration - Consistency , 2013, ECML/PKDD.

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

[7]  Swarat Chaudhuri,et al.  Incremental Task and Motion Planning: A Constraint-Based Approach , 2016, Robotics: Science and Systems.

[8]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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

[10]  H. Jaap van den Herik,et al.  Progressive Strategies for Monte-Carlo Tree Search , 2008 .

[11]  Shirin Sohrabi,et al.  A Novel Iterative Approach to Top-k Planning , 2018, ICAPS.

[12]  Leslie Pack Kaelbling,et al.  Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds , 2020, AAAI.

[13]  Subbarao Kambhampati,et al.  A Heuristic Approach to Planning with Incomplete STRIPS Action Models , 2014, ICAPS.

[14]  Jan Willemson,et al.  Improved Monte-Carlo Search , 2006 .

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

[16]  Leslie Pack Kaelbling,et al.  Integrated Task and Motion Planning , 2020, Annu. Rev. Control. Robotics Auton. Syst..

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

[18]  Lydia E. Kavraki,et al.  Informing Multi-Modal Planning with Synergistic Discrete Leads , 2020, 2020 IEEE International Conference on Robotics and Automation (ICRA).

[19]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[20]  Subbarao Kambhampati,et al.  Refining Incomplete Planning Domain Models Through Plan Traces , 2013, IJCAI.

[21]  Leslie Pack Kaelbling,et al.  Sampling-based methods for factored task and motion planning , 2018, Int. J. Robotics Res..

[22]  Rémi Coulom,et al.  Computing "Elo Ratings" of Move Patterns in the Game of Go , 2007, J. Int. Comput. Games Assoc..

[23]  Leslie Pack Kaelbling,et al.  PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning , 2020, ICAPS.

[24]  Siddhartha S. Srinivasa,et al.  A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors , 2016, ICAPS.

[25]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .

[26]  Leslie Pack Kaelbling,et al.  Hierarchical task and motion planning in the now , 2011, 2011 IEEE International Conference on Robotics and Automation.

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

[28]  Demis Hassabis,et al.  Mastering the game of Go with deep neural networks and tree search , 2016, Nature.

[29]  D. Long,et al.  PDDL+ : Modelling Continuous Time-dependent Effects , 1999 .

[30]  Rémi Munos,et al.  Bandit Algorithms for Tree Search , 2007, UAI.

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