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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,783 records · Page 99

All sources NASA NTRS DOE OSTI

NASA NTRS1996

Advanced Intelligent System Application to Load Forecasting and Control for Hybrid Electric Bus

The primary motivation for this research emanates from providing a decision support system to the electric bus operators in the municipal and urban localities which will guide the operators to maintain an optimal compromise among the noise level, pollution level, fuel usage etc. This study is backed up by our previous studies on study of battery characteristics, permanent magnet DC motor studies and electric traction motor size studies completed in the first year. The operator of the Hybrid Electric Car must determine optimal power management schedule to meet a given load demand for different weather and road conditions. The decision support system for the bus operator comprises three sub-tasks viz. forecast of the electrical load for the route to be traversed divided into specified time periods (few minutes); deriving an optimal 'plan' or 'preschedule' based on the load forecast for the entire time-horizon (i.e., for all time periods) ahead of time; and finally employing corrective control action to monitor and modify the optimal plan in real-time. A fully connected artificial neural network (ANN) model is developed for forecasting the kW requirement for hybrid electric bus based on inputs like climatic conditions, passenger load, road inclination, etc. The ANN model is trained using back-propagation algorithm employing improved optimization techniques like projected Lagrangian technique. The pre-scheduler is based on a Goal-Programming (GP) optimization model with noise, pollution and fuel usage as the three objectives. GP has the capability of analyzing the trade-off among the conflicting objectives and arriving at the optimal activity levels, e.g., throttle settings. The corrective control action or the third sub-task is formulated as an optimal control model with inputs from the real-time data base as well as the GP model to minimize the error (or deviation) from the optimal plan. These three activities linked with the ANN forecaster proving the output to the GP model which in turn produces the pre-schedule of the optimal control model. Some preliminary results based on a hypothetical test case will be presented for the load forecasting module. The computer codes for the three modules will be made available fe adoption by bus operating agencies. Sample results will be provided using these models. The software will be a useful tool for supporting the control systems for the Electric Bus project of NASA.

Momoh, James↗

NASA NTRS2002

Synthesizing Monitors for Safety Properties

The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in time analysis of software. An algorithm which takes a past time LTL formula and generates an efficient dynamic programming algorithm is presented. The generated algorithm tests whether the formula is satisfied by a finite trace of events given as input and runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula. Further optimizations of the algorithm are suggested. Past time operators suitable for writing succinct specifications axe introduced and shown definitionally equivalent to the standard operators. This work is part of the PathExplorer project, the objective of which it is to construct a flexible framework for monitoring and analyzing program executions.

Havelund, Klaus↗

NASA NTRS1982

Singular perturbation techniques for real time aircraft trajectory optimization and control

The usefulness of singular perturbation methods for developing real time computer algorithms to control and optimize aircraft flight trajectories is examined. A minimum time intercept problem using F-8 aerodynamic and propulsion data is used as a baseline. This provides a framework within which issues relating to problem formulation, solution methodology and real time implementation are examined. Theoretical questions relating to separability of dynamics are addressed. With respect to implementation, situations leading to numerical singularities are identified, and procedures for dealing with them are outlined. Also, particular attention is given to identifying quantities that can be precomputed and stored, thus greatly reducing the on-board computational load. Numerical results are given to illustrate the minimum time algorithm, and the resulting flight paths. An estimate is given for execution time and storage requirements.

Calise, A. J.↗

NASA NTRS2019

Extending XBAER Algorithm to Aerosol and Cloud Condition

The retrieval of cloud optical properties for aerosol contaminated water cloud is challenging because of the complexity of physical processes in such situations. Conventionally, cloud optical data products are typically derived, ignoring the aerosol impacts on radiative transfer in the retrieval process. This is potentially a significant source of error. In this paper, the eXtensible Bremen Aerosol Retrieval (XBAER) algorithm has been optimized for the retrieval of aerosol/cloud properties for the aerosol contaminated cloud (ACC) scenarios. This version of XBAER delivers cloud optical thickness (COT) and cloud effective radius (CER) for ACCs and simultaneously retrieves aerosol optical thickness (AOT). The surface parameterization and aerosol types used in the standard XBAER algorithm have been adapted in this retrieval to account for the ACC conditions. Aerosol types in XBAER for the retrieval of ACC scenarios have been parameterized to comprise weak and strong absorptions. The comparisons of COT, CER, and AOT retrieved using this adapted XBAER algorithm and two new NASA algorithms show good agreements, especially for biomass burning aerosol. The correlation coefficients are >0.9 for AOT, ~0.8 for CER, and ~0.7 for COT. There is also a good agreement for dust plume contaminated cloud scene. The XBAER derived AOT values for dust aerosols are systematically smaller than the NASA retrieval, but both products have the same spatial distribution patterns. The comparison of COT retrieved using the adapted XBAER algorithm and that retrieved from ground-based microwave radiometer (MWR) measurements shows much better agreement for ACC conditions with high AOT.

satellite↗

DOE OSTI2024

Accelerated Constrained Sparse Tensor Factorization on Massively Parallel Architectures

This study presents the first constrained sparse tensor factorization (cSTF) framework that optimizes and fully offloads computation to massively parallel GPU architectures, and the first performance characterization of cSTF on GPU architectures. In contrast to prior work on tensor factorization, where the matricized tensor times Khatri-Rao product (MTTKRP) is the primary performance bottleneck, our systematic analysis of the cSTF algorithm on GPUs reveals that adding constraints creates an additional bottleneck in the update operation for many real-world sparse tensors. While executing the update operation on the GPU brings significant speedup over its CPU counterpart, it remains a significant bottleneck. To further accelerate the update operation, we propose cuADMM, a new update algorithm that leverages algorithmic and code optimization strategies to minimize both computation and data movement on GPUs. As a result, our framework delivers significantly improved performance compared to prior state-of-the-art. On 10 real-world sparse tensors, our framework achieves geometric mean speedup of 5.1 × (max 41.59 ×) and 7.01 × (max 58.05 ×) on the NIVIDA A100 and H100 GPUs, respectively, over the state-of-the-art SPLATT library running on a 26-core Intel Ice Lake Xeon CPU.

Soh, Yongseok↗

NASA NTRS2018

Autonomous Small Body Mapping and Spacecraft Navigation

Current methods for pose and shape estimation of small bodies, such as comets and asteroids, rely on extensive ground support and signiﬁcant use of radiometric measurements using the Deep Space Network. The Stereo-Photoclinometry (SPC) technique is currently used to provide detailed topological information about a small body as well as its absolute orientation and position. While this technique has produced very accurate estimates, the core algorithm cannot be run in real-time and requires a team of scientists on the ground who must communicate with the spacecraft in order to oversee SPC operations. Autonomous onboard navigation addresses these limitations by eliminating the need for human oversight. In this paper, we present an optimization-based estimation algorithm for navigation that allows the spacecraft to autonomously approach and maneuver around an unknown small body by mapping its geometric shape, estimating its orientation, and simultaneously determining the trajectory of the center of mass of the small body. We show the eﬀectiveness of the proposed algorithm using simulated data from a previous ﬂight mission to Comet 67P.

Bhaskaran, Shyamkumar↗

DOE OSTI2026

Use of Digital Real-Time Simulation and Optimization to Identify Maximum Real Power Injection on Banshee Distribution Network

This study investigates the hosting capacity of the Banshee Distribution Network by optimizing the real power injection at carefully selected Distributed Energy Resource (DER) locations. The analysis is conducted within the framework of power system operational constraints, including bus voltage ranges, thermal line ratings, and transformer loading limits. A Python-based Genetic Algorithm (GA), implemented using the PyGAD library, is employed to iteratively identify the optimal power injection configuration that maximizes network utilization while preserving system reliability. The methodology integrates a real-time simulation environment using the Real-Time Digital Simulator (RTDS), allowing high-fidelity evaluation of power flow and voltage behavior under each proposed injection scenario. By coupling the optimization algorithm with real-time simulation feedback, this approach ensures that both static and dynamic constraints are enforced during the evaluation process. The GA leverages evolutionary operators such as selection, crossover, and mutation to navigate the nonlinear search space efficiently. The results of the study delineate the feasible hosting capacity at three targeted buses, reflecting maximum real power levels that can be injected without causing voltage violations, transformer overloading, or line congestion. These findings provide a decision- support tool for distribution planners and utilities aiming to integrate higher penetrations of DERs in existing infrastructure. Additionally, the work lays the foundation for extending such optimization techniques to multi-objective formulations, including economic dispatch and reactive power coordination, in future studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2026

Use of Digital Real-Time Simulation and Optimization to Identify Maximum Real Power Injection on the Banshee Distribution Network: Preprint

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Development of an integrated core–edge scenario using the super H-mode

An optimized pedestal regime called the super-H (SH) mode is leveraged to couple a fusion relevant core plasma with a high density scrape-off layer appropriate for realistic reactor power exhaust solutions. Recent DIII-D experiments have expanded the operating space of the SH regime using advanced control algorithms and investigated optimization of impurity seeding, deuterium gas puffing, and 3D magnetic perturbations. Simultaneous real-time control of the pedestal density and radiated power with in-vessel coils and nitrogen seeding enable optimal coupled divertor and pedestal conditions. Four case studies are analysed with varied levels of radiated power in the divertor volume ranging from 0 (no seeding) to 8.5 MW radiated from carbon and nitrogen emission. Plasmas with a 4.5 MW radiated power target establish a radiative mantle, leading to divertor temperatures of ~16 eV while maintaining SH-mode, and with only marginal impact on the pedestal and core performance. Increased levels of N 2 seeding with a 7.5 MW radiated power target facilitate detachment onset and divertor temperatures <5 eV, with no degradation in stored energy and the operational point remaining inside the SH-mode channel for $ > 2.5{\tau }_{\text{E}}$. Finally, a 8.5 MW radiated power target leads to partial detachment, which is so far associated with the loss of access to SH-mode pedestal conditions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points (or samples) in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor modification to the ISOCLUS specification. We provide empirical evidence, on both synthetic and Landsat image data sets, that our algorithm's performance is essentially the same as that of ISOCLUS, but with significantly lower running times. We show that our algorithm runs from 3 to 30 times faster than a straightforward implementation of ISOCLUS. Our adaptation of the filtering algorithm involves the efficient computation of a number of cluster statistics that are needed for ISOCLUS, but not for k-means.

Memarsadeghi, Nargess↗

NASA NTRS2008

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

autonomuys vehicles↗

NASA NTRS2006

Central East Pacific Flight Routing

With the introduction of the Federal Aviation Administration s Advanced Technology and Oceanic Procedures system at the Oakland Oceanic Center, a level of automation now exists in the oceanic environment to potentially begin accommodating increased user preferred routing requests. This paper presents the results of an initial feasibility assessment which examines the potential benefits of transitioning from the fixed Central East Pacific routes to user preferred routes. As a surrogate for the actual user-provided routing requests, a minimum-travel-time, wind-optimal dynamic programming algorithm was developed and utilized in this paper. After first describing the characteristics (e.g., origin airport, destination airport, vertical distribution and temporal distribution) of the westbound flights utilizing the Central East Pacific routes on Dec. 14-16 and 19-20, the results of both a flight-plan-based simulation and a wind-optimal-based simulation are presented. Whereas the lateral and longitudinal distribution of the aircraft trajectories in these two simulations varied dramatically, the number of simulated first-loss-of-separation events remained relatively constant. One area of concern that was uncovered in this initial analysis was a potential workload issue associated with the redistribution of traffic in the oceanic sectors due to thc prevailing wind patterns.

Grabbe, Shon↗

NASA NTRS1983

Optimal short range trajectories for helicopters

An optimal flight path algorithm using a simplified altitude state model and an apriori climb-cruise-descent flight profile has been developed and applied to determine minimum fuel and minimum cost trajectories for a helicopter flying a fixed range trajectory. The performance model is based on standard flight manual data and is such that on-line trajectory optimization is feasible with a relatively small computer. The results show that the optimal flight path and optimal cruise altitude can represent a 10 percent fuel saving on a minimum fuel trajectory. The optimal trajectories show considerable variability due to helicopter weight, ambient winds and the relative cost trade-off between time and fuel. In general, 'reasonable' variations from the optimal velocities and cruise altitudes do not significantly degrade the optimal cost.

Slater, G. L.↗

NASA NTRS2008

Implementation of Complex Signal Processing Algorithms for Position-Sensitive Microcalorimeters

We have recently reported on a theoretical digital signal-processing algorithm for improved energy and position resolution in position-sensitive, transition-edge sensor (POST) X-ray detectors [Smith et al., Nucl, lnstr and Meth. A 556 (2006) 2371. PoST's consists of one or more transition-edge sensors (TES's) on a large continuous or pixellated X-ray absorber and are under development as an alternative to arrays of single pixel TES's. PoST's provide a means to increase the field-of-view for the fewest number of read-out channels. In this contribution we extend the theoretical correlated energy position optimal filter (CEPOF) algorithm (originally developed for 2-TES continuous absorber PoST's) to investigate the practical implementation on multi-pixel single TES PoST's or Hydras. We use numerically simulated data for a nine absorber device, which includes realistic detector noise, to demonstrate an iterative scheme that enables convergence on the correct photon absorption position and energy without any a priori assumptions. The position sensitivity of the CEPOF implemented on simulated data agrees very well with the theoretically predicted resolution. We discuss practical issues such as the impact of random arrival phase of the measured data on the performance of the CEPOF. The CEPOF algorithm demonstrates that full-width-at- half-maximum energy resolution of < 8 eV coupled with position-sensitivity down to a few 100 eV should be achievable for a fully optimized device.

Smith, Stephen J.↗

NASA NTRS2017

Distributed Fast Motion Planning for Spacecraft Swarms in Cluttered Environments using Spherical Expansions and Sequence of Convex Optimization Problems

This paper presents a novel guidance algorithm for spacecraft swarms in an environment cluttered with many obstacles like a debris field or the asteroid belt. The objective of this algorithm is to reconfigure the swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with the obstacles. The agents first use a spherical-expansion-based sampling algorithm to cooperatively explore the workspace and find paths to the desired terminal positions. Using a distributed assignment algorithm, the agents converge on an optimal assignment of the target locations in the desired formation. Then each agent generates a locally optimal trajectory from its current location to its terminal position by solving a sequence of convex optimization problems. As the agent moves along this trajectory, it receives the position of other agents and updates its trajectory to avoid collisions with other agents and the obstacles. Thus the swarm achieves the desired formation in a distributed manner while avoiding collisions. Moreover, this algorithm is computationally efficient, therefore it can be implemented onboard resource-constrained spacecraft. Simulations results show that the proposed distributed algorithm can be used by a spacecraft swarm to reconfigure a desired formation around an asteroid in a collision-free manner.

Bandyopadhyay, Saptarshi↗

DOE OSTI2021

Exactness of OPF Relaxation on Three-phase Radial Networks with Delta Connections

Simulations have shown that while semi-definite relaxations of AC optimal power flow (AC-OPF) on three-phase radial networks with only wye connections tend to be exact, the presence of delta connections seem to render them inexact. This paper shows that such inexactness originates from the non-uniqueness of relaxation solutions and numerical errors amplified by the non-uniqueness. This finding motivates two algorithms to recover the exact solution of AC-OPF in unbalanced distribution networks featuring both wye and delta connections. In simulations using IEEE 13, 37 and 123-bus systems, the proposed algorithms provide exact optimal solutions up to numerical precision.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRSDate not supplied

Hyperspectral Sounder Spectral Fingerprinting: Using Machine Learning Techniques to Enhance Model-Based Physical Inversion

Different retrieval algorithms have been developed to process top-of-atmosphere (TOA) spectral radiance data provided by hyperspectral infrared sounder missions. Those algorithms are either optimal estimation method (OEM) based schemes with radiative transfer calculation involved in the retrieval process, or machine learning based methods that allow ultra-efficient data procession but lack of radiometric consistency validation based on the directly measured information. Combining both approaches leverages their respective technical advantages, leading to more accurate results. This study introduces a hyperspectral sounder fingerprinting algorithm to explore this hybrid approach. This approach involves the use of a spectral information-based classification method to identify an reference geophysical state and the corresponding radiative kernel. This enables the efficient retrieval of geophysical variables of interest through a radiative kernel-based linear inversion procedure. The fingerprinting method has been applied to analyze a decade-long hyperspectral sounder data record.

Wan Wu↗

DOE OSTI2023

Nonlinear control of safety factor gradient in tokamaks using spatially variable electron cyclotron current drives

Active control of plasma properties may be necessary to achieve stable operation of next-generation tokamaks over large time scales. Such control algorithms can regulate the plasma properties to avoid the onset of magnetohydrodynamic (MHD) instabilities. For instance, the global and local properties of the safety factor profile are linked to the onset of neoclassical tearing modes (NTMs). This work proposes a model-based control approach for deterring/delaying NTMs through active modulation of one of the safety factor properties - the gradient of the safety factor profile at a particular rational safety factor surface. In particular, a novel control-oriented model for the local safety factor gradient is developed. The nonlinear control model is governed by a nonautonomous ordinary differential equation that accounts for a given rational safety factor surface’s spatial variation over time. Further, to improve the controllability of the spatially evolving parameter, the control model treats ECH&CD positions, along with noninductive powers, as controllable variables. A nonlinear control algorithm based on feedback linearization with optimization is synthesized to achieve the objective of regulating the safety factor gradient around a given target. The proposed algorithm allocates optimal ECH&CD positions, in addition to auxiliary powers, at each time instant as the rational safety factor surface drifts to locations with a low control authority. Stability guarantees of the proposed control law are also discussed in this work. The proposed algorithm is tested for a DIII-D tokamak scenario in nonlinear simulations carried out using the Control Oriented Transport SIMulator (COTSIM). Both fixed and moving ECH&CD cases are studied, and their outcomes are compared. Simulation results demonstrate that enthusiastic regulation of the safety factor gradient can be achieved during the ramp-up and flat-top phases of tokamak operation in both fixed and moving ECH&CD cases. However, real-time updates of ECH&CD positions can prevent the saturation of auxiliary powers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗