Chapter 5: Performance of consensus algorithms
Abstract
In this chapter, we study the basic averaging dynamics, consensus dynamics, on a fixed network and show under suitable assumptions that it brings the states associated with the nodes to converge to the same value. Follow it introduces the rendezvous problem, which serves us as the main motivation to seek consensus, and states the main results.
Then we deal with the problem of leader following consensus under a directed communication topology for a class of discrete-time multiagent systems with large delay sequences (LDSs). We analyze the consensus problem with two different types of time-varying delays and construct new Lyapunov functionals. By imposing some constraints on the length and frequency ...
Get Discrete Networked Dynamic Systems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
