Search NASA⌕ Search

SEARCH · Search NASA

Results for “Markov”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS2019

Search for Gravitational Waves From Scorpius X-1 in the Second Advanced LIGO Observing Run With an Improved Hidden Markov Model

We present results from a semi coherent search for continuous gravitational waves from the low-mass x-ray binary Scorpius X-1, using a hidden Markov model (HMM) to track spin wandering. This search improves on previous HMM-based searches of LIGO data by using an improved frequency domain matched filter, the J-statistic, and by analyzing data from Advanced LIGO’s second observing run. In the frequency range searched, from 60 to 650 Hz, we find no evidence of gravitational radiation. At 194.6 Hz, the most sensitive search frequency, we report an upper limit on gravitational wave strain (at 95% confidence) ofh95%0¼3.47×10−25when marginalizing over source inclination angle. This is the most sensitive search for Scorpius X-1, to date, that is specifically designed to be robust in the presence of spin wandering.

B P Abbott↗
NASA NTRSDate not supplied

Evaluating Faulty State Occurrence in Wildfire UAS Missions Using Markov Chains

As autonomous technology advances, unmanned aircraft systems are increasingly integrated into emergency response missions, such as wildfire response. These systems must be be safe with less risk than non-autonomous counter parts, yet quantifying the risk associated with present-day and future systems conventionally relies solely on expert opinion and little data. Instead, combining narrative mishap reports with probabilistic analysis can provide a method for evolutionary and timely risk analysis. In this paper, we present a framework for a data-driven probabilistic risk assessment style analysis, where hazard events and rates originate from documented UAS mishaps. The framework is applied to a UAS mapping mission in wildfire response, including a fault tree analysis, event tree analysis, and probabilistic analysis using Markov Chains. The analysis provides an enumeration of hazards in the system, hazard events that can lead to faults, the probability of a mission experiencing any fault, the probability of experiencing a specific fault, and the expected time spent until faulty states occur in present-day operations.

risk analysis↗
NASA NTRSDate not supplied

Evaluating Faulty State Occurrence in Wildfire UAS Missions Using Markov Chains

As autonomous technology advances, unmanned aircraft systems are increasingly integrated into emergency response missions, such as wildfire response. These systems must be be safe with less risk than non-autonomous counter parts, yet quantifying the risk associated with present-day and future systems conventionally relies solely on expert opinion and little data. Instead, combining narrative mishap reports with probabilistic analysis can provide a method for evolutionary and timely risk analysis. In this paper, we present a framework for a data-driven probabilistic risk assessment style analysis, where hazard events and rates originate from documented UAS mishaps. The framework is applied to a UAS mapping mission in wildfire response, including a fault tree analysis, event tree analysis, and probabilistic analysis using Markov Chains. The analysis provides an enumeration of hazards in the system, hazard events that can lead to faults, the probability of a mission experiencing any fault, the probability of experiencing a specific fault, and the expected time spent until faulty states occur in present-day operations.

risk analysis↗
NASA NTRS1997

Recognizing Chromospheric Objects via Markov Chain Monte Carlo

The solar chromosphere consists of three classes which contribute differentially to ultraviolet radiation reaching the earth. We describe a data set of solar images, means of segmenting the images into the constituent classes, and a novel high-level representation for compact objects based on a triangulated spatial membership function.

Markov Chain Monte Carlo Solar↗
NASA NTRS1998

Hidden Markov Models and Neural Networks for Fault Detection

Continuous online monitoring of complex dynamic systems is common in applications as diverse as industrial plant operations, telecommunications network, and biomedical health monitoring. For monitoring purposes, the exact nature of the system under observation is typically not relevant provided there exist some measurements or symptoms which provide diagnostics information regarding the underlying system state.

Markov Fault Detection↗
NASA NTRS2012

A Markov Chain Approach to Probabilistic Swarm Guidance

This paper introduces a probabilistic guidance approach for the coordination of swarms of autonomous agents. The main idea is to drive the swarm to a prescribed density distribution in a prescribed region of the configuration space. In its simplest form, the probabilistic approach is completely decentralized and does not require communication or collabo- ration between agents. Agents make statistically independent probabilistic decisions based solely on their own state, that ultimately guides the swarm to the desired density distribution in the configuration space. In addition to being completely decentralized, the probabilistic guidance approach has a novel autonomous self-repair property: Once the desired swarm density distribution is attained, the agents automatically repair any damage to the distribution without collaborating and without any knowledge about the damage.

Markov chain↗
NASA NTRS1979

The condition of a finite Markov chain and perturbation bounds for the limiting probabilities

The inequalities bounding the relative error the norm of w- w squiggly/the norm of w are exhibited by a very simple function of E and A. Let T denote the transition matrix of an ergodic chain, C, and let A = I - T. Let E be a perturbation matrix such that T squiggly = T - E is also the transition matrix of an ergodic chain, C squiggly. Let w and w squiggly denote the limiting probability (row) vectors for C and C squiggly. The inequality is the best one possible. This bound can be significant in the numerical determination of the limiting probabilities for an ergodic chain. In addition to presenting a sharp bound for the norm of w-w squiggly/the norm of w an explicit expression for w squiggly will be derived in which w squiggly is given as a function of E, A, w and some other related terms.

Meyer, C. D., Jr.↗
NASA NTRS1984

An approximation formula for a class of Markov reliability models

A way of considering a small but often used class of reliability model and approximating algebraically the systems reliability is shown. The models considered are appropriate for redundant reconfigurable digital control systems that operate for a short period of time without maintenance, and for such systems the method gives a formula in terms of component fault rates, system recovery rates, and system operating time.

White, A. L.↗
NASA NTRS1984

Optimal inventories for overhaul of repairable redundant systems - A Markov decision model

A Markovian decision model was developed to calculate the optimal inventory of repairable spare parts for an avionics control system for commercial aircraft. Total expected shortage costs, repair costs, and holding costs are minimized for a machine containing a single system of redundant parts. Transition probabilities are calculated for each repair state and repair rate, and optimal spare parts inventory and repair strategies are determined through linear programming. The linear programming solutions are given in a table.

Schaefer, M. K.↗
NASA NTRS1985

Synthetic bounds for semi-Markov reliability models

Upper and lower bounds are derived for the probability of failure for a class of highly reliable process control computers. The bounds are synthetic in the sense that the descriptions of component failure and system recovery are assumed to be obtained from different sources. The reliability model is constructed under the assumption that the processes are independent.

White, A. L.↗
NASA NTRS1985

Markov-Tree model of intrinsic transport in Hamiltonian systems

A particle in a chaotic region of phase space can spend a long time near the boundary of a regular region since transport there is slow. This 'stickiness' of regular regions is thought to be responsible for previous observations in numerical experiments of a long-time algebraic decay of the particle survival probability, i.e., survival probability approximately t to the (-z) power for large t. This paper presents a global model for transport in such systems and demonstrates the essential role of the infinite hierarchy of small islands interspersed in the chaotic region. Results for z are discussed.

Meiss, J. D.↗