In this paper, we present an approach to assembly task scheduling involving two robot arms performing concurrently assembly operation in a common workspace. The focus of the material reported in the paper is on an approach which results in sub-optimal sequences, based on combination of breadth-first search method and heuristic functions.
展开▼