| C. Zhang and Y. Li, An algorithm for plan verification in multiple agent systems, in: Agents and Multi-Agent Systems Formalisms, Methodologies and Applications, Lecture Notes in Artificial Intelligence 1441, Editors: W. Wobcke et al., Springer-Verlag, 1998, 149-163. |
....For task level cooperation, one common approach is to use a central coordinator (agent) which has a centralized planning. Using this approach, the central agent generates the global plan and then hands out pieces of that plan to be performed by the participating agents [ 5 ] 15 ] 26 ] 27 ] 37 ] Of course there are several methods for relaxing these centralized solution to coordination. One common way is to have some hierarchy of coordinating agents, such that each agent is responsible for the coordination of those who are below it in the hierarchy. Coordination is then done through ....
.... which does not increase the complexity in computing (and which can also deal with ignorance) Boolean algebra is used to describe the hypothesis space, and the DempsterShafer theory is selected as a basic mathematical model to handle cooperation under uncertainties in a distributed expert system [ 37 ] In this paper, we extend this idea to the research of multiple agent systems, and that provides a new method to characterize agent s beliefs when agents gather a lot of information about the environment. The standard approach to make decisions is based on maximum expected utility theory, ....
C. Zhang and Y. Li, An algorithm for plan verification in multiple agent systems, in: Agents and Multi-Agent Systems Formalisms, Methodologies and Applications, Lecture Notes in Artificial Intelligence 1441, Editors: W. Wobcke et al., Springer-Verlag, 1998, 149-163.
....[29] Yuefeng Li and Jianhua Chen, A computer aided instruction system ASAC 2, in: Proceedings of International Symposium for Young Computer Professionals, 1989, 163 164. Book 1. Dayou Liu and Yuefeng Li, Principles of Data Structure , ISBN 7 56011622 1 TP33, Jilin University Press, Changchun, 1994. 4 [20] Yuefeng Li and Dayou Liu, Algebraic simplifier of transcendental expressions, Chinese J. of Software, 1995, Vol. 6, No. 2, 78 83. 21] Yuefeng Li and Dayou Liu, The method for approximation computation in the theory of evidence, ....
....Young Computer Professionals, 1989, 163 164. Book 1. Dayou Liu and Yuefeng Li, Principles of Data Structure , ISBN 7 56011622 1 TP33, Jilin University Press, Changchun, 1994. 4 [20] Yuefeng Li and Dayou Liu, Algebraic simplifier of transcendental expressions, Chinese J. of Software, 1995, Vol. 6, No. 2, 78 83. 21] Yuefeng Li and Dayou Liu, The method for approximation computation in the theory of evidence, Acta Scientiaru Naturalium Universitatis Jilinensis, 1995, No. 1, 28 32. Conference Paper In 1995] 22] Dayou Liu and Yuefeng Li, The random sets and the generalization of ....
[Article contains additional citation context not shown here]
Chengqi Zhang and Yuefeng Li, An algorithm for plan verification in multiple agent systems, to appear in: Agents and Multi-Agent Systems Formalisms, Methodologies and Applications, Lecture Notes in Artificial Intelligence 1441, Editors: W. Wobcke et al., Springer-Verlag, 1998, 149-163.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC