Related papers: Global Density Analysis for an Off-Lattice Agent-B…
Lattice-based random walk models are widely used to study populations of migrating cells with motility bias and proliferation. Crowding is typically represented by volume exclusion, where each lattice site can be occupied by at most one…
Cellular automata (CA) can be viewed as maps in the space of probability measures. Such maps are normally infinitely-dimensional, and in order to facilitate investigations of their properties, especially in the context of applications,…
We study the fixed points of outer-totalistic cellular automata on sparse random regular graphs. These can be seen as constraint satisfaction problems, where each variable must adhere to the same local constraint, which depends solely on…
We review existing approaches to mathematical modeling and analysis of multi-agent systems in which complex collective behavior arises out of local interactions between many simple agents. Though the behavior of an individual agent can be…
We develop a two-dimensional cellular automaton (CA) as a simple model for agents moving from origins to destinations. Each agent moves towards an empty neighbor site corresponding to the minimal distance to its destination. The…
Finding feasible and collision-free paths for multiple nonlinear agents is challenging in the decentralized scenarios due to limited available information of other agents and complex dynamics constraints. In this paper, we propose a fast…
There are numerous scenarios in which populations of cells migrate in crowded environments. Typical examples include wound healing, cancer growth and embryo development. In these crowded environments cells are able to interact with each…
People's transportation choices reflect complex trade-offs shaped by personal preferences, social norms, and technology acceptance. Predicting such behavior at scale is a critical challenge with major implications for urban planning and…
Agent-based modeling (ABM) has emerged as a powerful tool in social policy-making and socio-economics, offering a flexible and dynamic approach to understanding and simulating complex systems. While traditional analytic methods may be less…
Simulation with agent-based models is increasingly used in the study of complex socio-technical systems and in social simulation in general. This paradigm offers a number of attractive features, namely the possibility of modeling emergent…
The donation game is a well-established framework for studying the emergence and evolution of cooperation in multi-agent systems. The cooperative behavior can be influenced by the environmental noise in partially observable settings and by…
For an interacting spatio-temporal lattice system we introduce a formal way of expressing multi-time correlation functions of local observables located at the same spatial point with a time state, i.e. a statistical distribution of…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
A formal but intuitive framework is introduced to bridge the gap between data obtained from empirical studies and that generated by agent-based models. This is based on three key tenets. Firstly, a simulation can be given multiple formal…
As one of the emerging algorithms in the field of Artificial Immune Systems (AIS), the Dendritic Cell Algorithm (DCA) has been successfully applied to a number of challenging real-world problems. However, one criticism is the lack of a…
In this chapter, we deal with some specific domains of applications to game theory. This is one of the major class of models in the new approaches of modelling in the economic domain. For that, we use genetic automata which allow to build…
This paper describes a new concept of cellular automaton (CA). XCA consists of a set of arcs (edges) that correspond to cells in CA. At a particular time, the arcs are connected to a directed graph. With each time step, the arcs exchange…
In the article a transition from pattern evolution equation of reaction-diffusion type to a cellular automaton (CA) is described. The applicability of CA is demonstrated by generating patterns of complex irregular structure on a hexagonal…
We consider model-based reinforcement learning (MBRL) in 2-agent, high-fidelity continuous control problems -- an important domain for robots interacting with other agents in the same workspace. For non-trivial dynamical systems, MBRL…
This paper introduces Differentiable Logic Cellular Automata (DiffLogic CA), a novel combination of Neural Cellular Automata (NCA) and Differentiable Logic Gates Networks (DLGNs). The fundamental computation units of the model are…