Cargando…
A Graph-Transformational Approach to Swarm Computation
In this paper, we propose a graph-transformational approach to swarm computation that is flexible enough to cover various existing notions of swarms and swarm computation, and it provides a mathematical basis for the analysis of swarms with respect to their correct behavior and efficiency. A graph t...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8070391/ https://www.ncbi.nlm.nih.gov/pubmed/33921251 http://dx.doi.org/10.3390/e23040453 |
_version_ | 1783683459167813632 |
---|---|
author | Abdenebaoui, Larbi Kreowski, Hans-Jörg Kuske, Sabine |
author_facet | Abdenebaoui, Larbi Kreowski, Hans-Jörg Kuske, Sabine |
author_sort | Abdenebaoui, Larbi |
collection | PubMed |
description | In this paper, we propose a graph-transformational approach to swarm computation that is flexible enough to cover various existing notions of swarms and swarm computation, and it provides a mathematical basis for the analysis of swarms with respect to their correct behavior and efficiency. A graph transformational swarm consists of members of some kinds. They are modeled by graph transformation units providing rules and control conditions to specify the capability of members and kinds. The swarm members act on an environment—represented by a graph—by applying their rules in parallel. Moreover, a swarm has a cooperation condition to coordinate the simultaneous actions of the swarm members and two graph class expressions to specify the initial environments on one hand and to fix the goal on the other hand. Semantically, a swarm runs from an initial environment to one that fulfills the goal by a sequence of simultaneous actions of all its members. As main results, we show that cellular automata and particle swarms can be simulated by graph-transformational swarms. Moreover, we give an illustrative example of a simple ant colony the ants of which forage for food choosing their tracks randomly based on pheromone trails. |
format | Online Article Text |
id | pubmed-8070391 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-80703912021-04-26 A Graph-Transformational Approach to Swarm Computation Abdenebaoui, Larbi Kreowski, Hans-Jörg Kuske, Sabine Entropy (Basel) Article In this paper, we propose a graph-transformational approach to swarm computation that is flexible enough to cover various existing notions of swarms and swarm computation, and it provides a mathematical basis for the analysis of swarms with respect to their correct behavior and efficiency. A graph transformational swarm consists of members of some kinds. They are modeled by graph transformation units providing rules and control conditions to specify the capability of members and kinds. The swarm members act on an environment—represented by a graph—by applying their rules in parallel. Moreover, a swarm has a cooperation condition to coordinate the simultaneous actions of the swarm members and two graph class expressions to specify the initial environments on one hand and to fix the goal on the other hand. Semantically, a swarm runs from an initial environment to one that fulfills the goal by a sequence of simultaneous actions of all its members. As main results, we show that cellular automata and particle swarms can be simulated by graph-transformational swarms. Moreover, we give an illustrative example of a simple ant colony the ants of which forage for food choosing their tracks randomly based on pheromone trails. MDPI 2021-04-12 /pmc/articles/PMC8070391/ /pubmed/33921251 http://dx.doi.org/10.3390/e23040453 Text en © 2021 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Abdenebaoui, Larbi Kreowski, Hans-Jörg Kuske, Sabine A Graph-Transformational Approach to Swarm Computation |
title | A Graph-Transformational Approach to Swarm Computation |
title_full | A Graph-Transformational Approach to Swarm Computation |
title_fullStr | A Graph-Transformational Approach to Swarm Computation |
title_full_unstemmed | A Graph-Transformational Approach to Swarm Computation |
title_short | A Graph-Transformational Approach to Swarm Computation |
title_sort | graph-transformational approach to swarm computation |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8070391/ https://www.ncbi.nlm.nih.gov/pubmed/33921251 http://dx.doi.org/10.3390/e23040453 |
work_keys_str_mv | AT abdenebaouilarbi agraphtransformationalapproachtoswarmcomputation AT kreowskihansjorg agraphtransformationalapproachtoswarmcomputation AT kuskesabine agraphtransformationalapproachtoswarmcomputation AT abdenebaouilarbi graphtransformationalapproachtoswarmcomputation AT kreowskihansjorg graphtransformationalapproachtoswarmcomputation AT kuskesabine graphtransformationalapproachtoswarmcomputation |