Consensus protocols for networks of dynamic agents
California Institute of Technology
Abstract
In this paper, we introduce linear and nonlinear consensus protocols for networks of dynamic agents that allow the \nagents to agree in a distributed and cooperative fashion. \nWe consider the cases of networks with communication time-delays and channels that have filtering effects. \nWe find a tight upper bound on the maximum fixed time-delay \nthat can be tolerated in the network. It turns out that the \nconnectivity of the network is the key in reaching a \nconsensus. The case of agreement with bounded inputs is \nconsidered by analyzing the convergence of a class of nonlinear protocols. A Lyapunov function is introduced that \nquantifies the total disagreement among…
Citation impact
- FWCI
- 26.44
- Percentile
- 100%
- References
- 11
Authors
2Topics & keywords
- Computer science
- Bounded function
- Convergence (economics)
- Upper and lower bounds
- Nonlinear system
- Consensus
- Lyapunov function
- Key (lock)