Analysis of Swept Volume via Lie Groups and Differential Equations
- 1 December 1992
- journal article
- research article
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 11 (6) , 516-537
- https://doi.org/10.1177/027836499201100602
Abstract
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.Keywords
This publication has 20 references indexed in Scilit:
- Collision detection by four-dimensional intersection testingIEEE Transactions on Robotics and Automation, 1990
- Surface Intersections for Geometric ModelingJournal of Mechanical Design, 1990
- Automating process planning: Using feature interactions to guide searchJournal of Manufacturing Systems, 1989
- Improved test for closed loops in surface intersectionsComputer-Aided Design, 1989
- A Direct Minimization Approach for Obtaining the Distance between Convex PolyhedraThe International Journal of Robotics Research, 1989
- Tracing surface intersectionsComputer Aided Geometric Design, 1988
- Solid Modelling — A 1988 UpdatePublished by Springer Nature ,1988
- Efficient Detection of Intersections among SpheresThe International Journal of Robotics Research, 1983
- Planning Collision- Free Motions for Pick-and-Place OperationsThe International Journal of Robotics Research, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979