Research on Convex Polyhedron Collision Detection Algorithm Based on Improved Particle Swarm Optimization
- 10.2991/mems.2012.92How to use a DOI?
- Collision Detection, Convex Polyhedron, PSO, Distance
A convex polyhedron collision detection algorithm based on the shortest distance is proposed, which uses convex Bounding Volume Hierarchies to express convex polyhedron. Thus the distance problem of two convex polyhedrons is come down to a non-linear programming problem with constraints. The non-linear programming problem can be solved by improved particle swarm optimization. The strategy of self-adaptive parameters adjusting is applied, which have enhanced global searching ability of particle swarm optimization and optimized the time complexity. Results show that the efficiency of improved particle swarm optimization is higher and the computing speed is faster.
- © 2012, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Wang Wei AU - Gong Shuiqing AU - Li PeiLin AU - Chui Mingwei PY - 2012/12 DA - 2012/12 TI - Research on Convex Polyhedron Collision Detection Algorithm Based on Improved Particle Swarm Optimization BT - Proceedings of the 1st International Conference on Mechanical Engineering and Material Science (MEMS 2012) PB - Atlantis Press SP - 346 EP - 349 SN - 1951-6851 UR - https://doi.org/10.2991/mems.2012.92 DO - 10.2991/mems.2012.92 ID - Wei2012/12 ER -