Search NASA⌕ Search

SEARCH · Search NASA

Results for “probabilistic mapping technique”

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.

A Comparison of Risk Sensitive Path Planning Methods for Aircraft Emergency Landing

Determining the best site to land a damaged aircraft presents some interesting challenges for standard path planning techniques. There are multiple possible locations to consider, the space is 3-dimensional with dynamics, the criteria for a good path is determined by overall risk rather than distance or time, and optimization really matters, since an improved path corresponds to greater expected survival rate. We have investigated a number of different path planning methods for solving this problem, including cell decomposition, visibility graphs, probabilistic road maps (PRMs), and local search techniques. In their pure form, none of these techniques have proven to be entirely satisfactory - some are too slow or unpredictable, some produce highly non-optimal paths or do not find certain types of paths, and some do not cope well with the dynamic constraints when controllability is limited. In the end, we are converging towards a hybrid technique that involves seeding a roadmap with a layered visibility graph, using PRM to extend that roadmap, and using local search to further optimize the resulting paths. We describe the techniques we have investigated, report on our experiments with these techniques, and discuss when and why various techniques were unsatisfactory.

Meuleau, Nicolas↗

DEVELOP Poster: Medicine Bow Disasters

The Medicine Bow National Forest (MBNF) consists of approximately 1,383,790 acres of forested land, grassland, and sagebrush steppe in southeastern Wyoming. Cheatgrass (Bromus tectorum), an invasive plant species in the Western US, occurs in the grasslands throughout MBNF. Cheatgrass is known to rapidly colonize disturbed sites and dramatically alter historic fire regimes and nutrient/water dynamics as well as outcompete native plant species that are important forage for mule deer (Odocoileus hemionus) and elk (Cervus canadensis). In 2012, the Squirrel Creek Fire burned approximately 10,587 acres of land within MBNF, exacerbating the spread of cheatgrass. In 2015, the Wyoming Ecological Forecasting DEVELOP team identified areas of high cheatgrass abundance within the fire boundary in order to guide US Forest Service (USFS) herbicide spraying efforts to reduce cheatgrass in 2016. This research used Landsat 8 Operational Land Imager (OLI) and Sentinel-2 MultiSpectral Instrument (MSI) data to create a 2019 probabilistic cheatgrass occurrence map. This map allowed an analysis of the effectiveness of aerial spraying to inform future land management techniques for the USFS. Based on the results of the Generalized Linear Model, we found that treated areas decreased in cheatgrass cover by 36% while untreated areas increased in cheatgrass cover by 6%, suggesting that herbicide treatment has been effective.

Disasters↗

An analysis of scatter decomposition

A formal analysis of a powerful mapping technique known as scatter decomposition is presented. Scatter decomposition divides an irregular computational domain into a large number of equal sized pieces, and distributes them modularly among processors. A probabilistic model of workload in one dimension is used to formally explain why, and when scatter decomposition works. The first result is that if correlation in workload is a convex function of distance, then scattering a more finely decomposed domain yields a lower average processor workload variance. The second result shows that if the workload process is stationary Gaussian and the correlation function decreases linearly in distance until becoming zero and then remains zero, scattering a more finely decomposed domain yields a lower expected maximum processor workload. Finally it is shown that if the correlation function decreases linearly across the entire domain, then among all mappings that assign an equal number of domain pieces to each processor, scatter decomposition minimizes the average processor workload variance. The dependence of these results on the assumption of decreasing correlation is illustrated with situations where a coarser granularity actually achieves better load balance.

Nicol, David M.↗

MEDPRAT Treatment Clusters: Improving Representation of Mission Medical Risk

INTRODUCTION The Medical Extensible Dynamic Probabilistic Risk Assessment Tool (MEDPRAT) implements a computational model that aims to quantify spaceflight medical risk by utilizing probabilistic techniques to simulate critical event incidence and outcomes over thousands of simulated mission trials. The goal of MEDPRAT is to characterize mission medical risk and provide insight into medical resource utilization. In order to analyze the medical resource space, treatment must be mapped from each simulated condition, and resources consumed as a result of this treatment must be tracked throughout the course of the mission. A new MEDPRAT feature, ‘treatment clusters’, provide a more sophisticated method of defining the structure and interaction between resources, more closely mimicking the way treatment is carried out clinically. METHODS Treatment clusters expand on the two existing treatment groupings (combination and alternate) adding a new grouping: bundled treatment. Treatment clusters may be combined to any depth, giving users the ability to specify complex treatment trees whose behavior is governed by several user-specified parameters. This approach emphasizes reusability, as treatment clusters, once defined, can be used to create more complex treatment trees or applied to many conditions. By configuring parameters for contribution, efficacy, necessity, primacy, and equivalence, resource relationships and dependencies can be more accurately represented, thereby allowing users to build capabilities with desired treatment properties, for example an intravenous capability for conditions such as anaphylaxis, acute radiation syndrome, etc. MEDPRAT v1.0 remains backward compatible with existing treatment structures, giving users the ability to define new treatment clusters as evidence becomes available, without having to recode their existing treatment databases. In addition to facilitating the representation of more complex treatment options, by pairing treatment clusters with the internal optimization routine, the MEDPRAT set selector, medical resources can be identified as organized in bundles, where appropriate, so that optimized resource sets include groups of highly-dependent resources only when all resources of the group are together. For example, it would be wasteful to include ultrasound gel but not an ultrasound machine, since the gel provides no benefit as a treatment without the ultrasound machine. With treatment clusters, the user may require that both resources are available to provide any benefit as treatment, so that if one resource is optimized out of the set, the other resource will be optimized out as well. RESULTS AND CONCLUSIONS We will report on MEDPRAT treatment clusters used in a bundling study under the IMPACT project of the ExMC element. We will discuss an example of a complex treatment tree. Through the implementation of this feature MEDPRAT enables treatment to be defined and applied in a way that is more representative of the real world, providing more accurate insight into mission medical risk and the medical resource space.

Lawrence Leinweber↗

Identifying Molecules as Biosignatures with Assembly Theory and Mass Spectrometry

The search for evidence of life elsewhere in the universe is hard because it is not obvious what signatures are unique to life. Here we postulate that complex molecules found in high abundance are universal biosignatures as they cannot form by chance. To explore this, we developed the first intrinsic measure of molecular complexity that can be experimentally determined, and this is based upon a new approach called assembly theory which gives the molecular assembly number (MA) of a given molecule. MA allows us to compare the intrinsic complexity of molecules using the minimum number of steps required to construct the molecular graph starting from basic objects, and a probabilistic model shows how the probability of any given molecule forming randomly drops dramatically as its MA increases. To map chemical space, we calculated the MA of ca. 2.5 million compounds, and collected data which showed the complexity of a molecule can be experimentally determined by using three independent techniques including infra-red spectroscopy, nuclear magnetic resonance, and by fragmentation in a mass spectrometer, and this data has an excellent corelation with the values predicted from our assembly theory. We then set out to see if this approach could allow us to identify molecular biosignatures with a set of diverse samples from around the world, outer space, and the laboratory including prebiotic soups. The results show that there is a non-living to living threshold in MA complexity and the higher the MA for a given molecule, the more likely that it had to be produced by a biological process. This work demonstrates it is possible to use this approach to build a life detection instrument that could be deployed on missions to extra-terrestrial locations to detect biosignatures, map the extent of life on Earth, and be used as a molecular complexity scale to quantify the constraints needed to direct prebiotically plausible processes in the laboratory. Such an approach is vital if we are going to find new life elsewhere in the universe or create de-novo life in the lab.

Stuart M Marshall↗

Probabilistic Forecasting of Surface Ozone with a Novel Statistical Approach

The recent change in the Environmental Protection Agency's surface ozone regulation, lowering the surface ozone daily maximum 8-h average (MDA8) exceedance threshold from 75 to 70 ppbv, poses significant challenges to U.S. air quality (AQ) forecasters responsible for ozone MDA8 forecasts. The forecasters, supplied by only a few AQ model products, end up relying heavily on self-developed tools. To help U.S. AQ forecasters, this study explores a surface ozone MDA8 forecasting tool that is based solely on statistical methods and standard meteorological variables from the numerical weather prediction (NWP) models. The model combines the self-organizing map (SOM), which is a clustering technique, with a step wise weighted quadratic regression using meteorological variables as predictors for ozone MDA8. The SOM method identifies different weather regimes, to distinguish between various modes of ozone variability, and groups them according to similarity. In this way, when a regression is developed for a specific regime, data from the other regimes are also used, with weights that are based on their similarity to this specific regime. This approach, regression in SOM (REGiS), yields a distinct model for each regime taking into account both the training cases for that regime and other similar training cases. To produce probabilistic MDA8 ozone forecasts, REGiS weighs and combines all of the developed regression models on the basis of the weather patterns predicted by an NWP model. REGiS is evaluated over the San Joaquin Valley in California and the northeastern plains of Colorado. The results suggest that the model performs best when trained and adjusted separately for an individual AQ station and its corresponding meteorological site.

Ozone variables↗

Probabilistic Extraction Of Vectors In PIV

Probabilistic technique for extraction of velocity vectors in particle-image velocimetry (PIV) implemented with much less computation. Double-exposure photograph of particles in flow illuminated by sheet of light provides data on velocity field of flow. Photograph converted into video image then digitized and processed by computer into velocity-field data. Velocity vectors in interrogation region chosen from magnitude and angle histograms constructed from centroid map of region.

Humphreys, William M., Jr.↗

Orion Entry Performance-Based Center-of-Gravity Box

The Orion capsule is designed both for Low Earth Orbit missions to the ISS and for missions to the moon. For ISS class missions, the capsule will use an Apollo-style direct entry. For lunar return missions, depending on the timing of the mission, the capsule could perform a direct entry or a skip entry of up to 4800 n.mi. in order to land in the coastal waters of California. The physics of atmospheric re-entry determine the capability of the Orion vehicle. For a given vehicle mass and shape, physics tells us that the driving parameters for an entry vehicle are the hypersonic lift-to-drag ratio (L/D) and the flight path angle at entry interface (gamma(sub EI)). The design of the Orion atmospheric re-entry must meet constraints during both nominal and dispersed flight conditions on landing accuracy, heating rate, total heat load, sensed acceleration, and proper disposal of the Service Module. These constraints define an entry corridor in the space of L/D-gamma(sub EI); if the vehicle falls within this corridor, then all constraints are met. The gamma(sub EI) dimension of the corridor can be further constrained by the gloads experienced during emergency entries. Thus, the entry performance for the Orion vehicle can be described completely by the L/D. Bounds on the hypersonic L/D necessary to achieve all the mission requirements can be defined for the given entry corridor. Landing accuracy performance drives the lower limit on L/D. In order to achieve the desired landing accuracy, a minimum L/D must be ensured. The design of the Thermal Protection System (TPS) drives the upper limit on L/D. A higher L/D can drive mass into the design of the TPS. Conversely, once the TPS is designed, the L/D must be ensured to stay below a certain limit in order for the TPS to stay within its design envelop. The L/D must stay within its upper and lower bounds during dispersed flight conditions. L/D is a function of both the aerodynamics and the center-of-gravity (CG) of the vehicle. The aerodynamics of the vehicle are determined by Computational Fluid Mechanics (CFD) and wind tunnel tests. However, the aerodynamics are not known precisely. Instead, an aerodynamic database has been developed where the aerodynamic coefficients are known to fall within a probabilistic band defined by upper and lower bounds. It is expected that the probabilistic band will shrink after the first missions are flown and real-world data is collected. Until that time, the Orion must be designed to the current aerodynamic database. Thus, for a given aerodynamic database with given uncertainties, the allowable range in L/D can be mapped to an allowable box for the CG location. The CG box is used to set requirements on the dispersions allowed for vehicle packaging and cargo storage. As the aerodynamic uncertainties decrease, the size of the CG box can increase. This paper discusses the technique used to map the minimum and maximum L/D bounds set by the entry performance requirements to the allowable dispersions in CG while accounting for aerodynamic uncertainties. The L/D is defined as the ratio of the lift force to the drag force. It is equivalent to the ratio of lift coefficient (C(sub L)) over drag coefficient (C(sub D)). C(sub L) and C(sub D) are functions of Mach number (M) and angle of attack (alpha). A Mach number of 25 is used as a measuring point of the hypersonic L/D. Variations in C(sub L), C(sub D) and alpha cause variations in L/D. Equation (1) shows the three contributions to the variation in L/D.

Rea, Jeremy R.↗

Self-Directed Cooperative Planetary Rovers

The project is concerned with the development of decision-theoretic techniques to optimize the scientific return of planetary rovers. Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such resources as operation time, power, storage capacity, and communication bandwidth. Moreover, the limited computational resources of the rover limit the complexity of on-line planning and scheduling. We have developed a comprehensive solution to this problem that involves high-level tools to describe a mission; a compiler that maps a mission description and additional probabilistic models of the components of the rover into a Markov decision problem; and algorithms for solving the rover control problem that are sensitive to the limited computational resources and high-level of uncertainty in this domain.

Zilberstein, Shlomo↗

Spectral-Spatial Classification of Hyperspectral Images Using Hierarchical Optimization

A new spectral-spatial method for hyperspectral data classification is proposed. For a given hyperspectral image, probabilistic pixelwise classification is first applied. Then, hierarchical step-wise optimization algorithm is performed, by iteratively merging neighboring regions with the smallest Dissimilarity Criterion (DC) and recomputing class labels for new regions. The DC is computed by comparing region mean vectors, class labels and a number of pixels in the two regions under consideration. The algorithm is converged when all the pixels get involved in the region merging procedure. Experimental results are presented on two remote sensing hyperspectral images acquired by the AVIRIS and ROSIS sensors. The proposed approach improves classification accuracies and provides maps with more homogeneous regions, when compared to previously proposed classification techniques.

Tarabalka, Yuliya↗

NASA Tech Briefs, March 2014

Topics include: Data Fusion for Global Estimation of Forest Characteristics From Sparse Lidar Data; Debris and Ice Mapping Analysis Tool - Database; Data Acquisition and Processing Software - DAPS; Metal-Assisted Fabrication of Biodegradable Porous Silicon Nanostructures; Post-Growth, In Situ Adhesion of Carbon Nanotubes to a Substrate for Robust CNT Cathodes; Integrated PEMFC Flow Field Design for Gravity-Independent Passive Water Removal; Thermal Mechanical Preparation of Glass Spheres; Mechanistic-Based Multiaxial-Stochastic-Strength Model for Transversely-Isotropic Brittle Materials; Methods for Mitigating Space Radiation Effects, Fault Detection and Correction, and Processing Sensor Data; Compact Ka-Band Antenna Feed with Double Circularly Polarized Capability; Dual-Leadframe Transient Liquid Phase Bonded Power Semiconductor Module Assembly and Bonding Process; Quad First Stage Processor: A Four-Channel Digitizer and Digital Beam-Forming Processor; Protective Sleeve for a Pyrotechnic Reefing Line Cutter; Metabolic Heat Regenerated Temperature Swing Adsorption; CubeSat Deployable Log Periodic Dipole Array; Re-entry Vehicle Shape for Enhanced Performance; NanoRacks-Scale MEMS Gas Chromatograph System; Variable Camber Aerodynamic Control Surfaces and Active Wing Shaping Control; Spacecraft Line-of-Sight Stabilization Using LWIR Earth Signature; Technique for Finding Retro-Reflectors in Flash LIDAR Imagery; Novel Hemispherical Dynamic Camera for EVAs; 360 deg Visual Detection and Object Tracking on an Autonomous Surface Vehicle; Simulation of Charge Carrier Mobility in Conducting Polymers; Observational Data Formatter Using CMOR for CMIP5; Propellant Loading Physics Model for Fault Detection Isolation and Recovery; Probabilistic Guidance for Swarms of Autonomous Agents; Reducing Drift in Stereo Visual Odometry; Future Air-Traffic Management Concepts Evaluation Tool; Examination and A Priori Analysis of a Direct Numerical Simulation Database for High-Pressure Turbulent Flows; and Resource-Constrained Application of Support Vector Machines to Imagery.

Source record↗

Wildfire Segmentation From Remotely Sensed Data Using Quantum-Compatible Conditional Vector Quantized-Variational Autoencoders

Wildfires represent a critical environmental hazard with multifaceted implications for ecosystems, communities, and public health [1]. The escalating frequency and intensity of wildfires globally have intensified the urgency for robust segmentation methodologies to facilitate effective mitigation, response, and recovery strategies [2]. Accurate wildfire segmentation is pivotal for delineating fire boundaries, assessing progression patterns, and prioritizing resource allocation during emergency scenarios. Furthermore, precise segmentation enables stakeholders, including policymakers, environmental scientists, and emergency responders, to formulate evidence-based strategies, thereby minimizing socio-economic disruptions and ecological degradation. Consequently, advancing wildfire segmentation techniques through innovative technological interventions remains a paramount research imperative. Although foundational in wildfire segmentation, traditional deterministic models exhibit inherent limitations that compromise their efficacy in dynamic and uncertain environments. These models often operate on rigid algorithms prioritizing deterministic classifications, thereby overlooking the inherent complexities and uncertainties associated with wildfire behavior and satellite data variability. Such deterministic frameworks tend to produce oversimplified representations that fail to capture the intricate nuances of evolving fire dynamics, spatial heterogeneity, and environmental interactions [1]. Consequently, the deterministic approach’s propensity for uncertainty collapsing [1, 3] hampers the accuracy, reliability, and applicability of segmentation outcomes in real-world scenarios. Contrastingly, stochastic models offer a more nuanced and adaptable framework for wildfire segmentation. By integrating probabilistic elements into the modeling paradigm, stochastic approaches, particularly probabilistic approaches such as variational auto encoders (VAEs) [4], facilitate comprehensive uncertainty assessment, enabling researchers to quantify and incorporate uncertainties into segmentation outcomes effectively. This probabilistic nature empowers stochastic models to encapsulate variability, account for data inconsistencies, and adapt to evolving environmental conditions, enhancing segmentation accuracy, reliability, and robustness. Embracing stochastic methodologies thus catalyzes advancements in wildfire science by fostering a more holistic, adaptive, and resilient segmentation framework. Despite VAEs demonstrating significant promise in various applications, they come with inherent limitations that have garnered attention within the machine learning community. One of the primary drawbacks lies in their reliance on static priors, which essentially assume a fixed distribution for latent variables, thereby limiting the model’s flexibility to capture complex data structures effectively [5]. This static nature leads to suboptimal representations, especially when dealing with complex and high-dimensional data. Additionally, VAEs often struggle with generating sharp and realistic samples, a phenomenon commonly referred to as mode collapse [5, 7, 6]. Furthermore, the optimization process in VAEs, which involves balancing the reconstruction loss and the regularization term, can sometimes be challenging to fine-tune [7]. In recent efforts to address these shortcomings, alternative approaches like Vector Quantized Variational Auto encoders(VQ-VAEs) [7], address the challenges by incorporating discrete latent variables and leveraging techniques that enhance the quality and diversity of generated samples while maintaining efficient training dynamics. VQ-VAEs propose a dynamic prior distribution generation mechanism that diverges from the static priors commonly associated with traditional VAEs. This dynamic approach allows for more adaptive and context-aware latent variable representations, thereby potentially capturing complex data structures more effectively. Unlike autoregressive prior models such as PixelCNN, which, despite their ability to model dependencies across data dimensions, suffer from significant computational inefficiencies and lack flexibility in handling diverse datasets. In our work, we propose to use a generative quantum-compatible approach to help alleviate the shortcomings of autoregressive prior model in VQ-VAEs. Restricted Boltzmann Machines (RBMs) are a viable alternative prior model that can learn prior distributions in a faster and more flexible manner. In this research endeavor, we meticulously curate a state-of-the-art dataset leveraging satellite MODIS data in conjunction with VIIRS fire masks, derived from Fire Radiative Power (FRP), thereby encapsulating diverse wildfire scenarios and environmental contexts. We developed a conditional VQ-VAE architecture with the RBM prior model that is trained in a supervised manner for segmenting wildfire masks. This innovative approach synergistically harnesses deep learning capabilities, enabling the generation of segmentation maps characterized by heightened precision, granularity, and contextual relevance. Furthermore, replacing the autoregressive prior learning method proposed by the original VQ-VAE with a prior density approximation via quantum-compatible RBM facilitates expedited inference processes, augments flexibility in prior sampling, optimizes computational efficiency and establishes a groundbreaking benchmark in wildfire segmentation methodologies.

quantum machine learning↗