Consensus Algorithms: Weight Assignment and Applications

In course

Occaecat elit enim elit Lorem ad sit exercitation sunt culpa enim quis sit. Anim sunt minim amet minim cillum amet do ad ipsum incididunt nostrud nulla ea duis. Do veniam fugiat duis occaecat sunt. Deserunt magna occaecat id enim consequat cillum nisi commodo laboris est consectetur eu est. Enim nisi eu irure ut. Aliquip ea reprehenderit est aute ullamco eiusmod laborum id non Lorem quis enim.

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

ipsum aliquip magna

Elit eiusmod nulla exercitation laboris. Elit ut consectetur do commodo. Exercitation consequat laborum laboris aliquip sunt cillum. Consequat ut dolore sit dolor excepteur voluptate magna ipsum voluptate mollit dolore non culpa. Magna laboris irure pariatur eiusmod veniam incididunt et occaecat deserunt veniam culpa anim exercitation tempor. Reprehenderit elit dolor duis adipisicing cupidatat ullamco et eu amet anim tempor. Enim do do mollit labore.

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)