A New Nonlinear Set Membership Filter Based on Guaranteed Bounding Ellipsoid Algorithm
Authors:
- 1 February 2013
- journal article
- Published by Elsevier in Acta Automatica Sinica
- Vol. 39 (2) , 146-154
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61005092, 61105094)
- Doctoral Program Foundation of Institutions of Higher Education of China (20100092120026)
This publication has 23 references indexed in Scilit:
- Recurrent Neural Networks Training With Stable Bounding Ellipsoid AlgorithmIEEE Transactions on Neural Networks, 2009
- A Nonlinear Set Membership Approach for the Localization and Map Building of Underwater RobotsIEEE Transactions on Robotics, 2009
- Ellipsoidal Techniques for Reachability Analysis of Discrete-Time Linear SystemsIEEE Transactions on Automatic Control, 2007
- Reliable Localization Using Set-Valued Nonlinear FiltersIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2005
- A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian trackingIEEE Transactions on Signal Processing, 2002
- Guaranteed recursive non‐linear state bounding using interval analysisInternational Journal of Adaptive Control and Signal Processing, 2002
- Set membership localization and mapping for autonomous navigationInternational Journal of Robust and Nonlinear Control, 2001
- Robust extended Kalman filteringIEEE Transactions on Signal Processing, 1999
- Recursive state bounding by parallelotopesAutomatica, 1996
- On the value of information in system identification—Bounded noise caseAutomatica, 1982