Related papers: $\mathcal{H}_2$ performance of series-parallel net…
Series-parallel networks are a class of graphs on which many NP-hard problems have tractable solutions. In this paper, we examine performance measures on leader-follower consensus on series-parallel networks. We show that a distributed…
In this paper, we consider the $\mathcal{H}_2$-norm of networked systems with multi-time scale consensus dynamics and vector-valued agent states. This allows us to explore how measurement and process noise affect consensus on…
This paper examines the $\mathcal{H}_\infty$ performance problem of the edge agreement protocol for networks of agents operating on independent time scales, connected by weighted edges, and corrupted by exogenous disturbances.…
In this paper we consider the $\mathcal{H}_2$-norm of networked systems with multi-time scale consensus dynamics. We develop a general framework for such systems that allows for edge weighting, independent agent-based time scales, as well…
This paper addresses the energy accumulation problem, in terms of the $H_2$ norm, of linearly coupled dynamical networks. An interesting outer-coupling relationship is constructed, under which the $H_2$ norm of the newly constructed network…
In this paper, the synchronizability problem of dynamical networks is addressed, where better synchronizability means that the network synchronizes faster with lower-overshoot. The L2 norm of the error vector e is taken as a performance…
We study an optimal control problem aimed at achieving a desired tradeoff between the network coherence and communication requirements in the distributed controller. Our objective is to add a certain number of edges to an undirected…
This paper proposes model reduction approaches for consensus network systems based on a given clustering of the underlying graph. Namely, given a consensus network system of time-scaled agents evolving over a weighted undirected graph and a…
We propose an axiomatic approach for design and performance analysis of noisy linear consensus networks by introducing a notion of systemic performance measure. This class of measures are spectral functions of Laplacian eigenvalues of the…
We consider how to connect a set of disjoint networks to optimize the performance of the resulting composite network. We quantify this performance by the coherence of the composite network, which is defined by an $H_2$ norm of the system.…
We analyze performance of a class of time-delay first-order consensus networks from a graph topological perspective and present methods to improve it. The performance is measured by network's square of H-2 norm and it is shown that it is a…
We develop some basic principles for the design and robustness analysis of a continuous-time bilinear dynamical network, where an attacker can manipulate the strength of the interconnections/edges between some of the agents/nodes. We…
This paper studies reduced-order modeling of dynamic networks with strongly connected topology. Given a graph clustering of an original complex network, we construct a quotient graph with less number of vertices, where the edge weights are…
We consider the problem of robustness in large consensus networks that occur in many areas such as distributed optimization. Robustness, in this context, is the scaling of performance measures, e.g. H2-norm, as a function of network…
Based on stochastic differential equations (SDEs), we analyse the overall performance of heterogeneous power systems network, subject to spatially distributed and correlated noise with random initial conditions. We determine bounds on the…
Our goal is to analyze performance of stable linear dynamical networks subject to external stochastic disturbances. The square of the $\mathcal H_2$-norm of the network is used as a performance measure to quantify the expected steady-state…
This paper investigates the performance of networked control systems subject to multiplicative routing transformations that alter measurement pathways without directly injecting signals. Such transformations, arising from faults or…
Realistic networks display not only a complex topological structure, but also a heterogeneous distribution of weights in the connection strengths. Here we study synchronization in weighted complex networks and show that the…
In this paper, randomized gossip-type matrix-weighted consensus algorithms are proposed for both leaderless and leader-follower topologies. First, we introduce the notion of expected matrix-weighted network, which captures the…
We study a graph-theoretic approach to the $\mathcal{H}_{\infty}$ performance of leader following consensus dynamics on directed and undirected graphs. We first provide graph-theoretic bounds on the system $\mathcal{H}_{\infty}$ norm of the…