Constructing agents blackboard communication architecture based on graph theory

Computer Standards and Interfaces

Volumn 27, Issue 3, 2005, Pages 285-301

  Jiang, Y C ^a   Yi, P ^a   Zhang, S Y ^a   Zhong, Y P ^a  

^a FUDAN UNIVERSITY   (China)

Author keywords

Agents communication; Agents interaction; Blackboard architecture; Graph theory; Multi agents; Network topology

Indexed keywords

COMPUTER NETWORKS; EXPERT SYSTEMS; GRAPH THEORY; MULTI AGENT SYSTEMS; PROBLEM SOLVING; TOPOLOGY;

AGENTS COMMUNICATION; AGENTS INTERACTION; BLACKBOARD ARCHITECTURE; NETWORK TOPOLOGY;

COMMUNICATION;

EID: 10044221105     PISSN: 09205489     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0920-5489(04)00101-1     Document Type: Article

References (23)

1. Francois Charpillet, Philippe Lalanda, Jean-Paul Haton, A real time blackboard based architecture, ECAI92 10th European Conference on Artificial Intelligence, ECAI, August, 1992, pp. 262-266.
2. V. Botti, F. Barber, A temporal blackboard for a multi-agent environment, Data and Knowledge Engineering 15 (1995) 189-211.
3. Cyprian Foinjong Ngolah. A Tutorial on Agent Communication and Knowledge Sharing, http://www.enel.ucalgary.ca/ People/far/Lectures/SENG60922/PDF/ tutorials/2002/Agent_ Communication_and_Knowledge_Sharing.pdf.
4. Y.C. Jiang, Z.Y. Xia, Y.P. Zhong, S.Y. Zhang, An adaptive adjusting mechanism for agent distributed black-board architecture. Microprocessors and Microsystems, in press.
5. Yichuan Jiang, Yiping Zhong, Shiyong Zhang, Applying multi-medians location and Steiner tree methods into agents distributed blackboard architecture construction, Proceeding of the 17th Australian Joint Conference on Artificial Intelligence (AI2004). Cairns, Australian, 2004.
6. Nicos Christofides, Graph Theory: An Algorithmic Approach, Academic Press, London, 1975, pp. 79-120.
7. M.B. Teitz, P. Bart, Heuristic methods for estimating the generalized vertex median of a weighted graph, Operations Research 16 (1968) 955-961.
8. L. Cooper, Location allocation problems, Operations Research 11 (1963) 331-343.
9. Chen Senfa, Network Model and Optimization, South-East University Press Nanjing, China, 1992, pp. 91-112.
10. S.E. Dreyfus, R.A. Wagner, The Steiner problem in graphs, Networks 1 (1972) 195-207.
11. F.K. Hwang, D.S. Richards, Steiner tree problems, IEEE/ACM Transactions on Networking 22 (1992 January) 55-89.
12. Harris, Jr., C. Frederick, Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work. University of Nevada, http://www.cs.unr.edu/~fredh/papers/books/handbook/paper.ps.gz.
13. Martini Zachariasen. Algorithms for Plane Steiner Tree Problems. PhD thesis [1998]. University of Copenhagen, Denmark, 1998.
14. Brian Dazheng Zhou. Steiner Tree Optimization in Multicast Routing. MS thesis [2002]. University of Guelph. July, 2002.
15. L. Kou, G. Markowsky, L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15 (1981) 141-145.
16. S.K.S. Gupta, P.K. Srimani, Adaptive core selection and migration method for multicast routing in mobile ad hoc networks, IEEE Transactions on Parallel and Distributed Systems 14 (1) (2003 January) 27-38.
17. Sudipto Guha, Adam Meyerson, Kamesh Munagala, Improved algorithm for fault-tolerant facility location, Proceedings of 12th ACM-SIAM Symposium on Discrete Algorithms, 2001.
18. Tcl Developer Xchange: The Tcl and Tk Toolkit, Tcl/Tk Version 8.4.4. URL: http://www.tcl.tk/software/tcltk/8.4.html.
19. Tel Contributed Archive: Extended Tel (TclX), Version 7.0a. URL: http://www.neosoft.com/tcl/. Neosoft, 2003.
20. Home Page for Tix: Tk Interface eXtension: Tix-Programming Library for the Tk Toolkit, Version 4.0. URL: http://tix.mne.com/. 2003.
21. Internet Programming Toolkit: Binprolog Version 1.99. URL: http://www.binnetcorp.com/BinProlog/, 1995.
22. Aglets Software Development Kit: Aglets Software Development Kit v2 (Open Source). URL: http://www.trl.ibm.com/aglets/. 2002.
23. K. Mehlhorn, Data Structures and Algorithms: 1. Sorting and Searching, Springer-Verlag Berlin, Heidelberg, 1984.