On planning assemblies

  • Authors:
  • B. K. Natarajan

  • Affiliations:
  • The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA

  • Venue:
  • SCG '88 Proceedings of the fourth annual symposium on Computational geometry
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper concerns the problem of assembling composite objects. We study the problem on two fronts; Firstly we study the complexity of deciding the existence of an assembly sequence and show that this is PSPACE-hard in general. Secondly we define a new measure of complexity, one that attempts to measure the minimum number of hands required to assemble a given composite. We analyze various classes of composite objects with respect to this measure.