A Set-membership Smoother for State Estimation in Disturbances of Unknown Distribution

被引:0
作者
Liu, Jieyu [1 ,2 ]
Shen, Qiang [1 ]
Deller, John R., Jr. [3 ]
机构
[1] Xian Res Inst High Tech, Xian 710025, Shaanxi, Peoples R China
[2] Xian Elect & Mech Engn Inst, Xian 710119, Shaanxi, Peoples R China
[3] Michigan State Univ, Dept Elect & Comp Engn, E Lansing, MI 48824 USA
来源
PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017) | 2017年
基金
美国国家科学基金会;
关键词
smoother; state estimation; filter; set-membership; optimal bounding ellipsoid (OBE); IDENTIFICATION; SYSTEMS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A novel set-membership-based smoothing method for state estimation using the optimal bounding ellipsoid (OBE) algorithms is presented. OBE filters have been proven to be effective in state estimation problems with unknown but bounded errors. Compared with filtering methods, smoothing methods provide a much more accurate and reliable state estimate because observations beyond the current estimation time are used. The new method is a Rauch-Tung-Striebel (RTS)-type smoother which employs both forward and backward passes to estimate the system state. The forward pass is performed using the OBE filter, while the backward pass maintains the fundamental spirit of OBE algorithm in the backward direction. The minimum-volume and minimum-trace bounding ellipsoids containing the feasible state set are derived from this algorithm. Simulation results show the performance of the proposed smoother is superior to both the traditional OBE filter and Kalman filter for state estimation.
引用
收藏
页码:5038 / 5042
页数:5
相关论文
共 19 条
[1]   On Bayesian Fixed-Interval Smoothing Algorithms [J].
Ait-El-Fquih, Boujemaa ;
Desbouvries, Francois .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2008, 53 (10) :2437-2442
[2]   A set-membership state estimation algorithm based on DC programming [J].
Alamo, T. ;
Bravo, J. M. ;
Redondo, M. J. ;
Camacho, E. F. .
AUTOMATICA, 2008, 44 (01) :216-224
[3]   Low-complexity implementation of quasi-OBE algorithm [J].
Arablouei, R. ;
Dogancay, K. .
ELECTRONICS LETTERS, 2012, 48 (11) :621-623
[4]   A probabilistic interpretation of set-membership filtering: Application to polynomial systems through polytopic bounding [J].
Benavoli, Alessio ;
Piga, Dario .
AUTOMATICA, 2016, 70 :158-172
[5]   Set-membership identification and filtering for signal processing applications [J].
Deller, JR ;
Huang, YF .
CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2002, 21 (01) :69-82
[6]   UNIFYING THE LANDMARK DEVELOPMENTS IN OPTIMAL BOUNDING ELLIPSOID IDENTIFICATION [J].
DELLER, JR ;
NAYERI, M ;
LIU, MS .
INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING, 1994, 8 (01) :43-60
[7]   Multi-input multi-output ellipsoidal state bounding [J].
Durieu, C ;
Walter, É ;
Polyak, B .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2001, 111 (02) :273-303
[8]   ON THE VALUE OF INFORMATION IN SYSTEM-IDENTIFICATION - BOUNDED NOISE CASE [J].
FOGEL, E ;
HUANG, YF .
AUTOMATICA, 1982, 18 (02) :229-238
[9]   A new method for the nonlinear transformation of means and covariances in filters and estimators [J].
Julier, S ;
Uhlmann, J ;
Durrant-Whyte, HF .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2000, 45 (03) :477-482
[10]  
Kalman RE., 1960, J BASIC ENG, V82, P35, DOI [DOI 10.1115/1.3662552, 10.1115/1.3662552]