Controlling a mobile robot that searches for and rearranges objects with unknown locations and shapes

This paper offers a proposal for an algorithm of controlling a mobile robot that searches for and rearranges objects with unknown locations and shape. In this paper, we divide the task into two parts: exploration task and rearrangement task. The algorithms for each part of the task are presented with respect to the effectiveness of the path length and computational cost. Additionally integration algorithm that effectively combines exploration and rearrangement is presented. Experiments with a real robot are conducted to demonstrate the effectiveness of the proposed algorithm.

[1]  Ernest L. Hall,et al.  Region filling operations with random obstacle avoidance for mobile robots , 1988, J. Field Robotics.

[2]  Jean-Louis Deneubourg,et al.  From local actions to global tasks: stigmergy and collective robotics , 2000 .

[3]  Jun Ota,et al.  Region exploration path planning for a mobile robot expressing working environment by grid points , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[4]  Eiichi Yoshida,et al.  An algorithm of dividing a work area to multiple mobile robots , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[5]  Ehud Rivlin,et al.  Practical pushing planning for rearrangement tasks , 1998, IEEE Trans. Robotics Autom..

[6]  Jonathan Schaeffer,et al.  Pushing the limits: new developments in single-agent search , 1999 .

[7]  Rolf Pfeifer,et al.  Understanding intelligence , 2020, Inequality by Design.

[8]  Jun Ota,et al.  Rearrangement planning of multiple movable objects by using real-time search methodology , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[9]  Jun Ota,et al.  Design of an artificial mark to determine 3D pose by monocular vision , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[10]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..