Inferring feasible assemblies from spatial constraints

Abstract

The authors treat two different problems in the analysis of assemblies, and algorithms are described for each. The first problem is the selection of consistent sets of part feature relationships, and it corresponds to a search over possible configurations of parts that are consistent with feature set mappings. The second problem is the evaluation of the kinematic consistency of an assembly that has been defined by consistent feature sets. These two problems are linked together as two of the steps required in a search for all correct assembly configurations of a given set of parts. Several of the other necessary steps related to part interference, path feasibility, and workcell device kinematics are referred to but not analyzed. The proposed search algorithm is based on a constraint posting strategy, i.e. rather than generating and testing all specific alternatives, chunks of the search space are progressively removed from consideration by constraints that rule them out until one satisfactory alternative is found.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>