A Graph-Based Developmental Swarm Representation and Algorithm

  • Sebastian von Mammen
  • David Phillips
  • Timothy Davison
  • Christian Jacob
Conference paper

DOI: 10.1007/978-3-642-15461-4_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6234)
Cite this paper as:
von Mammen S., Phillips D., Davison T., Jacob C. (2010) A Graph-Based Developmental Swarm Representation and Algorithm. In: Dorigo M. et al. (eds) Swarm Intelligence. ANTS 2010. Lecture Notes in Computer Science, vol 6234. Springer, Berlin, Heidelberg

Abstract

Modelling natural processes requires the implementation of an expressive representation of the involved entities and their interactions. We present swarm graph grammars (SGGs) as a bio-inspired modelling framework that integrates aspects of formal grammars, graph-based representation and multi-agent simulation. In SGGs, the substitution of subgraphs that represent locally defined agent interactions drive the computational process of the simulation. The generative character of formal grammars is translated into an agent’s metabolic interactions, i.e. creating or removing agents from the system. Utilizing graphs to describe interactions and relationships between pairs or sets of agents offers an easily accessible way of modelling biological phenomena. Property graphs emerge through the application of local interaction rules; we use these graphs to capture various aspects of the interaction dynamics at any given step of a simulation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Sebastian von Mammen
    • 1
  • David Phillips
    • 1
  • Timothy Davison
    • 1
  • Christian Jacob
    • 1
    • 2
  1. 1.Dept. of Computer ScienceUniversity of CalgaryCanada
  2. 2.Dept. of Biochemistry and Molecular BiologyUniversity of CalgaryCanada

Personalised recommendations