Related papers: Coordination in multiagent systems and Laplacian s…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
This paper considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems under switching topologies is investigated. The structural controllability of multi-agent systems…
In this paper, we investigate the controllability of a class of formation control systems. Given a directed graph, we assign an agent to each of its vertices and let the edges of the graph describe the information flow in the system. We…
In this paper, a distributed output regulation problem is formulated for a class of uncertain nonlinear multi-agent systems subject to local disturbances. The formulation is given to study a leader-following problem when the leader contains…
It is basic question in biology and other fields to identify the char- acteristic properties that on one hand are shared by structures from a particular realm, like gene regulation, protein-protein interaction or neu- ral networks or…
Calculating a product of multiple graphs has been studied in mathematics, engineering, computer science, and more recently in network science, particularly in the context of multilayer networks. One of the important questions to be…
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…
Redundancy and parallelism make decentralized multi-robot systems appealing solutions for the exploration of extreme environments. However, effective cooperation often requires team-wide connectivity and a carefully designed communication…
Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…
In this report we provide a decentralized robust control approach, which guarantees that connectivity of a multi-agent network is maintained when certain bounded input terms are added to the control strategy. Our main motivation for this…
Complex real-world phenomena are often modeled as dynamical systems on networks. In many cases of interest, the spectrum of the underlying graph Laplacian sets the system stability and ultimately shapes the matter or information flow. This…
Since the complexity of the practical environment, many distributed networked systems can not be illustrated with the integer-order dynamics and only be described as the fractional-order dynamics. Suppose multi-agent systems will show the…
Formation control deals with the design of decentralized control laws that stabilize agents at prescribed distances from each other. We call any configuration that satisfies the inter-agent distance conditions a target configuration. It is…
This article reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including…
Motivated by the fact that intelligent traffic control systems have become inevitable demand to cope with the risk of traffic congestion in urban areas, this paper develops a distributed control strategy for urban traffic networks. Since…
Turing's model has been widely used to explain how simple, uniform structures can give rise to complex, patterned structures during the development of organisms. However, it is very hard to establish rigorous theoretical results for the…
In this paper, we study the social optimality for mean field linear quadratic control systems following the direct approach, where subsystems are coupled via individual dynamics and costs according to a network topology. A graph is…
Extensive research on graph-based dynamics and control of multi-agent systems has successfully demonstrated control of robotic swarms, where each robot is perceived as an independent agent virtually connected by a network topology. The…
Conservation laws and balance equations for physical network systems typically can be described with the aid of the incidence matrix of a directed graph, and an associated symmetric Laplacian matrix. Some basic examples are discussed, and…
In this paper it is established that any jointly controllable, jointly observable, multi-channel, discrete or continuous time linear system with a strongly connected neighbor (communication) graph can be exponentially stabilized with any…