Pushing boxes with a mobile robot in Sokoban-like scenarios

This work presents a system to implement the solution of a box-pushing problem inspired in the well-known Sokoban game using a mobile robot. We present in this paper the strategy to determine a sequence of actions that have to be performed by the mobile robot to accommodate a number of boxes in a scenario only by pushing them. We link this solution to actual motion primitives of the mobile robot by decomposing the action sequence. We discuss how the solution is searched and several issues that arise during the search procedure.

[1]  Daniel M. Helmick,et al.  Autonomy for Mars Rovers: Past, Present, and Future , 2008, Computer.

[2]  Sebastian Thrun,et al.  Stanley: The robot that won the DARPA Grand Challenge , 2006, J. Field Robotics.

[3]  Uri Zwick,et al.  SOKOBAN and other motion planning problems , 1999, Comput. Geom..

[4]  David M. Bourg,et al.  AI for Game Developers , 2004 .

[5]  Tomonari Furukawa,et al.  Autonomous Pesticide Spraying Robot for use in a Greenhouse , 2005 .

[6]  Roland Siegwart,et al.  Introduction to Autonomous Mobile Robots , 2004 .

[7]  Martin Nilsson,et al.  Cooperative multi-robot box-pushing , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[8]  Jonathan Schaeffer,et al.  Sokoban: Evaluating Standard Single-Agent Search Techniques in the Presence of Deadlock , 1998, Canadian Conference on AI.

[9]  Jonathan Schaeffer,et al.  Sokoban: improving the search with relevance cuts , 2001, Theor. Comput. Sci..

[10]  Michael Jenkin,et al.  Computational Principles of Mobile Robotics: Robots in Practice , 2010 .