Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Global Optimal Control”

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 163 records · Page 9

Practical input optimization for aircraft parameter estimation experiments

The object of this research was to develop an algorithm for the design of practical, optimal flight test inputs for aircraft parameter estimation experiments. A general, single pass technique was developed which allows global optimization of the flight test input design for parameter estimation using the principles of dynamic programming with the input forms limited to square waves only. Provision was made for practical constraints on the input, including amplitude constraints, control system dynamics, and selected input frequency range exclusions. In addition, the input design was accomplished while imposing output amplitude constraints required by model validity and considerations of safety during the flight test. The algorithm has multiple input design capability, with optional inclusion of a constraint that only one control move at a time, so that a human pilot can implement the inputs. It is shown that the technique can be used to design experiments for estimation of open loop model parameters from closed loop flight test data. The report includes a new formulation of the optimal input design problem, a description of a new approach to the solution, and a summary of the characteristics of the algorithm, followed by three example applications of the new technique which demonstrate the quality and expanded capabilities of the input designs produced by the new technique. In all cases, the new input design approach showed significant improvement over previous input design methods in terms of achievable parameter accuracies.

Morelli, Eugene A.↗

A Globally Optimal Minimax Solution for Spectral Overbounding and Factorization

In this paper, an algorithm is introduced to find a minimum phase transfer function of specified order whose magnitude "tightly" overbounds a specified real-valued nonparametric function of frequency. This method has direct application to transforming nonparametric uncertainty bounds (available from system identification experiments and/or plant modeling) into parametric representations required for modern robust control design software (i.e., a minimum-phase transfer function multiplied by a norm-bounded perturbation).

Scheid, Robert E.↗

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗

Distributed Control with Collective Intelligence

We consider systems of interacting reinforcement learning (RL) algorithms that do not work at cross purposes , in that their collective behavior maximizes a global utility function. We call such systems COllective INtelligences (COINs). We present the theory of designing COINs. Then we present experiments validating that theory in the context of two distributed control problems: We show that COINs perform near-optimally in a difficult variant of Arthur's bar problem [Arthur] (and in particular avoid the tragedy of the commons for that problem), and we also illustrate optimal performance in the master-slave problem.

Wolpert, David H.↗

Low global warming potential (GWP) refrigerant supermarket refrigeration system modeling and its application

As an environmentally friendly low global warming potential (GWP) refrigerant, Carbon dioxide (CO 2 ) has continuously gained popularity and research attention as alternative refrigerant for supermarket refrigeration system. In this paper, to fulfill the increasing need of accurate Low-GWP supermarket refrigeration models for development of supervisory level control and optimization strategies, a high fidelity model is developed for CO 2 transcritical supermarket refrigeration system which includes compressor rack of low temperature (LT) compressors and medium temperature (MT) compressors, air-cooled gas cooler, evaporator, expansion valves and other auxiliary equipment. A resistance-capacity model structure is proposed to simulate the display cases. Semi-thermodynamic models are proposed to estimate reciprocating compressors volumetric efficiency and power consumption. Furthermore the zone modeling approach is used for evaporator simulation, and air-cooled gas cooler is modeled with distributed modeling method. The expansion valve simulation is based on orifice flow model. To calibrate these models, both manufacture performance data and experimental data are used. The experiments are conducted with a full instrumental CO 2 supermarket refrigeration system installed in Oak Ridge National Lab Flexible Research Platform (FRP). The simulation model can predict the system performance, including power consumption, cooling capacity, mass flow rate, temperature, and pressure, with high accuracy (within ±4%) compared to experimental data. In addition, this developed model has been used to create the system optimum high side pressure for high side expansion valve control, and to generate wide operating range simulation data for developing the batter-equivalent commercial refrigeration system model which can be used in grid interactive control development.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

Global stellarator coil optimization with quadratic constraints and objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvements in conditioning, regularization, sparsity, and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10$ 2 x faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL’s effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Modal identification using single-mode projection filters and comparison with ERA and MLE results

The Single-Mode Projection Filter (SPF) is a newly developed algorithm for eigensystem parameter identification from both analytical results and test data. The SPF is formulated with a single mode only and practical for parallel processing implementation. Explicit formulations of SPF are derived for the multi-input multi-output (MIMO) system by using the orthogonal matrices of the controllability and observability matrices in the general sense. The modal parameters of SPF are initially obtained from an analytical model in modal space. The experimental data are then processed through SPF to update its modal parameters and to minimize a cost function defined by the norm of an error matrix. The updated modal parameters represent the characteristics of the test data. A two-dimensional global minimum optimization algorithm is developed and applied for the filter update by using the interval analysis method. The SPF is developed based on a single-mode subsystem and identifies only one modal frequency and one modal damping within a specified region. For an n-modes structure, n SPF can be implemented for parallel processing to reduce the computational burden. The SPF is applied to analyze the simulated data for the MAST beam structure. The estimated modal parameters are comparable to those from the Eigensystem Realization Algorithm (ERA) and repeated modal frequencies are identified. The modal analysis of the Spacecraft Control Laboratory Experiment (SCOLE) data is also performed by using the ERA and the Maximum Likelihood Estimate (MLE). The result shows that the first five modal frequencies are very close from ERA and MLE. However, there are slight disparities in the damping rates and the computational burdens are quite different among these two algorithms.

Huang, Jen-Kuang↗

Efficiently Measuring 𝑑-Wave Pairing and Beyond in Quantum Gas Microscopes

Understanding the mechanism of high-temperature superconductivity is among the most important problems in physics, one for which quantum simulation can provide new insights. However, it remains challenging to characterize superconductivity in existing cold-atom quantum simulation platforms. Here, in this work, we introduce a protocol for measuring a broad class of observables in fermionic quantum gas microscopes, including long-range superconducting pairing correlations (after a repulsive-to-attractive mapping). The protocol only requires global controls followed by site-resolved particle number measurements—capabilities that have been already demonstrated in multiple experiments—and is designed by analyzing the Hilbert space of fermions on two sites. The protocol is sample-efficient and we further optimize our pulses for robustness to experimental imperfections such as lattice inhomogeneity. Our Letter introduces a general tool for manipulating quantum states on optical lattices, enhancing their ability to tackle problems such as high-temperature superconductivity.

Hubbard model↗

Frequency domain synthesis of optimal inputs for adaptive identification and control

The input design problem of selecting appropriate inputs for use in SISO adaptive identification and model reference adaptive control algorithms is considered. Averaging theory is used to characterize the optimal inputs in the frequency domain. The design problem is formulated as an optimization problem which maximizes the smallest eigenvalue of the average information matrix over power constrained signals, and the global optimal solution is obtained using a convergent numerical algorithm. A bound on the frequency search range required in the design algorithm has been determined in terms of the desired performance.

Fu, Li-Chen↗

High-efficiency indium tin oxide/indium phosphide solar cells

Improvements in the performance of indium tin oxide (ITO)/indium phosphide solar cells have been realized by the dc magnetron sputter deposition of n-ITO onto an epitaxial p/p(+) structure grown on commercial p(+) bulk substrates. The highest efficiency cells were achieved when the surface of the epilayer was exposed to an Ar/H2 plasma before depositing the bulk of the ITO in a more typical Ar/O2 plasma. With H2 processing, global efficiencies of 18.9 percent were achieved. It is suggested that the excellent performance of these solar cells results from the optimization of the doping, thickness, transport, and surface properties of the p-type base, as well as from better control over the ITO deposition procedure.

Li, X.↗

Process and assembly plans for low cost commercial fuselage structure

Cost and weight reduction for a composite structure is a result of selecting design concepts that can be built using efficient low cost manufacturing and assembly processes. Since design and manufacturing are inherently cost dependent, concurrent engineering in the form of a Design-Build Team (DBT) is essential for low cost designs. Detailed cost analysis from DBT designs and hardware verification must be performed to identify the cost drivers and relationships between design and manufacturing processes. Results from the global evaluation are used to quantitatively rank design, identify cost centers for higher ranking design concepts, define and prioritize a list of technical/economic issues and barriers, and identify parameters that control concept response. These results are then used for final design optimization.

Willden, Kurtis↗

Global optimality of extremals: An example

The question of the existence and location of Darboux points is crucial for minimally sufficient conditions for global optimality and for computation of optimal trajectories. A numerical investigation is presented of the Darboux points and their relationship with conjugate points for a problem of minimum fuel, constant velocity, and horizontal aircraft turns to capture a line. This simple second order optimal control problem shows that ignoring the possible existence of Darboux points may play havoc with the computation of optimal trajectories.

Kreindler, E.↗

Execution time supports for adaptive scientific algorithms on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

Execution time support for scientific programs on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

Equuleus Launch Window Analysis and Mission Design

This paper presents the trajectory design process for EQUULEUS, a 6U CubeSat developed by JAXA and the University of Tokyo that is scheduled to launch as a piggyback of NASA’s Artemis 1. After separation from the upper stage of the Space Launch System, EQUULEUS will maneuver along a low-energy transfer to an Earth–Moon quasi-rectilinear halo orbit in 1-to-4 resonance with the lunar synodic period. As a secondary payload, the trajectory of EQUULEUS needs to be compatible with the requirements of the primary mission, but also robust against disturbances and potential changes in the deployment state. Realistic initial conditions spanning two years of potential launch windows are processed and the solution structure for optimal lunar transfers is analyzed. A host of candidate solutions is presented, compatibly with the fuel and power limitations of EQUULEUS. The global understanding of the solution space is shown to be insightful for the design of robust trajectories for limited control-authority spacecraft.

Kawakatsu, Yasuhiro↗

A review on the application of machine learning for combustion in power generation applications

Abstract Although the world is shifting toward using more renewable energy resources, combustion systems will still play an important role in the immediate future of global energy. To follow a sustainable path to the future and reduce global warming impacts, it is important to improve the efficiency and performance of combustion processes and minimize their emissions. Machine learning techniques are a cost-effective solution for improving the sustainability of combustion systems through modeling, prediction, forecasting, optimization, fault detection, and control of processes. The objective of this study is to provide a review and discussion regarding the current state of research on the applications of machine learning techniques in different combustion processes related to power generation. Depending on the type of combustion process, the applications of machine learning techniques are categorized into three main groups: (1) coal and natural gas power plants, (2) biomass combustion, and (3) carbon capture systems. This study discusses the potential benefits and challenges of machine learning in the combustion area and provides some research directions for future studies. Overall, the conducted review demonstrates that machine learning techniques can play a substantial role to shift combustion systems towards lower emission processes with improved operational flexibility and reduced operating cost.

Engineering↗

Computer aiding for low-altitude helicopter flight

A computer-aiding concept for low-altitude helicopter flight was developed and evaluated in a real-time piloted simulation. The concept included an optimal control trajectory-generated algorithm based on dynamic programming, and a head-up display (HUD) presentation of a pathway-in-the-sky, a phantom aircraft, and flight-path vector/predictor symbol. The trajectory-generation algorithm uses knowledge of the global mission requirements, a digital terrain map, aircraft performance capabilities, and advanced navigation information to determine a trajectory between mission waypoints that minimizes threat exposure by seeking valleys. The pilot evaluation was conducted at NASA Ames Research Center's Sim Lab facility in both the fixed-base Interchangeable Cab (ICAB) simulator and the moving-base Vertical Motion Simulator (VMS) by pilots representing NASA, the U.S. Army, and the U.S. Air Force. The pilots manually tracked the trajectory generated by the algorithm utilizing the HUD symbology. They were able to satisfactorily perform the tracking tasks while maintaining a high degree of awareness of the outside world.

Swenson, Harry N.↗