Dominique Désérable

Institut National des Sciences Appliquées de Rennes | INSA Rennes · LGCGM – PRES UEB – EA 3913

"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 fo...

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 pro...

We propose a second–order Cellular Automata (CA)–based approach to solve a problem of lifetime optimization in Wireless Sensor Networks (WSN). A WSN graph created for a given deployment of WSN in monitored area is considered as a multiagent system, where agents take part in a spatial Prisoner’s Dilemma game. We propose a local, agent–player oriente...

The problem of an optimal coverage of a wireless sensor network area is considered. To solve this problem, a Cellular Automata (CA) approach is proposed. More specifically, the objective is to find CA rules which are able to cover the 2D space by a minimum number of so–called “Sensor Tiles”. A sensor tile consists of a von Neumann neighborhood of r...

{\em Arrowhead} and {\em diamond} are two hierarchical Cayley graphs defined on the triangular grid. In their undirected version, they are isomorphic and merely define two distinct representations of the same graph. This paper gives the expression of their diameter, in the oriented and non--oriented case. It also displays the full distribution of a...

The objective is to find a Cellular Automata (CA) rule that is able to cover a 2d array of cells by a minimum number of so-called “Domino Tiles”. The aimed patterns are called min patterns. Two probabilistic CA rules were designed using templates, small matching patterns. For each of the 12 domino tile pixels a template is declared. If no template...

The objective is to demonstrate that a probabilistic cellular automata rule can place reliably a maximal number of dominoes in different active area shapes, exemplarily evaluated for the square and diamond. The basic rule forms domino patterns, but the number of dominoes is not necessarily maximal and the patterns are not always stable. It works wi...

Rule 22 elementary cellular automaton (ECA) has a 3--cell neighborhood, binary cell states, where a cell takes state `1' if there is exactly one neighbor, including the cell itself, in state `1'. In Boolean terms the cell-state transition is a XOR function of three cell states. In physico--chemical terms the rule might be seen as describing propaga...

We present a theoretical framework and an experimental tool to study behavior of heterogeneous multi-agent systems composed of the two classes of automata-based agents: Cellular Automata (CA) and Learning Automata (LA). Our general aim is to use this framework to solve global optimization problems in a distributed way using the collective behavior...

The objective in this study is to form a domino pattern by Cellular Automata (CA). In a previous work such patterns were formed by CA agents, which were trained with high effort by the aid of Genetic Algorithm. Now two probabilistic CA rules are designed in a methodical way that can perform this task very reliably even for rectangular fields. The f...

Considered is a 2D cellular automaton with moving agents. The objective is to find agents controlled by a Finite State Program (FSP) that can form domino patterns. The quality of a formed pattern is measured by the degree of order computed by counting matching \(3 \times 3\) patterns (templates). The class of domino patterns is defined by four temp...

Considered is a 2D cellular automaton with moving agents. Each cell contains a particle with a certain spin/color that can be turned by an agent. Four colors are used. The objective is to align the spins in parallel along horizontal and vertical lines, in order to form long orthogonal “line patterns”. The quality of a line pattern is measured by a...

This chapter describes an efficient novel router in which the messages are transported by Cellular Automata (CA) mini-robots or so called CA agents. CA agents are compliant but inconvenient to describe with the CA paradigm. In order to implement agents more efficiently, the CA-w model (with write access) is used. Both CA and CA–w models are compare...

Although cellular automata (CA) are usually driven by a local rule, global communications are often needed either to synchronize a process or to share common data. However, these communications must be carried out from the nearest-neighbor, local transition. Such disseminations are named “systolic” herein: this metaphor is borrowed from the eponymo...

Solving the all-to-all communication task in the cyclic triangulate and square grids in shortest time with mobile agents was the objective of this work. In order to solve the problem, the multi-agent system is modeled by cellular automata with synchronous updating and the agents’ behavior by an embedded finite state machine (FSM). Agents can move o...

The objective was to find the behaviour of agents to solve the all-to-all-communication task in the cyclic triangulate and square grids in shortest time. The agents should be reliable, meaning that they are successful on almost any initial configuration. In order to solve the problem, the multi-agent system was modeled by Cellular Automata with syn...

The void propagation defines a long-range interaction in granular matter. We detail a logic scheme simulating the propagation and implemented in a 2d cellular automata applied to granular flow. The CA belongs to the family of “lattice-grain” automata (LGrA) with one particle per cell. We focus first on the influence of inertia, or “memory effect”,...

This paper describes an efficient novel router on the 6-valent triangular grid with toroidal connections, denoted “T–grid” in the sequel. The router uses six channels per node that can host up to six agents. The topological properties of the T–grid are given first, as well as a minimal routing scheme, as a basis for a Cellular Automata modeling of...

A multiple target searching with evolved agents is per formed in a cellular automata network to solve the routing problem in the square toroidal grid. The agents shall behave according to a control algorithm implemented as finite state machine (FSM). Using a genetic procedure, algorithms are evolved that could solve successfully all the training ca...

Complex matter may take various forms from granular matter, soft matter, fluid-fluid, or solid-fluid mixtures to compact heterogeneous material. Cellular automata models make a suitable and powerful tool for catching the influence of the microscopic scale in the macroscopic behavior of these complex systems. Rather than a survey, this paper at-temp...

An open cellular automata (CA) environment applied to the simulation of two-dimensional granular flows is presented herein. The CA belongs to the family of so-called "lattice-grain" (cellular) automata (LGrA) with one particle per cell. The time evolution is governed by a "request-exchange" synchronous mode which simulates a two-stage interaction-a...

Given a triangular grid of N cells (communication nodes) with toroidal connections. The goal was to solve the routing problem with N/2 agents, each of the agents having the task to a transport a message from a source to a target. This task is also known as multiple target searching. The agents shall behave according to a control algorithm implement...

Complex matter may lie in various forms from granular matter, soft matter, fluid-fluid or solid-fluid mixtures to compact heterogeneous material. Cellular automata models make a suitable and powerful tool to catch the influence of the microscopic scale onto the macroscopic behaviour of these complex systems. Rather than a survey, this paper will at...

We present a two-dimensional cellular automata network applied to granular flow and often called a “lattice-grain” model. The time evolution is purely kinematical and is governed by an original two-stage, synchronous “request-exchange” mechanism. The transition rule follows a simple logic including three physical components: an external field, a se...

A discrete numerical method based on a cellular automaton may be considered for granular material modelling. First, this paper presents the basics of such a tool: space discretisation in a regular lattice, discrete time-evolution of the system by successive transitions. Then, the various kinematical or dynamical modelling performed for granular mat...

The paper is concerned with a family of tori (i.e. arrowhead and diamond) which we define on the triangular (or “hexavalent”) grid. Their related interconnection networks have several important advantages. They have a bounded valence and the highest allowed valence for a 2D regular grid. They are good hosts for embedding the normal grid. As hierarc...

A minimal routings scheme is presented that yields a shortest path between any source and destination node in a triangular (or hexavalent) grid. The simplicity of the protocol results from a preliminary statement of a hexagonal coordinate system that perfectly fits the symmetries of the grid. A shortest path routing is first stated for the infinite...

The «arrowhead torus» is a broadcast graph that we define on the 6-valent grid as a Cayley graph. A 3-port wormhole broadcasting protocol is derived first from construction, then improved by using edge-disjo- int forests. A store-and-forward broadcasting protocol is derived afterwards, then improved by mixing pipelining and arc-disjoint spanning tr...