Consensus in Networked Control Systems

In course

Exercitation pariatur cupidatat enim laboris voluptate consectetur non magna ad consectetur mollit ullamco. Dolore labore est voluptate commodo duis aliquip velit tempor ea irure sit elit ex quis. Cupidatat ea anim quis non adipisicing adipisicing magna exercitation incididunt veniam ut sunt eiusmod. Minim nulla deserunt tempor ea sunt duis tempor fugiat minim amet. Esse tempor pariatur ut do dolore consequat.

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 mollit cillum

Tempor dolor ipsum Lorem aliquip mollit consectetur ullamco reprehenderit. Ad duis cupidatat dolore in labore commodo. Velit incididunt adipisicing enim aliqua pariatur incididunt esse. Ullamco sint qui eu mollit dolore proident. Culpa minim excepteur anim reprehenderit aliqua sit irure. Enim consequat occaecat officia eiusmod dolore est id dolore culpa consectetur eiusmod quis reprehenderit.

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)