A case study on the Tower of Hanoi challenge: Representation, reasoning and execution

The Tower of Hanoi puzzle, has recently been established as a robotics challenge as a part of EU Robotics coordination action in 2011 and IEEE IROS Conference in 2012. It provides a good standardized test bed to evaluate integration of high-level reasoning capabilities of robots together with their manipulation and perception aspects.We address this challenge within a general planning and monitoring framework: we represent the puzzle in a logic-based formalism, integrate task planning and motion planning, solve this hybrid planning problem with a state-of-the-art automated reasoner (e.g., a SAT solver), execute the computed plans under feedback control while also monitoring for failures, and recover from failures as required. We show the applicability of this framework by implementing it using two robotic manipulators on a physical experimental setup.

[1]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..

[2]  Alfredo Gabaldon,et al.  Cumulative Effects of Concurrent Actions on Numeric-Valued Fluents , 2005, AAAI.

[3]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[4]  Esra Erdem,et al.  Causal Reasoning for Planning and Coordination of Multiple Housekeeping Robots , 2011, LPNMR.

[5]  Esra Erdem,et al.  Answer Set Programming for Reasoning with Semantic Knowledge in Collaborative Housekeeping Robotics , 2012, SyRoCo.

[6]  P. Stockmeyer Variations on the Four-Post Tower of Hanoi Puzzle , 1994 .

[7]  Jean-Claude Latombe,et al.  Integrating task and PRM motion planning : Dealing with many infeasible motion planning queries , 2009 .

[8]  Frederik W. Heger,et al.  Robust robotic assembly through contingencies, plan repair and re-planning , 2010, 2010 IEEE International Conference on Robotics and Automation.

[9]  Hudson Turner,et al.  Satisfiability planning with Causal Theories , 1998, KR.

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

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

[12]  Henry Ernest Dudeney,et al.  The Canterbury Puzzles , 1907 .

[13]  Vladimir Lifschitz,et al.  Representing Transition Systems by Logic Programs , 1999, LPNMR.

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

[15]  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.

[16]  P. Stockmeyer The Tower of Hanoi: A Bibliography , 2005 .

[17]  Frederik W. Heger Generating robust assembly plans in constrained environments , 2008, 2008 IEEE International Conference on Robotics and Automation.

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

[19]  F. RICCA,et al.  Team-building with answer set programming in the Gioia-Tauro seaport , 2011, Theory and Practice of Logic Programming.

[20]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[21]  J. Finger,et al.  Exploiting constraints in design synthesis , 1987 .

[22]  Lakhdar Sais,et al.  Control-Based Clause Sharing in Parallel SAT Solving , 2009, IJCAI.

[23]  James Tanton Mathematics Galore!: The Tower of Hanoi , 2012 .

[24]  Gerhard Lakemeyer,et al.  Cognitive Robotics , 2008, Handbook of Knowledge Representation.

[25]  Joohyung Lee,et al.  Describing Additive Fluents in Action Language C+ , 2003, IJCAI.

[26]  Michael Gelfond,et al.  An A Prolog decision support system for the Space Shuttle , 2001, Answer Set Programming.

[27]  Esra Erdem,et al.  Causality-based planning and diagnostic reasoning for cognitive factories , 2012, Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012).

[28]  Esra Erdem,et al.  From discrete task plans to continuous trajectories , 2009 .

[29]  P. Stockmeyer NEW VARIATIONS ON THE TOWER OF HANOI , 2008 .

[30]  Stuart J. Russell,et al.  Combined Task and Motion Planning for Mobile Manipulation , 2010, ICAPS.

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

[32]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[33]  Wolfgang Faber Answer Set Programming , 2013, Reasoning Web.

[34]  Esra Erdem,et al.  Combining high-level causal reasoning with low-level geometric reasoning and motion planning for robotic manipulation , 2011, 2011 IEEE International Conference on Robotics and Automation.

[35]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

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

[37]  Martin Gebser,et al.  clasp : A Conflict-Driven Answer Set Solver , 2007, LPNMR.

[38]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[39]  Hayedeh Ahrabian,et al.  On the Solution of the Towers of Hanoi Problem , 2011 .

[40]  Esra Erdem,et al.  Applications of Action Languages in Cognitive Robotics , 2012, Correct Reasoning.

[41]  P Cull,et al.  Time complexity of the Towers of Hanoi problem , 1986, SIGA.

[42]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[43]  Esra Erdem,et al.  Finding Answers and Generating Explanations for Complex Biomedical Queries , 2011, AAAI.

[44]  Randal E. Bryant,et al.  Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors , 2003, J. Symb. Comput..

[45]  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..

[46]  Esra Erdem,et al.  Bridging the Gap between High-Level Reasoning and Low-Level Control , 2009, LPNMR.

[47]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[48]  Frank van Harmelen,et al.  Handbook of Knowledge Representation , 2008, Handbook of Knowledge Representation.

[49]  Andreas M. Hinz,et al.  An iterative algorithm for the Tower of Hanoi with four pegs , 1989, Computing.