HMM-based quantized dissipative control for 2-D Markov jump systems

In this paper, the dissipative quantized control problem is addressed for Markov jump two-dimensional systems based on Roesser model, in which both asynchronous phenomenon and signal quantization between system modes and controller modes are taken into consideration simultaneously. Moreover, the hidden Markov model (HMM) is adopted to tackle such an asynchronous phenomenon. The principal goal is to devise a state feedback controller, which guarantees that the established closed-loop system achieves asymptotic mean square stability as well as satisfies a prescribed extended dissipative property. Drawing support from Lyapunov function approach and inequality technique, some less conservative criteria ensuring the implementability of the desired controller are derived. Ultimately, the availability and practicability of the developed results are certified through a simulation example.     

Basic problems and solution methods for two-dimensional continuous 3 × 3 order hidden Markov model

A novel model referred to as two-dimensional continuous 3 × 3 order hidden Markov model is put forward to avoid the disadvantages of the classical hypothesis of two-dimensional continuous hidden Markov model. This paper presents three equivalent definitions of the model, in which the state transition probability relies on not only immediate horizontal and vertical states but also immediate diagonal state, and in which the probability density of the observation relies on not only current state but also immediate horizontal and vertical states. The paper focuses on the three basic problems of the model, namely probability density calculation, parameters estimation and path backtracking. Some algorithms solving the questions are theoretically derived, by exploiting the idea that the sequences of states on rows or columns of the model can be viewed as states of a one-dimensional continuous 1 × 2 order hidden Markov model. Simulation results further demonstrate the performance of the algorithms. Because there are more statistical characteristics in the structure of the proposed new model, it can more accurately describe some practical problems, as compared to two-dimensional continuous hidden Markov model.     

Parameter estimation for partially observable systems subject to random failure

In this paper, we present a parameter estimation procedure for a condition‐based maintenance model under partial observations. Systems can be in a healthy or unhealthy operational state, or in a failure state. System deterioration is driven by a continuous time homogeneous Markov chain and the system state is unobservable, except the failure state. Vector information that is stochastically related to the system state is obtained through condition monitoring at equidistant sampling times. Two types of data histories are available — data histories that end with observable failure, and censored data histories that end when the system has been suspended from operation but has not failed. The state and observation processes are modeled in the hidden Markov framework and the model parameters are estimated using the expectation–maximization algorithm. We show that both the pseudolikelihood function and the parameter updates in each iteration of the expectation–maximization algorithm have explicit formulas. A numerical example is developed using real multivariate spectrometric oil data coming from the failing transmission units of 240‐ton heavy hauler trucks used in the Athabasca oil sands of Alberta, Canada. Copyright © 2012 John Wiley & Sons, Ltd.     

Ergodic and adaptive control of hidden Markov models

A partially observed stochastic system is described by a discrete time pair of Markov processes. The observed state process has a transition probability that is controlled and depends on a hidden Markov process that also can be controlled. The hidden Markov process is completely observed in a closed set, which in particular can be the empty set and only observed through the other process in the complement of this closed set. An ergodic control problem is solved by a vanishing discount approach. In the case when the transition operators for the observed state process and the hidden Markov process depend on a parameter and the closed set, where the hidden Markov process is completely observed, is nonempty and recurrent an adaptive control is constructed based on this family of estimates that is almost optimal.     

Parameter estimation in a condition-based maintenance model

A parameter estimation problem for a condition-based maintenance model is considered. We model a failing system that can be in a healthy or unhealthy operational state, or in a failure state. System deterioration is assumed to follow a hidden, three-state continuous time Markov process. Vector autoregressive data are obtained through condition monitoring at discrete time points, which gives partial information about the unobservable system state. Two kinds of data histories are considered: histories that end with observable system failure and histories that end when the system is suspended from operation but has not failed. Maximum likelihood estimates of the model parameters are obtained using the EM algorithm and a closed form expression for the pseudo-likelihood function is derived. Numerical results are provided which illustrate the estimation procedure.     

Modelling of hydrological persistence for hidden state Markov decision processes

A reservoir in south east Queensland can supply irrigators, industry or domestic users. Stochastic inflow is modelled by a hidden state Markov chain, with three hidden states corresponding to prevailing climatic conditions. A stochastic dynamic program that relies on estimation of the hidden state is implemented. The optimal decisions are compared with those obtained if the hidden state Markov chain model is replaced with a model that relies on the Southern Oscillation Index to define prevailing climatic conditions.     

A model for real-time failure prognosis based on hidden Markov model and belief rule base

As one of most important aspects of condition-based maintenance (CBM), failure prognosis has attracted an increasing attention with the growing demand for higher operational efficiency and safety in industrial systems. Currently there are no effective methods which can predict a hidden failure of a system real-time when there exist influences from the changes of environmental factors and there is no such an accurate mathematical model for the system prognosis due to its intrinsic complexity and operating in potentially uncertain environment. Therefore, this paper focuses on developing a new hidden Markov model (HMM) based method which can deal with the problem. Although an accurate model between environmental factors and a failure process is difficult to obtain, some expert knowledge can be collected and represented by a belief rule base (BRB) which is an expert system in fact. As such, combining the HMM with the BRB, a new prognosis model is proposed to predict the hidden failure real-time even when there are influences from the changes of environmental factors. In the proposed model, the HMM is used to capture the relationships between the hidden failure and monitored observations of a system. The BRB is used to model the relationships between the environmental factors and the transition probabilities among the hidden states of the system including the hidden failure, which is the main contribution of this paper. Moreover, a recursive algorithm for online updating the prognosis model is developed. An experimental case study is examined to demonstrate the implementation and potential applications of the proposed real-time failure prognosis method.     

Basic problems solving for two-dimensional discrete 3 × 4 order hidden markov model

A novel model is proposed to overcome the shortages of the classical hypothesis of the two-dimensional discrete hidden Markov model. In the proposed model, the state transition probability depends on not only immediate horizontal and vertical states but also on immediate diagonal state, and the observation symbol probability depends on not only current state but also on immediate horizontal, vertical and diagonal states. This paper defines the structure of the model, and studies the three basic problems of the model, including probability calculation, path backtracking and parameters estimation. By exploiting the idea that the sequences of states on rows or columns of the model can be seen as states of a one-dimensional discrete 1 × 2 order hidden Markov model, several algorithms solving the three questions are theoretically derived. Simulation results further demonstrate the performance of the algorithms. Compared with the two-dimensional discrete hidden Markov model, there are more statistical characteristics in the structure of the proposed model, therefore the proposed model theoretically can more accurately describe some practical problems.     

Swallowing sound detection using hidden markov modeling of recurrence plot features

Automated detection of swallowing sounds in swallowing and breath sound recordings is of importance for monitoring purposes in which the recording durations are long. This paper presents a novel method for swallowing sound detection using hidden Markov modeling of recurrence plot features. Tracheal sound recordings of 15 healthy and nine dysphagic subjects were studied. The multidimensional state space trajectory of each signal was reconstructed using the Taken method of delays. The sequences of three recurrence plot features of the reconstructed trajectories (which have shown discriminating capability between swallowing and breath sounds) were modeled by three hidden Markov models. The Viterbi algorithm was used for swallowing sound detection. The results were validated manually by inspection of the simultaneously recorded airflow signal and spectrogram of the sounds, and also by auditory means. The experimental results suggested that the performance of the proposed method using hidden Markov modeling of recurrence plot features was superior to the previous swallowing sound detection methods.     

Multivariate Discrete Hidden Markov Models for Domain-Based Measurements and Assessment of Risk Factors in Child Development

Many studies in the social and behavioral sciences involve multivariate discrete measurements, which are often characterized by the presence of an underlying individual trait, the existence of clusters such as domains of measurements, and the availability of multiple waves of cohort data. Motivated by an application in child development, we propose a class of extended multivariate discrete hidden Markov models for analyzing domain-based measurements of cognition and behavior. A random effects model is used to capture the long-term trait. Additionally, we develop a model selection criterion based on the Bayes factor for the extended hidden Markov model. The National Longitudinal Survey of Youth (NLSY) is used to illustrate the methods. Supplementary technical details and computer codes are available online.     

A Higher-Order Hidden Markov Chain-Modulated Model for Asset Allocation

This paper presents an analysis of asset allocation strategies when the asset returns are governed by a discrete-time higher-order hidden Markov model (HOHMM), also called the weak hidden Markov model. We assume the drifts and volatilities of the asset returns switch over time according to the state of the HOHMM, in which the probability of the current state depends on the information from previous time-steps. The “switching” and “mixed” strategies are studied. We use a multivariate filtering technique in conjunction with the EM algorithm to obtain estimates of model parameter at a given time. This, in turn, aids investors in determining the optimal investment strategy for the next time step. Numerical implementation is applied to data on Russell 3000 value and growth indices. We benchmark the respective performances of portfolio using three classical investment measures.     

基于动态规划的高阶隐马氏模型推广的Viterbi算法

首先通过Hadar等价变换方法将高阶隐马氏模型转换为与之等价的一阶向量值隐马氏模型,然后利用动态规划原理建立了一阶向量值隐马氏模型的Viterbi算法,最后通过高阶隐马氏模型和一阶向量值隐马氏模型之间的等价关系建立了高阶隐马氏模型基于动态规划推广的Viterbi算法．研究结果在一定程度上推广了几乎所有隐马氏模型文献中所涉及到的解码问题的Viterbi算法,从而进一步丰富和发展了高阶隐马氏模型的算法理论．     

On the Accuracy of the MAP Inference in HMMs

In a hidden Markov model, the underlying Markov chain is usually unobserved. Often, the state path with maximum posterior probability (Viterbi path) is used as its estimate. Although having the biggest posterior probability, the Viterbi path can behave very atypically by passing states of low marginal posterior probability. To avoid such situations, the Viterbi path can be modified to bypass such states. In this article, an iterative procedure for improving the Viterbi path in such a way is proposed and studied. The iterative approach is compared with a simple batch approach where a number of states with low probability are all replaced at the same time. It can be seen that the iterative way of adjusting the Viterbi state path is more efficient and it has several advantages over the batch approach. The same iterative algorithm for improving the Viterbi path can be used when it is possible to reveal some hidden states and estimating the unobserved state sequence can be considered as an active learning task. The batch approach as well as the iterative approach are based on classification probabilities of the Viterbi path. Classification probabilities play an important role in determining a suitable value for the threshold parameter used in both algorithms. Therefore, properties of classification probabilities under different conditions on the model parameters are studied.     

A comparison of some criteria for states selection in the latent Markov model for longitudinal data

We compare different selection criteria to choose the number of latent states of a multivariate latent Markov model for longitudinal data. This model is based on an underlying Markov chain to represent the evolution of a latent characteristic of a group of individuals over time. Then, the response variables observed at different occasions are assumed to be conditionally independent given this chain. Maximum likelihood estimation of the model is carried out through an Expectation–Maximization algorithm based on forward–backward recursions which are well known in the hidden Markov literature for time series. The selection criteria we consider are based on penalized versions of the maximum log-likelihood or on the posterior probabilities of belonging to each latent state, that is, the conditional probability of the latent state given the observed data. Among the latter criteria, we propose an appropriate entropy measure tailored for the latent Markov models. We show the results of a Monte Carlo simulation study aimed at comparing the performance of the above states selection criteria on the basis of a wide set of model specifications.     

A sequential condition‐based repair/replacement policy with non‐periodic inspections for a system subject to continuous wear

This paper studies a condition‐based maintenance policy for a repairable system subject to a continuous‐state gradual deterioration monitored by sequential non‐periodic inspections. The system can be maintained using different maintenance operations (partial repair, as good as new replacement) with different effects (on the system state), costs and durations. A parametric decision framework (multi‐threshold policy) is proposed to choose sequentially the best maintenance actions and to schedule the future inspections, using the on‐line monitoring information on the system deterioration level gained from the current inspection. Taking advantage of the semi‐regenerative (or Markov renewal) properties of the maintained system state, we construct a stochastic model of the time behaviour of the maintained system at steady state. This stochastic model allows to evaluate several performance criteria for the maintenance policy such as the long‐run system availability and the long‐run expected maintenance cost. Numerical experiments illustrate the behaviour of the proposed condition‐based maintenance policy. Copyright © 2003 John Wiley & Sons, Ltd.     

Particle filtering in the Dempster–Shafer theory

This paper derives a particle filter algorithm within the Dempster–Shafer framework. Particle filtering is a well-established Bayesian Monte Carlo technique for estimating the current state of a hidden Markov process using a fixed number of samples. When dealing with incomplete information or qualitative assessments of uncertainty, however, Dempster–Shafer models with their explicit representation of ignorance often turn out to be more appropriate than Bayesian models.The contribution of this paper is twofold. First, the Dempster–Shafer formalism is applied to the problem of maintaining a belief distribution over the state space of a hidden Markov process by deriving the corresponding recursive update equations, which turn out to be a strict generalization of Bayesian filtering. Second, it is shown how the solution of these equations can be efficiently approximated via particle filtering based on importance sampling, which makes the Dempster–Shafer approach tractable even for large state spaces. The performance of the resulting algorithm is compared to exact evidential as well as Bayesian inference.     

������ɷ��Ԫ��̬�ֲ������ļ�����Ȼ����

??Hidden Markov model is widely used in statistical modeling of time, space and state transition data. The definition of hidden Markov multivariate normal distribution is given. The principle of using cluster analysis to determine the hidden state of observed variables is introduced. The maximum likelihood estimator of the unknown parameters in the model is derived. The simulated observation data set is used to test the estimation effect and stability of the method. The characteristic is simple classical statistical inference such as cluster analysis and maximum likelihood estimation. The method solves the parameter estimation problem of complex statistical models.     

Maximum Likelihood Estimation of Hidden Markov Multivariate Normal Distribution Parameters

Hidden Markov model is widely used in statistical modeling of time, space and state transition data. The definition of hidden Markov multivariate normal distribution is given. The principle of using cluster analysis to determine the hidden state of observed variables is introduced. The maximum likelihood estimator of the unknown parameters in the model is derived. The simulated observation data set is used to test the estimation effect and stability of the method. The characteristic is simple classical statistical inference such as cluster analysis and maximum likelihood estimation. The method solves the parameter estimation problem of complex statistical models.     

Filtering of a Multi-Dimension Stochastic Volatility Model

In this article, we study a stochastic volatility model for a class of risky assets. We assume that the volatilities of the assets are driven by a common state of economy, which is unobservable and represented by a hidden Markov chain. Under this hidden Markov model (HMM), we develop recursively computable filtering equations for certain functionals of the chain. Expectation maximization (EM) parameter estimation is then used. Applications to an optimal asset allocation problem with mean-variance utility are given.     

Modelling the probability assessment of system state prognosis using available condition monitoring information

^** Email: w.wang{at}salford.ac.uk This paper reports on a model to assess the current and futurestates of a monitored system based on measured condition monitoringinformation to date. The true state of the system is unobservable,but is assumed to be related to the measured condition monitoringinformation in a stochastic way. We further assume that thetransition of the system state follows a time-dependent Markovchain which has only three states, namely good, defective andfailed. This assumption effectively defines a two-stage failureprocess which is widely used in delay time modelling of maintainedsystems. Three modelling techniques are used to establish themodel. First, we use a hidden Markov model to describe the transitionsbetween system states. Second, the transition matrix is establishedbased on the well-known delay time concept. The last one isthe use of the filtering technique to construct the relationshipbetween measured condition information and the underlying truestate of the system. We also discuss the procedure for modelparameter estimation. A numerical example is presented to demonstratethe modelling ideas.