Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constrained optimization”

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 937 records · Page 52

Hierarchical Image Segmentation of Remotely Sensed Data using Massively Parallel GNU-LINUX Software

A hierarchical set of image segmentations is a set of several image segmentations of the same image at different levels of detail in which the segmentations at coarser levels of detail can be produced from simple merges of regions at finer levels of detail. In [1], Tilton, et a1 describes an approach for producing hierarchical segmentations (called HSEG) and gave a progress report on exploiting these hierarchical segmentations for image information mining. The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HSWO) approach to region growing, which was described as early as 1989 by Beaulieu and Goldberg. The HSWO approach seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing (e.g. Horowitz and T. Pavlidis, [3]). In addition, HSEG optionally interjects between HSWO region growing iterations, merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the utility of the segmentation results, especially for larger images, it also significantly increases HSEG s computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) was devised, which includes special code to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. The recursive nature of RHSEG makes for a straightforward parallel implementation. This paper describes the HSEG algorithm, its recursive formulation (referred to as RHSEG), and the implementation of RHSEG using massively parallel GNU-LINUX software. Results with Landsat TM data are included comparing RHSEG with classic region growing.

Tilton, James C.↗

Climate Model Evaluation using New Datasets from the Clouds and the Earth's Radiant Energy System (CERES)

There are some in the science community who believe that the response of the climate system to anthropogenic radiative forcing is unpredictable and we should therefore call off the quest . The key limitation in climate predictability is associated with cloud feedback. Narrowing the uncertainty in cloud feedback (and therefore climate sensitivity) requires optimal use of the best available observations to evaluate and improve climate model processes and constrain climate model simulations over longer time scales. The Clouds and the Earth s Radiant Energy System (CERES) is a satellite-based program that provides global cloud, aerosol and radiative flux observations for improving our understanding of cloud-aerosol-radiation feedbacks in the Earth s climate system. CERES is the successor to the Earth Radiation Budget Experiment (ERBE), which has widely been used to evaluate climate models both at short time scales (e.g., process studies) and at decadal time scales. A CERES instrument flew on the TRMM satellite and captured the dramatic 1998 El Nino, and four other CERES instruments are currently flying aboard the Terra and Aqua platforms. Plans are underway to fly the remaining copy of CERES on the upcoming NPP spacecraft (mid-2010 launch date). Every aspect of CERES represents a significant improvement over ERBE. While both CERES and ERBE measure broadband radiation, CERES calibration is a factor of 2 better than ERBE. In order to improve the characterization of clouds and aerosols within a CERES footprint, we use coincident higher-resolution imager observations (VIRS, MODIS or VIIRS) to provide a consistent cloud-aerosol-radiation dataset at climate accuracy. Improved radiative fluxes are obtained by using new CERES-derived Angular Distribution Models (ADMs) for converting measured radiances to fluxes. CERES radiative fluxes are a factor of 2 more accurate than ERBE overall, but the improvement by cloud type and at high latitudes can be as high as a factor of 5. Diurnal cycles are explicitly resolved by merging geostationary satellite observations with CERES and MODIS. Atmospheric state data are provided from a frozen version of the Global Modeling and Assimilation Office- Data Assimilation System at the NASA Goddard Space Flight Center. In addition to improving the accuracy of top-of-atmosphere (TOA) radiative fluxes, CERES also produces radiative fluxes at the surface and at several levels in the atmosphere using radiative transfer modeling, constrained at the TOA by CERES (ERBE was limited to the TOA). In all, CERES uses 11 instruments on 7 spacecraft all integrated to obtain climate accuracy in TOA to surface fluxes. This presentation will provide an overview of several new CERES datasets of interest to the climate community (including a new adjusted TOA flux dataset constrained by estimates of heat storage in the Earth system), show direct comparisons between CERES ad ERBE, and provide a detailed error analysis of CERES fluxes at various time and space scales. We discuss how observations can be used to reduce uncertainties in cloud feedback and climate sensitivity and strongly argue why we should NOT "call off the quest".

Loeb, Norman G.↗

An asynchronous parallel high-throughput model calibration framework for crystal plasticity finite element constitutive models

Crystal plasticity finite element model (CPFEM) is a powerful numerical simulation in the integrated computational materials engineering toolboxes that relates microstructures to homogenized materials properties and establishes the structure–property linkages in computational materials science. However, to establish the predictive capability, one needs to calibrate the underlying constitutive model, verify the solution and validate the model prediction against experimental data. Bayesian optimization (BO) has stood out as a gradient-free efficient global optimization algorithm that is capable of calibrating constitutive models for CPFEM. Here in this paper, we apply a recently developed asynchronous parallel constrained BO algorithm to calibrate phenomenological constitutive models for stainless steel 304 L, Tantalum, and Cantor high-entropy alloy.

304L stainless steel↗

Interplanetary Trajectory Optimization with Powerlimited Propulsion Systems

A trajectory-optimization process is described in which the optimum­ thrust equations are derived using the calculus of variations. The mag­nitude of the thrust is constrained within an upper and a lower bound, but the thrust direction is arbitrary. This formulation allows both the constant-thrust program and the variable-thrust program to be con­sidered. For the constant-thrust program, certain propulsion-system parameters are optimized for maximum final vehicle mass. This theory has been used to study interplanetary missions to Venus and Mars using a power-limited propulsion system. Both one-way and round­ trip rendezvous trajectories are considered. The analysis employs a two-body inverse-square force-field model of three dimensions. An iterative routine used to solve the two-point boundary-value problem is described in the Appendix.

TRAJECTORY↗

Spacecraft inertia estimation via constrained least squares

This paper presents a new formulation for spacecraft inertia estimation from test data. Specifically, the inertia estimation problem is formulated as a constrained least squares minimization problem with explicit bounds on the inertia matrix incorporated as LMIs [linear matrix inequalities). The resulting minimization problem is a semidefinite optimization that can be solved efficiently with guaranteed convergence to the global optimum by readily available algorithms. This method is applied to data collected from a robotic testbed consisting of a freely rotating body. The results show that the constrained least squares approach produces more accurate estimates of the inertia matrix than standard unconstrained least squares estimation methods.

inertia estimation↗

Optimal Control Problems with Switching Points

The main idea of this report is to give an overview of the problems and difficulties that arise in solving optimal control problems with switching points. A brief discussion of existing optimality conditions is given and a numerical approach for solving the multipoint boundary value problems associated with the first-order necessary conditions of optimal control is presented. Two real-life aerospace optimization problems are treated explicitly. These are altitude maximization for a sounding rocket (Goddard Problem) in the presence of a dynamic pressure limit, and range maximization for a supersonic aircraft flying in the vertical, also in the presence of a dynamic pressure limit. In the second problem singular control appears along arcs with active dynamic pressure limit, which in the context of optimal control, represents a first-order state inequality constraint. An extension of the Generalized Legendre-Clebsch Condition to the case of singular control along state/control constrained arcs is presented and is applied to the aircraft range maximization problem stated above. A contribution to the field of Jacobi Necessary Conditions is made by giving a new proof for the non-optimality of conjugate paths in the Accessory Minimum Problem. Because of its simple and explicit character, the new proof may provide the basis for an extension of Jacobi's Necessary Condition to the case of the trajectories with interior point constraints. Finally, the result that touch points cannot occur for first-order state inequality constraints is extended to the case of vector valued control functions.

Seywald, Hans↗

Control system design using frequency domain models and parameter optimization, with application to supersonic inlet controls

A technique is described for designing feedback control systems using frequency domain models, a quadratic cost function, and a parameter optimization computer program. FORTRAN listings for the computer program are included. The approach is applied to the design of shock position controllers for a supersonic inlet. Deterministic or random system disturbances, and the presence of random measurement noise are considered. The cost function minimization is formulated in the time domain, but the problem solution is obtained using a frequency domain system description. A scaled and constrained conjugate gradient algorithm is used for the minimization. The approach to a supersonic inlet included the calculations of the optimal proportional-plus integral (PI) and proportional-plus-integral-plus-derivative controllers. A single-loop PI controller was the most desirable of the designs considered.

Seidel, R. C.↗

Structural Analysis of Pressurized Small Diameter Lines in a Random Vibration Environment

The pressurization and propellant feed lines for the Ares 1 Upper Stage Reaction and Roll Control Systems (ReCS and RoCS) were required to be in a high g-load random vibration flight environment. The lines connected the system components and were filled with both liquid hydrazine and gaseous helium. They are considered small and varied between one fourth to one inch in diameter. The random vibration of the lines was considered to be base excitation through the mating components and mounting hardware. It was found that reducing the amount of support structure for the lines added flexibility to the system and improved the line stresses from random vibration, but caused higher stresses from the static g-loads. The locations and number of brackets were optimized by analyzing the mode shapes of the lines causing high stresses. The use of brackets that only constrain motion in the direction of concern further reduced the stresses in the lines. Finite element analysis was used to perform the analysis. The lines were pre-stressed by temperature and internal pressure with fluid and insulation included as non-structural mass. Base excitation was added to the model using Power Spectral Density (PSD) data for the expected flight loads. The random vibration and static g-load cases were combined to obtain the total stress in the lines. This approach advances the state of the art in line analysis by using FEA to predict the stresses in the lines and to optimize the entire system based on the expected flight environment. Adding flexibility to lines has been used in piping system for temperature loads, but in flight environments flexibility has been limited for the static stresses. Adding flexibility to the system in a flight environment by reducing brackets has the benefit of reducing stresses and weight

Davis, Mark↗

An Active Subspace Method for Accelerating Convergence in Delaunay-Based Optimization via Dimension Reduction

Delaunay-based derivative-free optimization, ∆DOGS, is an efficient and provably-convergent global optimization method for the problems which has computationally expensive objection function and the analytical expression for the objective function is not available. ∆-DOGS is a novel optimization scheme in the family of response surface methods (RSMs); however, it suffers from the curse of dimensionality since the computational cost increases dramatically as the number of design parameters increases. As a result, the number of design parameters in ∆-DOGS algorithm is relatively low (n.10). To avoid such problems, this paper proposes a combination of derivative-free optimization, seeking the global minimizer of an expensive and nonconvex objective function f(x) and active subspace method, detecting the directions of the most variability using evaluations of the gradient. The contribution of other directions to the objective function is bounded by a sufficiently small constant. This new algorithm iteratively applied Delaunay-based derivative-free optimization to seek the minimizer on the d-dimensional active subspace that has most function variation. Inverse mapping is needed to project data from active subspace to full-model for evaluating function values. This task is overcome by solving an inequality constrained problem that curves the response surface of the objective function. The test results show that this strategy is effective on a handful of optimization problems.

Bewley, Thomas R.↗

Robust Optimal Experimental Design of Infinite-Dimensional Bayesian Nonlinear Inverse Problems

Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

Chowdhary, Abhijit↗

A Vehicle-to-Grid planning framework incorporating electric vehicle user equilibrium and distribution network flexibility enhancement

The rapid surge in electric vehicle (EV) adoption, coupled with advancements in charging technologies, emphasizes the critical necessity for expanding EV recharging infrastructure. Simultaneously, the Distribution Network (DN) encounters escalating challenges in meeting charging demand during peak traffic periods. Consequently, there is a mounting demand for the deployment of innovative Vehicle-to-Grid (V2G) technologies to augment the DN’s flexibility in power dispatch and alleviate travel costs for EV users. Hence, this paper proposes an EV-user-equilibrium-(UE)-constrained V2G planning framework that enhances flexibility in the DN. The framework aims to ascertain the optimal placement and capacity of EV charging stations (EVCSs) and V2G charging piles within the Transportation Network (TN). It takes into account the equilibrium condition stemming from competitive EV charging and routing behaviors alongside the optimal expansion of DN energy resources to accommodate the electricity supplied by the V2G piles. This study commences by analyzing EV drivers’ travel decisions, considering the influence of charging and V2G pile locations and sizes. Subsequently, we tackle the Traffic Assignment Problem with User Equilibrium (TAP-UE) model to characterize the steady-state traffic flow distribution of EVs. Following this, we formulate the optimization model for the Coordinated Power and Transportation Network (CPTN), which encompasses the optimal expansion of DN facilities and traffic flow regulation under UE conditions. To mitigate the computational complexity associated with the V2G planning model, we introduce a series of linearization methods to obtain a manageable Mixed-Integer Linear Programming (MILP) solution. Finally, to validate the efficacy of our proposed planning framework, we apply it to two test systems, including a real-world case study. Through these case studies, we explore the necessity and potential benefits of V2G technologies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Lyapunov optimal feedback control of a nonlinear inverted pendulum

Liapunov optimal feedback control is applied to a nonlinear inverted pendulum in which the control torque was constrained to be less than the nonlinear gravity torque in the model. This necessitates a control algorithm which 'rocks' the pendulum out of its potential wells, in order to stabilize it at a unique vertical position. Simulation results indicate that a preliminary Liapunov feedback controller can successfully overcome the nonlinearity and bring almost all trajectories to the target.

Grantham, W. J.↗

Temporal Changes in Astronauts’ Muscle and Cardiorespiratory Physiology Before, During and After Spaceflight

Background: NASA’s planned space exploration missions will require astronauts to safely perform extravehicular activity (EVA) and to safely egress vehicles in a variety of landing scenarios. Prolonged exposure to spaceflight can diminish tolerance for physical activity, decrease cardiovascular and sensorimotor function, and cause loss of bone mineral density, and reduced muscle mass and strength. Although exercise can mitigate these spaceflight-induced physiological decrements, little is known regarding the time-course of changes in muscle and aerobic performance during spaceflight. Furthermore, these exercise countermeasures are not fully protective. For example, maximal aerobic capacity (VO2pk), lower body muscle cross-sectional area, and strength decrease by about 10% to 15% after short- (~ 14 days) and long-duration (~ 6 months) missions on the International Space Station (ISS). Future space missions that are longer in duration and further from Earth will employ exploration vehicles that will have exercise hardware with less robust and more constrained exercise capabilities than of those available on the ISS. Thus, countermeasures will need to be optimized to protect crew health and performance on exploration-class missions that will last up to 3 years. This will require a more detailed understanding of the dynamic effects of spaceflight on human health and performance, and the ability of exercise to protect against this deconditioning, and the interaction of exercise with interrelated factors like nutrition, sleep, and environmental conditions. Methods: We will use standardized research and medical testing protocols previously validated in 1-G and 0-G to quantify the time course and the inter-individual variability of changes in physical performance, including cardiorespiratory fitness, and muscle strength, and endurance, before, during and after spaceflight missions lasting 2 months, 6 months, and 1 year. Additionally, we will use an extrapolation model to predict changes associated with 2–3-year exploration missions. Additionally, we will monitor in-flight exercise, nutrition, and sleep using in-flight assessment tools. Significance: Our testing protocols will provide valuable information for determining time course of change and the interindividual variability of spaceflight-induced deconditioning of aerobic capacity and muscle strength and endurance over the course of spaceflight missions up to and beyond 1 year. This information will be vital to assess whether humans can be physically ready for deep space exploration, such as on a mission to Mars, using current technology, or if additional mitigation strategies are necessary.

countermeasures↗

Temporal Changes in Astronauts’ Muscle and Cardiorespiratory Physiology Before, During, and After Spaceflight

Background: NASA’s planned space exploration missions will require astronauts to safely perform extravehicular activity (EVA) and to safely egress vehicles in a variety of landing scenarios. Prolonged exposure to spaceflight can diminish tolerance for physical activity, decrease cardiovascular and sensorimotor function, cause loss of bone mineral density, as well as reduced muscle mass and strength. Although exercise can mitigate these spaceflight-induced physiological decrements, little is known regarding the time-course of changes in muscle and aerobic performance during spaceflight. Furthermore, these exercise countermeasures are not fully protective. For example, maximal aerobic capacity (VO2pk), lower body muscle cross-sectional area, and strength decrease by about 10% to 15% after short- (≈14 days) and long-duration (≈6 months) missions on the International Space Station (ISS). Future space missions longer in duration and further from Earth will employ exploration vehicles that will have exercise hardware with less robust and more constrained exercise capabilities than of those available on the ISS. Thus, countermeasures will need to be optimized to protect crew health and performance on exploration-class missions lasting up to 3 years. This requires a more detailed understanding of the dynamic effects of spaceflight on human health and performance, the ability of exercise to protect against this deconditioning, and the interaction of exercise with interrelated factors like nutrition, sleep, and environmental conditions. Methods: We will use standardized research and medical testing protocols previously validated in 1g and microgravity to quantify the time course and the inter-individual variability of changes in physical performance, including cardiorespiratory fitness and muscle strength and endurance, before, during, and after spaceflight missions lasting 2 months, 6 months, and 1 year. Additionally, we will use an extrapolation model to predict changes associated with multi-year exploration missions. Additionally, we will monitor in-flight exercise, nutrition, and sleep using in-flight assessment tools. Significance: Our testing protocols will provide valuable information for determining time course of change and the interindividual variability of spaceflight-induced deconditioning of aerobic capacity and muscle strength and endurance over the course of spaceflight missions up to and beyond 1 year. This information will be vital to assess whether humans can be physically ready for deep space exploration, such as on a mission to Mars, using current technology, or if additional mitigation strategies are necessary.

N Strock↗

Description of Sensor Assignment Optimization Method as Deployed on a Multi-Node Cluster

Data analytic methods are being developed to address the problem of how to assign a sensor set in a nuclear facility such that a requisite level of process monitoring capability is realized and that the sensor set is sufficiently rich to determine the status of the individual sensors with respect to need for calibration. There is an awareness in the nuclear industry that data analytics combined with rich sensor sets represent a means to improve operations and reduce costs. In the industry the calibration problem has been previously approached as an empirical data-driven problem with several methods having been developed. However, the experience of the utilities over the past ten years with these methods indicates that the absence of physics-based information renders the data-driven approach less reliable. Complicating factors such as the inherent variability of operation (both equipment alignment and operating condition) can confound a pure data-driven approach while there are no rigorous guidelines for determining what constitutes an adequate sensor set. The solution under development to overcome these shortcomings supplements the data analytic method with process information in a so-called process-constrained data-analytic approach. Simple balance equations are written for generic components (e.g., mechanical pump, valve, and heat exchanger). These do not require a priori knowledge of process parameters, such as heat transfer coefficients or friction factors. All that is needed on the part of the utility user is to identify the components and how they are connected. This report describes the development of a parallel computing capability for determining the optimal sensor set. The optimal sensor set problem suffers from the curse of dimensionality. Computation time increases exponentially as the size of the system grows. To overcome this difficulty a pre-conditioner algorithm is developed to find an approximate solution close the actual solution. This serves as a seed for the full-blown algorithm and acts to constrain the space that must searched. The optimization algorithms are described and the implementation on a parallel computing platform is described. The application of the method to a use case we are solving in collaboration with our utility partner served to illustrate how the default sensor set in a nuclear plant may not provide sufficient coverage to infer sensor calibration status.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Bayesian optimization with active learning of design constraints using an entropy-based approach

Abstract The design of alloys for use in gas turbine engine blades is a complex task that involves balancing multiple objectives and constraints. Candidate alloys must be ductile at room temperature and retain their yield strength at high temperatures, as well as possess low density, high thermal conductivity, narrow solidification range, high solidus temperature, and a small linear thermal expansion coefficient. Traditional Integrated Computational Materials Engineering (ICME) methods are not sufficient for exploring combinatorially-vast alloy design spaces, optimizing for multiple objectives, nor ensuring that multiple constraints are met. In this work, we propose an approach for solving a constrained multi-objective materials design problem over a large composition space, specifically focusing on the Mo-Nb-Ti-V-W system as a representative Multi-Principal Element Alloy (MPEA) for potential use in next-generation gas turbine blades. Our approach is able to learn and adapt to unknown constraints in the design space, making decisions about the best course of action at each stage of the process. As a result, we identify 21 Pareto-optimal alloys that satisfy all constraints. Our proposed framework is significantly more efficient and faster than a brute force approach.

36 MATERIALS SCIENCE↗

Reinforcement learning pulses for transmon qubit entangling gates

The utility of a quantum computer is highly dependent on the ability to reliably perform accurate quantum logic operations. For finding optimal control solutions, it is of particular interest to explore model-free approaches, since their quality is not constrained by the limited accuracy of theoretical models for the quantum processor—in contrast to many established gate implementation strategies. In this work, we utilize a continuous control reinforcement learning algorithm to design entangling two-qubit gates for superconducting qubits; specifically, our agent constructs cross-resonance and CNOT gates without any prior information about the physical system. Using a simulated environment of fixed-frequency fixed-coupling transmon qubits, we demonstrate the capability to generate novel pulse sequences that outperform the standard cross-resonance gates in both fidelity and gate duration, while maintaining a comparable susceptibility to stochastic unitary noise. We further showcase an augmentation in training and input information that allows our agent to adapt its pulse design abilities to drifting hardware characteristics, importantly, with little to no additional optimization. Our results exhibit clearly the advantages of unbiased adaptive-feedback learning-based optimization methods for transmon gate design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Framework for a Supervisory Expert System for Robotic Manipulators with Joint-Position Limits and Joint-Rate Limits

This report addresses the problem of path planning and control of robotic manipulators which have joint-position limits and joint-rate limits. The manipulators move autonomously and carry out variable tasks in a dynamic, unstructured and cluttered environment. The issue considered is whether the robotic manipulator can achieve all its tasks, and if it cannot, the objective is to identify the closest achievable goal. This problem is formalized and systematically solved for generic manipulators by using inverse kinematics and forward kinematics. Inverse kinematics are employed to define the subspace, workspace and constrained workspace, which are then used to identify when a task is not achievable. The closest achievable goal is obtained by determining weights for an optimal control redistribution scheme. These weights are quantified by using forward kinematics. Conditions leading to joint rate limits are identified, in particular it is established that all generic manipulators have singularities at the boundary of their workspace, while some have loci of singularities inside their workspace. Once the manipulator singularity is identified the command redistribution scheme is used to compute the closest achievable Cartesian velocities. Two examples are used to illustrate the use of the algorithm: A three link planar manipulator and the Unimation Puma 560. Implementation of the derived algorithm is effected by using a supervisory expert system to check whether the desired goal lies in the constrained workspace and if not, to evoke the redistribution scheme which determines the constraint relaxation between end effector position and orientation, and then computes optimal gains.

Mutambara, Arthur G. O.↗