相关论文: $\mathcal{H}_\infty$ Network Optimization for Edge…
Edge computing promises to offer low-latency and ubiquitous computation to numerous devices at the network edge. For delay-sensitive applications, link delays can have a direct impact on service quality. These delays can fluctuate…
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…
This paper studies a class of distributed online convex optimization problems for heterogeneous linear multi-agent systems. Agents in a network, knowing only their own outputs, need to minimize the time-varying costs through neighboring…
This paper considers the consensus performance improvement problem of networked general linear agents subject to external disturbances over Markovian randomly switching communication topologies. The consensus control laws can only use its…
This note considers the constrained H-infinity consensus of multi-agent networks with nonidentical constraint sets. An improved distributed algorithm is adopted and a nonlinear controlled output function is defined to evaluate the effect of…
Many phenomena in real world social networks are interpreted as spread of influence between activated and non-activated network elements. These phenomena are formulated by combinatorial graphs, where vertices represent the elements and…
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.…
Collaborative edge computing addresses the resource constraints of individual edge nodes by enabling resource sharing and task co-processing across multiple nodes. To fully leverage the advantages of collaborative edge computing, joint…
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…
In this paper, we consider the network utility maximization problem with various user priorities via jointly optimizing user association, load distribution and power control in a load-coupled heterogeneous network. In order to tackle the…
Suppose there is a spreading process such as an infectious disease propagating on a graph. How would we reduce the number of affected nodes in the spreading process? This question appears in recent studies about implementing mobility…
In this paper, an optimal consensus problem with local inequality constraints is studied for a network of single-integrator agents. The goal is that a group of single-integrator a gents rendezvous at the optimal point of the sum of local…
We consider cooperative multi-agent consensus optimization problems over an undirected network of agents, where only those agents connected by an edge can directly communicate. The objective is to minimize the sum of agent-specific…
This paper studies the problem of designing networks of nonidentical coupled oscillators in order to achieve a desired level of phase cohesiveness, defined as the maximum asymptotic phase difference across the edges of the network. In…
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…
In signed networks, each edge is labeled as either positive or negative. The edge sign captures the polarity of a relationship. Balance of signed networks is a well-studied property in graph theory. In a balanced (sub)graph, the vertices…
This paper investigates the distributed optimal output consensus problem of heterogeneous linear multi-agent systems over weight-unbalanced directed networks. A novel distributed continuous-time state feedback controller is proposed to…
We consider decentralized optimization problems where one aims to minimize a sum of convex smooth objective functions distributed between nodes in the network. The links in the network can change from time to time. For the setting when the…
This paper studies distributed edge weight synthesis of a cooperative system for a fixed topology to improve $H_{\infty}$ performance, considering that disturbances are injected at interconnection channels. This problem is cast into a…
This work addresses multi-agent consensus networks where adverse attackers affect the convergence performances of the protocol by manipulating the edge weights. We generalize (Fabris and Zelazo, 2022) and provide guarantees on the agents'…