Fuzzy associative matrix

About: Fuzzy associative matrix is a research topic. Over the lifetime, 8027 publications have been published within this topic receiving 194790 citations.

Fuzzy reasoning supported by Petri nets

Abstract: We develop a representational model for the knowledge base (KB) of fuzzy production systems with rule chaining based on the Petri net formalism. The model presents the execution of a KB following a data driven strategy based on the sup-min compositional rule of inference. In this connection, algorithms characterizing different situations have been described, including the case where the KB is characterized by complete information about all the input variables and the case where it is characterized by ignorance of some of these variables. For this last situation we develop a process of "incremental reasoning"; this process allows the KB to take information about previously unknown values into consideration as soon as such information becomes available. Furthermore, as compared to other solutions, the rule chaining mechanism we introduce is more flexible, and the description of the rules more generic. The computational complexity of these algorithms is O((C/2+M+N)R/sup 2/) for the "complete information" case and O((M+N)R/sup 2/) and O(2(M+N)R/sup 2/) for the other cases, where R is the number of fuzzy conditional statements of the KB, M and N the maximum number of antecedents and consequents in the rules and C the number of chaining transitions in the KB representation. >

A survey of defuzzification strategies

Abstract: Defuzzification is an important operation in the theory of fuzzy sets. It transforms a fuzzy set information into a numeric data information. This operation along with the operation of fuzzification is critical to the design of fuzzy systems as both of these operations provide nexus between the fuzzy set domain and the real-valued scalar domain. We need the synergy of both of these domains to solve many of our ill-posed problems effectively. In this paper, we address the problem of defuzzification, we present merits and demerits of various defuzzification strategies that are used in the theory and practice, and in design and implementation of applications involving fuzzy theory, fuzzy control, and fuzzy rule base, and fuzzy inference-based systems. We also present in this paper a simple and yet a novel defuzzification mechanism. © 2001 John Wiley & Sons, Inc.

Relaxed Stabilization Criteria for Discrete-Time T–S Fuzzy Control Systems Based on a Switching Fuzzy Model and Piecewise Lyapunov Function

Abstract: In this paper, two new relaxed stabilization criteria for discrete-time T-S fuzzy systems are proposed. In the beginning, the operation state space is divided into several subregions, and then, the T-S fuzzy system is transformed to an equivalent switching fuzzy system corresponding to each subregion. Consequently, based on the piecewise Lyapunov function, the stabilization criteria of the switching fuzzy system are derived. The criteria have two features: 1) the behavior of the two successive states of the system is considered in the inequalities and 2) the interactions among the fuzzy subsystems in each subregion Sj are presented by one matrix Xj. Due to the above two features, the feasible solutions of the inequalities in the criteria are much easier to be found. In other words, the criteria are much more relaxed than the existing criteria proposed in other literature. The proposed conditions in the criteria and the fuzzy control design can be solved and achieved by means of linear matrix inequality tools. Two examples are given to present the superiority of the proposed criteria and the effectiveness of the fuzzy controller's design, respectively