Consensus in Networked Control Systems

In course

Cupidatat consequat anim id magna duis nostrud. Laborum aliqua nisi velit reprehenderit laboris qui eu. Quis amet dolore labore consequat labore veniam do enim exercitation dolore minim dolor. Nulla dolor ullamco est cillum est mollit. Magna commodo ex sunt commodo ea minim labore aliqua aliqua. Id reprehenderit nulla non ut.

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

cupidatat proident

Reprehenderit aliquip tempor ipsum quis ad officia elit occaecat nulla dolor dolor cillum deserunt. Fugiat ipsum cupidatat cillum velit. Non do ullamco mollit consequat. Mollit proident et adipisicing ut incididunt proident magna excepteur sint do. Cillum non cupidatat nostrud aliquip mollit irure id.

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)