Related papers: Coordination in multiagent systems and Laplacian s…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
This paper addresses the distributed consensus protocol design problem for multi-agent systems with general linear dynamics and directed communication graphs. Existing works usually design consensus protocols using the smallest real part of…
This paper investigates the distributed consensus tracking control problem for general linear multi-agent systems (MASs) with external disturbances and heterogeneous time-varying input and communication delays under a directed communication…
The distributed coordination problem of multi-agent systems is addressed in this paper under the assumption of intermittent communication between agents in the presence of time-varying communication delays. Specifically, we consider the…
We investigate the problem of learning undirected graphical models under Laplacian structural constraints from the point of view of financial market data. We show that Laplacian constraints have meaningful physical interpretations related…
In this paper, we examine the controllability of Laplacian dynamic networks on cographs. Cographs appear in modeling a wide range of networks and include as special instances, the threshold graphs. In this work, we present necessary and…
In this work, we design distributed control laws for spatial self-organization of multi-agent swarms in 1D and 2D spatial domains. The objective is to achieve a desired density distribution over a simply-connected spatial domain. Since…
In cooperative multi-agent robotic systems, coordination is necessary in order to complete a given task. Important examples include search and rescue, operations in hazardous environments, and environmental monitoring. Coordination, in…
Complex real-world phenomena across a wide range of scales, from aviation and internet traffic to signal propagation in electronic and gene regulatory circuits, can be efficiently described through dynamic network models. In many such…
Networks with a prescribed power-law scaling in the spectrum of the graph Laplacian can be generated by evolutionary optimization. The Laplacian spectrum encodes the dynamical behavior of many important processes. Here, the networks are…
This paper proposes a new architecture for multi-agent systems to cover an unknowingly distributed fast, safely, and decentralizedly. The inter-agent communication is organized by a directed graph with fixed topology, and we model agent…
Distributed algorithms of multi-agent coordination have attracted substantial attention from the research community; the simplest and most thoroughly studied of them are consensus protocols in the form of differential or difference…
A solution is given to the basic distributed feedback control problem for a multi-channel linear system assuming only that the system is jointly controllable, jointly observable and has an associated neighbor graph which is strongly…
Multiagent systems consist of agents that locally exchange information through a physical network subject to a graph topology. Current control methods for networked multiagent systems assume the knowledge of graph topologies in order to…
This work aims to address the design of fully distributed control protocols for stochastic consensus, and, for the first time, establishes the existence and uniqueness of solutions for the path-dependent and highly nonlinear closed-loop…
In this paper, we investigate the controllability of a linear time-invariant network following a Laplacian dynamics defined on a threshold graph. In this direction, an algorithm for deriving the modal matrix associated with the Laplacian…
Cellular sheaves and sheaf Laplacians provide a far-reaching generalization of graphs and graph Laplacians, resulting in a wide array of applications ranging from machine learning to multi-agent control. In the context of multi-agent…
Formation control is a key problem in the coordination of multiple agents. It arises new challenges to traditional formation control strategy when the communication among agents is affected by uncertainties. This paper considers the robust…
Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In…
We consider spectral methods that uncover hidden structures in directed networks. We establish and exploit connections between node reordering via (a) minimizing an objective function and (b) maximizing the likelihood of a random graph…