具有广义线性隶属函数的典型模糊系统的通用逼近性*

设计了一种将三角形和梯形隶属函数作为特例的广义线性隶属函数,推导了输入采用广义线性隶属函数的典型Mamdani模糊系统的解析结构,证明了典型模糊系统是单调、递减的有界连续函数;在此基础上证明了该类模糊系统能以任意精度逼近任意连续实函数,最后仿真实例证明了本设计的有效性。     

基于广义双曲正切模型的机器人模糊自适应控制

利用广义模糊双曲正切模型的全局逼近特点,设计一种直接模糊自适应控制器用于机器人轨迹跟踪控制．模糊控制器的输入变量经过平移变化后得到的广义输入变量能够覆盖整个输入空间,因此,模糊控制器能以任意精度逼近系统的最优控制;由于双曲正切模型的特殊结构,在保证跟踪精度的同时,避免了因模糊子集数目增加而带来的计算负担的增加,满足了机器人实时控制的需要．仿真结果表明,该控制算法具有较强的鲁棒性和较好的跟踪性．     

基于广义双曲正切模型的机器人鲁棒模糊自适应控制

利用广义模糊双曲正切模型的全局逼近特点,设计一种模糊自适应控制器用于机器人轨迹跟踪控制.广义双曲正切模型利用输入变量的平移能以任意精度逼近系统的不确定动态.对于系统不确定外界干扰和模糊系统的逼近误差,通过求解一个线性矩阵不等式来保证闭环系统的鲁棒稳定性.对比传统的模糊基函数,在保证系统跟踪精度的前提下,双曲正切模糊基函数的自适应调整参数大大减少,仿真表明该控制算法具有较强的鲁棒性能和较好的跟踪性能.     

SISO Mamdani模糊系统作为函数逼近器的必要条件

模糊系统已被证明是通用逼近器,但实现高精度通常需要大量规则．模糊系统满足给定精度的必要条件能指导最优系统的构造,如输入输出模糊集、模糊规则的选取．研究了单输入单输出（SISO）Mamdani模糊系统在给定逼近精度下作为函数逼近器的必要条件．由于通用型SISO Mamdani模糊系统在划分子区间单调,所以模糊系统的最优配置是输入域的划分数至少为系统输出的单调性变化次数．当模糊系统满足给定逼近精度时,通过分析目标函数的局部特性,基于目标函数的极点,建立了SISO Mamdani模糊系统的必要条件．更重要的是证明了现有的必要条件仅仅是该文结论的一种特例．最后,使用数值实例来验证该文的结论,分析模糊系统作为函数逼近器的优劣．     

模糊系统万能逼近理论研究综述

模糊系统通用逼近理论是模糊理论研究的一个重要方向．目前，对模糊系统通用逼近性的研究已经取得了很大的进展．对模糊系统的通用逼近性、模糊系统作为通用逼近器的充分条件和必要条件以及模糊系统的逼近精度等方面的研究进行了较为详尽的综述，分析了各种分析方法的主要成果及其特点（包括优点和局限性），并指出了今后模糊系统通用逼近理论研究中有待解决的许多问题．     

线性T-S模糊系统作为通用逼近器的充分条件

作为模糊系统理论研究和实际应用的基础,对模糊系统通用逼近性的研究已经取得了 很大的进展,但是只有为数不多的文献研究了模糊系统作为通用逼近器的充分条件.提出了线 性T-S模糊系统以任意精度一致逼近紧致集上任意连续实函数的一个充分条件,并给出了数值 示例.该示例表明提出的充分条件明显优于现有的其它结果.     

两类层次模糊Mass-Assignment系统是全局逼近器

基于mass assignment 理论,提出了两类层次模糊mass assignment系统,并运用构造性证明过程证明了其全局逼近性质.由于类型1层次模糊系统的规则数与输入变量数呈线性关系,类型2层次模糊系统按逼近精度要求引入子模糊系统,因此,此两类层次模糊mass assignm ent系统可被用来有效地克服模糊规则爆炸问题,即所谓的规则数与输入变量数呈指数关系问题.     

具有任意形状隶属函数的分层模糊系统逼近性能研究

首先证明了对任意给定的矩阵A和正数c, 一定存在向量b, 使得方程Ax=b有非负解, 且b和解的范数均小于c. 在此基础上证明了具有任意形状隶属函数的分层模糊系统对紧集上连续函数的逼近性质, 为使用分层模糊系统进行辨识或控制以避免模糊规则数目随系统变量个数呈指数增长提供了理论依据.     

T-S模糊系统的构造及其逼近能力的充分条件

针对任意多变量非线性函数, 至今缺少一种简单有效的构造性方法来建造一个T-S模糊系统对其实现给定精度的模糊逼近. 本文在逼近函数g(X)∈C2及g(X)不∈C2两种情况下给出了一种当模糊集满足均匀性、连续性、正规性条件下T-S模糊系统的构造方法以及该T-S模糊系统逼近能力的充分条件. 该构造性方法简单易行且其逼近能力充分条件的保守性低. 最后通过仿真研究证实了该方法的正确性与有效性.     

模糊系统的逼近精度和规则关系研究

从模糊系统的逼近精度角度来研究模糊系统的杂程度、逼近精度、控制规则数目之间的关系。通过修改逼近精度的边界而减少了控制规则,近而达到了简化系统复杂程度的目的。通过实例分析可以看出,所设计的模糊系统既达到了所要求的精度,同时又使规则数目大大地减少了。     

Sufficient and necessary conditions for Boolean fuzzy systems as universal approximators

A formula is first presented to compute the lower upper bounds on the number of fuzzy sets to achieve pre-specified approximation accuracy for an arbitrary multivariate continuous function. The necessary condition for Boolean fuzzy systems as universal approximators with minimal system configurations is then discussed. Two examples are provided to demonstrate how to design a Boolean fuzzy system in order to approximate a given continuous function with a required approximation accuracy.     

Approximation accuracy analysis of fuzzy systems as functionapproximators

This paper establishes the approximation error bounds for various classes of fuzzy systems (i.e., fuzzy systems generated by different inferential and defuzzification methods). Based on these bounds, the approximation accuracy of various classes of fuzzy systems is analyzed and compared. It is seen that the class of fuzzy systems generated by the product inference and the center-average defuzzifier has better approximation accuracy and properties than the class of fuzzy systems generated by the min inference and the center-average defuzzifier, and the class of fuzzy systems defuzzified by the MoM defuzzifier. In addition, it is proved that fuzzy systems can represent any linear and multilinear function and explicit expressions of fuzzy systems generated by the MoM defuzzified method are given     

Some approximation properties of adaptive fuzzy systems with variable universe of discourse

In the last 20 years, while most research on fuzzy approximation theory has focused on nonadaptive fuzzy systems, little work has been done on adaptive fuzzy systems. This paper introduces an algorithm for adaptive fuzzy systems with Variable Universe of Discourse (VUD). By means of contraction-expansion factors, universe of discourse can be modified online, and fuzzy rules can reproduce automatically to adapt to the modified universe of discourse. Thus, dependence on the size of initial rule base is greatly reduced. Using Stone-Weierstrass theorem, VUD adaptive fuzzy systems are proved to be universal approximators with two-order approximation accuracy. In addition, the convergence properties of approximation error are discussed, and a sufficient condition is presented to partition universe of discourse and to calculate the size of rule base. An example is also given to illustrate the approximation power of VUD adaptive fuzzy systems.     

T-S模糊广义系统的逼近性

本文研究T-S模糊广义系统的逼近性,给出了T-S模糊广义系统的逼近性定理.证明其可以以任意的精度逼近一类广泛存在的非线性广义系统.还将MISO(多输入单输出)情况推广到MIMO(多输入多输出)的情况.在逼近性定理的基础上,利用神经网络的方法对非线性广义系统建模,给出了神经网络的结构及学习算法.本文共提出了两种神经网路的训练策略,对各自的优点与不足给出了分析,最后用数值例子验证了算法的有效性.     

Fuzzy approximation via grid point sampling and singular valuedecomposition

This paper introduces a new approach for fuzzy approximation of continuous function on a compact domain. The approach calls for sampling the function over a set of rectangular grid points and applying singular value decomposition to the sample matrix. The resulting quantities are then tailored to become rule consequences and membership functions via the conditions of sum normalization and non-negativeness. The inference paradigm of product-sum-gravity is apparent from the structure of the decomposition equation. All information are extracted directly from the function samples. The present approach yields a class of equivalent fuzzy approximator to a given function. A tight bounding technique to facilitate normal or close-to-normal membership functions is also formulated. The fuzzy output approximates the given function to within an error which is dependent on the sampling intervals and the singular values discarded from the approximation process. Trade-off between the number of membership functions and the desired approximation accuracy is also discussed.     

Approximation theory of fuzzy systems-MIMO case

In this paper, the approximation properties of MIMO fuzzy systems generated by the product inference are discussed. We first give an analysis of fuzzy basic functions (FBF's) and present several properties of FBF's. Based on these properties of FBF's, we obtain several basic approximation properties of fuzzy systems: 1) basic approximation property which reveals the basic approximation mechanism of fuzzy systems; 2) uniform approximation bounds which give the uniform approximation bounds between the desired (control or decision) functions and fuzzy systems; 3) uniform convergent property which shows that fuzzy systems with defined approximation accuracy can always be obtained by dividing the input space into finer fuzzy regions; and 4) universal approximation property which shows that fuzzy systems are universal approximators and extends some previous results on this aspect. The similarity between fuzzy systems and mathematical approximation is discussed and an idea to improve approximation accuracy is suggested based on uniform approximation bounds     

两类B样条模糊系统及其应用

能够同时逼近函数及其导函数的模糊系统在应用中具有重要意义.本文利用B样条函数作为推理前件,得到了两类能够同时逼近函数及其导函数的B样条模糊系统.其中第一类B样条模糊系统是插值系统且对函数及其一阶导函数分别具有二阶和一阶逼近精度,第二类B样条模糊系统是拟插值系统且对函数及其一阶、二阶导函数均具有二阶逼近精度.最后,将这两类模糊系统应用到一级倒立摆的稳定控制中,仿真结果表明利用这两类模糊系统设计的控制器是可行的,且具有一定的鲁棒性.     

Hierarchical TS fuzzy system and its universal approximation

An efficient tool to deal with the ‘rule explosion’ problem is the hierarchical system by which a fuzzy system can be decomposed into a number of hierarchically connected low-dimensional systems. In this paper a generalized hierarchical Tagaki–Sugeno (TS) system is built. It is shown that the input–output (I/O) relationship of this generalized hierarchical system can be represented as one of a standard TS fuzzy system. And the system approximation capability is analyzed by taking piecewise linear functions as a bridge. By constructive method it is proven that the hierarchical fuzzy systems (HFS’s) can be universal approximators. For the given approximation accuracy, an estimation formula about the number of the rules needed in the HFS is established. Finally some simulation examples confirm that the HFS’s with smaller size rule base can approximate the given functions with high accuracy. The results obtained here provide us with the theoretical basis for various applications of HFS’s.     

A relationship between membership functions and approximationaccuracy in fuzzy systems

This paper presents a relationship between membership functions and approximation accuracy in fuzzy systems. This relationship suggests an idea to design membership functions such that the approximation accuracy of fuzzy systems is improved.     

Approximation of fuzzy context-free grammars

Fuzzy context-free max- grammar (or FCFG, for short), as a straightforward extension of context-free grammar, has been introduced to express uncertainty, imprecision, and vagueness in natural language fragments. Li recently proposed the approximation of fuzzy finite automata, which may effectively deal with the practical problems of fuzziness, impreciseness and vagueness. In this paper, we further develop the approximation of fuzzy context-free grammars. In particular, we show that a fuzzy context-free grammar under max- compositional inference can be approximated by some fuzzy context-free grammar under max-min compositional inference with any given accuracy. In addition, some related properties of fuzzy context-free grammars and fuzzy languages generated by them are studied. Finally, the sensitivity of fuzzy context-free grammars is also discussed.