SEARCH · Search NASA

Results for “Controllability Gramian”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

5 records

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Gramian-Based Characterization of Network Vulnerability to Nodal Impulse Inputs: Preprint

Impulsive inputs applied at influential nodes of a network system may result in undesirable behavior and degrade performance. This paper proposes the notion of vulnerability matrix (VM) to characterize the effect of impulse inputs on a network following either discrete-time or continuous-time dynamics. The VM describes the first-order effects of impulse inputs on edge flows and is based on the controllability Gramian. We provide explicit expressions for the elements of the vulnerability matrix for the class of directed line networks in terms of the edge weights. Simulations validate our results and highlight the utility of the proposed metric in capturing the transient effects of nodal impulse inputs on edge flows.

controllability Gramian↗

DOE OSTI2022

Multistage Stabilized Continuation for Indirect Optimal Control of Three-Dimensional Hypersonic Trajectories

This work presents the development of a multistaged stabilized continuation for the three-dimensional unpowered hypersonic trajectory planning problem using indirect optimal control methods. The stabilized continuation method is noniterative and guaranteed to terminate within a finite number of floating point operations, thereby making it well suited for onboard autonomous implementations. Here, we present a multistage formulation of the stabilized continuation scheme that involves starting with a “loose” integration tolerance during the first stage and ramping up toward a “strict” integration tolerance through subsequent stages. An important benefit of this approach is that even when the solution to the underlying optimal control problem is numerically unstable, such as with the hypersonic vehicle footprint generation problem, the stabilized continuation algorithm is shown to be successful in finding a solution while providing some additional insights into the underlying cause of the numerical instability.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2022

Data-driven Resilience Characterization of Control Dynamical Systems

In this paper, we define and quantify resiliency of a power network and propose data-driven algorithms for computing the same for the power grid. To do this, we use the Koopman operator framework to lift the controlled dynamical system to an abstract (possibly higher) dimensional space, where the evolution is linear. The linear system representation allows us to relate small time local controllability and observability of a general nonlinear control system to the controllability and observability of the lifted linear system. Finally, we define the resiliency of the underlying power grid in terms of the controllability and observability gramians of the lifted linear system. We illustrate the proposed approach to compute the resiliency metrics on time-series data obtained from a microgrid.

koopman operator, resilience, control↗

DOE OSTI2023

On the dual advantage of placing observations through forward sensitivity analysis

The four-dimensional variational data assimilation methodology for assimilating noisy observations into a deterministic model has been the workhorse in forecasting centres for over three decades. While this method provides a computationally efficient framework for dynamic data assimilation, it is largely silent on the important question concerning the minimum number and placement of observations. To answer this question, we demonstrate the dual advantage of placing the observations where the square of the sensitivity of the model solution with respect to the unknown control variables, called forward sensitivities, attains its maximum. By following this approach, we can force the observability Gramian to be of full rank, which in turn guarantees efficient recovery of the optimal values of the control variables, which is the first of the two advantages of this strategy. We further show that the proposed strategy of placing observations has another inherent optimality: the square of the sensitivity of the optimal estimates of the control with respect to the observations (used to obtain these estimates) attains its minimum value, a second advantage that is a direct consequence of the above strategy for placing observations. Our analytical framework and numerical experiments on linear and nonlinear systems confirm the effectiveness of our proposed strategy.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

A greedy Galerkin method to efficiently select sensors for linear dynamical systems

A key challenge in inverse problems is the selection of sensors to gather the most effective data. In this paper, we consider the problem of inferring the initial condition to a linear dynamical system and develop an efficient control-theoretical approach for greedily selecting sensors. Our method employs a Galerkin projection to reduce the size of the inverse problem, resulting in a computationally efficient algorithm for sensor selection. As a byproduct of our algorithm, we obtain a preconditioner for the inverse problem that enables the rapid recovery of the initial condition. Here, we analyze the theoretical performance of our greedy sensor selection algorithm as well as the performance of the associated preconditioner. Finally, we verify our theoretical results on various inverse problems involving partial differential equations.

97 MATHEMATICS AND COMPUTING↗