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

Citation
H. Hirukawa et al., AUTOMATIC-DETERMINATION OF POSSIBLE VELOCITY AND APPLICABLE FORCE OF FRICTIONLESS OBJECTS IN CONTACT FROM A GEOMETRIC MODEL, IEEE transactions on robotics and automation, 10(3), 1994, pp. 309-322
Citations number
22
Categorie Soggetti
Computer Application, Chemistry & Engineering","Controlo Theory & Cybernetics","Robotics & Automatic Control","Engineering, Eletrical & Electronic
ISSN journal
1042296X
Volume
10
Issue
3
Year of publication
1994
Pages
309 - 322
Database
ISI
SICI code
1042-296X(1994)10:3<309:AOPVAA>2.0.ZU;2-E
Abstract
This paper investigates motions of a polyhedron in contact with a fixe d polyhedron under the frictionless assumption. We propose a complete algorithm for determining possible velocity of the moving polyhedron a nd 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 pol yhedron 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 a rbitrary shapes are in contact with arbitrary state. It includes the d egenerate case in which a vertex contacts another vertex or edge. The second part solves the inequalities and obtains the set of possible ve locity vectors of the moving polyhedron. We prove that this part is eq uivalent to the algorithm for enumerating all vertices of a compact po lytope 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 possibl e applications of the algorithm are also presented.