AUTOMATIC-DETERMINATION OF POSSIBLE VELOCITY AND APPLICABLE FORCE OF FRICTIONLESS OBJECTS IN CONTACT FROM A GEOMETRIC MODEL

被引:17
作者
HIRUKAWA, H
MATSUI, T
TAKASE, K
机构
[1] Electrotechnical Laboratory, Agency of Industrial Science and Technology, Tsukuba, 305
来源
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 1994年 / 10卷 / 03期
关键词
D O I
10.1109/70.294206
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper investigates motions of a polyhedron in contact with a fixed polyhedron under the frictionless assumption. We propose a complete algorithm for determining possible velocity of the moving polyhedron and force applicable from the moving one to the fixed one automatically from their geometric models. The algorithm consists of two parts. The first part derives the constraints for the velocity of the moving polyhedron from their shape descriptions. The constraints are represented by linear inequalities of the velocity. The algorithm is complete in the sense that it can be applied to any case in which polyhedra with arbitrary shapes are in contact with arbitrary state. It includes the degenerate case in which a vertex contacts another vertex or edge. The second part solves the inequalities and obtains the set of possible velocity vectors of the moving polyhedron. We prove that this part is equivalent to the algorithm for enumerating all vertices of a compact polytope in higher dimensional space. The solution is the direct sum of a nonnegative linear combination of the vectors that break the contact state and a linear combination of the vectors that maintain the state. The minimum set of force vectors that are applicable from the moving polyhedron to the fixed one can be obtained from the set of possible velocity vectors of the moving one. The algorithm is fully implemented in an object-oriented lisp with a solid modeler and in C. The possible applications of the algorithm are also presented.
引用
收藏
页码:309 / 322
页数:14
相关论文
共 22 条
[1]  
Asada H., 1985, IEEE Journal of Robotics and Automation, VRA-1, P86
[2]  
ASADA H, 1989, P 5 INT S ROB RES TO, P290
[3]  
AVIS D, 1991, 7TH P ACM S COMP GEO, P98
[5]  
DEMELO LSH, 1988, TECH REP CARNEGIE ME
[6]  
DESAI RS, 1988, THESIS U MICHIGAN
[7]  
DESAI RS, 1989, IEEE T ROBOTIC AUTOM, P800
[8]  
GOLDMAN AJ, 1956, LINEAR INEQUALITIES, P19
[9]   SPACE SWEEP SOLVES INTERSECTION OF CONVEX POLYHEDRA [J].
HERTEL, S ;
MANTYLA, M ;
MEHLHORN, K ;
NIEVERGELT, J .
ACTA INFORMATICA, 1984, 21 (05) :501-519
[10]  
HIRUKAWA H, 1991, NOV P IEEE RSJ INT W, P38