On the complexity of precedence graphs for assembly and task planning

摘要

This paper deals with a complete and correct method to compute how many plans exist for an assembly or processing task. Planning is a NP-hard problem and then, in some situations, the application of time consuming search methods must be avoided.However, up to now the computation of the exact number of alternative plans for any situation was not reported elsewhere. Notice that the complexity of the problem does not depend on the number of involved operations, components or parts. The complexityof the problem depends on the topology of the precedences between operations. With the method presented in this paper, it will be easy to decide the search method to use, since we know how many possible plans could exist before applying the search method.