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

被引：0

作者：

Jin, Hanjun ^{[1
]}

Fu, Jia ^{[1
]}

机构：

[1] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China

来源：

2005 INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND TECHNOLOGY, PROCEEDINGS | 2005年

关键词：

convex polyhedron; collision detection; on-linear programming; genetic algorithms;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 faster than other algorithms in solving the problem.

引用

页码：365 / 370

页数：6

共 8 条

[1]

CAMERON S, 1996, P IEEE T ROBOTICS AU

[2]

CARRETERO A, 2002, P 2002 ASME DES ENG

[3]

CARRETERO JA, 2001, P 2001 IEEE RSJ INT

[4] A FAST PROCEDURE FOR COMPUTING THE DISTANCE BETWEEN COMPLEX OBJECTS IN 3-DIMENSIONAL SPACE [J].

GILBERT, EG ;

JOHNSON, DW ;

KEERTHI, SS .

IEEE JOURNAL OF ROBOTICS AND AUTOMATION, 1988, 4 (02) :193-203

[5]

LIN MC, 1991, 1991 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, P1008, DOI 10.1109/ROBOT.1991.131723

[6]

Shi J., 2002, BASIS VIRTUAL REALIT

[7]

Wang X., 2002, Genetic Algorithms-Theory. Application and Software Implementation

[8]

WANG ZQ, 1999, SOFTWARE PAPER, V10, P545

← 1 →