Multi-agent task decomposition algorithm based on and-or dependence graph
Hui Di Zhou · Jisuanji gongcheng yu sheji · 2009
To multi-agent system task decomposition problem,a task decomposition model and algorithm based on dependence is pro-posed.In order to formalize the dependence relations of operations,the concept of and-or dependency graph is introduced,then a con-struction algorithm of and-or dependency graph is put forward.Finally,based on these,a task decomposition model and algorithm is designed.The new task decomposition algorithm has the advantages as follows: It can distinguish such operations that can be computed parallelizably and further resolves out all the operation sets that are with parallelity.It reduces cyclic times cycling lay by lay,rather than operation by operation of the and-or dependency graph.An applied instance of the algorithm shows that the algorithm has good time and space efficiency,and support task dynamic decomposition.