Optimization of robot assembly planning

This paper presents an optimization procedure for solving three planning problems in single-arm assembly cells: sequence of assembly tasks, layout of cell accessories and selection of robot, abbreviated as the SLS problem. The proposed procedure uses a tree structure to represent alternative decisions at each stage of assembly. A branch and bound approach is used to find the assembly plan that results in minimum cost.