Practical pushing planning for rearrangement tasks

Rearrangement of objects by pushing is a basic manipulation task. The authors (1995) presented a resolution-complete algorithm that plans optimal pushing manipulations for rearrangement tasks but operates in high time and space complexity. In this paper the authors address the issue of practical planning for the same kind of problems. Rather than using a classical heuristic method, the authors propose an alternative approach. The authors present a hierarchical classification of the pushing problems domain into several classes, each characterized by properties of the plans that can solve it. Such a classification allows the authors to consider each class individually, analyze and exploit properties of each class, and suggest individual planning methods. Algorithms for two of the defined classes are presented. Both algorithms were tested in a simulated environment, with up to 32 movable objects and 66 combined DOF. Some of these simulations are presented here.

[1]  Sukhan Lee,et al.  Computer-Aided Mechanical Assembly Planning , 1991 .

[2]  Kevin M. Lynch,et al.  Stable Pushing: Mechanics, Controllability, and Planning , 1995, Int. J. Robotics Res..

[3]  Rachid Alami,et al.  Motion planning for a robot and a movable object amidst polygonal obstacles , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[4]  Jean-Claude Latombe,et al.  Multi-Arm Manipulation Planning , 1992 .

[5]  Rachid Alami,et al.  A geometrical approach to planning manipulation tasks. The case of discrete placements and grasps , 1991 .

[6]  Rachid Alami,et al.  Two manipulation planning algorithms , 1995 .

[7]  Jean-Claude Latombe,et al.  On multi-arm manipulation planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[8]  Matthew T. Mason,et al.  Posing Polygonal Objects in the Plane by Pushing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[9]  Gordon T. Wilfong.  Motion planning in the presence of movable obstacles , 1988, SCG '88.

[10]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

[11]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[12]  Yong K. Hwang,et al.  Practical path planning among movable obstacles , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[13]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[14]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.