Lecture

Networked Control Systems: Consensus Algorithms in Digraphs

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

ME-427: Networked control systems

This course offers an introduction to control systems using communication networks for interfacing sensors, actuators, controllers, and processes. Challenges due to network non-idealities and opportunities offered by communication will be analyzed. ...

Description

This lecture by the instructor covers consensus algorithms in digraphs, focusing on the case where the digraph is not strongly connected. The main result from previous lectures is discussed, emphasizing the consensus algorithm's behavior with primitive and stochastic matrices. The lecture explores scenarios where the digraph is not strongly connected, providing examples like opinion dynamics with a single globally reachable node. The concept of powers of adjacency matrices is introduced, along with discussions on reducible digraphs and induced subgraphs. The lecture concludes with a proof regarding strongly connected components and globally reachable nodes in digraphs.

Instructor

Giancarlo Ferrari Trecate

Expertise Automatic control, Dependable control, Neural-network Control, Machine learning, Microgrids, Hybrid systems Mission See the webpage of the DECODE (Dependable Control and Decision) group. Teaching & PhD PhD Students Laura Meroi, Julien Pallage, Nicolas Léo Pierre Kirsch, Simone Baratto, Daniele Martinelli, Riccardo Cescon, Jakob Nylöf, Sabri El Amrani Past EPFL PhD Students Pulkit Nahata, Mustafa Sahin Turan, Baiwei Guo, Jean-Sébastien Brouillon, Clara Galimberti, Andrea Martin, Muhammad Zakwan,

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (32)

Adjacency matrix

In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph. In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected (i.e. all of its edges are bidirectional), the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory.

Adjacency list

In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each unordered list within an adjacency list describes the set of neighbors of a particular vertex in the graph. This is one of several commonly used representations of graphs for use in computer programs. An adjacency list representation for a graph associates each vertex in the graph with the collection of its neighbouring vertices or edges.

Induced subgraph

In the mathematical field of graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges (from the original graph) connecting pairs of vertices in that subset. Formally, let be any graph, and let be any subset of vertices of G. Then the induced subgraph is the graph whose vertex set is and whose edge set consists of all of the edges in that have both endpoints in . That is, for any two vertices , and are adjacent in if and only if they are adjacent in .

Logical matrix

A logical matrix, binary matrix, relation matrix, Boolean matrix, or (0, 1)-matrix is a matrix with entries from the Boolean domain B = {0, 1}. Such a matrix can be used to represent a binary relation between a pair of finite sets. It is an important tool in combinatorial mathematics and theoretical computer science.

Globalization

Globalization, or globalisation (Commonwealth English; see spelling differences), is the process of interaction and integration among people, companies, and governments worldwide. The term globalization first appeared in the early 20th century (supplanting an earlier French term mondialization), developed its current meaning some time in the second half of the 20th century, and came into popular use in the 1990s to describe the unprecedented international connectivity of the post-Cold War world.

Related lectures (64)

Consensus in Networked Control Systems

Explores consensus in networked control systems through graph weight design and matrix properties.

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Networked Control Systems: Properties and Connectivity

Explores properties of matrices, irreducibility, and graph connectivity in networked control systems.

Networked Control Systems: Strongly Connected Components and Condensation Digraphs

Explores strongly connected components and condensation digraphs in networked control systems, demonstrating their practical implications.

Laplacian Matrix: Properties and Examples