Abstract
This article addresses the design of a dynamic average consensus (DAC) algorithm over strongly connected but may not necessarily balanced digraphs, which seems to be the first time in the literature. Specifically, a new concept of integral surplus is proposed for DAC problems. On this basis, an integral surplus DAC algorithm is developed for agents to track the average of their multiple dynamic input signals with a bounded steady-state error. Such error is tunable by some algorithm parameters and even vanishes for special classes of input signals. Simulation examples are presented to verify the theoretical results. © 1963-2012 IEEE.
| Original language | English |
|---|---|
| Pages (from-to) | 8329-8336 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 70 |
| Issue number | 12 |
| Online published | 30 Jun 2025 |
| DOIs | |
| Publication status | Published - Dec 2025 |
Funding
This work was supported in part by the National Natural Science Foundation of China through Grant No. 62422315, and in part by the Natural Science Basic Research Program of Shaanxi through Grant No. 2025JC-YBMS-667. (Corresponding author: Yongfang Liu) Runhua Cao, Yongfang Liu and Yu Zhao are with the School of Automation, Northwestern Polytechnical University, Xi’an 710129, China. (e-mail: [email protected]; [email protected]; [email protected]).
Research Keywords
- Dynamic average consensus
- integral surplus
- multi-agent system
- strongly connected digraph
- Dynamic average consensus (DAC)
- multiagent system
Fingerprint
Dive into the research topics of 'Dynamic Average Consensus over Strongly Connected Digraphs Based on Integral Surplus'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver