An official website of the United States government
The paper introduces and solves a structural controllability problem for continuum ensembles of linear time-invariant systems. All the individual linear systems of an ensemble are sparse, governed by the same sparsity pattern. Controllability of an ensemble system is, by convention, the capability of using a common control input to simultaneously steer every individual systems in it. A sparsity pattern is structurally controllable if it admits a controllable linear ensemble system. A main contribution of the paper is to provide a graphical condition that is necessary and sufficient for a sparsity pattern to be structurally controllable. Like other structural problems, the property of being structural controllable is monotone. We provide a complete characterization of minimal sparsity patterns as well.
more »
« less
Controllability of Sobolev-Type Linear Ensemble Systems
Systems composed of large ensembles of isolated or interacted dynamic units are prevalent in nature and engineered infrastructures. Linear ensemble systems are inarguably the simplest class of ensemble systems and have attracted intensive attention to control theorists and practionars in the past years. Comprehensive understanding of dynamic properties of such systems yet remains far-fetched and requires considerable knowledge and techniques beyond the reach of modern control theory. In this paper, we explore the classes of linear ensemble systems with system matrices that are not globally diagonalizable. In particular, we focus on analyzing their controllability properties under a Sobolev space setting and develop conditions under which uniform controllability of such ensemble systems is equivalent to that of their diagonalizable counterparts. This development significantly facilitates controllability analysis for linear ensemble systems through examining diagonalized linear systems.
more »
« less
- Award ID(s):
- 1810202
- PAR ID:
- 10314150
- Date Published:
- Journal Name:
- 60th IEEE Conference on Decision and Control
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract The ability to finely manipulate spatiotemporal patterns displayed in neuronal populations is critical for understanding and influencing brain functions, sleep cycles, and neurological pathologies. However, such control tasks are challenged not only by the immense scale but also by the lack of real-time state measurements of neurons in the population, which deteriorates the control performance. In this paper, we formulate the control of dynamic structures in an ensemble of neuron oscillators as a tracking problem and propose a principled control technique for designing optimal stimuli that produce desired spatiotemporal patterns in a network of interacting neurons without requiring feedback information. We further reveal an interesting presentation of information encoding and processing in a neuron ensemble in terms of its controllability property. The performance of the presented technique in creating complex spatiotemporal spiking patterns is demonstrated on neural populations described by mathematically ideal and biophysical models, including the Kuramoto and Hodgkin-Huxley models, as well as real-time experiments on Wein bridge oscillators.more » « less
-
Reparable systems are systems that are characterized by their ability to undergo maintenance actions when failures occur. These systems are often described by transport equations, all coupled through an integro-differential equation. In this paper, we address the understudied aspect of the controllability of reparable systems. In particular, we focus on a two-state reparable system and our goal is to design a control strategy that enhances the system availability- the probability of being operational when needed. We establish bilinear controllability, demonstrating that appropriate control actions can manipulate system dynamics to achieve desired availability levels. We provide theoretical foundations and develop control strategies that leverage the bilinear structure of the equations.more » « less
-
In this paper, we investigate the problem of actuator selection for linear dynamical systems. We develop a framework to design a sparse actuator schedule for a given large-scale linear system with guaranteed performance bounds using deterministic polynomial-time and randomized approximately linear-time algorithms. First, we introduce systemic controllability metrics for linear dynamical systems that are monotone and homogeneous with respect to the controllability Gramian. We show that several popular and widely used optimization criteria in the literature belong to this class of controllability metrics. Our main result is to provide a polynomial-time actuator schedule that on average selects only a constant number of actuators at each time step, independent of the dimension, to furnish a guaranteed approximation of the controllability metrics in comparison to when all actuators are in use. Our results naturally apply to the dual problem of sensor selection, in which we provide a guaranteed approximation to the observability Gramian. We illustrate the effectiveness of our theoretical findings via several numerical simulations using benchmark examples.more » « less
-
We consider a class of robotic systems composed of high elongation linear actuators connected at universal joints. We derive the differential kinematics of such robots, and formalize concepts of controllability based on graph rigidity. Control methods are then developed for two separate applications: locomotion and shape morphing. The control algorithm in both cases solves a series of linearly constrained quadratic programs at each time step to minimize an objective function while ensuring physical feasibility. We present simulation results for locomotion along a prescribed path, and morphing to a target shape.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/CDC45484.2021.9683659
