A Framework for Real-Time Multi-Contact Multi-Body Dynamic Simulation

In this paper we propose a unified framework for the real-time dynamic simulation and contact resolution of rigid articulated bodies. This work builds on previous developments in the field of dynamic simulation, collision detection, contact resolution, and operational space control. However, the key to efficiency and real-time performance is a new parallel implementation of our collision detection and contact resolution algorithm which decomposes the problem into tasks that can be concurrently executed. Finally, the results and accuracy of our simulation models are compared for the first time against recorded motions of real articulated bodies colliding on a frictionless air floating table.

[1]  David Baraff,et al.  Curved surfaces and coherence for non-penetrating rigid body simulation , 1990, SIGGRAPH.

[2]  Oussama Khatib,et al.  Operational space dynamics: efficient algorithms for modeling and control of branching mechanisms , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[3]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[4]  Oussama Khatib,et al.  A framework for multi-contact multi-body dynamic simulation and haptic display , 2000 .

[5]  Chandrajit L. Bajaj,et al.  Convex Decomposition of Polyhedra and Robustness , 1992, SIAM J. Comput..

[6]  David Baraff,et al.  Issues in computing contact forces for non-penetrating rigid bodies , 1993, Algorithmica.

[7]  Oliver Brock,et al.  Robotics and interactive simulation , 2002, CACM.

[8]  Ari Rappoport.  The n-dimensional extended convex differences tree (ECDT) for representing polyhedra , 1991, SMA '91.

[9]  Raimund Seidel,et al.  On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..

[10]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[11]  Bernard Chazelle,et al.  Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..

[12]  David Baraff,et al.  Fast contact force computation for nonpenetrating rigid bodies , 1994, SIGGRAPH.

[13]  Francois Conti,et al.  The CHAI Libraries , 2003 .

[14]  David Baraff,et al.  Analytical methods for dynamic simulation of non-penetrating rigid bodies , 1989, SIGGRAPH.

[15]  David Baraff,et al.  Linear-time dynamics using Lagrange multipliers , 1996, SIGGRAPH.

[16]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[17]  Oussama Khatib,et al.  A unified approach for motion and force control of robot manipulators: The operational space formulation , 1987, IEEE J. Robotics Autom..

[18]  Bernard Chazelle,et al.  Triangulating a non-convex polytype , 1989, SCG '89.

[19]  David Baraff,et al.  Coping with friction for non-penetrating rigid body simulation , 1991, SIGGRAPH.