Advertisement

Swarm-Based Multiset Rewriting Computing Models

  • Kaoru FujiokaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11493)

Abstract

Swarm-based computing models and multi-agent-based models have been investigated using parallel processing computation. Based on the preceding models and multiset computings, we propose new computing systems, called swarm systems, that are multiset rewriting systems to formalize swarms’ behaviors. A configuration in a swarm system is expressed by a multiset of agents to simulate swarm movements. Swarm automata are also introduced based on swarm systems, which accept strings by considering the configuration sequences. Transition rules in a swarm automaton are labeled by elements of an alphabet and when a configuration consists of final agents then the corresponding sequences of rule symbols are accepted. Position information for agents is added to those swarm models. We show that swarm automata with position information are universal if transition rules are applied in parallel. On the other hand, swarm automata without position information are computationally equivalent to finite state automata.

Keywords

Swarm grammar Swarm behavior Rewriting system Multi-agent system Cellular automaton 

References

  1. 1.
    Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Multiset automata. In: Calude, C.S., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2000. LNCS, vol. 2235, pp. 69–83. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-45523-X_4CrossRefzbMATHGoogle Scholar
  2. 2.
    von Mammen, S., Jacob, C.: Evolutionary swarm design of architectural idea models. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO 2008, pp. 143–150. ACM, New York (2008)Google Scholar
  3. 3.
    von Mammen, S., Phillips, D., Davison, T., Jacob, C.: A graph-based developmental swarm representation and algorithm. In: Dorigo, M., et al. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 1–12. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-15461-4_1CrossRefGoogle Scholar
  4. 4.
    von Neumann, J.: Theory of Self-reproducing Automata. University of Illionois Press, Champain (1966)Google Scholar
  5. 5.
    Okubo, F., Kobayashi, S., Yokomori, T.: Reaction automata. Theor. Comput. Sci. 429, 247–257 (2012)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Paun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press, Inc., New York (2010)CrossRefGoogle Scholar
  7. 7.
    Puaun, G., Rozenberg, G., Salomaa, A.: DNA Computing - New Computing Paradigms. Springer, Heidelberg (1998).  https://doi.org/10.1007/978-3-662-03563-4CrossRefzbMATHGoogle Scholar
  8. 8.
    Reynolds, C.W.: Flocks, herds and schools: a distributed behavioral model. SIGGRAPH Comput. Graph. 21(4), 25–34 (1987)CrossRefGoogle Scholar
  9. 9.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.International College of Arts and SciencesFukuoka Women’s UniversityFukuokaJapan

Personalised recommendations