Accelerating distributed average consensus by exploring the information of second-order neighbors

DOI10.1016/J.PHYSLETA.2010.03.053MaRDI QIDQ415068zbMATH OpenOpenAlexFDO

Authors Deming Yuan, Shengyuan Xu, Huanyu Zhao, Yu-Ming Chu

Publication date 11 May 2012

Published in Physics Letters. A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physleta.2010.03.053

zbMATH Keywords

convex optimizationaverage consensussecond-order neighbors

Mathematics Subject Classification ID

Measurement theory in the social and behavioral sciences (91C05) Social networks; opinion dynamics (91D30) Estimation and detection in stochastic control theory (93E10) Optimal stochastic control (93E20) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Accelerating average consensus by using the information of second-order neighbours with communication delays
• Optimal tradeoff between instantaneous and delayed neighbor information in consensus algorithms
• Fast linear iterations for distributed averaging
• Convergence speed in distributed consensus and averaging
• Convergence speed in distributed consensus and averaging

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Accelerated Distributed Average Consensus via Localized Node State Prediction
• Consensus problem in directed networks of multi-agents via nonlinear protocols
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Fast linear iterations for distributed averaging
• Fastest Mixing Markov Chain on a Graph
• Matrix Analysis
• Multi-vehicle consensus with a time-varying reference state
• Polynomial Filtering for Fast Convergence in Distributed Consensus
• Sensor Networks With Random Links: Topology Design for Distributed Consensus
• The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem

Cited in

(14)

• Consensus of second-order multi-agent systems with nonlinear dynamics via edge-based distributed adaptive protocols
• Second-order consensus in multi-agent systems based on second-order neighbours’ information
• Accelerating average consensus by using the information of second-order neighbours with communication delays
• Event-triggered control for multiagent systems with the problem of packet losses and communication delays when using the second-order neighbors' information
• Accelerating the convergence rate of consensus for second-order multi-agent systems by memory information
• Consensus of identical linear systems with communication delays by using the information of second-order neighbors
• Consensus of general linear multi-agent systems based on second-order neighbours' information: directed topology case
• Optimal tradeoff between instantaneous and delayed neighbor information in consensus algorithms
• Average consensus in multiagent systems with the problem of packet losses when using the second-order neighbors' information
• Consensus of linear multi-agent systems with communication delays by using the information of second-order neighbours under intermittent communication topology
• Adaptive guaranteed-performance consensus control for multi-agent systems with an adjustable convergence speed
• Accelerated consensus to accurate average in multi-agent networks via state prediction
• Distributed accelerating of quantized second-order consensus with bounded input
• Fault tolerant consensus of multi-agent systems with linear dynamics

This page was built for publication: Accelerating distributed average consensus by exploring the information of second-order neighbors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415068)