Research on Convex Polyhedron Collision Detection Algorithm Based on Improved Particle Swarm Optimization

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. Keywords-Collision Detection, Convex Polyhedron, PSO, Distance