Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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.