Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Lyapunov methods”

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.

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

At least 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Controls Algorithms, Models, and Stability Assessments of the RCS and TVC systems on Mars Ascent Vehicle

This paper presents a control systems overview of the Mars Ascent Vehicle (MAV) control design and stability analysis with two separate control methods: Thrust Vector Control (TVC) based control using main engine thrust and Reaction Control System (RCS) via thrusters. A pole-placement TVC controller is proposed to address quickly peaking thrust produced by the MAV solid propulsion engine. The controllerutilizes real-time parameter estimation to calculate control gains using an online pole-placement method. The pole-placement technique allows the controller to maintain constant stability margins throughout the flight under changing parameters and rapidly peaking thrust. A mathematical stability proof via Lyapunov inequality and Nichols method is demonstrated to support the stability of the method. In addition to the TVC control, a phase-plane based RCS control logic is applied to the vehicle for roll control during ascent and all axes during coast phases of flight. The logic implemented is an on-off type logic that applies pre-determined thrusters firings in reference to boundary parameters of pointing and rate error chosen to balance desired pointing with stability. A describing function methodology is applied to the non-linear phase plane loop response to determine linear stability across all flight phases. The controller additionally applies command alteration logic to output signals to account for RCS hardware limitations. The following paper will provide the methodology for controller implementation of the TVC and RCS, and provide a summary of results of the MAV performance applying the aforementioned control design.

Han Woong Bae↗
NASA NTRS1992

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Yedavalli, R. K.↗
NASA NTRS1973

Asymptotic stability and instability of large-scale systems

The purpose of this paper is to develop new methods for constructing vector Lyapunov functions and broaden the application of Lyapunov's theory to stability analysis of large-scale dynamic systems. The application, so far limited by the assumption that the large-scale systems are composed of exponentially stable subsystems, is extended via the general concept of comparison functions to systems which can be decomposed into asymptotically stable subsystems. Asymptotic stability of the composite system is tested by a simple algebraic criterion. By redefining interconnection functions among the subsystems according to interconnection matrices, the same mathematical machinery can be used to determine connective asymptotic stability of large-scale systems under arbitrary structural perturbations.

Grujic, L. T.↗
NASA NTRS2003

First Results from a Hardware-in-the-Loop Demonstration of Closed-Loop Autonomous Formation Flying

A closed-loop system for the demonstration of autonomous satellite formation flying technologies using hardware-in-the-loop has been developed. Making use of a GPS signal simulator with a dual radio frequency outlet, the system includes two GPS space receivers as well as a powerful onboard navigation processor dedicated to the GPS-based guidance, navigation, and control of a satellite formation in real-time. The closed-loop system allows realistic simulations of autonomous formation flying scenarios, enabling research in the fields of tracking and orbit control strategies for a wide range of applications. The autonomous closed-loop formation acquisition and keeping strategy is based on Lyapunov's direct control method as applied to the standard set of Keplerian elements. This approach not only assures global and asymptotic stability of the control but also maintains valuable physical insight into the applied control vectors. Furthermore, the approach can account for system uncertainties and effectively avoids a computationally expensive solution of the two point boundary problem, which renders the concept particularly attractive for implementation in onboard processors. A guidance law has been developed which strictly separates the relative from the absolute motion, thus avoiding the numerical integration of a target trajectory in the onboard processor. Moreover, upon using precise kinematic relative GPS solutions, a dynamical modeling or filtering is avoided which provides for an efficient implementation of the process on an onboard processor. A sample formation flying scenario has been created aiming at the autonomous transition of a Low Earth Orbit satellite formation from an initial along-track separation of 800 m to a target distance of 100 m. Assuming a low-thrust actuator which may be accommodated on a small satellite, a typical control accuracy of less than 5 m has been achieved which proves the applicability of autonomous formation flying techniques to formations of satellites as close as 50 m.

Gill, E.↗
NASA NTRS2024

Shape Servoing of Deformable Objects Using Model Estimation and Barrier Lyapunov Function

An adaptive shape servoing control method is presented in this article to manipulate a deformable object into a desired shape in 3-D. A finite-point-based representation of the deformable object is used and the deformation Jacobian matrix is approximated using Fourier series basis functions. The unknown parameters of the deformation Jacobian are learned by using the velocity applied to a control point on the object and corresponding change of positions of the points describing the entire object. An integral concurrent learning (ICL)-based parameter update law is designed along with a constrained controller to satisfy the state constraints on the motion of the control point using Barrier Lyapunov function analysis. ICL-based parameter update law uses data history of velocity and corresponding positions of the points along with their current values. An efficient algorithm to update the history stack using singular value maximization is proposed based on the structure of the regressor matrix. Simulations using a physical simulator and experiments using a robot platform are performed to validate the performance of the proposed controller on two different deformable objects.

Vrithik Raj Guthikonda↗
DOE OSTI2021

Green’s functions on a renormalized lattice: An improved method for the integer quantum Hall transition

Highlights: • Speed up of numerical calculations by exact renormalization group steps. • Practical approach to handle delicate scaling analysis. • Absence of evidence to prefer marginal corrections over power-law corrections. We introduce a performance-optimized method to simulate localization problems on bipartite tight-binding lattices. It combines an exact renormalization group step to reduce the sparseness of the original problem with the recursive Green’s function method. We apply this framework to investigate the critical behavior of the integer quantum Hall transition of a tight-binding Hamiltonian defined on a simple square lattice. In addition, we employ an improved scaling analysis that includes two irrelevant exponents to characterize the shift of the critical energy as well as the corrections to the dimensionless Lyapunov exponent. We compare our findings with the results of a conventional implementation of the recursive Green’s function method, and we put them into broader perspective in view of recent development in this field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1982

The applicability of Lyapunov characteristic numbers in the study of the stability of satellite orbits

It is pointed out that the Lyapunov Characteristic Numbers constitute a new tool for determining stability of trajectories of dynamical systems, or, even more generally, of solutions of systems of ordinary differential equations. In contrast with the characteristic exponents, which apply only to periodic solutions, the Lyapunov Characteristic Numbers apply to arbitrary nonperiodic solutions as well. A description is presented of the numerical experiments which have been made in order to investigate the practical value of the Lyapunov Characteristic Number and the Kolmogorov Entropy for the purpose of estimating the stability of trajectories and/or numerical integration methods in celestial mechanics. It is found that the Lyapunov Characteristic Numbers are extremely useful for the classification of the solutions of nonintegrable dynamical systems, especially in order to distinguish between quasi-periodic and chaotic solutions. However, the Lyapunov Characteristics Numbers do not appear to be useful for the purpose of evaluating numerical integration methods.

Broucke, R.↗
DOE OSTI2021

The divergence of nearby trajectories in soft-sphere DEM

The n-body instability is investigated with the soft-sphere discrete element method. The divergence of nearby trajectories is quantified by the dynamical memory time. Using the inverse proportionality between the dynamical memory time and the largest Lyapunov exponent, the soft-sphere discrete element method results are compared to previous hard-sphere molecular dynamics data for the first time. Good agreement is observed at low concentrations and the degree of instability is shown to increase asymptotically with increasing spring stiffness. At particle concentrations above 30%, the soft-sphere Lyapunov exponents increase faster than the corresponding hard-sphere data. Finally, this paper concludes with a demonstration of how this case study may be used in conjunction with regression testing and code verification activities.

42 ENGINEERING↗
NASA NTRS2021

A Functional Interpolation Approach to Compute Period Orbits in the Circular Restricted Three-body Problem

In this paper, we develop a method to solve for periodic orbits, i.e., Lyapunov and Halo orbits, using a functional interpolation scheme called the Theory of Func- tional Connections (TFC). Using this technique, a periodic constraint is analyti- cally embedded into the TFC constrained expression. By doing this, the system of differential equations governing the three-body problem is transformed into an unconstrained optimization problem where simple numerical schemes can be used to find a solution, e.g., nonlinear least-squares is used. This allows for a simpler numerical implementation with comparable accuracy and speed to the traditional differential corrector method.

Mortari, Daniele↗
DOE OSTI2021

Machine‐learning‐based construction of barrier functions and models for safe model predictive control

Abstract In this paper, we propose a control Lyapunov‐barrier function‐based model predictive control method utilizing a feed‐forward neural network specified control barrier function (CBF) and a recurrent neural network (RNN) predictive model to stabilize nonlinear processes with input constraints, and to guarantee that safety requirements are met for all times. The nonlinear system is first modeled using RNN techniques, and a CBF is characterized by constructing a feed‐forward neural network (FNN) model with unique structures and properties. The FNN model for the CBF is trained based on data samples collected from safe and unsafe operating regions, and the resulting FNN model is verified to demonstrate that the safety properties of the CBF are satisfied. Given sufficiently small bounded modeling errors for both the FNN and the RNN models, the proposed control system is able to guarantee closed‐loop stability while preventing the closed‐loop states from entering unsafe regions in state‐space under sample‐and‐hold control action implementation. We provide the theoretical analysis for bounded unsafe sets in state‐space, and demonstrate the effectiveness of the proposed control strategy using a nonlinear chemical process example with a bounded unsafe region.

Chen, Scarlett↗
NASA NTRS1994

Neural networks applications to control and computations

Several interrelated problems in the area of neural network computations are described. First an interpolation problem is considered, then a control problem is reduced to a problem of interpolation by a neural network via Lyapunov function approach, and finally a new, faster method of learning as compared with the gradient descent method, was introduced.

Luxemburg, Leon A.↗
DOE OSTI2023

Out-of-time-order correlators and Lyapunov exponents in sparse SYK

We use a combination of analytical and numerical methods to study out-of-time order correlators (OTOCs) in the sparse Sachdev-Ye-Kitaev (SYK) model. We find that at a given order of N, the standard result for the q-local, all-to-all SYK, obtained through the sum over ladder diagrams, is corrected by a series in the sparsity parameter, k. We present an algorithm to sum the diagrams at any given order of 1/(kq) n . We also study OTOCs numerically as a function of the sparsity parameter and determine the Lyapunov exponent. We find that numerical stability when extracting the Lyapunov exponent requires averaging over a massive number of realizations. This trade-off between the efficiency of the sparse model and consistent behavior at finite N becomes more significant for larger values of N.

2D gravity↗
NASA NTRS1995

Lyapunov exponents from CHUA's circuit time series using artificial neural networks

In this paper we present the general problem of identifying if a nonlinear dynamic system has a chaotic behavior. If the answer is positive the system will be sensitive to small perturbations in the initial conditions which will imply that there is a chaotic attractor in its state space. A particular problem would be that of identifying a chaotic oscillator. We present an example of three well known different chaotic oscillators where we have knowledge of the equations that govern the dynamical systems and from there we can obtain the corresponding time series. In a similar example we assume that we only know the time series and, finally, in another example we have to take measurements in the Chua's circuit to obtain sample points of the time series. With the knowledge about the time series the phase plane portraits are plotted and from them, by visual inspection, it is concluded whether or not the system is chaotic. This method has the problem of uncertainty and subjectivity and for that reason a different approach is needed. A quantitative approach is the computation of the Lyapunov exponents. We describe several methods for obtaining them and apply a little known method of artificial neural networks to the different examples mentioned above. We end the paper discussing the importance of the Lyapunov exponents in the interpretation of the dynamic behavior of biological neurons and biological neural networks.

Gonzalez, J. Jesus↗
DOE OSTI2024

Divide and conquer: Learning chaotic dynamical systems with multistep penalty neural ordinary differential equations

Forecasting high-dimensional dynamical systems is a fundamental challenge in various fields, such as geosciences and engineering. Neural Ordinary Differential Equations (NODEs), which combine the power of neural networks and numerical solvers, have emerged as a promising algorithm for forecasting complex nonlinear dynamical systems. However, classical techniques used for NODE training are ineffective for learning chaotic dynamical systems. In this work, we propose a novel NODE-training approach that allows for robust learning of chaotic dynamical systems. Here, our method addresses the challenges of non-convexity and exploding gradients associated with underlying chaotic dynamics. Training data trajectories from such systems are split into multiple, non-overlapping time windows. In addition to the deviation from the training data, the optimization loss term further penalizes the discontinuities of the predicted trajectory between the time windows. The window size is selected based on the fastest Lyapunov time scale of the system. Multi-step penalty(MP) method is first demonstrated on Lorenz equation, to illustrate how it improves the loss landscape and thereby accelerates the optimization convergence. MP method can optimize chaotic systems in a manner similar to least-squares shadowing with significantly lower computational costs. Our proposed algorithm, denoted the Multistep Penalty NODE, is applied to chaotic systems such as the Kuramoto-Sivashinsky equation, the two-dimensional Kolmogorov flow, and ERA5 reanalysis data for the atmosphere. It is observed that MP-NODE provide viable performance for such chaotic systems, not only for short-term trajectory predictions but also for invariant statistics that are hallmarks of the chaotic nature of these dynamics.

Chaotic dynamical systems↗
DOE OSTI2024

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗