Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithms 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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Advanced rotorcraft control using parameter optimization

A reliable algorithm for the evaluation of a quadratic performance index and its gradients with respect to the controller design parameters is presented. The algorithm is part of a design algorithm for an optimal linear dynamic output feedback controller that minimizes a finite time quadratic performance index. The numerical scheme is particularly robust when it is applied to the control law synthesis for systems with densely packed modes and where there is a high likelihood of encountering degeneracies in the closed loop eigensystem. This approach through the use of a accurate Pade series approximation does not require the closed loop system matrix to be diagonalizable. The algorithm has been included in a control design package for optimal robust low order controllers. Usefulness of the proposed numerical algorithm has been demonstrated using numerous practical design cases where degeneracies occur frequently in the closed loop system under an arbitrary controller design initialization and during the numerical search.

Vansteenwyk, Brett↗
NASA NTRSDate not supplied

Robust Trajectory Optimization for Guided Powered Descent and Landing

A robust trajectory optimization approach for guidance algorithm gain selection for powered descent and landing is developed. This approach uses a genetic algorithm to determine optimal guidance algorithm parameters while incorporating uncertainty information from linear covariance analysis. The optimal guidance algorithm parameters are determined while accounting for environment, navigation, and vehicle property uncertainty and sensor suite fidelity. As a demonstration of this method, the optimal gains for the fractional polynomial powered descent guidance are found for the braking phase of a robotic lunar landing mission. Scenarios with differing sensor suites and sensor qualities are considered, with objective functions to minimize variability in propellant usage or terminal position. Results show that the optimal guidance algorithm gains for a given trajectory differ based on the sensor suite, and optimal guidance algorithm gains may result in up to 20% performance improvements over the baseline in propellant usage and landed accuracy.

Grace E Calkins↗
DOE OSTI2024

Optimization using pathwise algorithmic derivatives of electromagnetic shower simulations

Among the well-known methods to approximate derivatives of expectancies computed by Monte-Carlo simulations, averages of pathwise derivatives are often the easiest one to apply. Computing them via algorithmic differentiation typically does not require major manual analysis and rewriting of the code, even for very complex programs like simulations of particle-detector interactions in high-energy physics. However, the pathwise derivative estimator can be biased if there are discontinuities in the program, which may diminish its value for applications. This work integrates algorithmic differentiation into the electromagnetic shower simulation code HepEmShow based on G4HepEm, allowing us to study how well pathwise derivatives approximate derivatives of energy depositions in a sampling calorimeter with respect to parameters of the beam and geometry. We found that when multiple scattering is disabled in the simulation, means of pathwise derivatives converge quickly to their expected values, and these are close to the actual derivatives of the energy deposition. Additionally, we demonstrate the applicability of this novel gradient estimator for stochastic gradient-based optimization in a model example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1995

Genetic-Algorithm Tool For Search And Optimization

SPLICER computer program used to solve search and optimization problems. Genetic algorithms adaptive search procedures (i.e., problem-solving methods) based loosely on processes of natural selection and Darwinian "survival of fittest." Algorithms apply genetically inspired operators to populations of potential solutions in iterative fashion, creating new populations while searching for optimal or nearly optimal solution to problem at hand. Written in Think C.

Wang, Lui↗
NASA NTRS2011

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↗
NASA NTRS1995

Practical aspects of variable reduction formulations and reduced basis algorithms in multidisciplinary design optimization

This paper discusses certain connections between nonlinear programming algorithms and the formulation of optimization problems for systems governed by state constraints. The major points of this paper are the detailed calculation of the sensitivities associated with different formulations of optimization problems and the identification of some useful relationships between different formulations. These relationships have practical consequences; if one uses a reduced basis nonlinear programming algorithm, then the implementations for the different formulations need only differ in a single step.

Lewis, Robert Michael↗
DOE OSTI2025

Powering the Woods Hole X-Spar Buoy with Ocean Wave Energy—A Control Co-Design Feasibility Study

Despite its success in measuring air–sea exchange, the Woods Hole Oceanographic Institution’s (WHOI) X-Spar Buoy faces operational limitations due to energy constraints, motivating the integration of an energy harvesting apparatus to improve its deployment duration and capabilities. This work explores the feasibility of an augmented, self-powered system in two parts. Part 1 presents the collaborative design between X-Spar developers and wave energy researchers translating user needs into specific functional requirements. Based on requirements like desired power levels, deployability, survivability, and minimal interference with environmental data collection, unsuitable concepts are pre-eliminated from further feasibility study consideration. In part 2, we focus on one of the promising concepts: an internal rigid body wave energy converter. We apply control co-design methods to consider commercial of the shelf hardware components in the dynamic models and investigate the concept’s power conversion capabilities using linear 2-port wave-to-wire models with concurrently optimized control algorithms that are distinct for every considered hardware configuration. During this feasibility study we utilize two different control algorithms, the numerically optimal (but acausal) benchmark and the optimized damping feedback. We assess the sensitivity of average power to variations in drive-train friction, a parameter with high uncertainty, and analyze stroke limitations to ensure operational constraints are met. Our results indicate that a well-designed power take-off (PTO) system could significantly extend the WEC-Spar’s mission by providing additional electrical power without compromising data quality.

autonomous systems↗
NASA NTRS1977

An application of the square root information filter to large scale linear interconnected systems

It is demonstrated that use of the square root information filter (SRIF) can reduce the storage and computation required for estimation of certain classes of large-scale interconnected systems. The SRIF uses an information array that is related to the Kalman filter covariance and estimate. The SRIF algorithm, which is optimal, is a direct application of matrix partitioning to some optimal filtering algorithms described in the literature. The SRIF algorithm is able to reduce the storage requirements of a 40-subsystem 10-state problem by a full order of magnitude.

Bierman, G. J.↗
NASA NTRS1981

Optimization of thrust algorithm calibration for Computing System (TCS) for Thrust the NASA Highly Maneuverable Aircraft Technology (HiMAT) vehicle's propulsion system

A simplified gross thrust computing technique for the HiMAT J85-GE-21 engine using altitude facility data was evaluated. The results over the full engine envelope for both the standard engine mode and the open nozzle engine mode are presented. Results using afterburner casing static pressure taps are compared to those using liner static pressure taps. It is found that the technique is very accurate for both the standard and open nozzle engine modes. The difference in the algorithm accuracy for a calibration based on data from one test condition was small compared to a calibration based on data from all of the test conditions.

Hamer, M. J.↗
NASA NTRS1988

Shuttle Entry Air Data System (SEADS) - Optimization of preflight algorithms based on flight results

The SEADS pressure model algorithm results were tested against other sources of air data, in particular, the Shuttle Best Estimated Trajectory (BET). The algorithm basis was also tested through a comparison of flight-measured pressure distribution vs the wind tunnel database. It is concluded that the successful flight of SEADS and the subsequent analysis of the data shows good agreement between BET and SEADS air data.

Wolf, H.↗
NASA NTRS1994

Algorithms for bilevel optimization

General multilevel nonlinear optimization problems arise in design of complex systems and can be used as a means of regularization for multi-criteria optimization problems. Here, for clarity in displaying our ideas, we restrict ourselves to general bi-level optimization problems, and we present two solution approaches. Both approaches use a trust-region globalization strategy, and they can be easily extended to handle the general multilevel problem. We make no convexity assumptions, but we do assume that the problem has a nondegenerate feasible set. We consider necessary optimality conditions for the bi-level problem formulations and discuss results that can be extended to obtain multilevel optimization formulations with constraints at each level.

Alexandrov, Natalia↗
NASA NTRS2011

Optimization of Adaboost Algorithm for Sonar Target Detection in a Multi-Stage ATR System

JPL has developed a multi-stage Automated Target Recognition (ATR) system to locate objects in images. First, input images are preprocessed and sent to a Grayscale Optical Correlator (GOC) filter to identify possible regions-of-interest (ROIs). Second, feature extraction operations are performed using Texton filters and Principal Component Analysis (PCA). Finally, the features are fed to a classifier, to identify ROIs that contain the targets. Previous work used the Feed-forward Back-propagation Neural Network for classification. In this project we investigate a version of Adaboost as a classifier for comparison. The version we used is known as GentleBoost. We used the boosted decision tree as the weak classifier. We have tested our ATR system against real-world sonar images using the Adaboost approach. Results indicate an improvement in performance over a single Neural Network design.

Adaboost↗
NASA NTRS2022

Optimized Umkehr Profile Algorithm for Ozone Trend Analyses

The long-term record of Umkehr measurements from four NOAA Dobson spectrophotometers was reprocessed after updates to the instrument calibration procedures. In addition, a new data quality-control tool was developed for the Dobson automation software (WinDobson). This paper presents a comparison of Dobson Umkehr ozone profiles from NOAA ozone network stations (Boulder, OHP, MLO, Lauder) against several satellite records, including Aura Microwave Limb Sounder (MLS; ver. 4.2), and combined SBUV and OMPS records (NASA AGG and NOAA COH). A subset of satellite data is selected to match Dobson Umkehr observations at each station spatially (distance less than 200 km) and temporally (within 24 hours). Umkehr Averaging Kernels (AKs) are applied to vertically smooth all overpass satellite profiles prior to comparisons. The station Umkehr record consists of several instrumental records, which have different optical characterizations, and thus instrument-specific stray light contributes to the data processing errors and creates step changes in the record. This work evaluates the overall quality of Umkehr long-term measurements at NOAA ground-based stations and assesses the impact of the instrumental changes on the stability of the Umkehr ozone profile record. This paper describes a method designed to correct biases and discontinuities in the retrieved Umkehr profile that originate from the Dobson calibration process, repair, or optical realignment of the instrument. The M2GMI and GMI CTM ozone profile model output matched to station location and date of observation is used to evaluate instrumental step changes in the Umkehr record. Homogenization of the Umkehr record and discussion of the apparent stray light error in retrieved ozone profiles are the focus of this paper. Homogenization of ground-based records is of great importance for studies of long-term ozone trends and climate change.

Umkehr↗
NASA NTRSDate not supplied

A NASA Perspective on Quantum Computing: Algorithmic Opportunities and Challenges

In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can provide an advantage, and if so how to design quantum algorithms that realize such advantages. Today, classical heuristics are used to solve many of the most challenging computational problems arising in the practical world, algorithms that have been shown to be effective empirically but have not been mathematically proven to outperform other approaches. With the advent of quantum advantage, the ability of current quantum hardware to do certain computations beyond the ability of even that largest supercomputers, we have an unprecedented opportunity to explore heuristic quantum algorithms. The next few years will be exciting as empirical testing of quantum heuristic algorithms becomes more and more feasible. The talk will begin overview of the NASA QuAIL team’s ongoing quantum computing investigations, and then focus on both near-term and longer term algorithms for optimization, including distributed algorithms.

quantum computing↗