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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Control-System Design Program

Control-theory design package, Optimal Regulator Algorithms for Control of Linear Systems (ORACLS), developed to aid in design of controllers and optimal filters for systems modeled by linear, time-invariant differential and difference equations. Optimal linear quadratic regulator theory, Linear-Quadratic-Gaussian (LQG) problem, most widely accepted method of determining optimal control policy. Provides for solution to time-in-variant continuous or discrete LQG problems. Attractive to control-system designer providing rigorous tool for dealing with multi-input and multi-output dynamic systems in continuous and discrete form. CDO version written in FORTRAN IV. VAX version written in FORTRAN 77.

Frisch, Harold P.↗
NASA NTRS2014

Improved Algorithms for Accurate Retrieval of UV - Visible Diffuse Attenuation Coefficients in Optically Complex, Inshore Waters

Photochemical processes driven by high-energy ultraviolet radiation (UVR) in inshore, estuarine, and coastal waters play an important role in global bio geochemical cycles and biological systems. A key to modeling photochemical processes in these optically complex waters is an accurate description of the vertical distribution of UVR in the water column which can be obtained using the diffuse attenuation coefficients of down welling irradiance (Kd()). The Sea UV Sea UVc algorithms (Fichot et al., 2008) can accurately retrieve Kd ( 320, 340, 380,412, 443 and 490 nm) in oceanic and coastal waters using multispectral remote sensing reflectances (Rrs(), Sea WiFS bands). However, SeaUVSeaUVc algorithms are currently not optimized for use in optically complex, inshore waters, where they tend to severely underestimate Kd(). Here, a new training data set of optical properties collected in optically complex, inshore waters was used to re-parameterize the published SeaUVSeaUVc algorithms, resulting in improved Kd() retrievals for turbid, estuarine waters. Although the updated SeaUVSeaUVc algorithms perform best in optically complex waters, the published SeaUVSeaUVc models still perform well in most coastal and oceanic waters. Therefore, we propose a composite set of SeaUVSeaUVc algorithms, optimized for Kd() retrieval in almost all marine systems, ranging from oceanic to inshore waters. The composite algorithm set can retrieve Kd from ocean color with good accuracy across this wide range of water types (e.g., within 13 mean relative error for Kd(340)). A validation step using three independent, in situ data sets indicates that the composite SeaUVSeaUVc can generate accurate Kd values from 320 490 nm using satellite imagery on a global scale. Taking advantage of the inherent benefits of our statistical methods, we pooled the validation data with the training set, obtaining an optimized composite model for estimating Kd() in UV wavelengths for almost all marine waters. This optimized composite set of SeaUVSeaUVc algorithms will provide the optical community with improved ability to quantify the role of solar UV radiation in photochemical and photobiological processes in the ocean.

UV↗
NASA NTRS2004

Autonomous In-Situ Resources Prospector

This presentation will describe the concept of an autonomous, intelligent, rover-based rapid surveying system to identify and map several key lunar resources to optimize their ISRU (In Situ Resource Utilization) extraction potential. Prior to an extraction phase for any target resource, ground-based surveys are needed to provide confirmation of remote observation, to quantify and map their 3-D distribution, and to locate optimal extraction sites (e.g. ore bodies) with precision to maximize their economic benefit. The system will search for and quantify optimal minerals for oxygen production feedstock, water ice, and high glass-content regolith that can be used for building materials. These are targeted because of their utility and because they are, or are likely to be, variable in quantity over spatial scales accessible to a rover (i.e., few km). Oxygen has benefits for life support systems and as an oxidizer for propellants. Water is a key resource for sustainable exploration, with utility for life support, propellants, and other industrial processes. High glass-content regolith has utility as a feedstock for building materials as it readily sinters upon heating into a cohesive matrix more readily than other regolith materials or crystalline basalts. Lunar glasses are also a potential feedstock for oxygen production, as many are rich in iron and titanium oxides that are optimal for oxygen extraction. To accomplish this task, a system of sensors and decision-making algorithms for an autonomous prospecting rover is described. One set of sensors will be located in the wheel tread of the robotic search vehicle providing contact sensor data on regolith composition. Another set of instruments will be housed on the platform of the rover, including VIS-NIR imagers and spectrometers, both for far-field context and near-field characterization of the regolith in the immediate vicinity of the rover. Also included in the sensor suite are a neutron spectrometer, ground-penetrating radar, and an instrumented cone penetrometer for subsurface assessment. Output from these sensors will be evaluated autonomously in real-time by decision-making software to evaluate if any of the targeted resources has been detected, and if so, to quantify their abundance. Algorithms for optimizing the mapping strategy based on target resource abundance and distribution are also included in the autonomous software. This approach emphasizes on-the-fly survey measurements to enable efficient and rapid prospecting of large areas, which will improve the economics of ISRU system approaches. The mature technology will enable autonomous rovers to create in-situ resource maps of lunar or other planetary surfaces, which will facilitate human and robotic exploration.

Dissly, R. W.↗
NASA NTRS2001

Pre-Hardware Optimization of Spacecraft Image Processing Software Algorithms and Hardware Implementation

Spacecraft telemetry rates have steadily increased over the last decade presenting a problem for real-time processing by ground facilities. This paper proposes a solution to a related problem for the Geostationary Operational Environmental Spacecraft (GOES-8) image processing application. Although large super-computer facilities are the obvious heritage solution, they are very costly, making it imperative to seek a feasible alternative engineering solution at a fraction of the cost. The solution is based on a Personal Computer (PC) platform and synergy of optimized software algorithms and re-configurable computing hardware technologies, such as Field Programmable Gate Arrays (FPGA) and Digital Signal Processing (DSP). It has been shown in [1] and [2] that this configuration can provide superior inexpensive performance for a chosen application on the ground station or on-board a spacecraft. However, since this technology is still maturing, intensive pre-hardware steps are necessary to achieve the benefits of hardware implementation. This paper describes these steps for the GOES-8 application, a software project developed using Interactive Data Language (IDL) (Trademark of Research Systems, Inc.) on a Workstation/UNIX platform. The solution involves converting the application to a PC/Windows/RC platform, selected mainly by the availability of low cost, adaptable high-speed RC hardware. In order for the hybrid system to run, the IDL software was modified to account for platform differences. It was interesting to examine the gains and losses in performance on the new platform, as well as unexpected observations before implementing hardware. After substantial pre-hardware optimization steps, the necessity of hardware implementation for bottleneck code in the PC environment became evident and solvable beginning with the methodology described in [1], [2], and implementing a novel methodology for this specific application [6]. The PC-RC interface bandwidth problem for the class of applications with moderate input-output data rates but large intermediate multi-thread data streams has been addressed and mitigated. This opens a new class of satellite image processing applications for bottleneck problems solution using RC technologies. The issue of a science algorithm level of abstraction necessary for RC hardware implementation is also described. Selected Matlab functions already implemented in hardware were investigated for their direct applicability to the GOES-8 application with the intent to create a library of Matlab and IDL RC functions for ongoing work. A complete class of spacecraft image processing applications using embedded re-configurable computing technology to meet real-time requirements, including performance results and comparison with the existing system, is described in this paper.

Kizhner, Semion↗
NASA NTRS1994

Massively Parallel Algorithms for Real-Time Wavefront Control of a Dense Adaptive Optics System

In this paper massively parallel algorithms and architectures for real-time wavefront control of a dense adaptive optic system (SELENE) are presented. We have already shown that the computation of a near optimal control algorithm for SELENE can be reduced to the solution of a discrete Poisson equation on a regular domain. Although this represents an optimal computation, due the large size of the system and the high sampling rate requirement, the implementation of this control algorithm poses a computationally challenging problem since it demands a sustained computational throughput of the order of 10 GFlops. We develop a novel algorithm, designated as Fast Invariant Imbedding algorithm, which offers a massive degree of parallelism with simple communication and synchronization requirements. Due to these features, our algorithm is significantly more efficient than other Fast Poisson Solvers for implementation on massively parallel architectures.

massively↗
NASA NTRS1992

A study of equation solvers for linear and non-linear finite element analysis on parallel processing computers

Concurrent computing environments provide the means to achieve very high performance for finite element analysis of systems, provided the algorithms take advantage of multiple processors. The authors have examined several algorithms for both linear and nonlinear finite element analysis. The performance of these algorithms on an Alliant FX/80 parallel supercomputer has been studied. For single load case linear analysis, the optimal solution algorithm is strongly problem dependent. For multiple load cases or nonlinear analysis through a modified Newton-Raphson method, decomposition algorithms are shown to have a decided advantage over element-by-element preconditioned conjugate gradient algorithms.

Watson, Brian C.↗
NASA NTRS2005

Distributed Optimization

We demonstrate a new framework for analyzing and controlling distributed systems, by solving constrained optimization problems with an algorithm based on that framework. The framework is ar. information-theoretic extension of conventional full-rationality game theory to allow bounded rational agents. The associated optimization algorithm is a game in which agents control the variables of the optimization problem. They do this by jointly minimizing a Lagrangian of (the probability distribution of) their joint state. The updating of the Lagrange parameters in that Lagrangian is a form of automated annealing, one that focuses the multi-agent system on the optimal pure strategy. We present computer experiments for the k-sat constraint satisfaction problem and for unconstrained minimization of NK functions.

Macready, William↗
NASA NTRS1983

Solution algorithms for non-linear singularly perturbed optimal control problems

The applicability and usefulness of several classical and other methods for solving the two-point boundary-value problem which arises in non-linear singularly perturbed optimal control are assessed. Specific algorithms of the Picard, Newton and averaging types are formally developed for this class of problem. The computational requirements associated with each algorithm are analysed and compared with the computational requirement of the method of matched asymptotic expansions. Approximate solutions to a linear and a non-linear problem are obtained by each method and compared.

Ardema, M. D.↗
NASA NTRS2005

Coherent Optical Receiver for PPM Signals under Atmospheric Turbulence

Adaptive combining of experimentally obtained heterodyned pulse position modulated (PPM) signals with pulse-to-pulse coherence in the presence of simulated spatial distortions resembling atmospheric turbulence is demonstrated. The adaptively combined PPM signals are phased up via an LMS algorithm suitably optimized to operate with PPM in the presence of additive shot-noise. A convergence analysis of the algorithm is presented, and results with both, computer simulated and experimentally obtained PPM signals are analyzed.

coherent detection↗
NASA NTRS2004

Adaptive Combining of Coherently Detected PPM Signals in the Presence of Atmospheric Turbulence

Adaptive combining of experimentally obtained heterodyned pulse position modulated (PPM) signals with pulse-to-pulse coherence, in the presence of simulated spatial distortions resembling atmospheric turbulence, is demonstrated. The adaptively combined PPM signals are phased up via an LMS algorithm suitably optimized to operate with PPM in the presence of additive shot-noise. A convergence study of the algorithm is presented, and results with both computer simulated and experimentally obtained PPM signals are presented and analyzed.

pulse position modulation (PPM)↗
DOE OSTI2024

A Workflow to Optimize Fast Neutron Irradiation in A Thermal Neutron Spectrum Test Reactor Leveraging Open-Source Tools

The Advanced Test Reactor (ATR) located at Idaho National Laboratory (INL) is one of the key nuclear engineering research and testing facilities within the US Department of Energy (DOE). The ATR is one of few high-power research reactors in the world with different application including accelerated testing of nuclear fuel, materials irradiation in a very high neutron flux environment, and medical radioisotope production [1]. Also, the ATR offers opportunities for testing fast spectrum fission and fusion reactor materials. The key challenges in this area are in further detailing and optimizing a fast spectrum environment within a thermal test reactor. This challenge involves researching, developing, and testing novel concepts for the multiplying of neutron populations into ever higher energy spectra in high flux test reactors like ATR. The main objective of this work is to investigate candidate materials for establishing a fast neutron experiment irradiation in thermal neutron spectrum test reactors which can be accomplished by filtering thermal and epithermal neutrons and boosting fast neutrons at designated irradiation positions. However, adding these filters will render the neutron spectrum and the criticality of the system. The selection of the thickness and material layers should be accomplished by developing an optimization design algorithm that is applicable for ATR to enhance the fast neutron spectrum irradiation utilizing high-fidelity Monte Carlo methods along with advanced machine learning capabilities. This paper presents workflow for design optimization to enhance fast neutron irradiation in the ATR. The workflow leverages open-source tools to develop an algorithm that is viable to ATR and can be leveraged in other reactors. The following sections discuss the development of the experiment design optimization workflow and its application to ATR irradiation positions.

42 - ENGINEERING↗
DOE OSTI2024

Multistart algorithm for identifying all optima of nonconvex stochastic functions

Here, we propose a multistart algorithm to identify all local minima of a constrained, nonconvex stochastic optimization problem. The algorithm uniformly samples points in the domain and then starts a local stochastic optimization run from any point that is the "probabilistically best" point in its neighborhood. Under certain conditions, our algorithm is shown to asymptotically identify all local optima with high probability; this holds even though our algorithm is shown to almost surely start only finitely many local stochastic optimization runs. We demonstrate the performance of an implementation of our algorithm on nonconvex stochastic optimization problems, including identifying optimal variational parameters for the quantum approximate optimization algorithm.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2020

Instrument Offset Optimization Technique for Airborne Doppler Wind Lidar Profiling Algorithm

This paper presents the instrument offset optimization technique for the Doppler Aerosol Wind Lidar (DAWN) profiling algorithm at NASA Langley Research Center (LaRC). The 2 um Doppler wind Lidar system at LaRC has a long history of research development and airborne campaigns. The core of the wind Lidar data processing is Airborne Wind Profiling Algorithm for Doppler Wind Lidar (APOLO), which was developed at LaRC. The extraction of wind parameters from the airborne Doppler wind Lidar data is challenging due to many factors such as the speed of aircraft, and the errors in instrument installation and calibration. It is unavoidable to prevent the adverse impact of calibration error and instrument installation offset on the performance of wind parameter estimation in the algorithm. Due to the unsteady environment where the data are collected, even a small offset will result in nonsensical results in the parameter estimation process. A brief introduction of APOLO and the overview of the optimization techniques are presented in this paper.

Wind profile↗
NASA NTRSDate not supplied

Performance Analysis of Magnetohydrodynamic Drag Modulation for Actively Controlled Aerocapture at Neptune

Missions to the Ice Giants are a top priority for flagship missions this coming decade. However, a fully propulsive orbital insertion into these planets requires an immense amount of fuel, taking a significant portion of the spacecraft mass and restricting the scientific payload. To mitigate this, aerocapture has been heavily investigated. Although simulations have shown that aerodynamically controlled aerocapture can successfully insert into an orbit around both Ice Giants, the deep atmospheric pass required necessitates a complex, mass expensive, and sometimes prohibitive thermal protection system. Magnetohydrodynamic drag modulation serves as a potential alternative control method for aerocapture which could not only save propellant mass compared to fully propulsive orbital insertion, but also save thermal protection system mass compared to conventional aerocapture methods. Both aerodynamically controlled and magnetohydrodynamically controlled aerocapture methodologies were simulated in NASA Langley’s high-fidelity six degree-of-freedom flight dynamics code, the Program to Optimize Simulated Trajectories II. Each method was simulated to identical missions to Neptune using a numerical predictor-corrector algorithm to optimize the control towards the target orbit. The results concluded that magnetohydrodynamic drag modulation can successfully capture and performs on par with aerodynamic drag modulation while significantly reducing the heatflux and aeroshell complexity.

Danny N Nguyen↗
NASA NTRS1986

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗
NASA NTRS1988

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗