Related papers: Gramian-based reachability metrics for bilinear ne…
This article determines and characterizes the minimal number of actuators needed to ensure structural controllability of a linear system under structural alterations that can severe the connection between any two states. We assume that…
In this note we describe an application of low-high orders in fault-tolerant network design. Baswana et al. [DISC 2015] study the following reachability problem. We are given a flow graph $G = (V, A)$ with start vertex $s$, and a spanning…
We study controllability and constructive synthesis for control-affine systems. We introduce trajectory-dependent Gramian maps that extend the linear time-varying Gramian and yield explicit fixed-point synthesis maps. On feasible coercivity…
Despite the significant advances in identifying the driver nodes and energy requiring in network control, a framework that incorporates more complicated dynamics remains challenging. Here, we consider the conformity behavior into network…
We consider a system described by a controlled bilinear Schr{\"o}dinger equation with three external inputs. We provide a constructive method to approximately steer the system from a given energy level to a superposition of energy levels…
This paper studies near-controllability of a class of discrete-time bilinear systems via a root locus approach. A necessary and sufficient criterion for the systems to be nearly controllable is given. In particular, by using the root locus…
To promote the implementation of realistic control over various complex networks, recent work has been focusing on analyzing energy cost. Indeed, the energy cost quantifies how much effort is required to drive the system from one state to…
A key problem in emerging complex cyber-physical networks is the design of information and control topologies, including sensor and actuator selection and communication network design. These problems can be posed as combinatorial set…
Model-based reinforcement learning seeks to simultaneously learn the dynamics of an unknown stochastic environment and synthesise an optimal policy for acting in it. Ensuring the safety and robustness of sequential decisions made through a…
A major application of the mathematical concept of graph in quantum mechanics is to model networks of electrical wires or electromagnetic wave-guides. In this paper, we address the dynamics of a particle trapped on such a network in…
Reachability analysis plays a central role in low-thrust spacecraft trajectory optimization by identifying which target states can be achieved under constraints on time, thrust, and propellant. Classical approaches construct reachable sets…
This paper investigates the minimal number of inputs/outputs required to guarantees the controllability/observability of a system, under the condition that its state transition matrix (STM) is prescribed. It has been proved that this…
Biological processes, including cell differentiation, organism development, and disease progression, can be interpreted as attractors (fixed points or limit cycles) of an underlying networked dynamical system. In this paper, we study the…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…
This work presents a method of efficiently computing inner and outer approximations of forward reachable sets for nonlinear control systems with changed dynamics and diminished control authority, given an a priori computed reachable set for…
We develop some basic principles for the design and robustness analysis of a continuous-time bilinear dynamical network, where an attacker can manipulate the strength of the interconnections/edges between some of the agents/nodes. We…
We consider infinite heterogeneous networks, consisting of input-to-state stable subsystems of possibly infinite dimension. We show that the network is input-to-state stable, provided that the gain operator satisfies a certain small-gain…
This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift…
We present an approach to approximate reachable sets for linear systems with bounded L-infinity controls in finite time. Our first approach investigates the boundaries of these sets and reveals an exact characterization for single-input,…
In this work, we investigate the small-time global controllability properties of a class of fourth-order nonlinear parabolic equations driven by a bilinear control posed on the one-dimensional torus. The controls depend only on time and act…