A collisions evaluation method in virtual environment for collaborativeassembly

Collision detection is critical for collaborative assembly simulation to assist design processing. However, collisions between polygonal models may not reflect collisions between real objects in reality because of polygonal approximation and designed tolerance. This problem reduces the reliability of simulation in collaborative assembly and sometimes even results in wrong conclusions. To solve the problem, we propose a novel collision evaluation algorithm based on generalized penetration depth, approximation information, and tolerance information. Given two interfered polygonal models, generalized penetration depth is calculated using relative motion information. Then two thresholds, which are based on approximation information and tolerance information, are integrated to evaluate collisions between polygonal models. In order to distinguish the status of collisions for further analysis, the collisions between polygonal models are categorized into three types by evaluation algorithm, namely real collision, potential collision, and fake collision. Computational efficiency and accuracy of the evaluation algorithm are verified in a virtual collaborative assembly environment.

[1]  S. A. Cameron,et al.  Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[2]  Dinesh Manocha,et al.  Fast penetration depth computation for physically-based animation , 2002, SCA '02.

[3]  Mitul Saha,et al.  Exact Collision Checking of Robot Paths , 2002, WAFR.

[4]  Stéphane Redon,et al.  Continuous collision detection for adaptive simulation of articulated bodies , 2008, The Visual Computer.

[5]  Yong Wang,et al.  Methods and Algorithms for Constraint-based Virtual Assembly , 2003, Virtual Reality.

[6]  Abderrahmane Kheddar,et al.  Fast Continuous Collision Detection between Rigid Bodies , 2002, Comput. Graph. Forum.

[7]  David G. Kirkpatrick,et al.  Computing the intersection-depth of polyhedra , 1993, Algorithmica.

[8]  Ning Ru-xin.  Research and Realization of Collision Detection Algorithm in Virtual Assembly Environment , 2004 .

[9]  Kenneth I. Joy,et al.  Swept Volumes: Fundation, Perspectives, and Applications , 2006, Int. J. Shape Model..

[10]  Abhishek Seth,et al.  Combining physical constraints with geometric constraint-based modeling for virtual assembly , 2007 .

[11]  M. Kobayashi,et al.  Interpolative variable-speed repetitive control and its application to a deburring robot with cutting load control , 1990, Adv. Robotics.

[12]  Abderrahmane Kheddar,et al.  CONTACT: arbitrary in-between motions for collision detection , 2001, Proceedings 10th IEEE International Workshop on Robot and Human Interactive Communication. ROMAN 2001 (Cat. No.01TH8591).

[13]  Abderrahmane Kheddar,et al.  An algebraic solution to the problem of collision detection for rigid polyhedral objects , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[14]  John F. Canny,et al.  Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Jianhua Liu,et al.  Evaluation of collisions between polygonal models in virtual assembly , 2012, Proceedings of the 2012 IEEE 16th International Conference on Computer Supported Cooperative Work in Design (CSCWD).

[16]  Chenhui Yang,et al.  A new algorithm of collision detection in shared space for collaborative design , 2001, Proceedings of the Sixth International Conference on Computer Supported Cooperative Work in Design (IEEE Cat. No.01EX472).

[17]  Dianliang Wu,et al.  Collaborative Virtual Assembly Operation Simulation and Its Application , 2011 .