Related papers: Distributed Localization in Dynamic Networks via C…
We consider the problem of solving a smooth convex optimization problem with equality and inequality constraints in a distributed fashion. Assuming that we have a group of agents available capable of communicating over a communication…
This work studies the problem of distributed optimization in heterogeneous linear multi-agent systems. Instead of relying on a perfect communication network as in many existing distributed optimization approaches, we considered two…
In large-scale systems there are fundamental challenges when centralised techniques are used for task allocation. The number of interactions is limited by resource constraints such as on computation, storage, and network communication. We…
Though commonly found in the real world, directed networks have received relatively less attention from the literature in which concerns their topological and dynamical characteristics. In this work, we develop a magnetic Laplacian-based…
The paper addresses large-scale, convex optimization problems that need to be solved in a distributed way by agents communicating according to a random time-varying graph. Specifically, the goal of the network is to minimize the sum of…
We study phenomena where some eigenvectors of a graph Laplacian are largely confined in small subsets of the graph. These localization phenomena are similar to those generally termed Anderson Localization in the Physics literature, and are…
This paper aims at addressing distributed averaging problems for signed networks in the presence of general directed topologies that are represented by signed digraphs. A new class of improved Laplacian potential functions is proposed by…
The study of dynamical systems on networks, describing complex interactive processes, provides insight into how network structure affects global behaviour. Yet many methods for network dynamics fail to cope with large or partially-known…
A number of prototypical optimization problems in multi-agent systems (e.g., task allocation and network load-sharing) exhibit a highly local structure: that is, each agent's decision variables are only directly coupled to few other agent's…
In this paper, we study the problem of distributed multi-agent optimization over a network, where each agent possesses a local cost function that is smooth and strongly convex. The global objective is to find a common solution that…
This paper considers a distributed convex optimization problem over a time-varying multi-agent network, where each agent has its own decision variables that should be set so as to minimize its individual objective subject to local…
In this paper, a distributed velocity-constrained consensus problem is studied for discrete-time multi-agent systems, where each agent's velocity is constrained to lie in a nonconvex set. A distributed constrained control algorithm is…
This paper addresses the leader-follower flocking problem with a moving leader for networked Lagrange systems with parametric uncertainties under a proximity graph. Here a group of followers move cohesively with the moving leader to…
Motivated by recent development in networking and parallel data-processing, we consider a distributed and localized finite-sum (or fixed-sum) allocation technique to solve resource-constrained convex optimization problems over multi-agent…
We consider a registration-based approach for localizing sensor networks from range measurements. This is based on the assumption that one can find overlapping cliques spanning the network. That is, for each sensor, one can identify…
Complex-valued Laplacians have been shown to be powerful tools in the study of distributed coordination of multi-agent systems in the plane including formation shape control problems and set surrounding control problems. In this paper, we…
In this paper, a multi-agent coordination problem with steady-state regulation constraints is investigated for a class of nonlinear systems. Unlike existing leader-following coordination formulations, the reference signal is not given by a…
One of the most essential prerequisites behind a successful task execution of a team of agents is to accurately estimate and track their poses. We consider a cooperative multi-agent positioning problem where each agent performs single-agent…
A multi-agent optimization problem motivated by the management of energy systems is discussed. The associated cost function is separable and convex although not necessarily strongly convex and there exist edge-based coupling equality…
Localization phenomena permeate many branches of physics playing a fundamental role on dynamical processes evolving on heterogeneous networks. These localization analyses are frequently grounded, for example, on eigenvectors of adjacency or…