Rolf Hoffmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Rolf Hoffmann has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Dominique Désérable
Institut National des Sciences Appliquées Rennes France
11 shared publications - Franciszek Seredynski
Institute of Computer Science University of Siedlce
10 shared publications Dominique Désérable
Institut National des Sciences Appliquées
6 shared publications- Tomasz Kulpa
Cardinal Stefan Wyszynski University
4 shared publications - Andrew Adamatzky
Unconventional Computing Laboratory, University of the West of England, UK
3 shared publications Franciszek Seredyński
Cardinal Stefan Wyszynski University
3 shared publications
Latest Publications
- 23 July 2026
- Published by Springer Nature in The European Physical Journal Special Topics
- Vol. 235 (31) , 8857-8868
Loops in areas with obstacles formed by cellular automata
- 23 July 2026
- Published by Springer Nature in The European Physical Journal Special Topics
- Vol. 235 (31) , 8857-8868
Loops in areas with obstacles formed by cellular automata
- 21 June 2025
- Published by Springer Nature
- p. 165-178
Touching Loops and Worms Formed by Cellular Automata
- 21 June 2025
- Published by Springer Nature
- p. 165-178
Touching Loops and Worms Formed by Cellular Automata
- Open Access
Optimizing Wealth by a Game within Cellular Automata
The objective is to find a Cellular Automata (CA) rule that can evolve 2D patterns that are optimal with respect to a global fitness function. The global fitness is defined as the sum of local computed utilities. A utility or value function computes a score depending on the states in the local neighborhood. First the method is explained that was followed to find such a CA rule. Then this method is applied to find a rule that maximizes social wealth. Here wealth is defined as the sum of the payoffs that all players (agents, cells) receive in a prisoner's dilemma game, and then shared equally among them. The problem is solved in four steps: (0) Defining the utility function, (1) Finding optimal master patterns with a Genetic Algorithm, (2) Extracting templates (local neighborhood configurations), (3) Inserting the templates in a general CA rule. The constructed CA rule finds optimal and near-optimal patterns for even and odd grid sizes. Optimal patterns of odd size contain exactly one singularity, a 2 x 2 block of cooperators.
Open AccessOptimizing Wealth by a Game within Cellular Automata
The objective is to find a Cellular Automata (CA) rule that can evolve 2D patterns that are optimal with respect to a global fitness function. The global fitness is defined as the sum of local computed utilities. A utility or value function computes a score depending on the states in the local neighborhood. First the method is explained that was followed to find such a CA rule. Then this method is applied to find a rule that maximizes social wealth. Here wealth is defined as the sum of the payoffs that all players (agents, cells) receive in a prisoner's dilemma game, and then shared equally among them. The problem is solved in four steps: (0) Defining the utility function, (1) Finding optimal master patterns with a Genetic Algorithm, (2) Extracting templates (local neighborhood configurations), (3) Inserting the templates in a general CA rule. The constructed CA rule finds optimal and near-optimal patterns for even and odd grid sizes. Optimal patterns of odd size contain exactly one singularity, a 2 x 2 block of cooperators.
- Open Access
Touching Loop Patterns with Cellular Automata
The objective is the design of a Cellular Automata rule that can form patterns with 'touching' loops. A loop is defined as a closed path of 1-cells in a 2D grid on a zero background and with a zero border. A path cell is connected with two of its adjacent neighbors. In touching loops a path cell is also allowed to touch another on a diagonal. A CA rule was designed that can evolve stable touching loop patterns. The rule tries to cover the 2D space by overlapping tiles. The rule uses so-called templates, 5 x 5 matching patterns which are systematically derived from the given set of 3 x 3 tiles. The rule checks the pattern being evolved against a list of templates. If the outer neighbors of a template match, then the cell's state is set to the template's center value. Noise is injected if there is no matching template, or the tiles are not properly assembled. Thereby the evolution is driven to the desired loop patterns.
Open AccessTouching Loop Patterns with Cellular Automata
The objective is the design of a Cellular Automata rule that can form patterns with 'touching' loops. A loop is defined as a closed path of 1-cells in a 2D grid on a zero background and with a zero border. A path cell is connected with two of its adjacent neighbors. In touching loops a path cell is also allowed to touch another on a diagonal. A CA rule was designed that can evolve stable touching loop patterns. The rule tries to cover the 2D space by overlapping tiles. The rule uses so-called templates, 5 x 5 matching patterns which are systematically derived from the given set of 3 x 3 tiles. The rule checks the pattern being evolved against a list of templates. If the outer neighbors of a template match, then the cell's state is set to the template's center value. Noise is injected if there is no matching template, or the tiles are not properly assembled. Thereby the evolution is driven to the desired loop patterns.
- 2 September 2024
- Published by Springer Nature
- p. 34-44
Pattern Formation by Collective Behavior of Competing Cellular Automata-Based Agents
- 2 September 2024
- Published by Springer Nature
- p. 34-44
Pattern Formation by Collective Behavior of Competing Cellular Automata-Based Agents
- Open Access
- 24 July 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (7) , 352
Generating Loop Patterns with a Genetic Algorithm and a Probabilistic Cellular Automata Rule
The objective is to find a Cellular Automata (CA) rule that can generate “loop patterns”. A loop pattern is given by ones on a zero background showing loops. In order to find out how loop patterns can be locally defined, tentative loop patterns are generated by a genetic algorithm in a preliminary stage. A set of local matching tiles is designed and checked whether they can produce the aimed loop patterns by the genetic algorithm. After having approved a certain set of tiles, a probabilistic CA rule is designed in a methodical way. Templates are derived from the tiles, which then are used in the CA rule for matching. In order to drive the evolution to the desired patterns, noise is injected if the templates do not match or other constraints are not fulfilled. Simulations illustrate that loops and connected loops can be evolved by the CA rule.
- 24 July 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (7) , 352
Open AccessGenerating Loop Patterns with a Genetic Algorithm and a Probabilistic Cellular Automata Rule
The objective is to find a Cellular Automata (CA) rule that can generate “loop patterns”. A loop pattern is given by ones on a zero background showing loops. In order to find out how loop patterns can be locally defined, tentative loop patterns are generated by a genetic algorithm in a preliminary stage. A set of local matching tiles is designed and checked whether they can produce the aimed loop patterns by the genetic algorithm. After having approved a certain set of tiles, a probabilistic CA rule is designed in a methodical way. Templates are derived from the tiles, which then are used in the CA rule for matching. In order to drive the evolution to the desired patterns, noise is injected if the templates do not match or other constraints are not fulfilled. Simulations illustrate that loops and connected loops can be evolved by the CA rule.
- Open Access
Maximal Arrangement of Dominos in the Diamond
"Dominos" are special entities consisting of a hard dimer-like kernel surrounded by a soft hull and governed by local interactions. "Soft hull" and "hard kernel" mean that the hulls can overlap while the kernel acts under a repulsive potential. Unlike the dimer problem in statistical physics, which lists the number of all possible configurations for a given n x n lattice, the more modest goal herein is to provide lower and upper bounds for the maximum allowed number of dominos in the diamond. In this NP problem, a deterministic construction rule is proposed and leads to a suboptimal solution ψ_n as a lower bound. A certain disorder is then injected and leads to an upper bound ψ_n_upper reachable or not. In some cases, the lower and upper bounds coincide, so ψ_n = ψ_n_upper becomes the exact number of dominos for a maximum configuration.
Open AccessMaximal Arrangement of Dominos in the Diamond
"Dominos" are special entities consisting of a hard dimer-like kernel surrounded by a soft hull and governed by local interactions. "Soft hull" and "hard kernel" mean that the hulls can overlap while the kernel acts under a repulsive potential. Unlike the dimer problem in statistical physics, which lists the number of all possible configurations for a given n x n lattice, the more modest goal herein is to provide lower and upper bounds for the maximum allowed number of dominos in the diamond. In this NP problem, a deterministic construction rule is proposed and leads to a suboptimal solution ψ_n as a lower bound. A certain disorder is then injected and leads to an upper bound ψ_n_upper reachable or not. In some cases, the lower and upper bounds coincide, so ψ_n = ψ_n_upper becomes the exact number of dominos for a maximum configuration.
- Open Access
Coverage and Lifetime Optimization by Self-Optimizing Sensor Networks
We propose an approach to self-optimizing wireless sensor networks (WSNs) which are able to find, in a fully distributed way, a solution to a coverage and lifetime optimization problem. The proposed approach is based on three components: (a) a multi-agent, social-like interpreted system, where the modeling of agents, discrete space, and time is provided by a 2-dimensional second-order cellular automata, (b) the interaction between agents is described in terms of the spatial prisoner’s dilemma game, and (c) a local evolutionary mechanism of competition between agents exists. Nodes of a WSN graph created for a given deployment of WSN in the monitored area are considered agents of a multi-agent system that collectively make decisions to turn on or turn off their batteries. Agents are controlled by cellular automata (CA)-based players participating in a variant of the spatial prisoner’s dilemma iterated game. We propose for players participating in this game a local payoff function that incorporates issues of area coverage and sensors energy spending. Rewards obtained by agent players depend not only on their personal decisions but also on their neighbor’s decisions. Agents act in such a way to maximize their own rewards, which results in achieving by them a solution corresponding to the Nash equilibrium point. We show that the system is self-optimizing, i.e., can optimize in a distributed way global criteria related to WSN and not known for agents, provide a balance between requested coverage and spending energy, and result in expanding the WSN lifetime. The solutions proposed by the multi-agent system fulfill the Pareto optimality principles, and the desired quality of solutions can be controlled by user-defined parameters. The proposed approach is validated by a number of experimental results.
Open AccessCoverage and Lifetime Optimization by Self-Optimizing Sensor Networks
We propose an approach to self-optimizing wireless sensor networks (WSNs) which are able to find, in a fully distributed way, a solution to a coverage and lifetime optimization problem. The proposed approach is based on three components: (a) a multi-agent, social-like interpreted system, where the modeling of agents, discrete space, and time is provided by a 2-dimensional second-order cellular automata, (b) the interaction between agents is described in terms of the spatial prisoner’s dilemma game, and (c) a local evolutionary mechanism of competition between agents exists. Nodes of a WSN graph created for a given deployment of WSN in the monitored area are considered agents of a multi-agent system that collectively make decisions to turn on or turn off their batteries. Agents are controlled by cellular automata (CA)-based players participating in a variant of the spatial prisoner’s dilemma iterated game. We propose for players participating in this game a local payoff function that incorporates issues of area coverage and sensors energy spending. Rewards obtained by agent players depend not only on their personal decisions but also on their neighbor’s decisions. Agents act in such a way to maximize their own rewards, which results in achieving by them a solution corresponding to the Nash equilibrium point. We show that the system is self-optimizing, i.e., can optimize in a distributed way global criteria related to WSN and not known for agents, provide a balance between requested coverage and spending energy, and result in expanding the WSN lifetime. The solutions proposed by the multi-agent system fulfill the Pareto optimality principles, and the desired quality of solutions can be controlled by user-defined parameters. The proposed approach is validated by a number of experimental results.
- 13 March 2023
- Published by Elsevier in Journal of Computational Science
- Vol. 68
Evolutionary self-optimization of large CA-based multi-agent systems
- 13 March 2023
- Published by Elsevier in Journal of Computational Science
- Vol. 68
Evolutionary self-optimization of large CA-based multi-agent systems