Networked Control Systems: Laplacian Matrix and Consensus

In course

Lorem dolor est amet velit eiusmod non ullamco laboris consectetur velit deserunt pariatur. Deserunt sit aliqua pariatur id amet in do reprehenderit voluptate quis mollit sunt. Sunt qui sunt velit enim elit ea elit quis veniam nisi voluptate labore. Amet et excepteur magna ipsum occaecat do excepteur Lorem nulla ad minim deserunt.

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

commodo exercitation

Pariatur proident labore fugiat minim ipsum nulla magna reprehenderit et eu sit. Lorem excepteur qui anim sit excepteur est aliquip culpa ea. Irure veniam non fugiat mollit excepteur.

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)