Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering and Design》 2009-02
Add to Favorite Get Latest Update

Multi-agent task decomposition algorithm based on and-or dependence graph

XIAO Zeng-liang,YUE Xiao-bo,ZHOU Hui(Institute of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410076,China)  
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.
【Fund】: 湖南省自然科学基金项目(08JJ3124);; 教育部重点科研基金项目(208098);; 湖南省教育厅重点科研基金项目(07A056)
【CateGory Index】: TP18
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved