First steps on asynchronous lattice-gas models with an application to a swarming rule

Lattice-gas cellular automata are often considered as a particular case of cellular automata in which additional constraints apply, such as conservation of particles or spatial exclusion. But what about their updating? How to deal with non-perfect synchrony? Novel definitions of asynchronism are pro...

Full description

Saved in:
Bibliographic Details
Published in:Natural computing 2013-12, Vol.12 (4), p.551-560
Main Authors: Bouré, Olivier, Fatès, Nazim, Chevrier, Vincent
Format: Article
Language:English
Subjects:
Artificial Intelligence
Asynchronous
Cellular Automata and Lattice Gases
Complex Systems
Computer Science
Evolutionary Biology
Gases
Lattice theory
Nonlinear Sciences
Processor Architectures
Robust control
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Lattice-gas cellular automata are often considered as a particular case of cellular automata in which additional constraints apply, such as conservation of particles or spatial exclusion. But what about their updating? How to deal with non-perfect synchrony? Novel definitions of asynchronism are proposed that respect the specific hypotheses of lattice-gas models. These definitions are then applied to a swarming rule in order to explore the robustness of the global emergent behaviour. In particular, we compare the synchronous and asynchronous case, and remark that a paradoxical phenomenon, the anti-alignment of particles, is no longer observed when a small but not infinitesimal amount of asynchronism is added.
ISSN:1567-7818
1572-9796
DOI:10.1007/s11047-013-9389-2