Papers
Topics
Authors
Recent
Search
2000 character limit reached

Single-Integrator Consensus Dynamics over Minimally Reactive Networks

Published 12 Jun 2023 in eess.SY and cs.SY | (2306.06839v1)

Abstract: The problem of achieving consensus in a network of connected systems arises in many science and engineering applications. In contrast to previous works, we focus on the system reactivity, i.e., the initial amplification of the norm of the system states. We identify a class of networks that we call minimally reactive, which are such that the indegree and the outdegree of each node of the network are the same. We propose several optimization procedures in which minimum perturbations (links or link weights) are imposed on a given network topology to make it minimally reactive. A new concept of structural reactivity is introduced which measures how much a given network is far from becoming minimally reactive by link perturbations. The structural reactivity of directed random graphs is studied.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.