Constructing agents blackboard communication architecture based on graph theory

In the agent blackboard communication architecture, agents do not interact with each other directly but through blackboard. The blackboard architecture includes central blackboard architecture and distributed one. In blackboard communication architecture, the location of central blackboard (or distributed sub-blackboards) and communication topology among sub-blackboards are two important issues that can influence the agent communication performance very much. However, there are few works about such issues; and in the existing agent systems, the central blackboard (or distributed sub-blackboards) is (or are) usually randomly located in the underlying network. To solve such problem, this paper presents a model for constructing agent blackboard communication architecture based on graph theory. The model computes the location of central blackboard or sub-blackboards based on median location method, and computes the communication topology among sub-blackboards based on Steiner Tree method; the model also applies graph theory to the construction of blackboard architecture's adaptation mechanism for dynamic topology and the realization of the blackboard architecture's fault-tolerance ability. At last, several case studies and simulation experiments are conducted, which prove that the presented model can construct the effective agent blackboard communication architecture.

[1]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[2]  Martin Zachariasen Algorithms for Plane Steiner Tree Problems , 1998 .

[3]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[4]  François Charpillet,et al.  A Real Time Blackboard Based Architecture , 1992, ECAI.

[5]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[6]  L. Cooper Location-Allocation Problems , 1963 .

[7]  Ismael Ripoll,et al.  A Temporal Blackboard for a Multi-Agent Environment , 1995, Data Knowl. Eng..

[8]  F. Harris Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work , 1998 .

[9]  Nicos Christofides,et al.  Graph theory: An algorithmic approach (Computer science and applied mathematics) , 1975 .

[10]  Sudipto Guha,et al.  Improved algorithms for fault tolerant facility location , 2001, SODA '01.

[11]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[12]  Shiyong Zhang,et al.  Applying Multi-medians Location and Steiner Tree Methods into Agents Distributed Blackboard Architecture Construction , 2004, Australian Conference on Artificial Intelligence.

[13]  Zhengyou Xia,et al.  An adaptive adjusting mechanism for agent distributed blackboard architecture , 2005, Microprocess. Microsystems.

[14]  Sandeep K. S. Gupta,et al.  Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[15]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[16]  Behrouz H. Far,et al.  A TUTORIAL ON AGENT COMMUNICATION AND KNOWLEDGE SHARING , 2003 .