基于模拟退火遗传算法的凸多面体间碰撞检测算法研究

Convex polytope collision detection algorithm based on non-linear programming

提出用顶点的凸包来表示凸多面体,将两凸物体间距离的问题归结为一个带约束条件的非线性规划问题。利用模拟退火遗传算法对该问题进行求解,即利用模拟退火的接收准则来交叉、变异。结果表明,该算法有较高的计算效率和计算速度。

With salient to present convex polytope, the distance between the the convex objects is came down to a non-linear programming problem with a restricted condition. The simulation anneal inherit arithmetic is used to cross and differentiate according to the simulation anneal reception rule. The results show that the arithmetic is with both the high efficiency and high speed.