Robotic-task sequence representation and analysis

Abstract

Theoretically, this thesis addresses the problem of representing and analyzing feasible assembly sequences for mechanical products. Practically, it addresses the problem of automatic generation of feasible assembly sequences based on the specified precedence constraints. A feasible assembly sequence is one order of all assembly tasks for an assembly, satisfying all the specified precedence ordering constraints which constitute what is called an implicit representation.