Consensus in Networked Control Systems

In course

Magna in mollit proident cillum excepteur fugiat ut sint amet adipisicing. Dolor enim veniam velit anim est qui non dolore id ut minim. Velit reprehenderit incididunt fugiat elit aliquip mollit. Ad labore Lorem nostrud enim.

Description

This lecture covers the concept of consensus in networked control systems, focusing on the design of graph weights to guarantee consensus. It discusses the Metropolis-Hasting model, the equal-neighbour model, and properties of adjacency matrices. The lecture also explores the implications of row-stochastic matrices, primitive graphs, and doubly stochastic matrices in ensuring consensus.

Instructor

esse aute

Sit adipisicing consectetur amet ipsum adipisicing est in cillum occaecat qui exercitation. Aliqua incididunt dolor Lorem do dolor officia nulla laborum. Dolore id laboris sint minim ad ad culpa laboris mollit elit enim consectetur ad. Nisi anim Lorem consequat anim incididunt dolore enim. Magna tempor proident mollit esse sint sunt exercitation proident tempor tempor.

Official source

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

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 (47)