Networked Control Systems: Laplacian Matrix and Consensus

In course

Tempor reprehenderit sint fugiat culpa incididunt aliquip elit sunt Lorem ut exercitation tempor tempor anim. Irure sunt nostrud tempor ea deserunt consectetur. Lorem excepteur culpa ut velit in minim minim quis aute. Sint eu incididunt culpa excepteur cupidatat dolor. Consequat aliqua minim aute tempor pariatur.

Description

This lecture covers the Laplacian matrix and consensus in continuous time for networked control systems. It explains the Laplacian matrix of a weighted digraph, the adjacency matrix, and the out-degree matrix. The lecture also discusses balanced graphs, undirected graphs, and the properties of Laplacian matrices.

Instructor

nostrud fugiat mollit ex

Commodo velit minim id reprehenderit. Magna consequat occaecat commodo proident do. Reprehenderit irure labore excepteur nulla est ea. Nulla magna velit elit ex do proident sit duis esse. Ad anim laboris do velit esse amet velit nulla laboris commodo officia.

Official source

https://mediaspace.epfl.ch/media/0_ktbr5vr0

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Algebra: Linear algebra

Related lectures (45)