Studies on Neighbourhood Graphs for Communication in Multi Agent Systems

  • Andreas Goebels
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4222)


This paper addresses a special type of graph, the k-neighbourhood graph, for the usage in huge multi agent systems. It can be used to establish slim communication structures in extensive groups of agents as they are present e.g. in swarm applications. We will prove some properties of k-neighbourhood graphs in two- and three-dimensional Euclidean space, i.e. we show that the maximum number of incoming connections per agent is limited to a value independent from the overall number of agents in the system. For the two-dimensional case we prove a maximum in-degree of 6 ·k. Furthermore, for agents interacting in three dimensions an upper and a lower bound for this value is presented.


Side Length Communication Partner Swarm Intelligence Neighbourhood Graph Incoming Connection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ferber, J.: Multi-agent systems: An introduction to distributed artificial intelligence. Addison-Wesley, Harlow (1999)Google Scholar
  2. 2.
    Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence - From natural to artificial Systems. Oxford University Press, Oxford (1999)MATHGoogle Scholar
  3. 3.
    Matarić, M.J.: Using communication to reduce locality in distributed multi-agent learning. In: Weiss, G. (ed.) Journal of Experimental and Theoretical Artificial Intelligence, special issue on Learning in DAI Systems 10(3), 357–369 (1998)MATHGoogle Scholar
  4. 4.
    Nii, H.P.: Blackboard systems, part one: The blackboard model of problem solving and the evolution of blackboard architectures. AI Magazine 7, 38–53 (1986)Google Scholar
  5. 5.
    Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks (2001)Google Scholar
  6. 6.
    Eppstein, D.: Spanning trees and spanners. Technical Report Technical Report 96-16, University of California, Dept. Information and Computer Science (1996)Google Scholar
  7. 7.
    Schindelhauer, C., Volbert, K., Ziegler, M.: Spanners, weak spanners, and power spanners for wireless networks. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 805–821. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Goebels, A., Büning, H.K., Priesterjahn, S., Weimer, A.: Towards online partitioning of agent sets based on local information. In: Proceedings of the International Conference on Parallel and Distributed Computing and Networks (PDCN), Innsbruck, Austria (2005)Google Scholar
  9. 9.
    Goebels, A.: Learning useful communication structures for groups of agents. In: Proceedings of the IFIP Conference on Biologically Inspired Cooperative Computing, BICC 2006, Santiago de Chile, Chile (2006)Google Scholar
  10. 10.
    Eppstein, D., Paterson, M.S., Yao, F.F.: On nearest-neighbor graphs. GEOMETRY: Discrete & Computational Geometry 17 (1997)Google Scholar
  11. 11.
    Vaidya, P.: An O(n logn) algorithm for the all-nearest-neighbors problem. Discrete and Computational Geometry (4), 101–115 (1989)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Callahan, P.: Optimal parallel all-nearest-neighbours using the well-separated pair decomposition. In: Proceedings of the 34th IEEE Symposium Foundations of Computer Science, pp. 332–340 (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Andreas Goebels
    • 1
  1. 1.International Graduate School of Dynamic Intelligent Systems, Knowledge Based SystemsUniversity of PaderbornGermany

Personalised recommendations