Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization algorithms”

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 1,747 records · Page 97
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Recursive Implementations of the Consider Filter

One method to account for parameters errors in the Kalman filter is to consider their effect in the so-called Schmidt-Kalman filter. This work addresses issues that arise when implementing a consider Kalman filter as a real-time, recursive algorithm. A favorite implementation of the Kalman filter as an onboard navigation subsystem is the UDU formulation. A new way to implement a UDU consider filter is proposed. The non-optimality of the recursive consider filter is also analyzed, and a modified algorithm is proposed to overcome this limitation.

Zanetti, Renato↗
NASA NTRS2009

Parametric Optimization of Ares I Propellant Slosh Characteristics Using Frequency Response Criteria

A novel technique for developing propellant slosh damping requirements with respect to the stability characteristics of large flexible launch vehicles is presented. A numerical algorithm is devised which allows an automated software program to rapidly converge to pseudo-optimal solutions that minimize required propellant slosh damping for multiple tanks while maintaining constraints on the frequency response characteristics of a particular open-loop plant transfer function. An implementation of the algorithm using a high-order linear model of the Ares I plant dynamics considers all relevant dynamic interactions of flexible body modes, propellant slosh, and nozzle inertia effects. A high-resolution propellant damping requirements table is produced that can be used for baffle design. The method is demonstrated to provide exceptional speed and accuracy when compared with the alternative human-in-the-loop approach.

Orr, Jeb S.↗
NASA NTRS2001

A New Ensemble Canonical Correlation Prediction Scheme for Seasonal Precipitation

Department of Mathematical Sciences, University of Alberta, Edmonton, Canada This paper describes the fundamental theory of the ensemble canonical correlation (ECC) algorithm for the seasonal climate forecasting. The algorithm is a statistical regression sch eme based on maximal correlation between the predictor and predictand. The prediction error is estimated by a spectral method using the basis of empirical orthogonal functions. The ECC algorithm treats the predictors and predictands as continuous fields and is an improvement from the traditional canonical correlation prediction. The improvements include the use of area-factor, estimation of prediction error, and the optimal ensemble of multiple forecasts. The ECC is applied to the seasonal forecasting over various parts of the world. The example presented here is for the North America precipitation. The predictor is the sea surface temperature (SST) from different ocean basins. The Climate Prediction Center's reconstructed SST (1951-1999) is used as the predictor's historical data. The optimally interpolated global monthly precipitation is used as the predictand?s historical data. Our forecast experiments show that the ECC algorithm renders very high skill and the optimal ensemble is very important to the high value.

Kim, Kyu-Myong↗
NASA NTRS2008

Deep Space Network Scheduling Using Multi-Objective Optimization with Uncertainty

We have developed a novel technique to incorporate uncertainty modeling within an evolutionary algorithm approach to multi-objective scheduling, with the goal of identifying a Pareto frontier (tradeoff curve) that recognizes the likelihood of events that can impact the schedule outcome. Our approach is particularly applicable to the generation of multiobjective optimized robust schedules, where objectives are assigned a service level, for example that we require an objective value to be greater than or equal to X with Y% confidence. We have demonstrated that such an approach can, for example, minimize scheduling on less reliable resources, based solely on a resource reliability model and not on any ad hoc heuristics. We have also investigated an alternative method of optimizing for robustness, in which we add to the set of objectives a failure risk objective to minimize. We compare the advantages and disadvantages of these two approaches. Future plans for further developing this technology include its application to space-based observatory scheduling problems.

Johnston, Mark D.↗
NASA NTRSDate not supplied

Generalized Linear Targeting For Cislunar Flight

An important element of Artemis and NASA’s campaign to explore the Moon is the autonomous onboard two-level targeter (TLT) used during all cislunar flight phases. The function of the TLT is to autonomously recompute the burn targets for the upcoming burn (or multiple burns) in response to navigation and vehicle dispersion providing a solution that meets all of the trajectory constraints. Although the TLT has been utilized previously as a ground-based planning tool, and flown onboard during the Artemis I mission, it’s complexity and iterative nature make is difficult to incorporate into and support rapid analyses such as robust optimal trajectory design applications where speed is essential. In this paper, a set of generalized linear targeting algorithms that mimics many of the properties of the TLT is derived. The generalized algorithms can handle single or multiple impulsive maneuvers, with multiple constraints at multiple fixed or variable times. A linear targeting algorithm for finite burn maneuvers is also derived. The generalized linear targeting algorithms are exceptionally fast and easy to implement in Monte Carlo analysis, linear covariance (LinCov) analysis, and robust optimal trajectory design. Several cislunar flight examples are provided.

Linear Covariance Analysis↗
NASA NTRS1993

Kalman-Filter Estimation Of Unmeasured Output Variables

Kalman-filter "observer" algorithm used in estimating unmeasured output variables of turbofan engine. Unmeasured output variables needed along with measured output variables as feedback data to characterize state of aircraft-and-engine system for control purposes. Subsystem or processor implementing Kalman-filter algorithm incorporated into adaptive digital control system, called "performance-seeking" control system, developed to compute engine-control settings to optimize performance of aircraft under given pseudo-steady-state cruise conditions. Basic concept of algorithm not restricted to aircraft-engine application and can be extended to internal-combustion engines in land vehicles.

Gilyard, Glenn B.↗
NASA NTRS1989

An indirect method for numerical optimization using the Kreisselmeir-Steinhauser function

A technique is described for converting a constrained optimization problem into an unconstrained problem. The technique transforms one of more objective functions into reduced objective functions, which are analogous to goal constraints used in the goal programming method. These reduced objective functions are appended to the set of constraints and an envelope of the entire function set is computed using the Kreisselmeir-Steinhauser function. This envelope function is then searched for an unconstrained minimum. The technique may be categorized as a SUMT algorithm. Advantages of this approach are the use of unconstrained optimization methods to find a constrained minimum without the draw down factor typical of penalty function methods, and that the technique may be started from the feasible or infeasible design space. In multiobjective applications, the approach has the advantage of locating a compromise minimum design without the need to optimize for each individual objective function separately.

Wrenn, Gregory A.↗
NASA NTRS2018

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.↗
NASA NTRS1981

Optimal time splitting for two- and three-dimensional Navier-Stokes equations with mixed derivatives

A new explicit, time splitting algorithm has been developed for finite difference modelling of the full two and three-dimensional time-dependent, compressible, viscous Navier-Stokes equations of fluid mechanics. The scheme is optimal in the sense that the split operators achieve their maximum allowable time step, i.e., the corresponding Courant number. The algorithm allows a conservation-form formulation. Stability is proven analytically and verified numerically. In proving stability it was shown that all nine matrix coefficients of the Navier-Stokes equations are simultaneously symmetrizable by a similarity transformation. Two such transformations and their resulting symmetric matrix coefficients are presented explicitly.

Abarbanel, S.↗
NASA NTRS1990

An optimal sensing strategy of a proximity sensor system for recognition and localization of polyhedral objects

An algorithm is presented for the recognition and localization of thre-dimensional polyhedral objects based on an optical proximity sensor system capable of measuring the depth and orientation of a local area of an object surface. Emphasis is given to the determination of an optimal sensor trajectory or an optimal probing, for efficient discrimination among all the possible interpretations. The determination of an optimal sensor trajectory for the next probing consists of the selection of optimal beam orientations based on the surface normal vector distribution of the multiple interpretation image (MII) and the selection of an optimal probing plane by projecting the MII onto the projection plane perpendicular to a selected beam orientation and deriving the optimal path on the projection plane. The selection of optimal beam orientation and probing plane is based on the measure of discrimination power of a cluster of surfaces of an MII. Simulation results are shown.

Lee, Sukhan↗
NASA NTRS1979

Linear state feedback, quadratic weights, and closed loop eigenstructures

Results are given on the relationships between closed loop eigenstructures, state feedback gain matrices of the linear state feedback problem, and quadratic weights of the linear quadratic regulator. Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used for the first time to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalues and the directional derivatives of closed loop eigenvectors (with respect to a scalar multiplying the feedback gain matrix or the quadratic control weight). An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, sufficient conditions to be in it are given, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties.

Thompson, P. M.↗
NASA NTRS1971

Mascot - A new concept in guidance

Trajectory algorithm for complete trajectory from liftoff to landing with optimal control and onboard flight computer for use in manned space shuttle

Baker, C. D.↗
NASA NTRS1972

Reciprocal - MSE and SNR as distinct performance measures in below-threshold communication.

The possible advantages of using algorithms that are minimum mean-square-error (MSE) optimal, or other averaging-type demodulators with frequency position modulation (FPM), are investigated. An attempt is made to describe the performance of the optimal and various suboptimal demodulators in terms of three parameters which depend on SNR and bandwidth expansion. The performance measures investigated are the reciprocal of the normalized mean-square error and the output SNR, which are different in the below-threshold region. The former is compared to the rate-distortion bound. The possible advantage of averaging-type discriminators from the point of view of the threshold is discussed.

Bar-David, I.↗
NASA NTRS1976

Design of air-gapped magnetic-core inductors for superimposed direct and alternating currents

Using data on standard magnetic-material properties and standard core sizes for air-gap-type cores, an algorithm designed for a computer solution is developed which optimally determines the air-gap length and locates the quiescent point on the normal magnetization curve so as to yield an inductor design with the minimum number of turns for a given ac voltage and frequency and with a given dc bias current superimposed in the same winding. Magnetic-material data used in the design are the normal magnetization curve and a family of incremental permeability curves. A second procedure, which requires a simpler set of calculations, starts from an assigned quiescent point on the normal magnetization curve and first screens candidate core sizes for suitability, then determines the required turns and air-gap length.

Ohri, A. K.↗
NASA NTRS1980

A singular perturbation analysis of minimum time long range intercept

The application of singular perturbation theory for deriving algorithms suitable for on board real time computation of optimal aircraft trajectory control was investigated. Minimum time intercept in three dimensions was selected as a pilot problem formulation, and data for an early version F-4 aircraft was used to represent aircraft aerodynamic and propulsion characteristics. Results include the derivation of nonlinear, near optimal feedback control laws that are readily implementable in an aircraft flight computer, performance results for a variety of initial conditions (including optimal intercept at short ranges), and a point mass three dimensional simulation suitable for representing fighter aircraft under closed loop optimal control.

Calise, A.↗
NASA NTRS1980

ACCESS 3. Approximation concepts code for efficient structural synthesis: User's guide

A user's guide is presented for ACCESS-3, a research oriented program which combines dual methods and a collection of approximation concepts to achieve excellent efficiency in structural synthesis. The finite element method is used for structural analysis and dual algorithms of mathematical programming are applied in the design optimization procedure. This program retains all of the ACCESS-2 capabilities and the data preparation formats are fully compatible. Four distinct optimizer options were added: interior point penalty function method (NEWSUMT); second order primal projection method (PRIMAL2); second order Newton-type dual method (DUAL2); and first order gradient projection-type dual method (DUAL1). A pure discrete and mixed continuous-discrete design variable capability, and zero order approximation of the stress constraints are also included.

Fleury, C.↗