4.6 Article

Nonsynchronized Robust Filtering Design for Continuous-Time T-S Fuzzy Affine Dynamic Systems Based on Piecewise Lyapunov Functions

Journal

IEEE TRANSACTIONS ON CYBERNETICS
Volume 43, Issue 6, Pages 1755-1766

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMCB.2012.2229389

Keywords

Parameter uncertainties; piecewise quadratic Lyapunov functions (PQLFs); state estimation; T-S fuzzy affine systems

Funding

  1. National Natural Science Foundation of China [60825303, 61004038]
  2. 973 Project [2009CB320600]
  3. Fundamental Research Funds for the Central Universities [HIT.BRETIII.201214]
  4. State Key Laboratory of Synthetical Automation for Process Industries (Northeastern University)

Ask authors/readers for more resources

This paper investigates the problem of robust H-infinity state estimation for a class of continuous-time nonlinear systems via Takagi-Sugeno (T-S) fuzzy affine dynamic models. Attention is focused on the analysis and design of an admissible full-order filter such that the resulting filtering error system is asymptotically stable with a guaranteed H-infinity disturbance attenuation level. It is assumed that the plant premise variables, which are often the state variables or their functions, are not measurable so that the filter implementation with state-space partition may not be synchronous with the state trajectories of the plant. Based on piecewise quadratic Lyapunov functions combined with S-procedure and some matrix inequality linearization techniques, some new results are presented for the filtering design of the underlying continuous-time T-S fuzzy affine systems. Illustrative examples are given to validate the effectiveness and application of the proposed design approaches.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available