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 757 records · Page 42

Reinforcement Learning Applied to Cognitive Space Communications

The future of space exploration depends on robust, reliable communication systems. As the number of such communication systems increase, automation is fast becoming a requirement to achieve this goal. A reinforcement learning solution can be employed as a possible automation method for such systems. The goal of this study is to build a reinforcement learning algorithm which optimizes data throughput of a single actor. A training environment was created to simulate a link within the NASA Space Communication and Navigation (SCaN) infrastructure, using state of the art simulation tools developed by the SCaN Center for Engineering, Networks, Integration, and Communications (SCENIC) laboratory at NASA Glenn Research Center to obtain the closest possible representation of the real operating environment. Reinforcement learning was then used to train an agent inside this environment to maximize data throughput. The simulation environment contained a single actor in low earth orbit capable of communicating with twenty-five ground stations that compose the Near-Earth Network (NEN). Initial experiments showed promising training results, so additional complexity was added by augmenting simulation data with link fading profiles obtained from real communication events with the International Space Station. A grid search was performed to find the optimal hyperparameters and model architecture for the agent. Using the results of the grid search, an agent was trained on the augmented training data. Testing shows that the agent performs well inside the training environment and can be used as a foundation for future studies with added complexity and eventually tested in the real space environment.

Schubert, Carson D.↗

A Robust Vision-Based Algorithm for Detecting and Classifying Small Orbital Debris Using On-Board Optical Cameras

This study develops a vision-based detection and classification algorithm to address the challenges of in-situ small orbital debris environment classification including debris observability and instrument requirements for small debris observation. The algorithm operates in near real time and is robust under difficult tasks in moving objects classification such as multiple moving objects, objects with various movement trajectories and speeds, very small or faint objects, and substantial background motion. The performance of the algorithm is optimized and validated using space image data available through simulated environments generated using NASA Marshall Space Flight Centers Dynamic Star Field Simulator of on-board optical sensors and cameras.

Zamani, Yasin↗

A Rideshare Tensegrity Rover Concept to Explore Titan's Lands and Oceans

The Tension Adjustable Network for Deploying Entry Membrane (TANDEM) tensegrity robot is redesigned for a mission to Titan. Focus is on the design of the aeroshell and the use of tensegrity algorithm to optimize the configuration and loading of the tensegrity structure within the aeroshell.

N Deitrich↗

Stability Analysis of Streaks Induced by Optimized Vortex Generators

Numerical computations are performed to investigate the potential for transition control in an axisymmetric boundary layer via fully realizable, streamwise stationary streaks induced by an azimuthally periodic array of surface mounted vortex generators (VGs). Previous work has shown that suitable streaks of this type can significantly reduce the growth of Mack’s second mode instabilities, but large streak amplitudes can make the flow susceptible to previously absent streak instabilities that can become the leading cause of transition. Here, we use the adjoint capabilities of the SU2 flow solver to optimize the VG shape to maximize the reduction in the growth of second-mode disturbances while also preventing the streak amplitudes from reaching large enough values to precipitate an earlier onset of transition via streak instabilities. The geometry and the freestream flow conditions are selected to match a relevant trajectory lo-cation from the HIFiRE-1 flight experiment. Results show that the optimized VGs can increase the mean streak amplitude by 117% with respect to a manually developed baseline design. The stability of this optimized basic state is analyzed via the plane-marching parabolized stability equations, predicting a fully laminar flow over the entire cone, or equivalently, yielding transition delay of 130% versus the 17% for the baseline VGs.

Boundary layer transition↗

AI-3000K Infrared Line List for Hot CO 2

AI-3000K is a semi-empirical IR line list constructed for hot CO 2 spectra analysis and simulation up to 3000 – 4000 K. Compared to previously published Ames-1000K and UCL-4000, it represents a major upgrade, utilizing a new algorithm for optimization and including the latest improvements in potential energy surface (PES), dipole moment surface (DMS), and room temperature IR line list (Ames-2021 296K). To maximize the success of introducing experimental based accurate line positions, a new PES (X01d) was refined with respect to >800 selected CDSD2019 [Tashkun et al. JQSRT (2019) 228, 124] energy levels in the range of 0 – 24,000 cm -1 , with σ rms = 0.5 – 0.7 cm -1 . Most differences between the X01d PES based levels and CDSD2019 energies are within ± 2 cm -1 . A new DMS is fitted from extrapolated CCSD(T)/aug-cc-pV(T,Q,5)Z dipole calculations, with σ rms = 5.1 × 10 -6 au for 11,155 geometries up to 40,000 cm -1 , denoted Ames-2021–40K. Compared to the best available Ames-2021 DMS and room temperature IR line list [Huang et al J. Phys. Chem. A (2022) 126, 5940], the relative intensity differences are expected to be ∼ 1 ‰. The line position accuracy of ''X01d + Ames-2021–40K'' IR line list is significantly improved by adopting CDSD2019 energy levels up to 24,000 cm -1 (J ≤ 150). The Einstein A21 coefficients for E' < 15,000 cm -1 transitions are replaced by more accurate values from the Ames-2021 296K IR line list. In short, the AI-3000K is the X01d PES and Ames-2021–40K DMS based line list enhanced with the A 21 of Ames-2021 296K line list and CDSD energy levels. It provides continuous coverage from 0 to 20,000 cm -1 for the four most abundant isotopologues: 12 C 16 O 2 (626), 13 C 16 O 2 (636), 16 O 12 C 18 O (628), and 16 O 12 C 17 O (627). The impacts of isotopologue and E'/E'' cutoffs have been examined. Intensity convergence (not accuracy) of AI-3000K line list is quantitatively estimated in 1 cm -1 bins. It is better than 99% in the whole range of 0 – 20,000 (or 10,000) cm -1 at 1000 K (or 2000 K), or better than 90% in the whole range of 0 – 15,000 (or 9000) cm -1 at 2000 K (or 3000 K), respectively. Convergence beyond 3000 K will require a new PES and DMS for E' > 40,000 cm -1 . The AI-3000K and HITEMP based IR simulations are compared to high resolution shock tube experiments for CO 2 -Ar mixture up to 2000 K. With line position accuracy comparable to that of HITEMP, AI-3000K IR line list yields better agreements at more frequencies. Potential sources of discrepancies with experiment are discussed.

AI-3000K↗

Creating Near Real-time Hourly VIIRS Radiance Mosaic over Polar Regions from SatCORPS Global Cloud Composite (GCC)

While polar orbiting satellites are essential in providing the needed observations over polar regions for data assimilation, weather diagnoses/forecasting, and flight guidance and situation awareness in airborne field campaigns, there is limited temporal coverage. Often, polar mosaics are created by overlaying multiple satellite imagers on top of each other which can lead to transition lines and discontinuities in the data products. To help ease some of these shortcomings, we utilize the NASA Langley Satellite ClOud and Radiation Property retrieval System (SatCORPS) Mosaic algorithm for optimally fusing and merging selected imager radiances from the Visible Infrared Imaging Radiometer Suite (VIIRS) instrument onboard the Suomi National polar-orbiting Partnership (SNPP), Joint Polar Satellite System (JPSS-1), and JPSS-2 satellites, and the MODerate resolution Imaging Spectroradiometer (MODIS) instruments onboard AQUA and TERRA satellites. Since multiple satellites overpasses and instruments are used in creating hourly 3-km composites over the polar regions, selection of the best satellite data for each 3-km composite pixel is based on aggregated ranking of satellite resolution, time, viewing zenith angle, and distance from terminator. This ranking system provides a smoother transition and improves data discontinuity in the merged output resulting in a more seamless polar region dataset. We will discuss the use of this near real-time dataset to support polar airborne field campaigns and SatCORPS satellite-derived Global Cloud Composite (GCC) generation.

Satellite composites↗

Robustness-Based Design Optimization Under Data Uncertainty

This paper proposes formulations and algorithms for design optimization under both aleatory (i.e., natural or physical variability) and epistemic uncertainty (i.e., imprecise probabilistic information), from the perspective of system robustness. The proposed formulations deal with epistemic uncertainty arising from both sparse and interval data without any assumption about the probability distributions of the random variables. A decoupled approach is proposed in this paper to un-nest the robustness-based design from the analysis of non-design epistemic variables to achieve computational efficiency. The proposed methods are illustrated for the upper stage design problem of a two-stage-to-orbit (TSTO) vehicle, where the information on the random design inputs are only available as sparse point and/or interval data. As collecting more data reduces uncertainty but increases cost, the effect of sample size on the optimality and robustness of the solution is also studied. A method is developed to determine the optimal sample size for sparse point data that leads to the solutions of the design problem that are least sensitive to variations in the input random variables.

Zaman, Kais↗

Comparison of Evolutionary (Genetic) Algorithm and Adjoint Methods for Multi-Objective Viscous Airfoil Optimizations

A comparison between an Evolutionary Algorithm (EA) and an Adjoint-Gradient (AG) Method applied to a two-dimensional Navier-Stokes code for airfoil design is presented. Both approaches use a common function evaluation code, the steady-state explicit part of the code,ARC2D. The parameterization of the design space is a common B-spline approach for an airfoil surface, which together with a common griding approach, restricts the AG and EA to the same design space. Results are presented for a class of viscous transonic airfoils in which the optimization tradeoff between drag minimization as one objective and lift maximization as another, produces the multi-objective design space. Comparisons are made for efficiency, accuracy and design consistency.

Pulliam, T. H.↗

Sensitivity calculations for a 2D, inviscid, supersonic forebody problem

The use of a sensitivity equation method to computer derivatives for optimization based design algorithms are discussed. The problem of designing an optimal forebody simulator is used to motivate the algorithm and to illustrate the basic ideas. Finally, how an existing computational fluid dynamics (CFD) code can be modified to compute sensitivities and a numerical example is presented.

Borggaard, Jeff↗

Solving Upwind-Biased Discretizations: Multigrid Solver Using Semicoarsening - 2

This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid).

Diskin, Boris↗

Reliable design of H-2 optimal reduced-order controllers via a homotopy algorithm

Due to control processor limitations, the design of reduced-order controllers is an active area of research. Suboptimal methods based on truncating the order of the corresponding linear-quadratic-Gaussian (LQG) compensator tend to fail if the requested controller dimension is sufficiently small and/or the requested controller authority is sufficiently high. Also, traditional parameter optimization approaches have only local convergence properties. This paper discusses a homotopy algorithm for optimal reduced-order control that has global convergence properties. The exposition is for discrete-time systems. The algorithm has been implemented in MATLAB and is applied to a benchmark problem.

Collins, Emmanuel G.↗

Rectilinear partitioning of irregular data parallel computations

New mapping algorithms for domain oriented data-parallel computations, where the workload is distributed irregularly throughout the domain, but exhibits localized communication patterns are described. Researchers consider the problem of partitioning the domain for parallel processing in such a way that the workload on the most heavily loaded processor is minimized, subject to the constraint that the partition be perfectly rectilinear. Rectilinear partitions are useful on architectures that have a fast local mesh network. Discussed here is an improved algorithm for finding the optimal partitioning in one dimension, new algorithms for partitioning in two dimensions, and optimal partitioning in three dimensions. The application of these algorithms to real problems are discussed.

Nicol, David M.↗

Performance Optimization of Plate Airfoils for Martian Rotor Applications Using a Genetic Algorithm

The Mars Helicopter Technology Demonstrator will be flying on the NASA Mars 2020 rover mission scheduled to launch in July of 2020. The goal is to demonstrate the viability and potential of heavier-than-air vehicles in the Martian atmosphere. Research is performed at the Jet Propulsion Laboratory and NASA Ames Research Center to extend these capabilities and develop the Mars Science Helicopter as the next possible step for Martian rotorcraft. The Mars Science Helicopter mass is scaled up to the 5 to 20 kg range, allowing a greater payload (approximately 0.5 to 2.0 kg), and greater range (approximately 3 km). Key to achieving these targets is careful aerodynamic rotor design. The Martian atmosphere’s low density and the small helicopter rotors result in very low chord-based Reynolds number flows, which reduces rotor performance. A continuous genetic algorithm is developed to optimize airfoil shapes at representative conditions for the Martian atmosphere. Previous research indicates that sharp leading edges and plate-like airfoils can out-perform conventional airfoil shapes. The present optimization allows for camber and thickness variation of curved and polygonal thin airfoils with sharp leading edges. The airfoil performance is evaluated at the highest attainable liftto- drag ratio near a moderate lift coefficient at compressible Mach numbers, as expected for Martian rotor application. Increases between 16% and 29% in airfoil lift-to-drag ratio at fixed lift coefficients are observed when compared with the Mars Helicopter Technology Demonstrator airfoils. Improvements in hover figure of merit are estimated to be between 4% and 10%, when applied to the Mars Helicopter Technology Demonstrator.

Koning, Witold J. F.↗

Structural optimization by multilevel decomposition

A method is described for decomposing an optimization problem into a set of subproblems and a coordination problem which preserves coupling between the subproblems. The method is introduced as a special case of multilevel, multidisciplinary system optimization and its algorithm is fully described for two level optimization for structures assembled of finite elements of arbitrary type. Numerical results are given for an example of a framework to show that the decomposition method converges and yields results comparable to those obtained without decomposition. It is pointed out that optimization by decomposition should reduce the design time by allowing groups of engineers, using different computers to work concurrently on the same large problem.

Sobieszczanski-Sobieski, J.↗