Skip to main content

Applying Multi-medians Location and Steiner Tree Methods into Agents Distributed Blackboard Architecture Construction

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3339))

Abstract

Distributed blackboard is one of the popular agent communication architectures, where the blackboards location and communication topology are two important issues. However, there are few works about the issues. To solve this problem, this paper presents a new method, which applies Multi-Medians Location Method to compute the sub-blackboard locations, and applies Steinner Tree Method to compute the communication topology among sub-blackboards. The model can construct the distributed blackboard architecture effectively according to the current underlying network topology.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

  2. Christofides, N.: Graph Theory: an algorithmic approach, pp. 79–120. Academic Press, London (1975)

    MATH  Google Scholar 

  3. Teitz, M.B., Bart, P.: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph. Ops. Res. 16, 955 (1968)

    Article  MATH  Google Scholar 

  4. Cooper, L.: Location Allocation problems. Ops.Res. 11, 331 (1963)

    Article  MATH  Google Scholar 

  5. Zachariasen, M.: Algorithms for Plane Steiner Tree Problems. Ph.d Thesis, University of Copenhagen, Denmark (1998)

    Google Scholar 

  6. Zhou, B.D.: Steiner Tree Optimization in Multicast Routing. M.S. Thesis [2002]. University of Guelph (July 2002)

    Google Scholar 

  7. Kou, L., Markowsky, G., Berman, L.: A Fast Algorithm for Steiner Trees. Acta Informatica. Vol.15 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, YC., Zhang, SY. (2004). Applying Multi-medians Location and Steiner Tree Methods into Agents Distributed Blackboard Architecture Construction. In: Webb, G.I., Yu, X. (eds) AI 2004: Advances in Artificial Intelligence. AI 2004. Lecture Notes in Computer Science(), vol 3339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30549-1_80

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30549-1_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24059-4

  • Online ISBN: 978-3-540-30549-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics