Average consensus develops with multi-agent systems where consensus is a vital aspect in coordination and cooperation [5]. It is a linear iteration scheme where each node updates its value as a linear weighted combination of the values received from neighbors and its own. Consensus can be guaranteed by appropriately designing the weights used in the linear schemes. However, the characteristics ...

We propose a model coupling the classical opinion dynamics of the bounded confidence model, proposed by Deffuant et al., with an adaptive network forming community or group structure. At each step, an individual can decide if it changes groups or interact on its opinion with one of its internal or external neighbour. If it decides to look at the group level, it changes group if its opinion is f...

—Distributed average consensus is the main mechanism in algorithms for decentralized computation. In distributed average consensus algorithm each node has an initial state, and the goal is to compute the average of these initial states in every node. To accomplish this task, each node updates its state by a weighted average of its own and neighbors' states, by using local communication between ...

This paper considers the problem of dynamic average consensus algorithm design for a group of communicating agents. This problem consists of designing a distributed algorithm that enables a group of agents with communication and computation capabilities to use local interactions to track the average of locally time-varying reference signals at each agent. The objective of this article is to pro...

We present a formal model of a distributed consensus algorithm in the executable specification language Promela extended with a new type of guards, called counting guards, needed to implement transitions that depend on majority voting. Our formalization exploits abstractions that follow from reduction theorems applied to the specific case-study. We apply the model checker Spin to automatically ...