相关论文: Optimization of the $H_\infty$-norm of Dynamic Flo…

In this paper, we consider the robustness of a basic model of a dynamical distribution network. In the first problem, i.e., optimal weight allocation, we minimize the H-inf- norm of the dynamical distribution network subject to allocation…

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.…

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…

We present a suboptimal control design algorithm for a family of continuous-time parameter-dependent linear systems that are composed of interconnected subsystems. We are interested in designing the controller for each subsystem such that…

The paper considers a distributed robust estimation problem over a network with Markovian randomly varying topology. The objective is to deal with network variations locally, by switching observer gains at affected nodes only. We propose…

We propose a linear programming (LP) framework for steady-state diffusion and flux optimization on geometric networks. The state variable satisfies a discrete diffusion law on a weighted, oriented graph, where conductances are scaled by…

This paper studies the vulnerability of flow networks against adversarial attacks. In particular, consider a power system (or, any system carrying a physical flow) consisting of $N$ transmission lines with initial loads $L_1, \ldots , L_N$…

Power minimisation in branched fluidic networks has gained significant attention in biology and engineering. The optimal network is defined by channel radii that minimise the sum of viscous dissipation and the volumetric energetic cost of…

This paper investigates the H2 and H-infinity suboptimal distributed filtering problems for continuous time linear systems. Consider a linear system monitored by a number of filters, where each of the filters receives only part of the…

In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main…

We suggest a global perspective on dynamic network flow problems that takes advantage of the similarities to port-Hamiltonian dynamics. Dynamic minimum cost flow problems are formulated as open-loop optimal control problems for general…

We consider network structures that optimize the $\mathcal{H}_2$ norm of weighted, time scaled consensus networks, under a minimal representation of such consensus networks described by the edge Laplacian. We show that a greedy algorithm…

We investigate the vulnerabilities of consensus-based distributed optimization protocols to nodes that deviate from the prescribed update rule (e.g., due to failures or adversarial attacks). We first characterize certain fundamental…

In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport…

We consider a basic model of a dynamical distribution network, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…

In this paper, we propose an improved method for computing the $\mathcal{H}_\infty$ norm of linear dynamical systems that results in a code that is often several times faster than existing methods. By using standard optimization tools to…

We investigate how the underlying graph of a network supports a flow between a source node and a destination node and propose to compute the expected number of nodes and links that contribute to transferring items in random graphs. Since…

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…

Even though power-law or close-to-power-law degree distributions are ubiquitously observed in a great variety of large real networks, the mathematically satisfactory treatment of random power-law graphs satisfying basic statistical…

This paper studies a basic model of a dynamical distribution network, where the network topology is given by a directed graph with storage variables corresponding to the vertices and flow inputs corresponding to the edges. We aim at…