Related papers: Gramian-based reachability metrics for bilinear ne…
The aim of this paper is to shed light on the problem of controlling a complex network with minimal control energy. We show first that the control energy depends on the time constant of the modes of the network, and that the closer the…
We deal with algorithmic techniques for minimal cost input-connectivity while maintaining controllability of linear systems. The input matrix is assumed to be constrained in the sense that the set of states that each input (if present) can…
Minimal input/output selection is investigated in this paper for each subsystem of a networked system. Some novel sufficient conditions are derived respectively for the controllability and observability of a networked system, as well as…
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…
Combinations of Gramian-based centrality measures are used for driver node selection in complex networks in order to simultaneously take into account conflicting control energy requirements, like minimizing the average energy needed to…
In the classical control of network systems, the control actions on a node are determined as a function of the states of all nodes in the network. Motivated by applications where the global state cannot be reconstructed in real time due to…
To achieve control objectives for extremely large-scale complex networks using standard methods is essentially intractable. In this work a theory of the approximate control of complex network systems is proposed and developed by the use of…
In this work we analyse the small-time reachability properties of a nonlinear parabolic equation, by means of a bilinear control, posed on a torus of arbitrary dimension $d$. Under a saturation hypothesis on the control operators, we show…
In this paper we study the problem of computing minimum-energy controls for linear systems from experimental data. The design of open-loop minimum-energy control inputs to steer a linear system between two different states in finite time is…
Pinning control of a complex network aims at forcing the states of all nodes to track an external signal by controlling a small number of nodes in the network. In this paper, an algebraic graph-theoretic condition is introduced to optimize…
Determining the reachable set for a given nonlinear system is critically important for autonomous trajectory planning for reach-avoid applications and safety critical scenarios. Providing the reachable set is generally impossible when the…
Applying neural networks as controllers in dynamical systems has shown great promises. However, it is critical yet challenging to verify the safety of such control systems with neural-network controllers in the loop. Previous methods for…
We discuss balanced truncation model order reduction for large-scale quadratic-bilinear (QB) systems. Balanced truncation for linear systems mainly involves the computation of the Gramians of the system, namely reachability and…
Determining the distance between a controllable system to the set of uncontrollable systems, namely, the controllability radius problem, has been extensively studied in the past. However, the opposite direction, that is, determining the…
A common goal in the control of a large network is to minimize the number of driver nodes or control inputs. Yet, the physical determination of control signals and the properties of the resulting control trajectories remain widely…
This the text of a proceeding accepted for the 21st International Symposium on Mathematical Theory of Networks and Systems (MTNS 2014). We present some results of an ongoing research on the controllability problem of an abstract bilinear…
Given a state transition matrix (STM), we reinvestigate the problem of constructing the sparest input matrix with a fixed number of inputs to guarantee controllability. We give a new and simple graph theoretic characterization for the…
This paper provides a Lyapunov-based small-gain theorem for input-to-state stability (ISS) of networks composed of infinitely many finite-dimensional systems. We model these networks on infinite-dimensional $\ell_{\infty}$-type spaces. A…
In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a…
In this paper, we propose a novelty-based metric for quantitative characterization of the controllability of complex networks. This inherently bounded metric describes the average angular separation of an input with respect to the past…