On the computational power of swarm automata using agents with position information
Abstract
Based on swarm movements and computing models using multisets, a swarm automaton was introduced to construct a new computing system using swarm behavior in the computing process. In a swarm automaton, each agent changes by input and the interaction between agents, which leads to change the swarm represented by the multiset of agents. An input string is accepted by a swarm automaton depending on the conditions of the agents in the swarm. That is, an input string that leads the swarm to a specified condition is accepted. When we introduce position information for agents in a swarm automaton, the agent not only changes but also moves according to the nearby agents. In this paper, we introduce a language accepted by a swarm automaton based on the position of agents in a swarm. That is, a string is accepted when it leads to the swarm consisting of agents on the designated position. We focus on the number of agents in a swarm and consider the computing power of that swarm automaton. We show that any recursively enumerable language is accepted by a swarm automaton with only five agents using parallel transition.
References
[1]
Bargmann Cornelia I and Erika Hartwieg HRH Odorant-selective genes and neurons mediate olfaction in C. Elegans Cell 1993 74 3 515-527
[2]
Camazine S, Franks NR, Sneyd J, Bonabeau E, Deneubourg JL, and Theraula G Self-organization in biological systems 2001 Princeton Princeton University Press
[3]
Ehrenfeucht A and Rozenberg G Reaction systems Fundam Inform 2007 75 1–4 263-280
[4]
Fujioka K McQuillan I and Seki S Swarm-based multiset rewriting computing models Unconventional computation and natural computation 2019 Cham Springer 79-93
[5]
Hopcroft JE and Ullman JD Introduction to automata theory, languages, and computation 2001 New York Addison-Wesley Publishing Company
[6]
Ibarra OH On membrane hierarchy in P systems Theor Comput Sci 2005 334 1 115-129
[7]
Kusumoto H and TKSSTe Efficiency of gastrointestinal cancer detection by nematode-nose (n-nose) J Theor Biol 2020 34 1 73-80
[8]
Lopes YK, Trenkwalder SM, Leal AB, Dodd TJ, and Groß R Supervisory control theory applied to swarm robotics Swarm Intell 2016 10 65-97
[9]
Minsky ML Computation: finite and infinite machines 1967 Hoboken Prentice-Hall
[10]
Okubo F Reaction automata working in sequential manner RAIRO Theor Inform Appl 2014 48 1 23-38
[11]
Okubo F and Yokomori T Decomposition and factorization of chemical reaction transducers Theor Comput Sci 2019 777 431-442
[12]
Okubo F, Kobayashi S, and Yokomori T Reaction automata Theor Comput Sci 2012 429 247-257
[13]
Păun G, Rozenberg G, and Salomaa A The Oxford handbook of membrane computing 2010 New York Oxford University Press Inc
[14]
Ramadge PJ and Wonham WM Modular feedback logic for discrete event systems SIAM J Control Optim 1987 25 5 1202-1218
[15]
Ramadge PJ and Wonham WM Supervisory control of a class of discrete event processes SIAM J Control Optim 1987 25 1 206-230
[16]
Rozenberg G and Salomaa A Handbook of formal languages 1997 Berlin Springer
[17]
von Mammen S, Jacob C (2007) Genetic swarm grammar programming: Ecological breeding like a gardener. In: 2007 IEEE Congress on Evolutionary Computation. IEEE Press, Singapore, pp 851–858
[18]
von Mammen S, Jacob C (2008) Evolutionary swarm design of architectural idea models. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO ’08. ACM, New York, NY, USA, pp 143–150
[19]
von Mammen S, Phillips D, Davison T, Jacob C (2010) A graph-based developmental swarm representation and algorithm. In: International Conference on Swarm intelligence. Springer, Berlin, pp 1–12
[20]
Wonham W, Cai K, and Rudie K Supervisory control of discrete-event systems: a brief history - 1980–2015 IFAC PapersOnLine 2017 50 1 1791-1797
Index Terms
- On the computational power of swarm automata using agents with position information
Index terms have been assigned to the content through auto-classification.
Recommendations
On the Hierarchy of Swarm-automaton for the Number of Agents
AbstractWe have introduced and extended the notion of swarm automaton to analyze the computability using swarm movement represented by multiset rewriting. The two transitions, parallel and sequential, are considered to transform a configuration of ...
Swarm-Based Multiset Rewriting Computing Models
Unconventional Computation and Natural ComputationAbstractSwarm-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 ...
Empowering particle swarm optimization algorithm using multi agents capability
A new PSO variant, i.e., HolonicPSO is proposed to balance exploration/exploitation.By considering PSO algorithm as a simple multi agent system, holonic organization is used to improve the efficiency of this algorithm.Using holonic organization balances ...
Comments
Information & Contributors
Information
Published In
© The Author(s), under exclusive licence to Springer Nature B.V. 2022.
Publisher
Kluwer Academic Publishers
United States
Publication History
Published: 01 December 2022
Accepted: 05 February 2022
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025