On planning assemblies

1 January 1988

proceedings article
Published by Association for Computing Machinery (ACM)

p. 299-308
https://doi.org/10.1145/73393.73424

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.

Keywords

NEW MEASURE
PAPER CONCERN
VARIOUS CLASS
MINIMUM NUMBER
COMPOSITE OBJECT
ASSEMBLY SEQUENCE

This publication has 0 references indexed in Scilit: