Decentralized evolution of robotic behavior using finite state machines
The DOI matches its Crossref record.
Abstract
Purpose: In evolutionary robotics (ER), robotic control systems are subject to a developmental process inspired by natural evolution. The purpose of this paper is to utilize a control system representation based on finite state machines (FSMs) to build a decentralized online‐evolutionary framework for swarms of mobile robots. Design/methodology/approach: A new recombination operator for multi‐parental generation of offspring is presented and a known mutation operator is extended to harden parts of genotypes involved in good behavior, thus narrowing down the dimensions of the search space. A storage called memory genome for archiving the best genomes of every robot introduces a decentralized elitist strategy. These operators are studied in a factorial set of experiments by evolving two different benchmark behaviors such as collision avoidance and gate passing on a simulated swarm of robots. A comparison with a related approach is provided. Findings: The framework is capable of robustly evolving the benchmark behaviors. The memory genome and the number of parents for reproduction highly influence the quality of the results; the recombination operator leads to an improvement in certain parameter combinations only. Research limitations/implications: Future studies should focus on further improving mutation and recombination. Generality statements should be made by studying more behaviors and there is a need for experimental studies with real robots. Practical implications: The design of decentralized ER frameworks is improved. Originality/value: The framework is robust and has the advantage that the resulting controllers are easier to analyze than in approaches based on artificial neural networks. The findings suggest improvements in the general design of decentralized ER frameworks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Automatic Design of Robot Swarms: Achievements and Challenges
Francesca, G., & Birattari, M. (2016) · Frontiers in Robotics and AI · doi:10.3389/frobt.2016.00029 · Cited by 144
“Matarić (2001) surveyed various behavior-based control architectures that allow the on-line optimization of parameters.”
BackgroundAutoMoDe-Chocolate: automatic design of control software for robot swarms
Francesca, G., Brambilla, M., Brutschy, A., Garattoni, L., Miletitch, R., Podevijn, G., Reina, A., Soleymani, T., Salvaro, M., Pinciroli, C., et al. (2015) · Swarm Intelligence · doi:10.1007/s11721-015-0107-9 · Cited by 99
Ligot, A., & Birattari, M. (2020) · Swarm Intelligence · doi:10.1007/s11721-019-00175-w · Cited by 55
Birattari, M., Ligot, A., & Francesca, G. (2021) · Natural Computing Series · doi:10.1007/978-3-030-72069-8_5 · Cited by 22
Metadata
- Authors
- König, L., Mostaghim, S., & Schmeck, H.
- Venue
- International Journal of Intelligent Computing and Cybernetics
- Publisher
- Emerald
- Published
- 2009-11-20
- Volume
- 2
- Issue
- 4
- Pages
- 695-723
- ISSN
- 1756-378X (ISSN-L)
- OpenAlex
- W2074691864
- Cited by
- 42
- References
- 0
- FWCI
- 2.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Decentralized evolution of robotic behavior using finite state machines. https://app.cochat.ai/papers/10.1108/17563780911005845
- The paper
- König, L., Mostaghim, S., & Schmeck, H. (2009). Decentralized evolution of robotic behavior using finite state machines. International Journal of Intelligent Computing and Cybernetics. https://doi.org/10.1108/17563780911005845
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.