Incremental Task and Motion Planning: A Constraint-Based Approach

We present a new algorithm for task and motion planning (TMP) and discuss the requirements and abstractions necessary to obtain robust solutions for TMP in general. Our Iteratively Deepened Task and Motion Planning (IDTMP) method is probabilistically-complete and offers improved performance and generality compared to a similar, state-of-theart, probabilistically-complete planner. The key idea of IDTMP is to leverage incremental constraint solving to efficiently add and remove constraints on motion feasibility at the task level. We validate IDTMP on a physical manipulator and evaluate scalability on scenarios with many objects and long plans, showing order-of-magnitude gains compared to the benchmark planner and a four-times self-comparison speedup from our extensions. Finally, in addition to describing a new method for TMP and its implementation on a physical robot, we also put forward requirements and abstractions for the development of similar planners in the future.

[1]  Alessandro Saffiotti,et al.  Constraint propagation on interval bounds for dealing with geometric backtracking , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[3]  Danny De Schreye,et al.  Answer Set Planning , 1999 .

[4]  Vladimir Lifschitz,et al.  Answer Set Programming , 2019 .

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

[6]  Swarat Chaudhuri,et al.  Task and Motion Policy Synthesis as Liveness Games , 2016, ICAPS.

[7]  Rachid Alami,et al.  An interface for interleaved symbolic-geometric planning and backtracking , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[8]  Rachid Alami,et al.  A Robot Task Planner that Merges Symbolic and Geometric Reasoning , 2004, ECAI.

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

[10]  Neil T. Dantam,et al.  The Motion Grammar: Analysis of a Linguistic Method for Robot Control , 2013, IEEE Transactions on Robotics.

[11]  Hadas Kress-Gazit,et al.  Translating Structured English to Robot Controllers , 2008, Adv. Robotics.

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

[13]  Tamim Asfour,et al.  Manipulation Planning Among Movable Obstacles , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[14]  Dinesh Manocha,et al.  FCL: A general purpose library for collision and proximity queries , 2012, 2012 IEEE International Conference on Robotics and Automation.

[15]  Leslie Pack Kaelbling,et al.  FFRob: An Efficient Heuristic for Task and Motion Planning , 2015, WAFR.

[16]  Michael A. Arbib,et al.  A formal model of computation for sensory-based robotics , 1989, IEEE Trans. Robotics Autom..

[17]  J. Rintanen.  Madagascar : Scalable Planning with SAT , 2014 .

[18]  Pieter Abbeel,et al.  Motion planning with sequential convex optimization and convex collision checking , 2014, Int. J. Robotics Res..

[19]  Bernhard Nebel,et al.  Semantic Attachments for Domain-Independent Planning Systems , 2009, ICAPS.

[20]  Lukás Chrpa,et al.  The 2014 International Planning Competition: Progress and Trends , 2015, AI Mag..

[21]  Kostas E. Bekris,et al.  Dealing with Difficult Instances of Object Rearrangement , 2015, Robotics: Science and Systems.

[22]  Rachid Alami,et al.  Towards Combining HTN Planning and Geometric Task Planning , 2013, ArXiv.

[23]  Maxim Likhachev,et al.  Single- and dual-arm motion planning with heuristic search , 2014, Int. J. Robotics Res..

[24]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[25]  Lydia E. Kavraki,et al.  Motion Planning With Dynamics by a Synergistic Combination of Layers of Planning , 2010, IEEE Transactions on Robotics.

[26]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

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

[28]  Jussi Rintanen.  Engineering Efficient Planners with SAT , 2012, ECAI.

[29]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[30]  Damian M. Lyons,et al.  A Task Grammar Approach to the Structure and Analysis of Robot Programs , 1987 .

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

[32]  Rachid Alami,et al.  A new approach to combined symbolic-geometric backtracking in the context of human-robot interaction , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[33]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[34]  Nikolaj Bjørner,et al.  Satisfiability modulo theories , 2011, Commun. ACM.

[35]  Lydia E. Kavraki,et al.  Motion planning with hybrid dynamics and temporal goals , 2010, 49th IEEE Conference on Decision and Control (CDC).

[36]  Calin Belta,et al.  Discrete abstractions for robot motion planning and control in polygonal environments , 2005, IEEE Transactions on Robotics.

[37]  Wolfram Burgard,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[38]  Leslie Pack Kaelbling,et al.  A constraint-based method for solving sequential manipulation planning problems , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[39]  Mike Stilman,et al.  Kinodynamic RRTs with Fixed Time Step and Best-Input Extension Are Not Probabilistically Complete , 2014, WAFR.

[40]  Peter Schüller,et al.  Levels of Integration between Low-Level Reasoning and Task Planning , 2013, AAAI 2013.

[41]  Tully Foote,et al.  tf: The transform library , 2013, 2013 IEEE Conference on Technologies for Practical Robot Applications (TePRA).

[42]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[43]  Kris K. Hauser,et al.  The minimum constraint removal problem with three robotics applications , 2014, Int. J. Robotics Res..

[44]  Ferdinand Freudenstein,et al.  Kinematic Synthesis of Linkages , 1965 .

[45]  Mike Stilman,et al.  Hierarchical Decision Theoretic Planning for Navigation Among Movable Obstacles , 2012, WAFR.

[46]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[47]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[48]  Moshe Y. Vardi,et al.  Motion Planning with Complex Goals , 2011, IEEE Robotics & Automation Magazine.

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

[50]  Moritz Tenorth,et al.  Representations for robot knowledge in the KnowRob framework , 2017, Artif. Intell..

[51]  Chris Young,et al.  Ray Tracing Worlds with POV-Ray , 1994 .

[52]  Kris K. Hauser,et al.  Minimum Constraint Displacement Motion Planning , 2013, Robotics: Science and Systems.

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

[54]  Luke S. Zettlemoyer,et al.  Learning to Parse Natural Language Commands to a Robot Control System , 2012, ISER.

[55]  Timothy Bretl,et al.  Proving path non-existence using sampling and alpha shapes , 2012, 2012 IEEE International Conference on Robotics and Automation.

[56]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning with deterministic μ-calculus specifications , 2012, 2012 American Control Conference (ACC).

[57]  Peter Kulchyski.  and , 2015 .

[58]  Jussi Rintanen,et al.  Planning as satisfiability: Heuristics , 2012, Artif. Intell..

[59]  J. Ho,et al.  The Metric FF Planning System Translating Ignoring Delete Lists to Numeric State Variables , 2003 .

[60]  Clark W. Barrett,et al.  The SMT-LIB Standard Version 2.0 , 2010 .

[61]  Rachid Alami,et al.  A Hybrid Approach to Intricate Motion, Manipulation and Task Planning , 2009, Int. J. Robotics Res..

[62]  Gregory D. Hager,et al.  Sampling-Based Motion and Symbolic Action Planning with geometric and differential constraints , 2010, 2010 IEEE International Conference on Robotics and Automation.

[63]  James J. Kuffner,et al.  Navigation among movable obstacles: real-time reasoning in complex environments , 2004, 4th IEEE/RAS International Conference on Humanoid Robots, 2004..

[64]  Swarat Chaudhuri,et al.  SMT-based synthesis of integrated task and motion plans from plan outlines , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[65]  Lydia E. Kavraki,et al.  Towards manipulation planning with temporal logic specifications , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[66]  Siddhartha S. Srinivasa,et al.  A Framework for Push-Grasping in Clutter , 2011, Robotics: Science and Systems.

[67]  Rachid Alami,et al.  Combining symbolic and geometric planning to synthesize human-aware plans: toward more efficient combined search. , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[68]  Andrew Howard,et al.  Design and use paradigms for Gazebo, an open-source multi-robot simulator , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[69]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.

[70]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[71]  Dinesh Manocha,et al.  Path Planning among Movable Obstacles: A Probabilistically Complete Approach , 2008, WAFR.

[72]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[73]  James A. Hendler,et al.  HTN Planning: Complexity and Expressivity , 1994, AAAI.

[74]  Hadas Kress-Gazit,et al.  Temporal-Logic-Based Reactive Mission and Motion Planning , 2009, IEEE Transactions on Robotics.

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

[76]  Esra Erdem,et al.  Answer set programming for collaborative housekeeping robotics: representation, reasoning, and execution , 2012, Intell. Serv. Robotics.