A time optimal control study of a second- order linear system with delay
Time optimal control study of second-order linear system with delay
SEARCH · Engineering Papers
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.
Time optimal control study of second-order linear system with delay
A sequential method employing classical root-locus techniques has been developed in order to determine the quadratic weighting matrices and discrete linear quadratic regulators of multivariable control systems. At each recursive step, an intermediate unity rank state-weighting matrix that contains some invariant eigenvectors of that open-loop matrix is assigned, and an intermediate characteristic equation of the closed-loop system containing the invariant eigenvalues is created.
Lattice Quantumchromodynamics (QCD) is a powerful tool to numerically access the low energy regime of QCD in a straightforward way with quantifyable uncertainties. In this approach, QCD is discretized on a four dimensional, euclidian space-time grid with millions of degrees of freedom. In modern lattice calculations, most of the work is still spent in solving large, sparse linear systems. This part has two challenges, i.e. optimizing the sparse matrix application as well as BLAS-like kernels used in the linear solver. We are going to present performance optimizations of the Dirac operator (dslash) with and without clover term for recent Intel architectures, including Knights Landing (KNL). Using only a single right hand side, we were able to achieve a good fraction of peak performance for slash, CG and BiCGStab. We will also present a series of experiments we performed on KNL, i.e. running MCDRAM in different modes, enabling or disabling hardware prefetching, using different SoA lengths as well as different sub-NUMA-clustering modes.
Developments of the linear quadratic optimal control problem are discussed. The theory is applicable to the development of neighboring optimal feedback guidance gains, and is useful as a tool for synthesizing feedback control laws. A computer program which requires only the pertinent matrices of the linear quadratic problem is described.
Linear time varying systems optimal control through decoupling of boundary value problems
This project developed the LAPIS compiler framework, built on the Multilevel Intermediate Representation (MLIR), to optimize sparse linear algebra operations and support performance portability across diverse architectures. The main innovation of LAPIS is the Kokkos dialect, which allows for lowering codes from a high productivity language to different architectures in an elegant way. The dialect also allows the conversion of lower-level MLIR code to C++ Kokkos code, facilitating the integration of scientific machine learning (SciML) models into applications. To extend LAPIS for distributed memory architectures, a new partition dialect was created to manage the distribution of sparse tensors and express communication patterns for sparse linear algebra operations. This dialect also supports the distributed execution of operators and includes algorithmic optimizations to minimize communication to improve performance. The project also demonstrates that MLIR can enable effective linear algebra-level optimizations, improving performance on different GPUs for both sparse and dense linear algebra kernels. Key applications of LAPIS include sparse linear algebra and graph kernels, TenSQL, a relational database management solution built on GraphBLAS, and the development of subgraph isomorphism and monomorphism kernels, showcasing performance portability. In summary, the LAPIS framework supports productivity, performance, portability, and distributed memory execution, while also enabling linear algebra-level optimizations that are challenging in traditional programming languages, with successful applications ranging from simple sparse linear algebra to complex graph kernels.
This paper presents the formulation of a class of optimization problems dealing with selecting, at each instant of time, one measurement provided by one out of many sensors. Each measurement has an associated measurement cost. The basic problem is then to select an optimal measurement policy, during a specified observation time interval, so that a weighted combination of prediction accuracy and accumulated observation cost is optimized. The current analysis is limited to the class of linear stochastic dynamic systems and measurement subsystems. The problem of selecting the optimal measurement strategy can be transformed into a deterministic optimal control problem. It is shown that the optimal measurement policy and the associated matched Kalman-type filter can be precomputed.
Optimization problems involving two decision makers at two different decision levels are referred to as bi-level programming problems. Herein, we present novel algorithms for the exact and global solution of two classes of bi-level programming problems, namely (i) bi-level mixed-integer linear programming problems (B-MILP) and (ii) bi-level mixed-integer convex quadratic programming problems (B-MIQP) containing both integer and bounded continuous variables at both optimization levels. Based on multi-parametric programming theory, the main idea is to recast the lower level problem as a multi-parametric programming problem, in which the optimization variables of the upper level problem are considered as bounded parameters for the lower level. The resulting exact multi-parametric mixed-integer linear or quadratic solutions are then substituted into the upper level problem, which can be solved as a set of single-level, independent, deterministic mixed-integer optimization problems. Extensions to problems including right-hand-side uncertainty on both lower and upper levels are also discussed. Finally, computational implementation and studies are presented through test problems.
An algorithm has been developed for the analysis and design of controls for non-linear systems. The technical approach is to use statistical linearization to model the non-linear dynamics of a system by a quasi-Gaussian model. A covariance analysis is performed to determine the behavior of the dynamical system and a quadratic cost function. Expressions for the cost function and its derivatives are determined so that numerical optimization techniques can be applied to determine optimal feedback laws. The primary application for this paper is centered about the design of controls for nominally linear systems but where the controls are saturated or limited by fixed constraints. The analysis is general, however, and numerical computation requires only that the specific non-linearity be considered in the analysis.
Not Available
An overview of the performance seeking control (PSC) algorithm and details of the important components of the algorithm are given. The onboard propulsion system models, the linear programming optimization, and engine control interface are described. The PSC algorithm receives input from various computers on the aircraft including the digital flight computer, digital engine control, and electronic inlet control. The PSC algorithm contains compact models of the propulsion system including the inlet, engine, and nozzle. The models compute propulsion system parameters, such as inlet drag and fan stall margin, which are not directly measurable in flight. The compact models also compute sensitivities of the propulsion system parameters to change in control variables. The engine model consists of a linear steady state variable model (SSVM) and a nonlinear model. The SSVM is updated with efficiency factors calculated in the engine model update logic, or Kalman filter. The efficiency factors are used to adjust the SSVM to match the actual engine. The propulsion system models are mathematically integrated to form an overall propulsion system model. The propulsion system model is then optimized using a linear programming optimization scheme. The goal of the optimization is determined from the selected PSC mode of operation. The resulting trims are used to compute a new operating point about which the optimization process is repeated. This process is continued until an overall (global) optimum is reached before applying the trims to the controllers.
Not Available
The linear quadratic optimal control problem on infinite time interval for linear time-invariant systems defined on Hilbert spaces is considered. The optimal control is given by a feedback form in terms of solution pi to the associated algebraic Riccati equation (ARE). A Ritz type approximation is used to obtain a sequence pi sup N of finite dimensional approximations of the solution to ARE. A sufficient condition that shows pi sup N converges strongly to pi is obtained. Under this condition, a formula is derived which can be used to obtain a rate of convergence of pi sup N to pi. The results of the Galerkin approximation is demonstrated and applied for parabolic systems and the averaging approximation for hereditary differential systems.
A variable-skew oblique wing offers a substantial aerodynamic performance advantage for aircraft missions that require both high efficiency in subsonic flight and supersonic dash or cruise. The most obvious characteristic of the oblique-wing concept is the asymmetry associated with wing-skew angle which results in significant aerodynamic and inertial cross-coupling between the aircraft longitudinal and lateral-directional axes. A technique for synthesizing a decoupling controller while providing the desired stability augmentation. The proposed synthesis procedure uses the cncept of explicit model following. Linear quadratic optimization techniques are used to design the linear feedback system. The effectiveness of the control laws developed in achieving the desired decoupling is illustrated for a given flight condition by application to linearized equations of motion, and also to the nonlinear equations of six degrees of freedom of motion with nonlinear aerodynamic data.
A variable-skew oblique wing offers a substantial aerodynamic performance advantage for aircraft missions that require both high efficiency in subsonic flight and supersonic dash or cruise. The most obvious characteristic of the oblique-wing concept is the asymmetry associated with wing-skew angle which results in significant aerodynamic and inertial cross-coupling between the aircraft longitudinal and lateral-directional axes. This paper presents a technique for synthesizing a decoupling controller while providing the desired stability augmentation. The proposed synthesis procedure uses the concept of explicit model following. Linear quadratic optimization techniques are used to design the linear feedback system. The effectiveness of the control laws developed in achieving the desired decoupling is illustrated for a given flight condition by application to linearized equations of motion, and also to the nonlinear equations of six degrees of freedom of motion with nonlinear aerodynamic data.
This paper associates the Riccati group and its group action on linear-quadratic optimal control problems to the action of a Lie transformation group on a set of Hamiltonian matrices. In this Lie theoretic setting results are presented concerning the associated orbit structure and the structure of the group itself. These results are of importance in understanding the solution structure of matrix Riccati differential equations, and thus also of importance in linear-quadratic optimal control.
Time optimal control function and optimal trajectories solved for second order linear system with constant time delay
The variations in feedstock characteristics, such as moisture and particle size distribution, lead to an inconsistent flow of feedstock from the biomass pre-processing system to the reactor in-feed system. These inconsistencies result in low on-stream times at the reactor in-feed equipment. This research develops an optimal process control method for a biomass pre-processing system comprised of milling and densification operations to provide the consistent flow of feedstock to a reactor's throat. This method uses a mixed-integer optimization model to identify optimal bale sequencing, equipment in-feed rate, and buffer location and size in the biomass pre-processing system. This method, referred to as the hybrid process control (HPC), aims to maximize throughput over time. We compare HPC with a baseline feed forward process control. Our case study based on switchgrass finds that HPC reduces the variation of a reactor's feeding rate by up to 100% without increasing the operating cost of the biomass pre-processing system for biomass with moisture ranging from 10 to 25%. Additionally, HPC reduces the cost of processing biomass by 0.36%–2.22%, and reduces processing time by 0.35%-2.24%. Furthermore, a biorefinery can adapt HPC to achieve its design capacity.