Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adaptive algorithm”

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,729 records · Page 96
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A Behavioral Robotics Approach to Radiation Mapping Using Adaptive Sampling

Radiation mapping is a desirable task to automate because of the inherent risks involved and its tedious nature. A novel system was designed to address this by combining various existing technologies, utilizing behavior-based robotics and Bayesian optimization. The system uses a quadruped robot equipped with a manipulator and gamma detector to take measurements at locations that are selected based on the uncertainty of a surrogate model used to estimate the true radiation field. The robot uses input from the world with depth cameras to avoid collisions with the robot’s body, and unreachable points for the end effector are addressed by both allowing for a soft collision with the environment to occur, prompting the system to abandon that point, and varying the exploration tendency of the optimization based on consecutive collisions. This approach provides unique traversability and adaptability over other strategies in the literature. Experiments were performed by placing a Cesium-137 source on the ground and varying geometric setups and an optimization parameter demonstrating the adaptability to diverse environments and the increased robustness resulting from the designed behavior. The results additionally demonstrate that dynamically adjusting the optimization algorithm’s exploration tendency based on the arm’s collision history improves the system’s ability to navigate cluttered environments and construct accurate radiation maps without getting stuck in unreachable areas.

Adams, Joel↗
NASA NTRS1994

Fuzzy logic, neural networks, and soft computing

The past few years have witnessed a rapid growth of interest in a cluster of modes of modeling and computation which may be described collectively as soft computing. The distinguishing characteristic of soft computing is that its primary aims are to achieve tractability, robustness, low cost, and high MIQ (machine intelligence quotient) through an exploitation of the tolerance for imprecision and uncertainty. Thus, in soft computing what is usually sought is an approximate solution to a precisely formulated problem or, more typically, an approximate solution to an imprecisely formulated problem. A simple case in point is the problem of parking a car. Generally, humans can park a car rather easily because the final position of the car is not specified exactly. If it were specified to within, say, a few millimeters and a fraction of a degree, it would take hours or days of maneuvering and precise measurements of distance and angular position to solve the problem. What this simple example points to is the fact that, in general, high precision carries a high cost. The challenge, then, is to exploit the tolerance for imprecision by devising methods of computation which lead to an acceptable solution at low cost. By its nature, soft computing is much closer to human reasoning than the traditional modes of computation. At this juncture, the major components of soft computing are fuzzy logic (FL), neural network theory (NN), and probabilistic reasoning techniques (PR), including genetic algorithms, chaos theory, and part of learning theory. Increasingly, these techniques are used in combination to achieve significant improvement in performance and adaptability. Among the important application areas for soft computing are control systems, expert systems, data compression techniques, image processing, and decision support systems. It may be argued that it is soft computing, rather than the traditional hard computing, that should be viewed as the foundation for artificial intelligence. In the years ahead, this may well become a widely held position.

Zadeh, Lofti A.↗
NASA NTRS1992

Computational fluid dynamics '92; Proceedings of the European Computational Fluid Dynamics Conference, 1st, Brussels, Belgium, Sep. 7-11, 1992. Vols. 1 & 2

A conference was held on Computational Fluid Dynamics (CFD) and produced related papers. Topics included CFD algorithms, transition and turbulent flow, hypersonic reacting flow, incompressible flow, two phase flow and combustion, internal flow, compressible flow, grid generation and adaption, boundary layers, environmental and industrial applications, and non-Newtonian flow.

Hirsch, Charles↗
NASA NTRS2002

Compact Video Microscope Imaging System Implemented in Colloid Studies

Long description Photographs showing fiber-optic light source, microscope and charge-coupled discharge (CCD) camera head connected to camera body, CCD camera body feeding data to image acquisition board in PC, and Cartesian robot controlled via PC board. The Compact Microscope Imaging System (CMIS) is a diagnostic tool with intelligent controls for use in space, industrial, medical, and security applications. CMIS can be used in situ with a minimum amount of user intervention. This system can scan, find areas of interest in, focus on, and acquire images automatically. Many multiple-cell experiments require microscopy for in situ observations; this is feasible only with compact microscope systems. CMIS is a miniature machine vision system that combines intelligent image processing with remote control. The software also has a user-friendly interface, which can be used independently of the hardware for further post-experiment analysis. CMIS has been successfully developed in the SML Laboratory at the NASA Glenn Research Center and adapted for use for colloid studies and is available for telescience experiments. The main innovations this year are an improved interface, optimized algorithms, and the ability to control conventional full-sized microscopes in addition to compact microscopes. The CMIS software-hardware interface is being integrated into our SML Analysis package, which will be a robust general-purpose image-processing package that can handle over 100 space and industrial applications.

McDowell, Mark↗
NASA NTRS2018

The Impact of Stellar Variability on the Detection of Transiting Earth-like Planets

Stellar variability represents a key limitation on the detectability of weak transit signatures of small, Earth-size planets with space-based missions such as NASA's Kepler Mission or ESA's PLATO Mission. The expectations for the performance of the Kepler Mission in the face of solar-like variability were predicated on observations of the Sun with the Variability of Solar Irradiance and Gravity Oscillations (VIRGO) instrument aboard NASA and ESA's joint Solar and Heliospheric Observatory (SOHO) mission, which was launched in December 1995. Analyses of SOHO data indicated that solar-like variability would contribute approx.10 ppm to Kepler's noise budget at 6.5 ours, a typical grazing transit timescale. This proved to be optimistic as the typical 12th mag G2V star in the Kepler field of view exhibited 20 ppm of stellar variability-related noise at 6.5 hours, making the detection of true Earth-Sun analogs more difficult. While the consequent increase in the total noise at 6.5 hours from 20 ppm to 30 ppm could have been overcome by extending the mission to a total duration of 7 to 8 years. Unfortunately, a second reaction wheel failed in May 2013, ending the Kepler primary mission. Nevertheless, Kepler proved to be a veritable cornucopia of science results, both for exoplanets and for astrophysics. The phenomenal photometric precision and continuous observations required in order to identify small, rocky transiting planets enables the study of a large range of phenomena contributing to stellar variability for many thousands of solar-like stars in Kepler's field of view in exquisite detail. These effects range from less than 1 ppm acoustic oscillations on timescales from a few minutes and longward, to flares on timescales of hours, to spot-induced modulation on timescales of days to weeks to activity cycles on timescales of months to years. Kepler discovered over 2600 validated and confirmed exoplanets, and measured the pressure-mode oscillations of over 15000 stars over the course of its mission and the reconstituted K2 mission. We present the adaptive, wavelet-based matched filter used for both the Kepler and the TESS missions, and discuss the connections between this detection algorithm and fundamental detection theory, which allows the detector to function as a noise characterization engine. This provides a dynamical measurement of the photometric noise at transit timescales and thus, a key performance metric for missions like PLATO and Kepler. We give an overview of the stellar variability we see across the full range of spectral types observed by Kepler, from the cool, small red M stars to the hot, large late A stars, both in terms of amplitude as well as timescale.

transit surveys↗
NASA NTRS2018

The Impact of Stellar Variability on the Detection of Transiting Earth-Like Planets

Stellar variability represents a key limitation on the detectability of weak transit signatures of small, Earth-size planets with space-based missions such as NASA's Kepler Mission or ESA's PLATO Mission. The expectations for the performance of the Kepler Mission in the face of solar-like variability were predicated on observations of the Sun with the Variability of Solar Irradiance and Gravity Oscillations (VIRGO) instrument aboard NASA and ESA's joint Solar and Heliospheric Observatory (SOHO) mission, which was launched in December 1995. Analyses of SOHO data indicated that solar-like variability would contribute ~10 ppm to Kepler's noise budget at 6.5 ours, a typical grazing transit timescale. This proved to be optimistic as the typical 12th mag G2V star in the Kepler field of view exhibited 20 ppm of stellar variability-related noise at 6.5 hours, making the detection of true Earth-Sun analogs more difficult. While the consequent increase in the total noise at 6.5 hours from 20 ppm to 30 ppm could have been overcome by extending the mission to a total duration of 7 to 8 years. Unfortunately, a second reaction wheel failed in May 2013, ending the Kepler primary mission. Nevertheless, Kepler proved to be a veritable cornucopia of science results, both for exoplanets and for astrophysics. The phenomenal photometric precision and continuous observations required in order to identify small, rocky transiting planets enables the study of a large range of phenomena contributing to stellar variability for many thousands of solar-like stars in Kepler's field of view in exquisite detail. These effects range from <1 ppm acoustic oscillations on timescales from a few minutes and longward, to flares on timescales of hours, to spot-induced modulation on timescales of days to weeks to activity cycles on timescales of months to years. Kepler discovered over 2600 validated and confirmed exoplanets, and measured the pressure-mode oscillations of over 15000 stars over the course of its mission and the reconstituted K2 mission. We present the adaptive, wavelet-based matched filter used for both the Kepler and the TESS missions, and discuss the connections between this detection algorithm and fundamental detection theory, which allows the detector to function as a noise characterization engine. This provides a dynamical measurement of the photometric noise at transit timescales and thus, a key performance metric for missions like PLATO and Kepler. We give an overview of the stellar variability we see across the full range of spectral types observed by Kepler, from the cool, small red M stars to the hot, large late A stars, both in terms of amplitude as well as timescale.

exoplanets↗
NASA NTRSDate not supplied

Optimization of the Lunar Icecube Trajectory Using Stochastic Global Search and Multi-Point Shooting

Lunar IceCube is a 6U cubesat that will launch on NASA’s Artemis 1 mission in 2021. Lunar IceCube will separate from Artemis 1 shortly after trans-lunar injection (TLI) and travel to its science orbit about the moon using its Busek Ion Thruster 3 (BIT-3) propulsion system. This paper describes a technique to rapidly design Lunar IceCube trajectories using the monotonic basin hopping (MBH) stochastic global search algorithm, along with low- and high-fidelity multi-point shooting transcriptions. This technique allows the Lunar IceCube team to rapidly adapt to changing initial conditions, spacecraft properties, and operational constraints.

optimization↗
DOE OSTI2020

Building Battery Energy Storage System Performance Data into an Economic Assessment

Economic assessments of battery energy storage systems (BESSs) rely on optimal dispatch methods to capture temporal interdependency of BESS operations and coupling among different grid applications. Many existing BESS economic assessment studies are based on a simplified first-order scalar model using BESS nameplate numbers. Such a method cannot accurately capture varying capabilities and nonlinear dynamics of a BESS, leading to inaccurate assessment results. This paper presents a practical implementation of performance data into the economic assessment of the BESSs recently developed within the Snohomish Public Utility District system in Washington State. Extensive testing conducted over multiple seasons is used to assess the technical performance and develop high-fidelity models of the BESSs. A dynamic programming algorithm is proposed to optimally dispatch the BESSs and assess the potential benefits from stacked value streams. The proposed method can be adapted for the economic assessment of other BESSs with different applications.

Wu, Di↗
NASA NTRS2003

Resource Management for Real-Time Adaptive Agents

Increased autonomy and automation in onboard flight systems offer numerous potential benefits, including cost reduction and greater flexibility. The existence of generic mechanisms for automation is critical for handling unanticipated science events and anomalies where limitations in traditional control software with fixed, predetermined algorithms can mean loss of science data and missed opportunities for observing important terrestrial events. We have developed such a mechanism by adding a Hierarchical Agent-based ReaLTime technology (HART) extension to our Dynamic Resource Management (DRM) middleware. Traditional DRM provides mechanisms to monitor the realtime performance of distributed applications and to move applications among processors to improve real-time performance. In the HART project we have designed and implemented a performance adaptation mechanism to improve reaktime performance. To use this mechanism, applications are developed that can run at various levels of quality. The DRM can choose a setting for the quality level of an application dynamically at run-time in order to manage satellite resource usage more effectively. A groundbased prototype of a satellite system that captures and processes images has also been developed as part of this project to be used as a benchmark for evaluating the resource management framework A significant enhancement of this generic mission-independent framework allows scientists to specify the utility, or "scientific benefit," of science observations under various conditions like cloud cover and compression method. The resource manager then uses these benefit tables to determine in redtime how to set the quality levels for applications to maximize overall system utility as defined by the scientists running the mission. We also show how maintenance functions llke health and safety data can be integrated into the utility framework. Once thls framework has been certified for missions and successfully flight tested it can be reused with little development overhead for other missions. In contrast, current space missions llke Swift manage similar types of resource trade -off completely with the scientific application code itself, and such code must be re-certified and tested for each mission even if a large portion of the code base is shared. This final report discusses some of the major issues motivating this research effort, provides a literature review of the related work, discusses the resource management framework and ground-based satellite system prototype that has been developed, indicates what work is yet to be performed, and provides a list of publications resulting from this work.

Welch, Lonnie↗
NASA NTRS2022

First Observations of Mesospheric OH Emission Profiles from OMPS/LP

The hydroxyl radical (OH) is one of the most reactive trace species and plays several important roles in the photochemical equilibrium and energy balance in the mesosphere. Global observations of OH from satellite instruments have a role to play in the study of OH and water vapor variations. This study describes an advanced algorithm to detect mesospheric OH emission profiles from the Suomi NPP satellite Ozone Mapping and Profiler Suite Limb Profiler (OMPS/LP). A triplet technique has been adapted to the OMPS/LP radiance measurements for determining OH emission signatures and OH index (OHI) from the OH A2Σ+-X2Π 0-0 band near the 308.8-nm wavelength. The derived mesospheric profiles provide an overall picture of the vertical distribution of OHI between 55 and 84 km and seasonal and latitudinal variability of the strength and height of the OHI. The observed annual cycle is correlated with the water vapor cycle and anticorrelated with the mesospheric temperature cycle. The data show that the relationships persist during the period of April 2012–December 2020. The seasonal behavior of OHI may be associated with variations in solar illumination or mesospheric water vapor abundance. The influence of solar illumination is dominant in the midlatitudes, while the OHI pattern is dominated by water vapor photolysis and other influences in the tropics.

Observations of Mesospheric OH Emission↗
DOE OSTI2021

Scaling pair count to next galaxy surveys

ABSTRACT Counting pairs of galaxies or stars according to their distance is at the core of real-space correlation analyses performed in astrophysics and cosmology. Upcoming galaxy surveys (LSST, Euclid) will measure properties of billions of galaxies challenging our ability to perform such counting in a minute-scale time relevant for the usage of simulations. The problem is only limited by efficient access to the data, hence belongs to the big data category. We use the popular Apache Spark framework to address it and design an efficient high-throughput algorithm to deal with hundreds of millions to billions of input data. To optimize it, we revisit the question of non-hierarchical sphere pixelization based on cube symmetries and develop a new one dubbed the ‘Similar Radius Sphere Pixelization’ (SARSPix) with very close to square pixels. It provides the most adapted indexing over the sphere for all distance-related computations. Using LSST-like fast simulations, we compute autocorrelation functions on tomographic bins containing between a hundred million to one billion data points. In each case, we achieve the construction of a standard pair-distance histogram in about 2 min, using a simple algorithm that is shown to scale, over a moderate number of nodes (16–64). This illustrates the potential of this new techniques in the field of astronomy where data access is becoming the main bottleneck. They can be easily adapted to other use-cases as nearest-neighbours search, catalogue cross-match or cluster finding. The software is publicly available from https://github.com/astrolabsoftware/SparkCorr.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2004

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Alena, Richard I.↗
DOE OSTI2021

Interpreting Write Performance of Supercomputer I/O Systems with Regression Models

This work seeks to advance the state of the art in HPC I/O performance analysis and interpretation. In particular, we demonstrate effective techniques to: (1) model output performance in the presence of I/O interference from production loads; (2) build features from write patterns and key parameters of the system architecture and configurations; (3) employ suitable machine learning algorithms to improve model accuracy. We train models with five popular regression algorithms and conduct experiments on two distinct production HPC platforms. We find that the lasso and random forest models predict output performance with high accuracy on both of the target systems. We also explore use of the models to guide adaptation in I/O middleware systems, and show potential for improvements of at least 15% from model-guided adaptation on 70% of samples, and improvements up to 10× on some samples for both of the target systems.

Xie, Bing↗
NASA NTRS2015

In-Flight Suppression of a Destabilized F/A-18 Structural Mode Using the Space Launch System Adaptive Augmenting Control System

NASA's Space Launch System (SLS) Flight Control System (FCS) includes an Adaptive Augmenting Control (AAC) component which employs a multiplicative gain update law to enhance the performance and robustness of the baseline control system for extreme off nominal scenarios. The SLS FCS algorithm including AAC has been flight tested utilizing a specially outfitted F/A-18 fighter jet in which the pitch axis control of the aircraft was performed by a Non-linear Dynamic Inversion (NDI) controller, SLS reference models, and the SLS flight software prototype. This paper describes test cases from the research flight campaign in which the fundamental F/A-18 airframe structural mode was identified using frequency-domain reconstruction of flight data, amplified to result in closed loop instability, and suppressed in-flight by the SLS adaptive control system.

Wall, John H.↗
DOE OSTI2022

Optimal Operation of PV Sources in DC Grids for Improving Technical, Economical, and Environmental Conditions by Using Vortex Search Algorithm and a Matrix Hourly Power Flow

This document presents a master–slave methodology for solving the problem of optimal operation of photovoltaic (PV) distributed generators (DGs) in direct current (DC) networks. This problem was modeled using a nonlinear programming model (NLP) that considers the minimization of three different objective functions in a daily operation of the system. The first one corresponds to the minimization of the total operational cost of the system, including the energy purchasing cost to the conventional generators and maintenance costs of the PV sources; the second objective function corresponds to the reduction of the energy losses associated with the transport of energy in the network, and the third objective function is related to the minimization of the total emissions of CO2 by the conventional generators installed on the DC grid. The minimization of these objective functions is achieved by using a master–slave optimization approach through the application of the Vortex Search algorithm combined with a matrix hourly power flow. To evaluate the effectiveness and robustness of the proposed approach, two test scenarios were used, which correspond to a grid-connected and a standalone network located in two different regions of Colombia. The grid-connected system emulates the behavior of the solar resource and power demand of the city of Medellín-Antioquia, and the standalone network corresponds to an adaptation of the generation and demand curves for the municipality of Capurganá-Choco. A numerical comparison was performed with four optimization methodologies reported in the literature: particle swarm optimization, multiverse optimizer, crow search algorithm, and salp swarm algorithm. The results obtained demonstrate that the proposed optimization approach achieved excellent solutions in terms of response quality, repeatability, and processing times.

14 SOLAR ENERGY↗
DOE OSTI2024

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗