Consensus with GR Nodes

In course

Labore reprehenderit dolor incididunt pariatur esse id. Dolore eiusmod esse excepteur aliquip anim laboris sunt cupidatat. Labore nostrud tempor dolore occaecat ea sint. Voluptate aute do proident elit quis officia incididunt mollit. Cillum exercitation veniam ut aliqua incididunt consequat labore laboris adipisicing ut. Quis eu nisi magna amet nisi irure nisi ad deserunt. Cupidatat quis mollit velit culpa nostrud do.

Description

This lecture covers the topic of consensus with GR nodes in networked control systems. The instructor explains the concept of condensation digraphs, properties of C(G), and the main result related to consensus with GR nodes. The lecture delves into the theorem stating the conditions under which a digraph with row-stochastic adjacency matrix A achieves consensus. Various examples and remarks are provided to illustrate the theoretical concepts discussed.

Instructor

occaecat non consectetur irure

Nulla incididunt mollit duis consectetur incididunt elit reprehenderit sunt ut dolore ea cillum ut dolor. Laborum commodo occaecat qui velit sunt elit dolore. Dolor in non irure cupidatat proident adipisicing irure do. Adipisicing aute aliquip fugiat laboris. Tempor do qui dolor minim do eiusmod.

Official source

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

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)