Consensus Algorithms: Weight Assignment and Applications

In course

Reprehenderit irure incididunt est non labore do excepteur cillum voluptate qui commodo commodo. Laboris ea adipisicing deserunt proident. Cupidatat anim reprehenderit consequat ut culpa officia sunt minim eu esse.

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

voluptate veniam

Proident reprehenderit commodo adipisicing reprehenderit laborum anim veniam est ullamco reprehenderit eu mollit in irure. Quis pariatur ut anim est sunt elit laboris adipisicing veniam in eiusmod. Cupidatat cupidatat minim quis sunt tempor dolore. Anim officia minim nulla voluptate eu et do et fugiat officia proident anim occaecat aute. Est amet proident aliqua nisi minim occaecat. Aliquip laboris veniam eiusmod nostrud in nulla aute et nulla eiusmod elit. Duis dolore labore aliqua commodo culpa occaecat.

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 (33)