摘要
In the MAS, system goal task can be decomposed into many transactions, which will be achieved by special agents distributed in different physical space. Due to complex coupling relations among transactions, transactions may form Waiting-Circle resulting in deadlock. Concerning the problem, this paper proposes two theorems developed for Waiting-Circle detection in transaction set and ensures the implement of goal task decomposition result. Furthermore, Circle-First Search is put forward to search all of the Waiting-Circle, which prnvide the basic guideline for decomposing goal task again and eliminate Waiting-Circle.
In the MAS, system goal task can be decomposed into many transactions, which will be achieved by special agents distributed in different physical space. Due to complex coupling relations among transactions,transactions may form Waiting-Circle resulting in deadlock. Concerning the problem, this paper proposes two theorems developed for Waiting-Circle detection in transaction set and ensures the implement of goal task decomposition result. Furthermore, Circle-First Search is put forward to search all of the Waiting-Circle, which provide the basic guideline for decomposing goal task again and eliminate Waiting-Circle.
基金
Sponsored by the High-Tech Research and Development Program of China (Grant No. 2001AA412210)
Spaceflight Support Technology Fund Project (Grant No. 2001-HT-HGDO1)
