scholarly journals Optimal strategies in the average consensus problem

Author(s):  
Jean-Charles Delvenne ◽  
Ruggero Carli ◽  
Sandro Zampieri
2009 ◽  
Vol 58 (10-11) ◽  
pp. 759-765 ◽  
Author(s):  
Jean-Charles Delvenne ◽  
Ruggero Carli ◽  
Sandro Zampieri

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1519 ◽  
Author(s):  
Rawad Abdulghafor ◽  
Sultan Almotairi ◽  
Hamad Almohamedh ◽  
Sherzod Turaev ◽  
Badr Almutairi

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.


2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Jinping Mou

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.


2016 ◽  
Vol 49 (3) ◽  
pp. 341-346
Author(s):  
Mustafa Saraoğlu ◽  
Aydın Polat ◽  
İlhan Mutlu ◽  
Mehmet Turan Söylemez

2014 ◽  
Vol 25 (6) ◽  
pp. 1056-1064 ◽  
Author(s):  
Wenhui Liu ◽  
Feiqi Deng ◽  
Jiarong Liang ◽  
Xuekui Yan

Sign in / Sign up

Export Citation Format

Share Document