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

Research on collision detection algorithm between convex polyhedron based on genetic algorithm

作　　者：金汉均[1] 李朝晖[1] 张晓亮[2] 郭亚军[2] 

机构地区：[1]华中科技大学水电与数字化工程学院,武汉430074 [2]华中师范大学计算机科学系,武汉430079

出　　处：《华中师范大学学报（自然科学版）》2006年第1期25-28,共4页Journal of Central China Normal University：Natural Sciences

基　　金：湖北省自然科学基金资助(2005ABA243)

摘　　要：将两凸物体间碰撞检测问题归结为一个带约束条件的非线性规划问题.对该问题进行适当的处理后,利用遗传算法对该问题进行求解.实例表明,遗传算法对该问题的求解比用传统的方法求解具有更高的计算效率和更快的计算速度.The problem of collision detection between a pair of convex objects is summed up a problem of non-linear programming with restrict conditions in this paper. And the problem that has been adjusted properly is solved with genetic algorithms. Experimental results show that genetic algorithms have better computing efficiency and more faster than other algorithms in solving the problem.

关 键 词：凸多面体 碰撞检测 非线性规划 遗传算法 

分 类 号：O221.2[理学—运筹学与控制论]