Parameter Identification of Recurrent Fuzzy Systems With Fuzzy Finite-State Automata Representation

Authors:
C. A. Gama;A. G. Evsukoff;P. Weber;N. F.F. Ebecken
Affiliations:
Univ. Fed. do Rio de Janeiro, Rio de Janeiro;-;-;-
Venue:
IEEE Transactions on Fuzzy Systems
Year:
2008

Citing 0
Cited 5

Finite automata theory with membership values in lattices

Information Sciences: an International Journal
Fault tolerant measurement system based on Takagi--Sugeno fuzzy models for a gas turbine in a combined cycle power plant

Fuzzy Sets and Systems
A multi-model approach for long-term runoff modeling using rainfall forecasts

Expert Systems with Applications: An International Journal
Nondeterministic fuzzy automata

Information Sciences: an International Journal
Modeling with discrete-time recurrent fuzzy systems via mixed-integer optimization

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the identification of nonlinear dynamical systems by recurrent fuzzy system (RFS) models. Two types of RFS models are discussed: the Takagi-Sugeno-Kang (TSK) type and the linguistic or Mamdani type. Both models are equivalent and the latter model may be represented by a fuzzy finite-state automaton (FFA). An identification procedure is proposed based on a standard general purpose genetic algorithm (GA). First, the TSK rule parameters are estimated and, in a second step, the TSK model is converted into an equivalent linguistic model. The parameter identification is evaluated in some benchmark problems for nonlinear system identification described in literature. The results show that RFS models achieve good numerical performance while keeping the interpretability of the actual system dynamics.