Realizing the exploration and rearrangement of multiple unknown objects by an actual mobile robot

This paper offers a proposal for realizing the exploration and rearrangement of multiple unknown objects that lay scattered in working environments. The objective of the exploration task is to find all the objects in the environments. On the other hand, the objective of the rearrangement task is to carry all the objects to their goal position. Many applications are possible if the exploration and rearrangement tasks are combined. Some of them are cleaning, mine detecting and housework. An algorithm that integrates two tasks is presented with respect to the effectiveness of the path length and computational cost. In addition, an exploration algorithm is proposed that can work well in an environment that has many objects. In order to verify the algorithm, experiments are conducted with an actual robot. In the experimentals, an environmental recognition method is developed by attaching a mark to the objects. The robot recognizes the objects by finding the mark. It then obtains information from the mark. The mark is also used to modify the odometry error of the robot by computing its configuration relative to a mark attached to a wall. The success rate of this experiment was almost 80% in 20 trials.

[1]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[2]  Ehud Rivlin,et al.  Practical pushing planning for rearrangement tasks , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[3]  Martin Held,et al.  On the Computational Geometry of Pocket Machining , 1991, Lecture Notes in Computer Science.

[4]  Jun Ota,et al.  Real-Time Cooperative Exploration by Reaction-Diffusion Equation on a Graph , 2002, DARS.

[5]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

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

[7]  Vladimir J. Lumelsky,et al.  Sensor-Based Terrain Acquisition: a "Seed Spreader" Strategy , 1989, Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications.

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

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

[10]  Howie Choset,et al.  Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse Decompositions , 2002, Int. J. Robotics Res..

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

[12]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[13]  Hideo Yuasa,et al.  Internal observation systems and a theory of reaction-diffusion equation on a graph , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

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

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

[16]  Jan Karel Lenstra,et al.  On general routing problems , 1976, Networks.

[17]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

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