Research Of Task Description And Decomposition Mechanism In Multi-agent Environment

With the rapid development of computer technology, we have to deal with theincreasing amount of information. The growing popularity of the Internet, solving thenetwork heterogeneity is problems we have to face. These reasons drive themulti-agent environment task management to rapid development. There are manyproblems to be solved in the multi-agent environment, the main problems is themulti-agent task description, the multi-agent task decomposition and the multi-agenttask scheduling. In this paper, we mainly focused on the task description and taskdecomposition to research.In terms of the macro, now the task management and performance requirementsin multi-agent environment generally focus on the following aspects: High reliability,openness, flexibility, ease of maintenance and coordination. These features meetthe requirements， the requirement of versatility, scalability, reusability andconsistency has been meet result from Structure of complex software systems.Based on the study of single agent model and the MAS, the task model of “andor” dependent graph is established for the characteristics in multi-agent environment.Base on the task model of “and or” dependent graph,“and or” dependent tree isintroduced. In order to prepare for the next step, multi-agent task description, thetask model of “and or” dependent graph is transformed to the task model of “and or”dependent tree. Because of XML is cross-platform, flexibility, security and manyother features, it is a good data transmission carrier in Internet environment. XMLshow data with tree which is Consistent with “and or” dependent tree in thetask model. For the reasons above, the XML-based description language is used todescribe the relation among the tasks in the multi-agent environment.On the basis of the task description, this paper develops a taskdecomposition algorithm based on the task model of “and or” dependent graph，inwhich based on the data dependencies relation, and “and or” relation among tasks，prune The task tree and then simultaneously execute tasks Correspond withLeaf node as much as possible, which is not dependent on other data node.The taskdecomposition Algorithm consider the data dependencies relation, and “and or”relation among tasks. Finally, we test the performance of conversion algorithm and task decompositionalgorithm in practical application.