A General Framework for Assembly Planning: The Motion Space Approach (1998)
Cached
Download Links
- [robotics.stanford.edu]
- [robotics.stanford.edu]
- [ai.stanford.edu]
- [www.math.tau.ac.il]
- DBLP
Other Repositories/Bibliography
| Citations: | 23 - 5 self |
BibTeX
@MISC{Halperin98ageneral,
author = {Dan Halperin and Jean-claude Latombe and Randall H. Wilson},
title = {A General Framework for Assembly Planning: The Motion Space Approach},
year = {1998}
}
Years of Citing Articles
OpenURL
Abstract
Assembly planning is the problem of finding a sequence of motions to assemble a product from its parts. We present a general framework for finding assembly motions based on the concept of motion space. Assembly motions are parameterized such that each point in motion space represents a mating motion that is independent of the moving part set. For each motion we derive blocking relations that explicitly state which parts collide with other parts; each subassembly (rigid subset of parts) that does not collide with the rest of the assembly can easily be derived from the blocking relations. Motion space is partitioned into an arrangement of cells such that the blocking relations are fixed within each cell. In the first part of the paper we give background material, present the motion space approach and describe applications of the approach to assembly motions of several useful types, including one-step translations, multi-step translations, and infinitesimal rigid motions. Several efficien...







