On estimation of discrete processes under multiplicative and additive noise conditions
Information Sciences: an International Journal
Paper: A survey of design methods for failure detection in dynamic systems
Automatica (Journal of IFAC)
Brief paper: Random sampling approach to state estimation in switching environments
Automatica (Journal of IFAC)
Brief paper: A detection-estimation scheme for state estimation in switching environments
Automatica (Journal of IFAC)
Learning with a probabilistic teacher
IEEE Transactions on Information Theory
Recursive Bayesian estimation with uncertain observation (Corresp.)
IEEE Transactions on Information Theory
Exact and approximate filtering in signal detection: An example (Corresp.)
IEEE Transactions on Information Theory
Adaptive estimation in linear systems with unknown Markovian noise statistics
IEEE Transactions on Information Theory
Simultaneous Localization, Mapping and Moving Object Tracking
International Journal of Robotics Research
Robotics and Autonomous Systems
Interacting MCMC particle filter for tracking maneuvering target
Digital Signal Processing
Brief paper: Segmentation of ARX-models using sum-of-norms regularization
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Brief paper: A method for the estimation of infrequent abrupt changes in nonlinear systems
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
A multiple model multiple hypothesis filter for Markovian switching systems
Automatica (Journal of IFAC)
Model-set adaptation using a fuzzy Kalman filter
Mathematical and Computer Modelling: An International Journal
A distributed multirate IMM algorithm for multiplatform tracking
Mathematical and Computer Modelling: An International Journal
Hi-index | 22.16 |
The problem of state estimation and system structure detection for discrete stochastic dynamical systems with parameters which may switch among a finite set of values is considered. The switchings are modelled by a Markov chain with known transition probabilities. A brief survey and a unified treatment of the existing suboptimal algorithms are provided. The optimal algorithms require exponentially increasing memory and computations with time. Simulation results comparing the various suboptimal algorithms are presented.