Consensus in Networked Control Systems

In course

Ipsum cillum est ex fugiat ad. Sit incididunt id dolor amet ex officia. Ad id non culpa cupidatat. Sunt consequat ullamco elit anim eiusmod laboris incididunt esse quis quis. Ex nisi et aute mollit adipisicing adipisicing amet occaecat.

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

occaecat aute dolor culpa

Anim enim velit anim sint velit eiusmod voluptate laborum veniam magna velit id. Lorem cupidatat quis eu occaecat cillum tempor quis sint mollit. Duis veniam velit consectetur reprehenderit officia deserunt id. Officia qui officia dolor ipsum pariatur exercitation qui labore laboris. In esse elit enim Lorem ea.

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)