Related papers: Controllability of Hypergraphs
In graph-theoretical terms, an edge in a graph connects two vertices while a hyperedge of a hypergraph connects any more than one vertices. If the hypergraph's hyperedges further connect the same number of vertices, it is said to be…
This paper discusses the controllability problem of complex networks. It is shown that almost any weighted complex network with noise on the strength of communication links is controllable in the sense of Kalman controllability. The concept…
Convolutional neural networks (CNNs) leverage the great power in representation learning on regular grid data such as image and video. Recently, increasing attention has been paid on generalizing CNNs to graph or network data which is…
Nonlinear networked systems are of interest in several areas of research, such as multi-agent systems and social networks. In this paper, we examine the controllability of several classes of nonlinear networked dynamics on which the…
The control of high-dimensional systems, such as soft robots, requires models that faithfully capture complex dynamics while remaining computationally tractable. This work presents a framework that integrates Graph Neural Network…
In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely…
Many real-world systems are composed of many individual components that interact with one another in a complex pattern to produce diverse behaviors. Understanding how to intervene in these systems to guide behaviors is critically important…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
Strong structural controllability (SSC) guarantees networked system with linear-invariant dynamics controllable for all numerical realizations of parameters. Current research has established algebraic and graph-theoretic conditions of SSC…
This paper studies observability for non-uniform hypergraphs with inputs and outputs. To capture higher-order interactions, we define a canonical non-homogeneous dynamical system with nonlinear outputs on hypergraphs. We then construct…
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…
This paper proposes a Recurrent Neural Network (RNN) controller for lane-keeping systems, effectively handling model uncertainties and disturbances. First, quadratic constraints cover the nonlinearities brought by the RNN controller, and…
The problem on how to determine the observability of Boolean control networks (BCNs) has been open for five years already. In this paper, we propose a unified approach to determine all the four types of observability of BCNs in the…
This paper is concerned with the controllability problem of a connected threshold graph following the Laplacian dynamics. An algorithm is proposed to generate a spanning set of orthogonal Laplacian eigenvectors of the graph from a…
A recurrent neural network (RNN) is a universal approximator of dynamical systems, whose performance often depends on sensitive hyperparameters. Tuning of such hyperparameters may be difficult and, typically, based on a trial-and-error…
In this paper, we study the well-posedness and approximate controllability of a class of network systems having delays and controls at the boundary conditions. The particularity of this work is that the network system is defined on infinite…
Controlling complex networks is of paramount importance in science and engineering. Despite the recent development of structural-controllability theory, we continue to lack a framework to control undirected complex networks, especially…
Mean-field control (MFC) offers a scalable solution to the curse of dimensionality in multi-agent systems but traditionally hinges on the restrictive assumption of exchangeability via dense, all-to-all interactions. In this work, we bridge…
We study the dynamics of systems on networks from a linear algebraic perspective. The control theoretic concept of controllability describes the set of states that can be reached for these systems. Under appropriate conditions, there is a…
Control of complex processes is a major goal of network analyses. Most approaches to control nonlinearly coupled systems require the network topology and/or network dynamics. Unfortunately, neither the full set of participating nodes nor…