Sparse solutions to the average consensus problem via l1-norm regularization of the fastest mixing Markov-chain problem

2014 ◽  
Author(s):  
Giorgio Gnecco ◽  
Rita Morisi ◽  
Alberto Bemporad
Keyword(s):  
Markov Chain ◽  
Consensus Problem ◽  
Average Consensus ◽  
Sparse Solutions ◽  
Chain Problem

scholarly journals Nonlinear Consensus Protocol Modified from Doubly Stochastic Quadratic Operators in Networks of Dynamic Agents

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1519 ◽  
Author(s):  
Rawad Abdulghafor ◽  
Sultan Almotairi ◽  
Hamad Almohamedh ◽  
Sherzod Turaev ◽  
Badr Almutairi
Keyword(s):  
Theoretical Analysis ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Agent Systems ◽  
Doubly Stochastic ◽  
Average Consensus ◽  
Multi Agent ◽  
Mathematical Equations ◽  
Simulation Results

This article explores nonlinear convergence to limit the effects of the consensus problem that usually occurs in multi-agent systems. Most of the existing research essentially considers the outline of linear protocols, using complex mathematical equations in various orders. In this work, however, we designed and developed an alternative nonlinear protocol based on simple and effective mathematical approaches. The designed protocol in this sense was modified from the Doubly Stochastic Quadratic Operators (DSQO) and was aimed at resolving consensus problems. Therefore, we called it Modified Doubly Stochastic Quadratic Operators (MDSQO). The protocol was derived in the context of coordinated systems to overcome the consensus issue related to multi-agent systems. In the process, we proved that by using the proposed nonlinear protocol, the consensus could be reached via a common agreement among the agents (average consensus) in a fast and easy fashion without losing any initial status. Moreover, the investigated nonlinear protocol of MDSQO realized the reaching consensus always as well as DSQO in some cases, which could not reach consensus. Finally, simulation results were given to prove the validity of the theoretical analysis.

scholarly journals Adaptive Consensus of Distributed Varying Scale Wireless Sensor Networks under Tolerable Jamming Attacks

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Jinping Mou
Keyword(s):  
Wireless Sensor Networks ◽  
Dwell Time ◽  
Lyapunov Method ◽  
Wireless Sensor ◽  
Consensus Problem ◽  
Consensus Protocol ◽  
Jamming Attacks ◽  
Jamming Attack ◽  
Average Consensus ◽  
The Given

Consensus problem is investigated for a varying scale wireless sensor network (VSWSN) under tolerable jamming attacks, where the scale of the network is increasing or decreasing due to the newly joined nodes or the removed nodes, respectively; the tolerable jamming attack means that the attack strength is limited. It supposes that during the communications, all nodes may encounter with the tolerable jamming attacks; when the attack power is larger than the given value, the attacked nodes fall asleep, or otherwise the nodes are awakened. Under the sleep method, based on the Lyapunov method, it shows that if the communicating graph is the global limited intersectional connection (GLI connection) and the system has the enough dwell time in the intersectional topology, then under the designed consensus protocol, all nodes achieve the global average consensus.

scholarly journals Optimal strategies in the average consensus problem

2009 ◽  
Vol 58 (10-11) ◽  
pp. 759-765 ◽  
Author(s):  
Jean-Charles Delvenne ◽  
Ruggero Carli ◽  
Sandro Zampieri
Keyword(s):  
Optimal Strategies ◽  
Consensus Problem ◽  
Average Consensus

Towards consensus: some convergence theorems on repeated averaging

1977 ◽  
Vol 14 (01) ◽  
pp. 89-97 ◽  
Author(s):  
S. Chatterjee ◽  
E. Seneta
Keyword(s):  
Markov Chain ◽  
Consensus Problem ◽  
Stochastic Matrices ◽  
Convergence Theorems ◽  
Strong Ergodicity ◽  
Markov Chain Theory ◽  
Inhomogeneous Markov Chain ◽  
Chain Theory ◽  
Equivalent Conditions

The problem of tendency to consensus in an information-exchanging operation is connected with the ergodicity problem for backwards products of stochastic matrices. For such products, weak and strong ergodicity, defined analogously to these concepts for forward products of inhomogeneous Markov chain theory, are shown (in contrast to that theory) to be equivalent. Conditions for ergodicity are derived and their relation to the consensus problem is considered.

scholarly journals A Practical Framework for the Analysis of Average Consensus Problem: Laplacian Generator and Analyzer Algorithm

2016 ◽  
Vol 49 (3) ◽  
pp. 341-346
Author(s):  
Mustafa Saraoğlu ◽  
Aydın Polat ◽  
İlhan Mutlu ◽  
Mehmet Turan Söylemez
Keyword(s):  
Consensus Problem ◽  
Average Consensus
Sign in / Sign up

Export Citation Format

Share Document