Volume 32 Issue 12
Dec.  2006
Turn off MathJax
Article Contents
Chai Wei, Sun Xianfang. Robust ellipsoidal state bounding algorithm[J]. Journal of Beijing University of Aeronautics and Astronautics, 2006, 32(12): 1447-1450. (in Chinese)
Citation: Chai Wei, Sun Xianfang. Robust ellipsoidal state bounding algorithm[J]. Journal of Beijing University of Aeronautics and Astronautics, 2006, 32(12): 1447-1450. (in Chinese)

Robust ellipsoidal state bounding algorithm

  • Received Date: 19 Dec 2005
  • Publish Date: 31 Dec 2006
  • A numerically robust algorithm for computing ellipsoidal bounds on the state of a linear, discrete-time dynamic system was proposed. The algorithm employed ellipsoidal outer approximation of the feasible set assuming instantaneous process and observation noise vectors and the initial state to be bounded by known ellipsoids. The time and observation updates produced, respectively, the vector sum and intersection of two ellipsoids. Cholesky decomposition was used in the propagation of the shape-defining matrix of the ellipsoid to keep it positive definite in the presence of roundoff errors. Besides, a subminimal-volume ellipsoid was selected from a family of ellipsoids as the observation-updated ellipsoid to circumvent the complex optimization affected by ill-conditioned matrix inverse. Monte Carlo simulations on a digital computer were performed to compare the performance of the proposed algorithm with that of the optimal algorithm. Simulation results show that the proposed algorithm not only matches the performance of the optimal algorithm closely in terms of ellipsoid volumes and mean-square errors, but also is less vulnerable to roundoff errors. The proposed algorithm also features the capability to be realized on a parallel computer.

     

  • loading
  • [1] Maksarov D G, Norton J P. State bounding with ellipsoid set description of uncertainty [J]. International Journal of Control, 1996, 65(5):847-866 [2] Sun X F, Fan Y Z. Guaranteed sensor fault detection and isolation via recursive rectangular parallelepiped bounding in state-set estimation Proc 3rd ASCC. Shanghai:, 2000:3041-3046 [3] Chisci L, Garulli A, Zappa G. Recursive state bounding by parallelotopes [J]. Automatica, 1996, 32(7):1049-1055 [4] Spathopoulos M P, Grobov I D. A state-set estimation algorithm for linear systems in the presence of bounded disturbances [J]. International Journal of Control, 1996, 63(4):799-811 [5] Durieu C, Walter E, Polyak B. Multi-input multi-output ellipsoidal state bounding [J]. Journal of Optimization Theory and Applications, 2001, 111(2):273-303 [6] Maksarov D G, Norton J P. Computational efficient algorithms for state estimation with ellipsoidal approximations [J]. International Journal of Adaptive Control and Signal Processing, 2002, 16(5):411-434 [7] Scholte E, Campbell M. A nonlinear set-membership filter for on-line applications [J]. International Journal of Robust and Nonlinear Control, 2003, 13(10):1337-1358 [8] Morf M, Kailath T. Square root algorithms for the least squares estimation [J]. IEEE Transactions on Automatic Control, 1975, 20(4):487-497 [9] 苏德富,钟诚. 计算机算法设计与分析[M].北京:电子工业出版社,2005:217-221 Su Defu, Zhong Cheng. The design and analysis of computer algorithm [M]. Beijing:Publishing House of Electronics Industry, 2005:217-221(in Chinese) [10] 陈国良,陈崚.VLSI计算理论与并行算法[M].合肥:中国科学技术大学出版社,1991:90-197 Chen Guoliang, Chen Ling. The theory of VLSI computing and parallel algorithms[M]. Hefei:University of Science and Technology of China Press, 1991:90-197(in Chinese)
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(2785) PDF downloads(1051) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return