Optimal Dynamic Average Consensus of Multi-Agent Systems

摘要

This paper studies the average tracking problem on the premise of networked systems where each node is only allowed to interact with its neighbours. To this end, new dynamic average consensus protocols for both continuous-time and discrete time systems are proposed, and the corresponding analysis provides the rules on the optimal settings of the proposed algorithm with respect to convergence rate and steady-state performance. Numerical simulations validate the theoretical contributions of this work.