相关论文: $\mathcal{H}_\infty$ Network Optimization for Edge…
We study performance limits of solutions to utility maximization problems (e.g., max-min problems) in wireless networks as a function of the power budget $\bar{p}$ available to transmitters. Special focus is devoted to the utility and the…
In this paper, we study a model reduction technique for leader-follower networked multi-agent systems defined on weighted, undirected graphs with arbitrary linear multivariable agent dynamics. In the network graph of this network, nodes…
We develop an edge-assisted object recognition system with the aim of studying the system-level trade-offs between end-to-end latency and object recognition accuracy. We focus on developing techniques that optimize the transmission delay of…
The edge removal problem studies the loss in network coding rates that results when a network communication edge is removed from a given network. It is known, for example, that in networks restricted to linear coding schemes and networks…
Adaptive guaranteed-performance consensus control problems for multi-agent systems are investigated, where the adjustable convergence speed is discussed. This paper firstly proposes a novel adaptive guaranteed-performance consensus…
We consider network-based decentralized optimization problems, where each node in the network possesses a local function and the objective is to collectively attain a consensus solution that minimizes the sum of all the local functions. A…
We consider cooperative multi-agent consensus optimization problems over both static and time-varying communication networks, where only local communications are allowed. The objective is to minimize the sum of agent-specific possibly…
A problem of reconstruction of the topology and the respective edge resistance values of an unknown circular planar passive resistive network using limitedly available resistance distance measurements is considered. We develop a multistage…
This paper considers a problem of output agreement in heterogeneous networks with dynamics on the nodes as well as on the edges. The control and disturbance signals entering the nodal dynamics are "unmatched" meaning that some nodes are…
In this paper we study maximum size and minimum weight planar matchings of inhomogenous random bipartite graphs. Our motivation for this study comes from efficient usage of cross edges in relay networks for overall improvement in network…
This paper considers a cross-layer optimization problem driven by multi-timescale stochastic exogenous processes in wireless communication networks. Due to the hierarchical information structure in a wireless network, a mixed timescale…
This paper studies output synchronization problems for heterogeneous networks of continuous- or discrete-time right-invertible linear agents in presence of unknown, non-uniform and arbitrarily large input delay based on localized…
The function or performance of a network is strongly dependent on its robustness, quantifying the ability of the network to continue functioning under perturbations. While a wide variety of robustness metrics have been proposed, they have…
In this work, an adaptive edge element method is developed for an H(curl)-elliptic constrained optimal control problem. We use the lowest-order Nedelec's edge elements of first family and the piecewise (element-wise) constant functions to…
The paper considers a distributed robust estimation problem over a network with directed topology involving continuous time observers. While measurements are available to the observers continuously, the nodes interact according to a…
In this work we study a distributed optimal output consensus problem for heterogeneous linear multi-agent systems where the agents aim to reach consensus with the purpose of minimizing the sum of private convex costs. Based on output…
In this paper, we study a model of network adaptation mechanism to control spreading processes over switching contact networks, called adaptive susceptible-infected-susceptible model. The edges in the network model are randomly removed or…
A popular approach to model interactions is to represent them as a network with nodes being the agents and the interactions being the edges. Interactions are often timestamped, which leads to having timestamped edges. Many real-world…
In this paper, we study the robust consensus problem for a set of discrete-time linear agents to coordinate over an uncertain communication network, which is to achieve consensus against the transmission errors and noises resulted from the…
In this paper, we investigate asymptotic properties of a consensus protocol taking place in a class of temporal (i.e., time-varying) networks called the activity driven network. We first show that a standard methodology provides us with an…