Search NASA⌕ Search

SEARCH · Search NASA

Results for “probabilistic distance”

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 19 records

Efficient feature subset selection with probabilistic distance criteria

Recursive expressions are derived for efficiently computing the commonly used probabilistic distance measures as a change in the criteria both when a feature is added to and when a feature is deleted from the current feature subset. A combinatorial algorithm for generating all possible r feature combinations from a given set of s features in (s/r) steps with a change of a single feature at each step is presented. These expressions can also be used for both forward and backward sequential feature selection.

Chittineni, C. B.↗

Evaluation of detectability and distinguishability of aircraft control element failures using flight test data

This paper examines the detectability and distinguishability of control element failures on the B-737 aircraft. The results of Weiss (1985) are used to define decentralized residuals from analytic redundancy relationships, and the results of Weiss et al. (1984) are used to define the probabilistic distance measures which provide bounds on the minimum achievable probabilities or error. The residual signals are then generated using data which were recorded during a landing approach of the NASA-Langley Advanced Transport Operations (ATOPS) transportation systems research vehicle (TSRV). The distance measures are computed using estimates of the statistics of these residual signals.

Weiss, J. L.↗

Obstacle detection in foliage with ladar and radar

Autonomous off-road navigation is central to several important applications of unmanned ground vehicles. This requires the ability to detect obstacles in vegetation. We examine the prospects for doing so with scanning ladar and with a linear array of 2.2 GHz micro-impulse radar transceivers. For ladar, we summarize our work to date on algorithms for detecting obstacles in tall grass with single-axis ladar, then present a simple probabilistic model of the distance into tall grass that ladar-based obstacle detection is possible.

ladar↗

A Computationally-Efficient Inverse Approach to Probabilistic Strain-Based Damage Diagnosis

This work presents a computationally-efficient inverse approach to probabilistic damage diagnosis. Given strain data at a limited number of measurement locations, Bayesian inference and Markov Chain Monte Carlo (MCMC) sampling are used to estimate probability distributions of the unknown location, size, and orientation of damage. Substantial computational speedup is obtained by replacing a three-dimensional finite element (FE) model with an efficient surrogate model. The approach is experimentally validated on cracked test specimens where full field strains are determined using digital image correlation (DIC). Access to full field DIC data allows for testing of different hypothetical sensor arrangements, facilitating the study of strain-based diagnosis effectiveness as the distance between damage and measurement locations increases. The ability of the framework to effectively perform both probabilistic damage localization and characterization in cracked plates is demonstrated and the impact of measurement location on uncertainty in the predictions is shown. Furthermore, the analysis time to produce these predictions is orders of magnitude less than a baseline Bayesian approach with the FE method by utilizing surrogate modeling and effective numerical sampling approaches.

Warner, James E.↗

Analysis of a Hypergolic Propellant Explosion During Processing of Launch Vehicles in the VAB

NASA is developing launch vehicles to support missions to Low Earth Orbit (LEO), the moon and deep space. Whether manned or unmanned, the vehicle components will likely be integrated in the Vehicle Assembly Building (VAB) at Kennedy Space Center (KSC) and typically include a fueled spacecraft (SC) that sits on top of one or more stages. The processing of a fueled SC involves hazardous operations when it is brought into the VAB Transfer Aisle and lifted a significant height for mating with lower stages. Accidents resulting from these hazardous operations could impact unrelated personnel working in buildings adjacent to the VAB. Safe separation distances based on the DOD Explosives Standards Quantity-Distance (Q-D) approach result in large IBD arcs. This paper presents site-specific air blast and fragmentation hazard analyses for comparison with the Q-D arcs as well as consequence and risk analyses to provide added information for the decision maker. A new physics-based fragmentation model is presented that includes: a) the development of a primary fragment list (which defines the fragment characteristics) associated with a hypergolic propellant explosion, b) a description of a 3D fragment bounce model, c) the results of probabilistic Monte-Carlo simulations (that include uncertainties in the fragment characteristics) to determine: i) the hazardous fragment density distance, ii) the expected number of wall/roof impacts and penetrations to over 40 buildings adjacent to the VAB, and iii) the risk to building occupants.

Chrostowski, Jon D.↗

Using Correlation to Compute Better Probability Estimates in Plan Graphs

Plan graphs are commonly used in planning to help compute heuristic "distance" estimates between states and goals. A few authors have also attempted to use plan graphs in probabilistic planning to compute estimates of the probability that propositions can be achieved and actions can be performed. This is done by propagating probability information forward through the plan graph from the initial conditions through each possible action to the action effects, and hence to the propositions at the next layer of the plan graph. The problem with these calculations is that they make very strong independence assumptions - in particular, they usually assume that the preconditions for each action are independent of each other. This can lead to gross overestimates in probability when the plans for those preconditions interfere with each other. It can also lead to gross underestimates of probability when there is synergy between the plans for two or more preconditions. In this paper we introduce a notion of the binary correlation between two propositions and actions within a plan graph, show how to propagate this information within a plan graph, and show how this improves probability estimates for planning. This notion of correlation can be thought of as a continuous generalization of the notion of mutual exclusion (mutex) often used in plan graphs. At one extreme (correlation=0) two propositions or actions are completely mutex. With correlation = 1, two propositions or actions are independent, and with correlation > 1, two propositions or actions are synergistic. Intermediate values can and do occur indicating different degrees to which propositions and action interfere or are synergistic. We compare this approach with another recent approach by Bryce that computes probability estimates using Monte Carlo simulation of possible worlds in plan graphs.

Bryce, Daniel↗

Demonstration of the Application of Composite Load Spectra (CLS) and Probabilistic Structural Analysis (PSAM) Codes to SSME Heat Exchanger Turnaround Vane

This report describes a probabilistic structural analysis performed to determine the probabilistic structural response under fluctuating random pressure loads for the Space Shuttle Main Engine (SSME) turnaround vane. It uses a newly developed frequency and distance dependent correlation model that has features to model the decay phenomena along the flow and across the flow with the capability to introduce a phase delay. The analytical results are compared using two computer codes SAFER (Spectral Analysis of Finite Element Responses) and NESSUS (Numerical Evaluation of Stochastic Structures Under Stress) and with experimentally observed strain gage data. The computer code NESSUS with an interface to a sub set of Composite Load Spectra (CLS) code is used for the probabilistic analysis. A Fatigue code was used to calculate fatigue damage due to the random pressure excitation. The random variables modeled include engine system primitive variables that influence the operating conditions, convection velocity coefficient, stress concentration factor, structural damping, and thickness of the inner and outer vanes. The need for an appropriate correlation model in addition to magnitude of the PSD is emphasized. The study demonstrates that correlation characteristics even under random pressure loads are capable of causing resonance like effects for some modes. The study identifies the important variables that contribute to structural alternate stress response and drive the fatigue damage for the new design. Since the alternate stress for the new redesign is less than the endurance limit for the material, the damage due high cycle fatigue is negligible.

Rajagopal, Kadambi R.↗

Metrics for Labeled Markov Systems

Partial Labeled Markov Chains are simultaneously generalizations of process algebra and of traditional Markov chains. They provide a foundation for interacting discrete probabilistic systems, the interaction being synchronization on labels as in process algebra. Existing notions of process equivalence are too sensitive to the exact probabilities of various transitions. This paper addresses contextual reasoning principles for reasoning about more robust notions of "approximate" equivalence between concurrent interacting probabilistic systems. The present results indicate that:We develop a family of metrics between partial labeled Markov chains to formalize the notion of distance between processes. We show that processes at distance zero are bisimilar. We describe a decision procedure to compute the distance between two processes. We show that reasoning about approximate equivalence can be done compositionally by showing that process combinators do not increase distance. We introduce an asymptotic metric to capture asymptotic properties of Markov chains; and show that parallel composition does not increase asymptotic distance.

Desharnais, Josee↗

A Model-Based Probabilistic Inversion Framework for Wire Fault Detection Using TDR

Time-domain reflectometry (TDR) is one of the standard methods for diagnosing faults in electrical wiring and interconnect systems, with a long-standing history focused mainly on hardware development of both high-fidelity systems for laboratory use and portable hand-held devices for field deployment. While these devices can easily assess distance to hard faults such as sustained opens or shorts, their ability to assess subtle but important degradation such as chafing remains an open question. This paper presents a unified framework for TDR-based chafing fault detection in lossy coaxial cables by combining an S-parameter based forward modeling approach with a probabilistic (Bayesian) inference algorithm. Results are presented for the estimation of nominal and faulty cable parameters from laboratory data.

Schuet, Stefan R.↗

Investigation of Alert Zone and Display Concepts for Free Flight

To better understand the potential benefits and drawbacks of utilizing a probability-based method, a number of alternative approaches to the collision avoidance problem were examined and summarized in the paper "Survey of Conflict Detection and Resolution Modeling Methods" which was presented in August 1997 at the AIAA Guidance, Navigation, and Control Conference. The paper provides a summary and comparative evaluation of the many different approaches that have been used in the past to perform conflict analysis. Each method is categorized in its dynamic modeling approach and method of handling conflict detection and conflict resolution. For example, one category included the extrapolation method used to predict future trajectories of which 3 were defined: nominal, probabilistic, and worst-case. Another category listed the metrics and parameters used by each method to make conflict decisions (i.e. estimated time to closest point of approach, miss distance, current separation, expected maneuvering cost, probability of conflict). Other useful information such as the ability to handle multi-aircraft conflicts and cooperative and non-cooperative maneuvering is also included.

Yang, Lee C.↗

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.↗

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↗

Probabilistic Analysis of Impact of Wake Vortices on Closely-Spaced Parallel Approaches

One of the primary constraints on the capacity of the nation's air transportation system is the landing capacity of its largest airports. Many airports with closely spaced parallel runways suffer a severe runway acceptance rate when the weather conditions do not allow full utilization of these parallel runways. The present requirement for simultaneous independent landings in Instrument Meteorological Conditions, IMC, is at least 4300 feet of lateral runway spacing (as close as 3000 feet for runways with a Precision Runway Monitor). Operations in Visual Meteorological Conditions, VMC, to Closely Spaced Parallel Approaches only require a lateral runway spacing greater than 750 feet. A study by Hardy and Lewis integrated and extended earlier studies and concepts in lateral traffic separation, longitudinal station keeping, wake prediction, wake display, and the concepts of R N P into a preliminary system concept for Closely Spaced Parallel Approaches in IMC. This system allows IMC airport acceptance rates to approach those for VMC. The system concept that was developed, presented traffic and wake information on the NAVigation Display, NAV, and developed operational procedures for a mix of conventional and Runway Independent Aircraft with different approach speeds to Closely Spaced Parallel Runways. This paper first describes some improvements made on the technology needed to better predict and formulate a probabilistic representation for the time-dependent motion and spreading of the hazardous region associated with the lift-generated vortex wakes of preceding aircraft. In this way, the time at which the vortex wakes of leading aircraft intrude into the airspace of adjacent flight-corridor/runway combinations can be more reliably predicted. Such a prediction is needed because it determines restraints to be placed on in-trail separation distances; or, the allowable time intervals between aircraft executing nearly simultaneous landings or takeoffs on very closely-spaced runways. Improved estimates of wake spreading are achieved by inclusion of representations in the equations for wake spreading due to ambient turbulence and due to the long-wave instability of a vortex pair. Wake motion and spreading due to the time-averaged wind and its variations with time, are retained. The more detailed representation of wake spreading presented here permits the development of probabilistically-based uncertainty estimates for wake spreading. Measurements needed within actual aircraft wake vortices to validate and support this analysis are also described. The second part of the paper uses the improvements in the accuracy of the location of wake vortices to extend the preliminary system concept for Closely Spaced Parallel Approaches described earlier with more robust operational procedures. Additionally, improvements in longitudinal station keeping, wake display, and risk assessment methodologies are incorporated and described.

Hardy, Gordon H.↗

Impact-Identified Medical Capabilities with Largest Effect on Medical Risk for an Extended Duration Artemis Mission

Historically, identifying resources to include in a medical system has been based on heuristically guided clinical subject matter expert assessment. Probabilistic risk assessment (PRA) and tradespace analysis have the power to simplify and increase the fidelity of this traditional approach by providing initial risk estimates and system design solutions that fit within the specified constraints. This will be especially important as the increased mission complexity, distance from Earth, and duration of LDEMs is likely to drive an increase in mission medical risk. NASA’s Informing Mission Planning via Analysis of Complex Tradespaces tool (IMPACT) is designed to do just that. IMPACT uses an evidence based medical database of conditions likely to affect LDEM outcomes and a PRA computational engine to estimate how medical conditions and included medical capabilities affect mission outcomes. We identified the 10 medical conditions with the largest effect on medical risks and determined what medical system capabilities affected risk reduction the greatest.

Anderson A↗

Analysis of backward error recovery for concurrent processes with recovery blocks

Three different methods of implementing recovery blocks (RB's). These are the asynchronous, synchronous, and the pseudo recovery point implementations. Pseudo recovery points so that unbounded rollback may be avoided while maintaining process autonomy are proposed. Probabilistic models for analyzing these three methods under standard assumptions in computer performance analysis, i.e., exponential distributions for related random variables were developed. The interval between two successive recovery lines for asynchronous RB's mean loss in computation power for the synchronized method, and additional overhead and rollback distance in case PRP's are used were estimated.

Shin, K. G.↗

Mariner Venus-Mercury 1973 mission solar proton environment: fluence and dose

A derivation is presented for proton fluence over the duration of the Mariner Venus-Mercury 1973 (MVM73) mission in terms of a relatively constant, low energy component, the solar wind, and a probabilistic high energy component from discrete solar events. An updated correlation of yearly energetic proton fluence with yearly average sunspot number is presented. This correlation and sunspot cycle forecasts for the period of the MVM73 mission (late 1973 through early 1975) form the basis for the high energy proton fluence estimates with various confidence levels. Uncertainties in the probability estimates and in calculation of the scaling with distance from the Sun are discussed. Selection of a particular 95-percentile model as the design constraint is recommended, and reasons are presented for not using the worst-case model. Interior fluences were calculated and expressed in terms useful for spacecraft design.

Thomas, J. R.↗

Estimating Controller Intervention Probabilities for Optimized Profile Descent Arrivals

Simulations of arrival traffic at Dallas/Fort-Worth and Denver airports were conducted to evaluate incorporating scheduling and separation constraints into advisories that define continuous descent approaches. The goal was to reduce the number of controller interventions required to ensure flights maintain minimum separation distances of 5 nmi horizontally and 1000 ft vertically. It was shown that simply incorporating arrival meter fix crossing-time constraints into the advisory generation could eliminate over half of the all predicted separation violations and more than 80% of the predicted violations between two arrival flights. Predicted separation violations between arrivals and non-arrivals were 32% of all predicted separation violations at Denver and 41% at Dallas/Fort-Worth. A probabilistic analysis of meter fix crossing-time errors is included which shows that some controller interventions will still be required even when the predicted crossing-times of the advisories are set to add a 1 or 2 nmi buffer above the minimum in-trail separation of 5 nmi. The 2 nmi buffer was shown to increase average flight delays by up to 30 sec when compared to the 1 nmi buffer, but it only resulted in a maximum decrease in average arrival throughput of one flight per hour.

continous descent arrivals↗