Incremental Configuration Space Construction for Mechanism Analysis

Abstract

We present an incremental configuration space (CS) construction algorithm for mechanisms described as collections of subassemblies of rigid parts. The inputs are the initial subassembly configurations and the sub-assembly CSs partitioned into uniform motion regions in which part contacts are constant and motions are monotonic. The output is a partition of the mecha-nism CS into uniform motion regions. The algorithm optimizes CS construction by incrementally enumer-ating and testing only the regions reachable from the initial configuration. We implement the algorithm for subassemblies whose uniform motion regions are poly-hedral or are of dimension two or lower. The program constructs the exact CS when possible and an approx-imate CS otherwise. The approximate CS usually is qualitatively correct and in good quantitative agree-ment with the true CS. The program covers most mech-anisms composed of linkages and fixed-axes kinematic pairs, two subassembly types for which CS construc-tion programs are available.

Cite

Text

Joskowicz and Sacks. "Incremental Configuration Space Construction for Mechanism Analysis." AAAI Conference on Artificial Intelligence, 1991.

Markdown

[Joskowicz and Sacks. "Incremental Configuration Space Construction for Mechanism Analysis." AAAI Conference on Artificial Intelligence, 1991.](https://mlanthology.org/aaai/1991/joskowicz1991aaai-incremental/)

BibTeX

@inproceedings{joskowicz1991aaai-incremental,
  title     = {{Incremental Configuration Space Construction for Mechanism Analysis}},
  author    = {Joskowicz, Leo and Sacks, Elisha},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1991},
  pages     = {888-893},
  url       = {https://mlanthology.org/aaai/1991/joskowicz1991aaai-incremental/}
}