Analysis of Swept Volume via Lie Groups and Differential Equations

The development of useful mathematical techniques for an alyzing swept volumes, together with efficient means of im plementing these methods to produce serviceable models, has important applications to numerically controlled (NC) machin ing, robotics, and motion planning, as well as other areas of automation. In this article a novel approach to swept volumes is delineated—one that fully exploits the intrinsic geometric and group theoretical structure of Euclidean motions in or der to formulate the problem in the context of Lie groups and differential equations. Precise definitions of sweep and swept volume are given that lead naturally to an associated ordinary differential equation. This sweep differential equation is then shown to be related to the Lie group structure of Euclidean motions and to generate trajectories that completely determine the geometry of swept volumes. It is demonstrated that the notion of a sweep differential equation leads to criteria that provide useful insights concern ing the geometric and topologic features of swept volumes. Several new results characterizing swept volumes are obtained. For example, a number of simple properties that guarantee that the swept volume is a Cartesian product of elementary mani folds are identified. The criteria obtained may be readily tested with the aid of a computer.

[1]  C. Chevalley Theory of Lie Groups , 1946 .

[2]  C. Chevalley,et al.  Theory of Lie Groups (PMS-8) , 1946 .

[3]  H. Piaggio Differential Geometry of Curves and Surfaces , 1952, Nature.

[4]  J. Denavit,et al.  A kinematic notation for lower pair mechanisms based on matrices , 1955 .

[5]  P. Hartman Ordinary Differential Equations , 1965 .

[6]  J. Milnor Topology from the differentiable viewpoint , 1965 .

[7]  F. W. Warner Foundations of Differentiable Manifolds and Lie Groups , 1971 .

[8]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and Linear Algebra , 1974 .

[9]  L. Shampine,et al.  Computer solution of ordinary differential equations : the initial value problem , 1975 .

[10]  Manfredo P. do Carmo,et al.  Differential geometry of curves and surfaces , 1976 .

[11]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[12]  Requicha,et al.  Solid Modeling: A Historical Summary and Contemporary Assessment , 1982, IEEE Computer Graphics and Applications.

[13]  J. Schwartz,et al.  Efficient Detection of Intersections among Spheres , 1983 .

[14]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[15]  R. Brooks Planning Collision- Free Motions for Pick-and-Place Operations , 1983 .

[16]  James U. Korein,et al.  A geometric investigation of reach , 1985 .

[17]  S. Shafer Shadows and Silhouettes in Computer Vision , 1985 .

[18]  K. K. Wang,et al.  Geometric Modeling for Swept Volume of Moving Solids , 1986, IEEE Computer Graphics and Applications.

[19]  Herbert B. Voelcker,et al.  Graphical simulation & automatic verification of NC machining programs , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[20]  K. K. Wang,et al.  Real-time verification of multiaxis NC programs with raster graphics , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[21]  S. H. Park,et al.  Geometric Representation of Translational Swept Volumes and its Applications , 1986 .

[22]  Tomas Lozano-Perez A simple motion-planning algorithm for general robot manipulators , 1986, IEEE J. Robotics Autom..

[23]  Gerald Farin,et al.  Geometric modeling : algorithms and new trends , 1987 .

[24]  Chandrajit L. Bajaj,et al.  Tracing surface intersections , 1988, Comput. Aided Geom. Des..

[25]  Aristides A. G. Requicha,et al.  Solid modelling—A 1988 update , 1988 .

[26]  Joël Marchand The algorithm by Schwartz, Sharir and Collins on the piano mover's problem , 1988, Geometry and Robotics.

[27]  John E. Hopcroft,et al.  Robust set operations on polyhedral solids , 1987, IEEE Computer Graphics and Applications.

[28]  T. Sederberg,et al.  Improved test for closed loops in surface intersections , 1989 .

[29]  Paul K. Wright,et al.  Automating process planning: Using feature interactions to guide search , 1989 .

[30]  James E. Bobrow,et al.  A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra , 1989, Int. J. Robotics Res..

[31]  Stephen Cameron,et al.  Collision detection by four-dimensional intersection testing , 1990, IEEE Trans. Robotics Autom..

[32]  Ming C. Leu,et al.  Geometric Representation of Swept Volumes with Application to Polyhedral Objects , 1990, Int. J. Robotics Res..

[33]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[34]  Nicholas M. Patrikalakis,et al.  Surface Intersections for Geometric Modeling , 1990 .

[35]  Giuseppe Catania,et al.  Form-features for Mechanical Design and Manufacturing , 1991 .

[36]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .