Lecture
Distributed Computation: Consensus Algorithms in Networked Control Systems
In course
DEMO: aliquip consectetur sit
Esse sunt excepteur nulla duis sint enim quis. Esse incididunt Lorem veniam tempor officia Lorem esse aliqua esse sunt aute ex ut. Veniam et incididunt dolor dolore anim nisi sit dolor officia. Nostrud commodo non laboris nostrud eu aliquip amet magna id veniam eu reprehenderit. Veniam reprehenderit non dolor exercitation voluptate aliqua. Proident pariatur magna aute ipsum eiusmod proident ea ipsum duis aliqua sit minim.
Description
This lecture covers the application of consensus algorithms in networked control systems, focusing on topics such as Metropolis-Hasting models, weighted adjacency matrices, node counting, and distributed computation of Least-Squares regression. The instructor explains how to compute BLUE in a distributed way, the consensus on vector-valued and matrix-valued quantities, and the distributed computation of LS regression. The lecture also delves into the explicit formulas for LS, the goal of making each node compute LS with a distributed algorithm, and the time-varying consensus algorithms' robustness to changes in graph topology, lossy communication, transmission delays, and quantization.
Instructor
aliquip sunt veniam
Mollit sunt est adipisicing ullamco voluptate nisi in sint irure. Consectetur laborum ullamco voluptate elit labore minim proident officia exercitation ea velit consectetur. Enim ullamco velit nostrud laboris incididunt. Dolor id sit Lorem anim cillum sit excepteur ipsum reprehenderit aute nulla. Dolore tempor exercitation ex anim nostrud tempor incididunt elit cupidatat pariatur labore. Consequat veniam adipisicing sit ipsum dolor nulla.
Official source
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
Related lectures (38)
Distributed Algorithms for Networked Control Systems
Explores distributed algorithms for networked control systems, covering consensus, least-squares regression, and time-varying communication networks.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Counterfactuals: SEM and D-Separation
Explores counterfactuals in SEMs and D-Separation in graphical models.
Networked Control Systems: Opportunities
Explores coordination in networked control systems, graph theory, and consensus algorithms.
Epidemic Spreading Models
Covers classical models of epidemic spreading and dynamics on networks with examples.