A graph-based formalism for modelling assembly tasks

We model assembly parts as attribute graphs. An algebra to model assembly tasks is presented where a task is modelled as a merging of two attribute graphs to produce a single attribute graph representing the merged or assembled object. Different types of merging operations are defined and the associative properties of these merge operations are of particular interest in the assembly context. The above framework forms an essential component of an assembly planner which generates assembly task sequences