Abstract

In this paper, various discrete-time estimation problems are studied for a finite and homogeneous Markov chain observed by a marked point process. These problems, which could have significant applications in target tracking, manufacturing or communication theory, have never been studied in the literature. The quantities to be estimated are the state, the number of jumps and the occupation times. The identification of the chain transition matrix is also addressed via an expectation maximization procedure. Solutions, in the sense of the conditional distribution, are obtained by a change of probability measure and are shown to have convenient recursive forms. The efficiency of this new approach for sensor modeling is illustrated by the study of a linear Markovian jump filtering problem where, in addition to a classical state observation, a mode Markov point process observation is assumed. A numerical example is given.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.