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 Laplacian flow and consensus on communication networks with a globally reachable node, illustrated through examples. It delves into the analysis of x = -Lx, equilibria, and theorems related to achieving consensus in networked control systems.