Assembly partitioning with a constant number of translations
- Stanford Univ., Stanford, CA (United States)
- Sandia National Labs., Albuquerque, NM (United States)
The authors consider the following problem that arises in assembly planning: given an assembly, identify a subassembly that can be removed as a rigid object without disturbing the rest of the assembly. This is the assembly partitioning problem. Specifically, they consider planar assemblies of simple polygons and subassembly removal paths consisting of a single finite translation followed by a translation to infinity. They show that such a subassembly and removal path can be determined in O(n{sup 1.46}N{sup 6}) time, where n is the number of polygons in the assembly and N is the total number of edges and vertices of all the parts together. They then extend this formulation to removal paths consisting of a small number of finite translations, followed by a translation to infinity. In this case the algorithm runs in time polynomial in the number of parts, but exponential in the number of translations a path may contain.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 10190498
- Report Number(s):
- SAND-94-1819; ON: DE95001857; TRN: 94:009722
- Resource Relation:
- Other Information: PBD: 24 Aug 1994
- Country of Publication:
- United States
- Language:
- English
Similar Records
A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions
Two-dimensional robot navigation among unknown stationary polygonal obstacles