Brief paper: Discrete-time dynamic average consensus

Authors:
Minghui Zhu;Sonia Martínez
Affiliations:
Department of Mechanical and Aerospace Engineering, University of California, San Diego, 9500 Gilman Dr, La Jolla CA, 92093-0411, USA;Department of Mechanical and Aerospace Engineering, University of California, San Diego, 9500 Gilman Dr, La Jolla CA, 92093-0411, USA
Venue:
Automatica (Journal of IFAC)
Year:
2010

Citing 8
Cited 5

Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
Load Balancing in Parallel Computers: Theory and Practice

Load Balancing in Parallel Computers: Theory and Practice
Parallel and Distributed Computation: Numerical Methods

Parallel and Distributed Computation: Numerical Methods
Quantized consensus

Automatica (Journal of IFAC)
Asynchronous distributed averaging on communication networks

IEEE/ACM Transactions on Networking (TON)
Convergence Speed in Distributed Consensus and Averaging

SIAM Journal on Control and Optimization
Randomized gossip algorithms

IEEE Transactions on Information Theory
Consensus Propagation

IEEE Transactions on Information Theory

Brief paper: A hyperparameter consensus method for agreement under uncertainty

Automatica (Journal of IFAC)
Distributed consensus filtering for discrete-time nonlinear systems with non-Gaussian noise

Signal Processing
Dynamic average consensus via nonlinear protocols

Automatica (Journal of IFAC)
Finite-time consensus for multi-agent systems via nonlinear control protocols

International Journal of Automation and Computing
On distributed constrained formation control in operator-vehicle adversarial networks

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.15

Visualization

Abstract

We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely on the input-to-output stability properties of static average consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set of reference inputs is that the maximum relative deviation between the nth-order differences of any two reference inputs be bounded for some integer n=1.