Control optimization, stabilization and computer algorithms for space applications
Research of control optimization, stochastic stability, and air traffic control problems
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.
Research of control optimization, stochastic stability, and air traffic control problems
This paper first presents a brief review on the application of optimization and active control of seismic structures along with some of the author's recent work. It then assesses the practicality and future development of seismic structural optimization, and some practical problems associated with active control.
Total Variation optimization penalizes the gradient of a control variable or state. While this work focuses on image processing in particular, it has also found applications in inverse problems and topology optimization. In image processing, the goal is to maintain faithfulness to the original image while denoising and/or deblurring. Additionally, bilevel optimization over the spatially varying regularization weights can illuminate interfaces such as damage regions and other anomalies. We will address two fundamental challenges with TV-optimization: (i) the typical slow convergence of existing TV-optimization methods, and (ii) the selection of spatially varying TV parameters to promote interface detection. Additionally, we will apply such techniques to image data collected in additive manufacturing. In said context, stochasticity in build events induces flaws in the manufactured piece, compromising the integrity of said part. There is a critical need for in-situ monitoring to spot anomalies once they form, and in this setting we apply our total variation and hyperparameter solvers. We will develop a customized algorithm based on for extreme-scale TV-optimization that achieves super-linear or quadratic-convergence, a critical property for real-time, image-by-image analysis. A worst-case outcome is a preprocessing step that enhances image quality in-situ, specifically for out-of-focus and noisy images.
Optimizing a system’s resilience can be challenging, especially when it involves considering both the inherent resilience of a robust design and the active resilience of a health management system to a set of computationally-expensive hazard simulations. While prior work has developed specialized architectures to effectively and efficiently solve combined design and resilience optimization problems, the comparison of these architectures has been limited to a single case study. To further study resilience optimization formulations, this work develops a problem repository which includes previously-developed resilience optimization problems and additional problems presented in this work: a notional system resilience model, a pandemic response model, and a cooling tank hazard prevention model. This work then uses models in the repository at large to understand the characteristics of resilience optimization problems and study the applicability of optimization architectures and decomposition strategies. Based on the comparisons in the repository, applying an optimization architecture effectively requires understanding the alignment and coupling relationships between the design and resilience models, as well as the efficiency characteristics of the algorithms. While alignment determines the necessity of a surrogate of resilience cost in the upper-level design problem, coupling determines the overall applicability of a sequential, alternating, or bilevel structure. Additionally, the application of decomposition strategies is dependent on there being limited interactions between variable sets, which often does not hold when a resilience policy is parameterized in terms of actions to take in hazardous model states rather than specific given scenarios.
Dynamic programming applications to optimal stochastic orbital transfer strategy, describing computer program
Dynamic programming applications to optimal stochastic orbital transfer strategy, describing computer program
An investigation is conducted of application of optimal observer-based control laws derived using both pole-placement techniques and optimal linear regulator theory. Although a pole-placement-derived control law with optimal observer provides fast response and excellent noise rejection, its observer requires an electrical input proportional to the unknown skin friction force, which is unavailable. To overcome this limitation, an optimal linear regulator design is proposed which estimates the unknown force input and provides excellent noise rejection, at the expense, however, of significantly slower transient response.
Hydrogen atoms inside of an Mg-doped GaN epitaxial layer were effectively removed by the electrochemical potentiostatic activation (EPA) method. The role of hydrogen was investigated in terms of the device performance of light-emitting diodes (LEDs). The effect of the main process parameters for EPA such as solution type, voltage, and time was studied and optimized for application to LED fabrication. In optimized conditions, the light output of 385-nm LEDs was improved by about 26% at 30 mA, which was caused by the reduction of the hydrogen concentration by ∼35%. Further removal of hydrogen seems to be involved in the breaking of Ga-H bonds that passivate the nitrogen vacancies. An EPA process with high voltage breaks not only Mg-H bonds that generate hole carriers but also Ga-H bonds that generate electron carriers, thus causing compensation that impedes the practical increase of hole concentration, regardless of the drastic removal of hydrogen atoms. A decrease in hydrogen concentration affects the current-voltage characteristics, reducing the reverse current by about one order and altering the forward current behavior in the low voltage region.
Planning complex missions requires a number of programs to be executed in concert. The Application Navigation System (ANS), developed in the NAS Division, can execute many interdependent programs in a distributed environment. We show that the ANS simplifies user effort and reduces time in optimization of the trajectory of a martian airplane. We use a software package, Cart3D, to evaluate trajectories and a shortest path algorithm to determine the optimal trajectory. ANS employs the GridScape to represent the dynamic state of the available computer resources. Then, ANS uses a scheduler to dynamically assign ready task to machine resources and the GridScape for tracking available resources and forecasting completion time of running tasks. We demonstrate system capability to schedule and run the trajectory optimization application with efficiency exceeding 60% on 64 processors.
The application of linear optimal control to the design of systems with integral control action on specified outputs is considered. Using integral terms in a quadratic performance index, an asymptotic analysis is used to determine the effect of variable quadratic weights on the eigenvalues and eigenvectors of the closed loop system. It is shown that for small integral terms the placement of integrator poles and gain calculation can be effectively decoupled from placement of the primary system eigenvalues. This technique is applied to the design of integral controls for a STOL aircraft outer loop guidance system.
Purpose: To develop and test a method for optimizing and constructing a dual scattering system in passively scattered proton therapy. Methods: A beam optics optimization algorithm was developed to optimize the thickness of the first scatterer (S1) and the profile (of both the high-Z material and Lexan) of the second scatterer (S2) to deliver a proton beam matching a given set of parameters, including field diameter, fluence, flatness, and symmetry. A new manufacturing process was also tested that allows the contoured second scattering foil to be created much more economically and quickly using Cerrobend casting. Two application-specific scattering systems were developed and tested using both experimental and Monte Carlo techniques to validate the optimization process described. Results: A scattering system was optimized and constructed to deliver large uniform irradiations of radiobiology samples at low dose rates. This system was successfully built and tested using film and ionization chambers. The system delivered a uniform radiation field of 50 cm diameter (to a dose of {+-}7% of the central axis) while the depth dose profile could be tuned to match the specifications of the particular investigator using modulator wheels and range shifters. A second scattering system for intermediate field size (4 cm < diameter < 10 cm) stereotactic radiosurgery and radiation therapy (SRS and SRT) treatments was also developed and tested using GEANT4. This system improved beam efficiency by over 70% compared with existing scattering systems while maintaining field flatness and depth dose profile. In both cases the proton range uniformity across the radiation field was maintained, further indicating the accuracy of the energy loss formalism in the optimization algorithm. Conclusions: The methods described allow for rapid prototyping of scattering foils to meet the demands of both research and clinical beam delivery applications in proton therapy.
Application of dynamic programming to optimizing the orbital control process of a 24-hour communications satellite
Application of dynamic programming to optimizing the orbital control process of a 24-hour communications satellite
The purpose of this project was to devise, implement, and demonstrate a method that can use Sandia's existing analysis codes (e.g., Sierra, Alegra, the CTH hydro code) with minimal modification to generate objective function gradients for optimization-based design in transient, non-linear, coupled-physics applications. The approach uses a Moving Least Squares representation of the geometry to substantially reduce the number of geometric degrees of freedom. A Multiple-Program Multiple-Data computing model is then used to compute objective gradients via finite differencing. Details of the formulation and implementation are provided, and example applications are presented that show effectiveness and scalability of the approach.
Bubble domain materials and devices are discussed. One of the materials development goals was a materials system suitable for operation of 16 micrometer period bubble domain devices at 150 kHz over the temperature range -10 C to +60 C. Several material compositions and hard bubble suppression techniques were characterized and the most promising candidates were evaluated in device structures. The technique of pulsed laser stroboscopic microscopy was used to characterize bubble dynamic properties and device performance at 150 kHz. Techniques for large area LPE film growth were developed as a separate task. Device studies included detector optimization, passive replicator design and test and on-chip bridge evaluation. As a technology demonstration an 8 chip memory cell was designed, tested and delivered. The memory elements used in the cell were 10 kilobit serial registers.
A methodology for nonintrusive projection-based nonlinear model reduction originally presented by Renganathan et al. is further extended here toward parametric systems with a focus on application to aerospace design. Specifically, the method is extended to address static systems with parametric geometry (that deforms the mesh) in addition to parametric freestream boundary conditions. The main idea is to first perform a transformation on the governing equations such that it is lifted to a higher-dimensional but linear underdetermined system. This enables one to extract the system matrices easily as compared to that of the original nonlinear system. The underdetermined system is closed with a set of model-dependent nonlinear constraints upon which the model reduction is finally performed. The methodology is validated on the subsonic and transonic inviscid flows past the NACA0012 and the RAE2822 airfoils with parametrized shapes. The utility of the approach is further demonstrated by applying it to two common problems in aerospace design, namely, derivative-free global optimization and parametric uncertainty quantification with Monte Carlo sampling. Overall, the methodology is shown to achieve accuracy up to 5% and computational speedup of two to three orders of magnitude relative to the full order model. Comparison against another nonintrusive model reduction method revealed that the proposed approach is more robust, accurate, and retains the consistency between the state variables.
In this paper, we present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems, whose constraints are differentiable, and are indexed by an index set of low dimension. After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints. The combination of this distribution optimization method and the central cutting surface algorithm yields a solution to a family of distributionally robust optimization problems that are considerably more general than the ones proposed to date.
Our FY 2012 LDRD research on stochastic optimization with its application in power grid planning and operations has advanced the state-of-the-art of this area in the following aspects: (1) Deploying stochastic unit commitment on large real-world applications, (2) Stochastic optimization coupled with real-time production cost simulation (interleaved), and (3) Real-time stochastic optimization with rolling-horizon look-ahead. In conjunction, a number of computational experiments have been performed to evaluate the capability of the latest stochastic optimization software and explore opportunities for future research. In what follows, we discuss each of these contribution areas, including the results of our computational experiments and their implications on the scalability and solvability of large-scale stochastic optimization models.