In an assembly, degrees of freedom are realized by creating mating features that permit relative motion between parts. In complex assemblies, interactions between individual degrees of freedom may result in a behavior different from the intended behavior. In addition, current methods perform assembly reasoning by approximating curved surfaces as piecewise linear surfaces. Therefore, it is important to be able to reason about assemblies using exact representations of curved surfaces; verify global motion behavior of parts in the assembly; and create motion simulations of the assembly by examination of the geometry and material properties. In this paper, we present a linear algebraic constraint method to automatically construct the space of allowed instantaneous motions of an assembly from the geometry of its constituent parts. Our work builds on previous work on linear contact mechanics and curved surface contact mechanics. We enumerate the conditions under which general curved surfaces can be represented using a finite number of constraints that are linear in the instantaneous velocities. We compose such constraints to build a space of allowed instantaneous velocities for the assembly. The space is then described as a set-theoretic sum of contact-preserving and contact-breaking subspaces. Analysis of each subspace provides feedback to the designer, which we demonstrate through the use of an example assembly—a 4-part mechanism. Finally, the results of the analysis of a 4-bar linkage are compared to those from mechanism theory.

1.
Ge
,
Q.
, and
McCarthy
,
J. M.
,
1991
, “
Functional Constraints as Algebraic Manifolds in a Clifford Algebra
,”
IEEE J. Rob. Autom.
,
7
, pp.
670
677
.
2.
Liu
,
Y.
, and
Popplestone
,
R.
,
1994
, “
A Group Theoretic Formalization of Surface Contact
,”
Int. J. Robot. Res.
,
13
, pp.
148
161
.
3.
Mattikalli
,
R.
,
Baraff
,
D.
,
Khosla
,
P.
, and
Repetto
,
B.
,
1995
, “
Gravitational Stability of Frictionless Assemblies
,”
IEEE Trans. Rob. Autom.
,
11
, pp.
374
388
.
4.
Paredis
,
C. J. J.
,
Diaz-Calderon
,
A.
,
Sinha
,
R.
, and
Khosla
,
P. K.
,
2001
, “
Composable Models for Simulation-Based Design
,”
Eng. Comput.
,
17
, pp.
112
128
.
5.
ADAMS, 2000, “Http://Www.Adams.Com,”.
6.
Rajan, V., Lyons, K., and Sreerangam, R., 1997, “Generation of Component Degrees of Freedom from Assembly Surface Mating Constraints,” 1997 ASME Design Engineering Technical Conference, Sacramento, CA, pp. 1–12.
7.
Hirai
,
S.
, and
Asada
,
H.
,
1993
, “
Kinematics and Statics of Manipulation Using the Theory of Polyhedral Convex Cones
,”
Int. J. Robot. Res.
,
12
, pp.
434
447
.
8.
Sinha, R., Paredis, C. J. J., Gupta, S. K., and Khosla, P. K., 1998, “Capturing Articulation in Assemblies from Component Geometry,” ASME Design Engineering Technical Conference, Atlanta, GA.
9.
Ohwovoriole
,
M. S.
, and
Roth
,
B.
,
1981
, “
An Extension of Screw Theory
,”
ASME J. Mech. Des.
,
103
, pp.
725
735
.
10.
Mattikalli, R., and Khosla, P. K., 1991, “Analysis of Restraints to Translational and Rotational Motion from the Geometry of Contact,” ASME Winter Annual Meeting, Atlanta, pp. 65–71.
11.
Rajan
,
V. N.
, and
Noy
,
S. Y.
,
1996
, “
Minimal Precedence Constraints for Integrated Assembly and Execution Planning
,”
IEEE Trans. Rob. Autom.
,
12
, pp.
175
186
.
12.
Gray, A., 1998, Modern Differential Geometry of Curves and Surfaces with Mathematica. New York, NY, CRC Press.
13.
Goldman, A. J., and Tucker, A. W., 1956, “Polyhedral Convex Cones,” in Linear Inequalities and Related Systems, 39, Annals of Math Studies, H. W. Kuhn and A. W. Tucker, Eds., Princeton, NJ, Princeton University Press, pp. 19–39.
14.
Avis, D., 1994, “A C Implementation of the Reverse Search Vertex Enumeration Algorithm,” in Rims Kokyuroku 872, H. Imai, Ed., Kyoto, Kyoto University.
15.
Avis
,
D.
, and
Fukuda
,
K.
,
1992
, “
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
,”
Discrete and Computational Geometry
,
8
, pp.
295
313
.
16.
Avis
,
D.
, and
Fukuda
,
K.
,
1996
, “
Reverse Search for Enumeration
,”
Discrete Appl. Math.
,
6
, pp.
21
46
.
17.
Motzkin, T. S., Raiffa, H., Thompson, G. L., and Thrall, R. M., 1953, “The Double Description Method,” in Contributions to the Theory of Games, 2, H. W. Kuhn and A. W. Tucker, Eds., Princeton, NJ, Princeton University Press.
18.
Bremner
,
D.
,
Fukuda
,
K.
, and
Marzetta
,
A.
,
1998
, “
Primal-Dual Methods for Vertex and Facet Enumeration
,”
Discrete Computational Geometry
,
20
, pp.
333
357
.
19.
Fukuda, K., and Prodon, A., 1996, “Double Description Method Revisited,” in Combinatorics and Computer Science, 1120, Lecture Notes in Computer Science, M. Deza, R. Euler, and I. Manoussakis, Eds. Springer-Verlag, pp. 91–111.
20.
Nemhauser, G. L., and Wolsey, L. A., 1988, Integer and Combinatorial Optimization, New York, John Wiley & Sons.
21.
Avis
,
D.
,
1998
, “
Computational Experience with the Reverse Search Vertex Enumeration Algorithm
,”
Optimization Methods and Software
,
10
, pp.
107
124
.
22.
Fukuda, K., 1996, “Note on New Complexity Classes ENP, EP and CEP—an Extension of the Classes NP ∩ Co-NP and P,” ETH Zu¨rich, Institute for Operations Research, Zu¨rich June 12.
23.
Paul, B., 1979, Kinematics and Dynamics of Planar Machinery. Englewood Cliffs, NJ, Prentice-Hall Inc.
You do not currently have access to this content.