Automatic determination of possible velocity and applicable force of frictionless objects in contact from a geometric model

Investigates motions of a polyhedron in contact with a fixed polyhedron under the frictionless assumption. The authors 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. The authors 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. >

[1]  Shinichi Hirai,et al.  Towards a symbolic-level force feedback: recognition of assembly process states , 1991 .

[2]  Matthew T. Mason,et al.  Compliance and Force Control for Computer Controlled Manipulators , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  David Avis,et al.  A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1991, SCG '91.

[4]  H. Harry Asada,et al.  Kinematic analysis of workpart fixturing for flexible assembly with automatically reconfigurable fixtures , 1985, IEEE J. Robotics Autom..

[5]  David E. Muller,et al.  Finding the Intersection of n Half-Spaces in Time O(n log n) , 1979, Theor. Comput. Sci..

[6]  Bernard Roth,et al.  An Extension of Screw Theory , 1981 .

[7]  Arthur C. Sanderson,et al.  Assembly Sequence Planning , 1990, AI Mag..

[8]  John J. Craig,et al.  Hybrid position/force control of manipulators , 1981 .

[9]  John F. Canny,et al.  Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  P. McMullen The maximum numbers of faces of a convex polytope , 1970 .

[11]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[12]  Rajiv S. Desai,et al.  Identification and verification of termination conditions in fine motion in presence of sensor errors and geometric uncertainties , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[13]  Arthur C. Sanderson,et al.  Evaluation Functions For Assembly Sequence Planning , 1989, Other Conferences.

[14]  H. Hirukawa,et al.  A general algorithm for derivation and analysis of constraint for motion of polyhedra in contact , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[15]  Masayuki Inaba,et al.  EusLisp: an object-based implementation of Lisp , 1991 .

[16]  A. J. Goldman,et al.  Polyhedral Convex Cones , 1956 .

[17]  Michael Ian Shamos,et al.  Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[18]  Jean-Claude Latombe,et al.  Robot motion planning , 1991, The Kluwer international series in engineering and computer science.

[19]  GARRET SWART,et al.  Finding the Convex Hull Facet by Facet , 1985, J. Algorithms.