On-Line Manipulation Planning for Two Robot Arms in a Dynamic Environment

In a dynamic and partially unpredictable environment, robot motion planning must be on-line. The planner receives a continuous flow of information about occurring events and generates new plans, while previously planned motions are being executed. This paper describes an on-line planner for two cooperating arms whose task is to grab parts on a conveyor belt and transfer them to their respective goals, while avoiding collision with obstacles. Parts arrive on the belt in random order, at any time. This scenario is typical of manufacturing cells serving machine-tools, assembling products, or packaging objects. The proposed approach breaks the overall planning problem into subproblems, each involving a low-dimensional configuration or configuration x time space, and orchestrates very fast primitives solving these subproblems. The resulting planner has been implemented and extensively tested both in a simulated environment and with a real dual-arm system. Its competitiveness has been evaluated against an oracle making (almost) the best decision at any one time. The planner compares extremely well.

[1]  Jean-Claude Latombe,et al.  Experimental Integration of Planning in a Distributed Control System , 1993, ISER.

[2]  B. Faverjon,et al.  A practical approach to motion-planning for manipulators with many degrees of freedom , 1991 .

[3]  Phillip J. McKerrow,et al.  Introduction to robotics , 1991 .

[4]  William A. Gruver,et al.  A unified approach for robot motion planning with moving polyhedral obstacles , 1990, IEEE Trans. Syst. Man Cybern..

[5]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[6]  Francis L. Merat,et al.  Introduction to robotics: Mechanics and control , 1987, IEEE J. Robotics Autom..

[7]  Tsai-Yen Li,et al.  Sensorless manipulation using transverse vibrations of a plate , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[8]  Jean-Claude Latombe,et al.  On-Line Manipulation Planning for Two Robot Arms in a Dynamic Environment , 1997, Int. J. Robotics Res..

[9]  Jean-Claude Latombe,et al.  Experiments in dual-arm manipulation planning , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

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

[11]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[12]  Tomás Lozano-Pérez,et al.  Parallel robot motion planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[13]  Jean-Claude Latombe,et al.  Motion planning in the presence of moving obstacles , 1992 .

[14]  Kikuo Fujimura,et al.  Motion Planning Amid Transient Obstacles , 1994, Int. J. Robotics Res..

[15]  Kamal K. Gupta,et al.  Practical global motion planning for many degrees of freedom: a novel approach within sequential framework , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[16]  Bruce Randall Donald,et al.  Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.

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

[18]  Prof. Dr. Kikuo Fujimura Motion Planning in Dynamic Environments , 1991, Computer Science Workbench.

[19]  Stanley A. Schneider,et al.  The network data delivery service: real-time data connectivity for distributed control applications , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[20]  Jean-Claude Latombe A Fast Path Planner for a Car-Like Indoor Mobile Robot , 1991, AAAI.

[21]  J. Barraquand and Jean-Claude Latombe Robot Motion Planning : A Distributed Representation Approach , 1991 .

[22]  Jean-Claude Latombelatombe Ing of Connguration Space for Fast Path Planning , 2007 .

[23]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[24]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[25]  Tsai-Yen Li,et al.  Assembly maintainability study with motion planning , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[26]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[27]  L. Graux,et al.  Integration of a Path Generation Algorithm into Off-line Programming of AIRBUS Panels , 1992 .

[28]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[29]  John J. Craig,et al.  Introduction to Robotics Mechanics and Control , 1986 .

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

[31]  Kamal K. Gupta,et al.  Motion planning for many degrees of freedom: sequential search with backtracking , 1995, IEEE Trans. Robotics Autom..

[32]  Leonidas J. Guibas,et al.  A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

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

[35]  Jean-Claude Latombe,et al.  Planning motions with intentions , 1994, SIGGRAPH.