首页 | 本学科首页   官方微博 | 高级检索  
     

基于遗传算法的凸多面体间碰撞检测算法研究
引用本文:金汉均,李朝晖,张晓亮,郭亚军. 基于遗传算法的凸多面体间碰撞检测算法研究[J]. 华中师范大学学报(自然科学版), 2006, 40(1): 25-28
作者姓名:金汉均  李朝晖  张晓亮  郭亚军
作者单位:华中科技大学,水电与数字化工程学院,武汉,430074;华中师范大学,计算机科学系,武汉,430079;华中科技大学,水电与数字化工程学院,武汉,430074;华中师范大学,计算机科学系,武汉,430079
摘    要:将两凸物体间碰撞检测问题归结为一个带约束条件的非线性规划问题.对该问题进行适当的处理后.利用遗传算法对该问题进行求解.实例表明,遗传算法对该问题的求解比用传统的方法求解具有更高的计算效率和更快的计算速度.

关 键 词:凸多面体  碰撞检测  非线性规划  遗传算法
文章编号:1000-1190(2006)01-0025-04
收稿时间:2005-06-14
修稿时间:2005-06-14

Research on collision detection algorithm between convex polyhedron based on genetic algorithm
JIN Han-jun,LI Zhao-hui,ZHANG Xiao-liang,GUO Ya-jun. Research on collision detection algorithm between convex polyhedron based on genetic algorithm[J]. Journal of Central China Normal University(Natural Sciences), 2006, 40(1): 25-28
Authors:JIN Han-jun  LI Zhao-hui  ZHANG Xiao-liang  GUO Ya-jun
Affiliation:1, College of Hydropower and Information Engineering, Huazhong University of Science and Technology, Wuhan 430074; 2. Department of Computer Science, Central China Normal University, Wuhan 430079
Abstract: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.
Keywords:convex polyhedron   collision detection   non-linear programming   genetic algorithms
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《华中师范大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《华中师范大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号