skip to main content

Title: Learning-based Sensor Selection with Guaranteed Performance Bounds
In this paper, we consider the problem of sensor selection for discrete-time linear dynamical networks. We develop a framework to design a sparse sensor schedule for a given large-scale linear system with guaranteed performance bounds using a learning-based algorithm. To sparsify the sensors in both time and space, we build our combinatorial optimization problems based on the notion of systemic controllability/observability metrics for linear dynamical networks with three properties: monotonicity, convexity, and homogeneity with respect to the controllability/observability Gramian matrix of the network. These combinatorial optimizations are inherently intractable and NP-hard. However, solving a continuous relaxation for each optimization is considered best practice. This is achievable since we constructed the objective based on the systemic metrics, which are convex. Furthermore, by leveraging recent advances in sparsification literature and regret minimization, we then round the fractional solution obtained by the continuous optimization to achieve a (1+epsilon) approximation sparse schedule that chooses on average a constant number of sensors at each time, to approximate all types of systemic metrics.  more » « less
Award ID(s):
Author(s) / Creator(s):
Date Published:
Journal Name:
2022 American Control Conference (ACC)
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. 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
  2. A linear mechanical oscillator is non-linearly coupled with an electromagnet and its driving circuit through a magnetic field. The resulting non-linear dynamics are investigated using magnetic circuit approximations without major loss of accuracy and in the interest of brevity. Different computational approaches to simulate the setup in terms of dynamical system response and design parameters optimization are pursued. A current source operating in baseband without modulation directly feeds the electromagnet, which consists commonly of a solenoid and a horseshoe-shaped core. The electromagnet is then magnetically coupled to a mass made of soft magnetic material and attached to a spring with damping. The non-linear system is described by a linearized steady-space representation while is examined for controllability and observability. A controller using a pole placement approach is built to stabilize the element. Drawing upon the fact that coupling works both ways, enabling estimation of the mass position and velocity (state variables) by processing the induced voltage across the electromagnet, a state observer is constructed. Accurate and fast tracking of the state variables, along with the possibility of driving more than one module from the same source using modulation, proves the applicability of the electro-magneto-mechanical transducer for sensor applications. Next, a three-layer feed-forward artificial neural network (ANN) system equivalent was trained using the non-linear plant-linear controller-linear observer configuration. Simulations to investigate the robustness of the system with respect to different equilibrium points and input currents were carried out. The ANN proved robust with respect to position accuracy. 
    more » « less
  3. Abstract

    This study presents a new methodology for identifying near‐optimal sensor locations for contaminant source tracing in river networks. We define an optimal sensor placement as one that enables the best overall reconstruction of contaminant concentrations from observed data. To establish a physical basis for the problem, we first derive a linear time‐invariant (LTI) model for riverine contaminant transport using the one‐dimensional advection‐reaction‐diffusion equation. We then formulate an optimization problem to find the sensor placement that maximizes theobservabilityof the modeled system and identify two heuristics for efficiently achieving this goal. By evaluating each sensor placement strategy on its ability to reconstruct initial contaminant loads from observed outputs, we find that the best sensor placement is obtained by maximizing the rank of the LTI system's Observability Gramian. This sensor placement strategy enables the best overall reconstruction of both magnitudes and distributions of nonpoint‐source contaminants. Our methodology will enable researchers to build sensor networks that better interpolate pollutant loads in ungauged locations, improve contaminant source identification, and inform more effective pollution control strategies.

    more » « less
  4. Abstract

    Ease of control of complex networks has been assessed extensively in terms of structural controllability and observability, and minimum control energy criteria. Here we adopt a sparsity-promoting feedback control framework for undirected networks with Laplacian dynamics and distinct topological features. The control objective considered is to minimize the effect of disturbance signals, magnitude of control signals and cost of feedback channels. We show that depending on the cost of feedback channels, different complex network structures become the least expensive option to control. Specifically, increased cost of feedback channels favors organized topological complexity such as modularity and centralization. Thus, although sparse and heterogeneous undirected networks may require larger numbers of actuators and sensors for structural controllability, networks with Laplacian dynamics are shown to be easier to control when accounting for the cost of feedback channels.

    more » « less
  5. null (Ed.)
    We present PALLAS, a practical method for gene regulatory network (GRN) inference from time series data, which employs penalized maximum likelihood and particle swarms for optimization. PALLAS is based on the Partially-Observable Boolean Dynamical System (POBDS) model and thus does not require ad-hoc binarization of the data. The penalty in the likelihood is a LASSO regularization term, which encourages the resulting network to be sparse. PALLAS is able to scale to networks of realistic size under no prior knowledge, by virtue of a novel continuous-discrete Fish School Search particle swarm algorithm for efficient simultaneous maximization of the penalized likelihood over the discrete space of networks and the continuous space of observational parameters. The performance of PALLAS is demonstrated by a comprehensive set of experiments using synthetic data generated from real and artificial networks, as well as real time series microarray and RNA-seq data, where it is compared to several other well-known methods for gene regulatory network inference. The results show that PALLAS can infer GRNs more accurately than other methods, while being capable of working directly on gene expression data, without need of ad-hoc binarization. PALLAS is a fully-fledged program, written in python, and available on GitHub ( 
    more » « less