具有通用逼近性的T-S模糊系统的充分条件  

The Sufficient Condition of T-S Fuzzy Systems with Universal Approximation

作　　者：刘慧林[1] 游文虎[1] 冯汝鹏[1] 

机构地区：[1]哈尔滨工业大学控制科学与工程系,黑龙江哈尔滨150001

出　　处：《哈尔滨理工大学学报》2006年第5期21-23,共3页Journal of Harbin University of Science and Technology

摘　　要：给出局域隶属函数的定义,根据模糊推理机所依据的公式性质,给出局域推理机的定义.对于采用局域推理机的T-S模糊系统,证明了模糊器和模糊规则的隶属函数采用局域隶属函数所构造的T-S模糊系统具有通用逼近性.这种具有通用逼近性的T-S模糊系统所需的条件明显优于其他文献中构造具有通用逼近性的T-S模糊系统所需的条件.The definition of Local Membership Function used in T-S fuzzy systems is given firstly, and the definition of Local Inference Machine by the different property of the formula that the inference machines are used is given. Then the classification of fuzzy inference machine is proposed. For T-S fuzzy systems with local inference machine, if the membership functions of fuzzificators and fuzzy rules are local membership functions, the theory of these fuzzy systems as universal approximators are proved. And those conditions for constructing T-S fuzzy systems which are universal approximators is better than those in all other paper mentioned.

关 键 词：T—S模糊系统 局域推理机 局域隶属函数 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]