Related papers: Coordination in multiagent systems and Laplacian s…
We study synchronization and consensus in a group of dynamical systems coupled via multiple directed networks. We show that even though the coupling in a single network may not be sufficient to synchronize the systems, combination of…
This work focuses on exploring the potential benefits of introducing a nonlinear Laplacian in Sheaf Neural Networks for graph-related tasks. The primary aim is to understand the impact of such nonlinearity on diffusion dynamics, signal…
Multilayer networks provide a more comprehensive framework for exploring real-world and engineering systems than traditional single-layer networks, consisting of multiple interacting networks. However, despite significant research in…
In this paper, we study the target controllability problem of networked dynamical systems, in which we are tasked to steer a subset of network states towards a desired objective. More specifically, we derive necessary and sufficient…
We present examples of rooted tree graphs for which the Laplacian has singular continuous spectral measures. For some of these examples we further establish fractional Hausdorff dimensions. The singular continuous components, in these…
We consider distributed inference in social networks where a phenomenon of interest evolves over a given social interaction graph, referred to as the \emph{social digraph}. For inference, we assume that a network of agents monitors certain…
Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…
In this paper we study a generalization of distributed conditional gradient method to time-varying network architectures. We theoretically analyze convergence properties of the algorithm and provide numerical experiments. The time-varying…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
In this work we study statistical properties of graph-based algorithms for multi-manifold clustering (MMC). In MMC the goal is to retrieve the multi-manifold structure underlying a given Euclidean data set when this one is assumed to be…
Coordinating multiple autonomous agents to reach a target region while avoiding collisions and maintaining communication connectivity is a core problem in multi-agent systems. In practice, agents have a limited communication range. Thus,…
We propose a distributed model predictive control (MPC) framework for coordinating heterogeneous, nonlinear multi-agent systems under individual and coupling constraints. The cooperative task is encoded as a shared objective function…
In this paper, we construct directed strongly regular graphs and divisible design graphs with new parameters merging some basic relations of so-called Tatra associations schemes. We also study the above association schemes, their fusions…
This paper addresses the distributed consensus problem for a linear multi-agent system with switching directed communication topologies. By appropriately introducing a linear transformation, the consensus problem is equivalently converted…
The multi-agent spatial coverage control problem encompasses a broad research domain, dealing with both dynamic and static deployment strategies, discrete-task assignments, and spatial distribution-matching deployment. Coverage control may…
Formation control deals with the design of decentralized control laws that stabilize mobile, autonomous agents at prescribed distances from each other. We call any configuration of the agents a target configuration if it satisfies the…
In numerous artificial intelligence applications, the collaborative efforts of multiple intelligent agents are imperative for the successful attainment of target objectives. To enhance coordination among these agents, a distributed…
This paper addresses the problem of formation control and tracking a of desired trajectory by an Euler-Lagrange multi-agent systems. It is inspired by recent results by Qingkai et al. and adopts an event-triggered control strategy to reduce…
In graph signal processing, many studies assume that the underlying network is undirected. Although the digraph model is rarely adopted, it is more appropriate for many applications, especially for real world networks. In this paper, we…
We study the multi-agent formation control problem in a directed graph. The relative configurations are expressed by unit dual quaternions (UDQs). We call such a weighted directed graph a unit dual quaternion directed graph (UDQDG). We show…