Chapter 3: Consensus of systems over graphs
Abstract
In this chapter, we treat different consensus problems for distributed/multiagent systems over graphs. We begin by shedding light on issues pertaining to the consensus problems for distributed/multiagent systems described over graphs. Next, we study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed (i.i.d.), directed random graphs, where each agent can communicate with any other agent with some exogenously specified probability. While different aspects of consensus algorithms over random switching networks have been widely studied, a complete characterization ...
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.
