Lecture

Consensus Algorithms: Weight Assignment and Applications

In course

Irure voluptate ad incididunt id labore enim elit do non laboris. Ipsum commodo veniam sunt magna commodo occaecat anim ad officia. Pariatur elit irure dolor minim et enim proident proident qui nostrud commodo nulla tempor elit. Qui proident ipsum occaecat quis sunt laboris Lorem dolor incididunt officia.

Description

This lecture covers the design of graph weights to ensure consensus in networked control systems, including the Metropolis-Hasting model and the computation of weighted adjacency matrices. It also explores applications of consensus algorithms such as BLUE estimation in sensor networks and node counting.

Instructor

labore ipsum aliqua velit

Ex do occaecat consectetur quis ex deserunt nulla. Fugiat ullamco mollit id veniam ipsum. Id et officia ex laboris voluptate magna. Magna ea consectetur velit id laborum quis deserunt amet aliquip.

Official source

https://mediaspace.epfl.ch/media/0_acc148ry

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

Related lectures (32)