# A New Fuzzy System Based on Rectangular Pyramid

Authors: Mingzuo Jiang; Xuehai Yuan; Hongxing Li; Jiaxia Wang
Journal: The Scientific World Journal
 (2015)

---

## Abstract

A new fuzzy system is proposed in this paper. The novelty of the proposed system is mainly in the compound of the antecedents, which is based on the proposed rectangular pyramid membership function instead of t-norm. It is proved that the system is capable of approximating any continuous function of two variables to arbitrary degree on a compact domain. Moreover, this paper provides one sufficient condition of approximating function so that the new fuzzy system can approximate any continuous function of two variables with bounded partial derivatives. Finally, simulation examples are given to show how the proposed fuzzy system can be effectively used for function approximation.


---

## Body

## 1. Introduction

Fuzzy system has been the subject of numerous researches in more than three decades. It has been successfully applied to a great variety of different processes such as control engineering, signal processing, information processing, machine intelligence, decision making, management, finance, medicine, and robotics [1–9].Motivated by successful applications of fuzzy system, there have been a number of works aiming at improving the structure and performance of fuzzy system. Yuan et al. [10] put forward a parameter singleton fuzzifier method. Celikyilmaz and Turksen [11] presented a new fuzzy system modeling approach based on improved fuzzy functions to model systems with continuous output variable. Adaptive fuzzy systems are also developed well. In [12], a dynamic rule base which allows the fuzzy sets to dynamically change or move with the inputs was used for the construction of fuzzy system. Márquez et al. [13] proposed adaptive t-norms for the antecedents connection and adaptive defuzzification methods. Moreover, fuzzy system can be integrated with some other techniques, for example, neurocontrol [14–17], genetic algorithms and particle swarm optimization [18–23], and fuzzy sliding-mode control [24–26]. This paper focuses on the structure design of conventional dual-input single-output Mamdani fuzzy system to improve its approximation property and simplify its structure. A new kind of fuzzy system based on the proposed rectangular pyramid membership function is established. The model of the rectangular pyramid fuzzy system (RPFS) is introduced mainly by replacing the compound of the two rule antecedents using t-norm with the rectangular pyramid membership function of the input vector. With the help of rectangular pyramid membership function, the fuzzy system structure becomes simple and easily realized.In most applications of fuzzy systems, the main design objective can be considered as problems of functions approximation. So the study on approximation theory of fuzzy systems is very important and necessary. Wang [27] used Stone-Weierstrass Theorem to prove the approximation capability of a common kind of fuzzy systems. Based on the above research, Wang and Mendel [28] proposed fuzzy basic functions to explain the approximation property of fuzzy systems. In [29], the approximation properties of MIMO fuzzy systems are discussed based on its fuzzy basic functions. Castro [30] proved the approximation properties of the fuzzy systems with a wide class of fuzzy logics and membership functions. Mao et al. [31] addressed whether a fuzzy system with weaker constraints to its membership functions can be a universal approximator. Li [32] found out that the commonly used fuzzy system algorithms can be regarded as some interpolation functions. Generally speaking, fuzzy systems can approximate any continuous function on any compact domain, which explains the ability of fuzzy controller in achieving satisfactory performance in applications. So before the application of one kind of fuzzy systems, it is helpful to know clearly whether they are universal approximators. Note that the features of RPFS are mainly determined by the properties of its fuzzy basic functions. We will first give an analysis of the properties of fuzzy basic functions of RPFS and then discuss the approximation property of RPFS.Sufficient conditions of fuzzy systems lead to the following practical result: the derived formulas can calculate the numbers of input fuzzy sets and fuzzy rules needed to satisfy any given approximation accuracy. Ying [33] gave sufficient conditions for general fuzzy system. Chen [34] established sufficient conditions for two classes of fuzzy logic controllers in [33]. In [35], the sufficient conditions for Boolean fuzzy systems were proposed by using Weierstrass Theorem. Zeng et al. [36] and Liu et al. [37] made a systematic and comparative study on sufficient conditions for different fuzzy systems. In a constructive way, we have found one sufficient condition on the premise that RPFS can uniformly approximate any real continuous function on a compact domain to any degree of accuracy.The structure of this paper is as follows. After the introduction, the model of the conventional fuzzy system and its approximation theory are given in Section2. The construction of RPFS is introduced in Section 3. Some definitions and properties of RPFS are given in Section 4 in order to describe the approximation capability of RPFS. One sufficient condition of RPFS is given in Section 5. After the above discussion, we provide some simulation results of approximating functions to evaluate the approximation performance of RPFS in Section 6. Conclusions are made in the last section.


## 2. Preliminaries

In this section, we will introduce the model of conventional dual-input single-output fuzzy system. Furthermore, we will describe the ability of the system in approximating any continuous function on an arbitrary compact domain.Conventional fuzzy system consists of four principal components: fuzzifier, fuzzy rule base, fuzzy inference engine, and defuzzifier. The fuzzy rule base contains information of how to infer new control actions. The fuzzy inference engine is a reasoning mechanism which performs inference procedure on the fuzzy rules and derives reasonable control actions. It is the central part of a fuzzy system. The fuzzification interface (or fuzzifier) defines a mapping from a real-valued space to a fuzzy space, and the defuzzification interface (or defuzzifier) defines a mapping from a fuzzy space to a real-valued space. The fuzzifier converts a crisp value to a fuzzy number while the defuzzifier converts the inferred fuzzy conclusion to a crisp value.Consider a dual-input single-output fuzzy system:U
×
V
→
W, where U
×
V
⊂
R
2 is the input space and W
⊂
R is the output space, respectively. The fuzzy rule base consists of M
N rules in the following form:(1)
R
i
j
:
IF
x
is
A
i
1
,
y
is
A
j
2
,
THEN
z
is
B
i
j
,where i
=
1,2
,
…
,
M; j
=
1,2
,
…
,
N; x and y are the input variables of the fuzzy system; z is the output variable of the fuzzy system. A
i
1
⊂
U, A
j
2
⊂
V, and B
i
j
⊂
W are linguistic terms characterized by fuzzy membership functions A
i
1
x, A
j
2
y, and B
i
j
z, respectively. z
i
j is the point in W at which B
i
j
z achieves its maximum value. Assume that the fuzzifier is the singleton fuzzifier method. Under the commonly used fuzzy engine and defuzzifier method, the final output of the conventional dual-input single-output fuzzy system is derived as follows:(2)
z
=
∑
i
=
1
M
∑
j
=
1
N
A
i
1
x
A
j
2
y
z
i
j
∑
i
=
1
M
∑
j
=
1
N
A
i
1
x
A
j
2
y
.The below theorem [27] gives the basic approximation property of conventional dual-input single-output fuzzy system.Theorem 1.
For any given real continuous functiong
x
,
y on the compact set U
×
V
⊂
R
2 and arbitrary ε
>
0, there exists a fuzzy system f
x
,
y such that (3)
sup
⁡
(
x
,
y
)
∈
U
×
V
g
x
,
y
-
f
x
,
y
<
ε
.


## 3. Construction of Rectangular Pyramid Fuzzy System

In this section, we applied the definition of rectangular pyramid membership function instead of t-norm to the construction of fuzzy system to achieve high accuracy of the output of given data. Moreover, the structure of fuzzy system is simplified. A detailed description of RPFS is given. The discussion is limited to dual-input single-output systems. RPFS consists of four principle parts which are similar to those of conventional fuzzy systems: fuzzifier, fuzzy rule base, fuzzy inference engine, and defuzzifier. For this class of fuzzy systems, they can be constructed by Sections3.1–3.3. The structure of RPFS is presented in Figure 1 and the sketch of rectangular pyramid membership function is shown in Figure 2.Figure 1
The structure of RPFS.Figure 2
Rectangular pyramid membership function.


### 3.1. Fuzzifier

The fuzzification interface can translate input values into linguistic terms which are characterized by the rectangular pyramid membership functions. Denote byx
,
y the input vector and by z the output variable. Let a
,
b
×
c
,
d be the universe of the input vector and [
m
,
n
] the universe of the output variable. The universe a
,
b
×
c
,
d is equidistantly divided by peak points (
x
i
,
y
j
)
(
i
=
1,2
,
…
,
M
;
j
=
1,2
,
…
,
N
) of the rectangular pyramid membership functions. Consider one subset [
x
i
,
x
i
+
1
]
×
[
y
j
,
y
j
+
1
] in a
,
b
×
c
,
d; for simplicity of discussion, we construct, respectively, the rectangular pyramid membership functions P
i
j
x
,
y, P
i
.
j
+
1
x
,
y, P
i
+
1
,
j
+
1
x
,
y, and P
i
+
1
,
j
x
,
y (on the small area [
x
i
,
x
i
+
1
]
×
[
y
j
,
y
j
+
1
]) of the peak points (
x
i
,
y
j
), (
x
i
,
y
j
+
1
), (
x
i
+
1
,
y
j
+
1
), and (
x
i
+
1
,
y
j
) as follows.At point(
x
i
,
y
j
), when x
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, we have(4)
P
i
j
x
,
y
=
x
i
+
1
-
x
x
i
+
1
-
x
i
;when x
i
≤
x
≤
x
i
+
1, y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, we have(5)
P
i
j
x
,
y
=
y
j
+
1
-
y
y
j
+
1
-
y
j
.At point (
x
i
,
y
j
+
1
), when x
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, we have(6)
P
i
,
j
+
1
x
,
y
=
y
-
y
j
y
j
+
1
-
y
j
;when x
i
≤
x
≤
x
i
+
1, y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, we have(7)
P
i
,
j
+
1
x
,
y
=
x
i
+
1
-
x
x
i
+
1
-
x
i
.At point (
x
i
+
1
,
y
j
+
1
), when x
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, we have(8)
P
i
+
1
,
j
+
1
x
,
y
=
y
-
y
j
y
j
+
1
-
y
j
;when x
i
≤
x
≤
x
i
+
1, y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, we have(9)
P
i
+
1
,
j
+
1
x
,
y
=
x
-
x
i
x
i
+
1
-
x
i
.At point (
x
i
+
1
,
y
j
), when x
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, we have(10)
P
i
+
1
,
j
x
,
y
=
x
-
x
i
x
i
+
1
-
x
i
;when x
i
≤
x
≤
x
i
+
1, y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, we have(11)
P
i
+
1
,
j
x
,
y
=
y
j
+
1
-
y
y
j
+
1
-
y
j
.The singleton fuzzifier method is adopted in this step. It maps a real-valued pointx
,
y
∈
a
,
b
×
c
,
d into a fuzzy singleton set P
* which has membership value 1 at x
,
y and 0 at the other points in a
,
b
×
c
,
d; that is,(12)
P
*
x
,
y
=
1
,
if
x
,
y
=
x
′
,
y
′
0
,
otherwise
.


### 3.2. Fuzzy Inference

The fuzzy inference engine is a decision-making mechanism that employs fuzzy rules from the fuzzy rule base to determine a mapping from the fuzzy sets in the input space to the fuzzy sets in the output space.The conventional fuzzy rule base consists of a set of linguistic rules in the form of (1). In this paper, we consider the fuzzy rules which are different from those of the conventional fuzzy system in the following form:(13)
R
i
j
:
IF
x
,
y
is
P
i
j
,
THEN
z
is
C
i
j
i
=
1,2
,
…
,
M
;
j
=
1,2
,
…
,
N
,where P
i
j are the fuzzy set characterized by rectangular pyramid membership function P
i
j
x
,
y. The difference between RPFS and the conventional fuzzy system mainly lies in the compound of the antecedents. In the conventional fuzzy system, fuzzy intersections (t-norms) for connective “and” are used. Then, the compound fuzzy proposition (14)
IF
x
is
A
i
1
,
y
is
A
j
2is interpreted as a fuzzy set A
i
1
∩
A
j
2 in U
×
V with a membership function(15)
μ
A
i
1
∩
A
j
2
x
,
y
=
t
μ
A
i
1
x
,
μ
A
j
2
y
,where t
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is any t-norm.As the fuzzy rule base consists of a set of rules, the relationship among these rules is an interesting question. Important properties of a set of conventional rules are completeness, consistency, and continuity. Note that the form of fuzzy rules in this paper has been changed; it is necessary to know whether the changed rules have the similar good character as the conventional rules.Definition 2.
A set of fuzzy IF-THEN rules is complete if, for anyx
,
y
∈
U
×
V, there exists at least one rule in the fuzzy rule base, say rule R
st (in the form of (13)), such that(16)
P
st
x
,
y
≠
0
∀
i
=
1,2
,
…
,
M
;
j
=
1,2
,
…
,
N
.Intuitively, the completeness of a set of rules means that at any point in the input space there exists at least one rule making the membership value of the IF part of the rule at this point nonzero.Definition 3.
A set of fuzzy IF-THEN rules is consistent if there are no rules with the same IF parts but different THEN parts.Definition 4.
A set of fuzzy IF-THEN rules is continuous if there do not exist such neighboring rules whose THEN part fuzzy sets have empty intersection.
It is obvious that the rule base of RPFS has properties of completeness, consistency, and continuity.For fuzzy rule base containing more than one rule, the key question is how to infer with a set of rules. There are two ways: composition-based inference and individual-rule based inference. If all theM
N fuzzy rules are firstly composed into a new fuzzy rule which is then used to generate a fuzzy consequence in accordance with the given fuzzy antecedents, this is the so-called composition-based inference. Alternatively, each of the M
N fuzzy rules is individually used to generate a fuzzy consequence in accordance with the given fuzzy antecedent. The resulting M
N fuzzy consequences are then composed into a new fuzzy consequence. This is the so-called individual-rule based inference. In this paper, we follow the widely used composition-based inference. So each fuzzy rule can be written as(17)
R
i
j
x
,
y
,
z
=
θ
P
i
j
x
,
y
,
C
i
j
z
=
P
i
j
x
,
y
C
i
j
z
,where θ is the Mamdani product implication operator from the fuzzy antecedent P
i
j to the fuzzy consequence C
i
j. Based on composition-based inference, we have(18)
R
=
⋃
i
=
1
M
⋃
j
=
1
N
R
i
j
.Therefore, the membership function of R can be expressed as(19)
R
x
,
y
,
z
=
⋁
i
=
1
M
⋁
j
=
1
N
P
i
j
x
,
y
C
i
j
z
.
R composes the M
N fuzzy rules into a single fuzzy rule via the union operator. To derive the expression of the output, we need to construct a set transformation T
:
P
*
→
C
*, C
*
=
[
P
*
×
Z
∩
R
]
z,(20)
C
*
z
=
⋁
x
′
,
y
′
∈
X
×
Y
P
*
x
′
,
y
′
∧
R
x
′
,
y
′
,
z
=
R
x
,
y
,
z
.


### 3.3. Defuzzifier

In this step, we need a defuzzification process to get a crisp decision. Among the commonly used defuzzification strategies, fuzzy centroid-defuzzification method yields superior results [38]. Through this method, we get an equation of output variable(21)
z
=
∫
m
n
z
C
*
z
d
z
∫
m
n
C
*
z
d
z
=
∫
m
n
z
⋁
i
=
1
M
⋁
j
=
1
N
P
i
j
x
,
y
C
i
j
z
d
z
∫
m
n
⋁
i
=
1
M
⋁
j
=
1
N
P
i
j
x
,
y
C
i
j
z
d
z
≈
∑
t
=
1
M
N
z
t
[
⋁
i
=
1
M
⋁
j
=
1
N
(
P
i
j
x
,
y
C
i
j
z
)
]
Δ
z
t
∑
t
=
1
M
N
[
⋁
i
=
1
M
⋁
j
=
1
N
(
P
i
j
x
,
y
C
i
j
z
)
]
Δ
z
t
=
P
i
,
j
x
,
y
z
i
,
j
+
P
i
+
1
,
j
x
,
y
z
i
+
1
,
j
+
P
i
+
1
,
j
+
1
x
,
y
z
i
+
1
,
j
+
1
+
P
i
,
j
+
1
x
,
y
z
i
,
j
+
1
×
P
i
,
j
x
,
y
+
P
i
+
1
,
j
x
,
y
+
P
i
+
1
,
j
+
1
x
,
y
+
P
i
,
j
+
1
x
,
y
-
1
,where z
i
1
,
j
1
=
f
(
x
i
1
,
y
j
1
)
i
1
=
i
,
i
+
1
;
j
1
=
j
,
j
+
1 and f
x
,
y is a real-valued function defined on a domain D
′
⊂
R
2. From the expressions of the rectangular pyramid membership functions P
i
j
x
,
y, P
i
,
j
+
1
x
,
y, P
i
+
1
,
j
+
1
x
,
y, and P
i
+
1
,
j
x
,
y and the above formula, the general structure of RPFS can be represented as follows:(i)
whenx
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, y
j
≤
y
≤
y
j
+
1+(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i,(22)
S
x
,
y
=
x
i
+
1
-
x
y
j
+
1
-
y
j
(
2
y
+
y
j
+
1
-
3
y
j
)
x
i
+
1
-
x
i
z
i
j
+
y
-
y
j
2
y
+
y
j
+
1
-
3
y
j
z
i
,
j
+
1
+
y
-
y
j
2
y
+
y
j
+
1
-
3
y
j
z
i
+
1
,
j
+
1
+
x
-
x
i
y
j
+
1
-
y
j
2
y
+
y
j
+
1
-
3
y
j
x
i
+
1
-
x
i
z
i
+
1
,
j
;
(ii)
whenx
i
≤
x
≤
x
i
+
1, y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, y
j
≤
y
≤
y
j
+
1+(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i,(23)
S
x
,
y
=
x
i
+
1
-
x
i
y
j
+
1
-
y
2
x
+
x
i
+
1
-
3
x
i
y
j
+
1
-
y
j
z
i
j
+
x
i
+
1
-
x
i
y
-
y
j
2
x
+
x
i
+
1
-
3
x
i
y
j
+
1
-
y
j
z
i
,
j
+
1
+
x
-
x
i
2
x
+
x
i
+
1
-
3
x
i
z
i
+
1
,
j
+
1
+
x
-
x
i
2
x
+
x
i
+
1
-
3
x
i
z
i
+
1
,
j
;
(iii)
whenx
i
≤
x
≤
x
i
+
1, y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1,(24)
S
x
,
y
=
y
-
y
j
+
1
-
2
y
+
3
y
j
+
1
-
y
j
z
i
j
+
y
j
+
1
-
y
j
x
i
+
1
-
x
-
2
y
+
3
y
j
+
1
-
y
j
x
i
+
1
-
x
i
z
i
,
j
+
1
+
y
j
+
1
-
y
j
x
-
x
i
-
2
y
+
3
y
j
+
1
-
y
j
x
i
+
1
-
x
i
z
i
+
1
,
j
+
1
+
y
j
+
1
-
y
-
2
y
+
3
y
j
+
1
-
y
j
z
i
+
1
,
j
;otherwise(25)
S
x
,
y
=
x
i
+
1
-
x
-
2
x
+
3
x
i
+
1
-
x
i
z
i
j
+
x
i
+
1
-
x
-
2
x
+
3
x
i
+
1
-
x
i
z
i
,
j
+
1
+
x
i
+
1
-
x
i
y
-
y
j
-
2
x
+
x
i
+
1
-
x
i
y
j
+
1
-
y
j
z
i
+
1
,
j
+
1
+
x
i
+
1
-
x
i
y
j
+
1
-
y
-
2
x
+
3
x
i
+
1
-
x
i
y
j
+
1
-
y
j
z
i
+
1
,
j
.The four conditions correspond to the division domains I, II, III, and IV in Figure 3, respectively. In the rest of this paper, S
x
,
y will be used to represent the output of RPFS and P
i
j
x
,
y the rectangular pyramid membership function at peak point (
x
i
,
y
j
).Figure 3
The division of small rectangular area[
x
i
,
x
i
+
1
]
×
[
y
j
,
y
j
+
1
] of S
x
,
y.


## 3.1. Fuzzifier

The fuzzification interface can translate input values into linguistic terms which are characterized by the rectangular pyramid membership functions. Denote byx
,
y the input vector and by z the output variable. Let a
,
b
×
c
,
d be the universe of the input vector and [
m
,
n
] the universe of the output variable. The universe a
,
b
×
c
,
d is equidistantly divided by peak points (
x
i
,
y
j
)
(
i
=
1,2
,
…
,
M
;
j
=
1,2
,
…
,
N
) of the rectangular pyramid membership functions. Consider one subset [
x
i
,
x
i
+
1
]
×
[
y
j
,
y
j
+
1
] in a
,
b
×
c
,
d; for simplicity of discussion, we construct, respectively, the rectangular pyramid membership functions P
i
j
x
,
y, P
i
.
j
+
1
x
,
y, P
i
+
1
,
j
+
1
x
,
y, and P
i
+
1
,
j
x
,
y (on the small area [
x
i
,
x
i
+
1
]
×
[
y
j
,
y
j
+
1
]) of the peak points (
x
i
,
y
j
), (
x
i
,
y
j
+
1
), (
x
i
+
1
,
y
j
+
1
), and (
x
i
+
1
,
y
j
) as follows.At point(
x
i
,
y
j
), when x
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, we have(4)
P
i
j
x
,
y
=
x
i
+
1
-
x
x
i
+
1
-
x
i
;when x
i
≤
x
≤
x
i
+
1, y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, we have(5)
P
i
j
x
,
y
=
y
j
+
1
-
y
y
j
+
1
-
y
j
.At point (
x
i
,
y
j
+
1
), when x
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, we have(6)
P
i
,
j
+
1
x
,
y
=
y
-
y
j
y
j
+
1
-
y
j
;when x
i
≤
x
≤
x
i
+
1, y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, we have(7)
P
i
,
j
+
1
x
,
y
=
x
i
+
1
-
x
x
i
+
1
-
x
i
.At point (
x
i
+
1
,
y
j
+
1
), when x
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, we have(8)
P
i
+
1
,
j
+
1
x
,
y
=
y
-
y
j
y
j
+
1
-
y
j
;when x
i
≤
x
≤
x
i
+
1, y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, we have(9)
P
i
+
1
,
j
+
1
x
,
y
=
x
-
x
i
x
i
+
1
-
x
i
.At point (
x
i
+
1
,
y
j
), when x
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, we have(10)
P
i
+
1
,
j
x
,
y
=
x
-
x
i
x
i
+
1
-
x
i
;when x
i
≤
x
≤
x
i
+
1, y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, we have(11)
P
i
+
1
,
j
x
,
y
=
y
j
+
1
-
y
y
j
+
1
-
y
j
.The singleton fuzzifier method is adopted in this step. It maps a real-valued pointx
,
y
∈
a
,
b
×
c
,
d into a fuzzy singleton set P
* which has membership value 1 at x
,
y and 0 at the other points in a
,
b
×
c
,
d; that is,(12)
P
*
x
,
y
=
1
,
if
x
,
y
=
x
′
,
y
′
0
,
otherwise
.


## 3.2. Fuzzy Inference

The fuzzy inference engine is a decision-making mechanism that employs fuzzy rules from the fuzzy rule base to determine a mapping from the fuzzy sets in the input space to the fuzzy sets in the output space.The conventional fuzzy rule base consists of a set of linguistic rules in the form of (1). In this paper, we consider the fuzzy rules which are different from those of the conventional fuzzy system in the following form:(13)
R
i
j
:
IF
x
,
y
is
P
i
j
,
THEN
z
is
C
i
j
i
=
1,2
,
…
,
M
;
j
=
1,2
,
…
,
N
,where P
i
j are the fuzzy set characterized by rectangular pyramid membership function P
i
j
x
,
y. The difference between RPFS and the conventional fuzzy system mainly lies in the compound of the antecedents. In the conventional fuzzy system, fuzzy intersections (t-norms) for connective “and” are used. Then, the compound fuzzy proposition (14)
IF
x
is
A
i
1
,
y
is
A
j
2is interpreted as a fuzzy set A
i
1
∩
A
j
2 in U
×
V with a membership function(15)
μ
A
i
1
∩
A
j
2
x
,
y
=
t
μ
A
i
1
x
,
μ
A
j
2
y
,where t
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is any t-norm.As the fuzzy rule base consists of a set of rules, the relationship among these rules is an interesting question. Important properties of a set of conventional rules are completeness, consistency, and continuity. Note that the form of fuzzy rules in this paper has been changed; it is necessary to know whether the changed rules have the similar good character as the conventional rules.Definition 2.
A set of fuzzy IF-THEN rules is complete if, for anyx
,
y
∈
U
×
V, there exists at least one rule in the fuzzy rule base, say rule R
st (in the form of (13)), such that(16)
P
st
x
,
y
≠
0
∀
i
=
1,2
,
…
,
M
;
j
=
1,2
,
…
,
N
.Intuitively, the completeness of a set of rules means that at any point in the input space there exists at least one rule making the membership value of the IF part of the rule at this point nonzero.Definition 3.
A set of fuzzy IF-THEN rules is consistent if there are no rules with the same IF parts but different THEN parts.Definition 4.
A set of fuzzy IF-THEN rules is continuous if there do not exist such neighboring rules whose THEN part fuzzy sets have empty intersection.
It is obvious that the rule base of RPFS has properties of completeness, consistency, and continuity.For fuzzy rule base containing more than one rule, the key question is how to infer with a set of rules. There are two ways: composition-based inference and individual-rule based inference. If all theM
N fuzzy rules are firstly composed into a new fuzzy rule which is then used to generate a fuzzy consequence in accordance with the given fuzzy antecedents, this is the so-called composition-based inference. Alternatively, each of the M
N fuzzy rules is individually used to generate a fuzzy consequence in accordance with the given fuzzy antecedent. The resulting M
N fuzzy consequences are then composed into a new fuzzy consequence. This is the so-called individual-rule based inference. In this paper, we follow the widely used composition-based inference. So each fuzzy rule can be written as(17)
R
i
j
x
,
y
,
z
=
θ
P
i
j
x
,
y
,
C
i
j
z
=
P
i
j
x
,
y
C
i
j
z
,where θ is the Mamdani product implication operator from the fuzzy antecedent P
i
j to the fuzzy consequence C
i
j. Based on composition-based inference, we have(18)
R
=
⋃
i
=
1
M
⋃
j
=
1
N
R
i
j
.Therefore, the membership function of R can be expressed as(19)
R
x
,
y
,
z
=
⋁
i
=
1
M
⋁
j
=
1
N
P
i
j
x
,
y
C
i
j
z
.
R composes the M
N fuzzy rules into a single fuzzy rule via the union operator. To derive the expression of the output, we need to construct a set transformation T
:
P
*
→
C
*, C
*
=
[
P
*
×
Z
∩
R
]
z,(20)
C
*
z
=
⋁
x
′
,
y
′
∈
X
×
Y
P
*
x
′
,
y
′
∧
R
x
′
,
y
′
,
z
=
R
x
,
y
,
z
.


## 3.3. Defuzzifier

In this step, we need a defuzzification process to get a crisp decision. Among the commonly used defuzzification strategies, fuzzy centroid-defuzzification method yields superior results [38]. Through this method, we get an equation of output variable(21)
z
=
∫
m
n
z
C
*
z
d
z
∫
m
n
C
*
z
d
z
=
∫
m
n
z
⋁
i
=
1
M
⋁
j
=
1
N
P
i
j
x
,
y
C
i
j
z
d
z
∫
m
n
⋁
i
=
1
M
⋁
j
=
1
N
P
i
j
x
,
y
C
i
j
z
d
z
≈
∑
t
=
1
M
N
z
t
[
⋁
i
=
1
M
⋁
j
=
1
N
(
P
i
j
x
,
y
C
i
j
z
)
]
Δ
z
t
∑
t
=
1
M
N
[
⋁
i
=
1
M
⋁
j
=
1
N
(
P
i
j
x
,
y
C
i
j
z
)
]
Δ
z
t
=
P
i
,
j
x
,
y
z
i
,
j
+
P
i
+
1
,
j
x
,
y
z
i
+
1
,
j
+
P
i
+
1
,
j
+
1
x
,
y
z
i
+
1
,
j
+
1
+
P
i
,
j
+
1
x
,
y
z
i
,
j
+
1
×
P
i
,
j
x
,
y
+
P
i
+
1
,
j
x
,
y
+
P
i
+
1
,
j
+
1
x
,
y
+
P
i
,
j
+
1
x
,
y
-
1
,where z
i
1
,
j
1
=
f
(
x
i
1
,
y
j
1
)
i
1
=
i
,
i
+
1
;
j
1
=
j
,
j
+
1 and f
x
,
y is a real-valued function defined on a domain D
′
⊂
R
2. From the expressions of the rectangular pyramid membership functions P
i
j
x
,
y, P
i
,
j
+
1
x
,
y, P
i
+
1
,
j
+
1
x
,
y, and P
i
+
1
,
j
x
,
y and the above formula, the general structure of RPFS can be represented as follows:(i)
whenx
i
≤
x
≤
x
i
+
1, y
j
≤
y
≤
y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i, y
j
≤
y
≤
y
j
+
1+(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i,(22)
S
x
,
y
=
x
i
+
1
-
x
y
j
+
1
-
y
j
(
2
y
+
y
j
+
1
-
3
y
j
)
x
i
+
1
-
x
i
z
i
j
+
y
-
y
j
2
y
+
y
j
+
1
-
3
y
j
z
i
,
j
+
1
+
y
-
y
j
2
y
+
y
j
+
1
-
3
y
j
z
i
+
1
,
j
+
1
+
x
-
x
i
y
j
+
1
-
y
j
2
y
+
y
j
+
1
-
3
y
j
x
i
+
1
-
x
i
z
i
+
1
,
j
;
(ii)
whenx
i
≤
x
≤
x
i
+
1, y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, y
j
≤
y
≤
y
j
+
1+(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i,(23)
S
x
,
y
=
x
i
+
1
-
x
i
y
j
+
1
-
y
2
x
+
x
i
+
1
-
3
x
i
y
j
+
1
-
y
j
z
i
j
+
x
i
+
1
-
x
i
y
-
y
j
2
x
+
x
i
+
1
-
3
x
i
y
j
+
1
-
y
j
z
i
,
j
+
1
+
x
-
x
i
2
x
+
x
i
+
1
-
3
x
i
z
i
+
1
,
j
+
1
+
x
-
x
i
2
x
+
x
i
+
1
-
3
x
i
z
i
+
1
,
j
;
(iii)
whenx
i
≤
x
≤
x
i
+
1, y
j
+
(
(
y
j
+
1
-
y
j
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1, y
j
+
1
+
(
(
y
j
-
y
j
+
1
)
/
(
x
i
+
1
-
x
i
)
)
x
-
x
i
≤
y
≤
y
j
+
1,(24)
S
x
,
y
=
y
-
y
j
+
1
-
2
y
+
3
y
j
+
1
-
y
j
z
i
j
+
y
j
+
1
-
y
j
x
i
+
1
-
x
-
2
y
+
3
y
j
+
1
-
y
j
x
i
+
1
-
x
i
z
i
,
j
+
1
+
y
j
+
1
-
y
j
x
-
x
i
-
2
y
+
3
y
j
+
1
-
y
j
x
i
+
1
-
x
i
z
i
+
1
,
j
+
1
+
y
j
+
1
-
y
-
2
y
+
3
y
j
+
1
-
y
j
z
i
+
1
,
j
;otherwise(25)
S
x
,
y
=
x
i
+
1
-
x
-
2
x
+
3
x
i
+
1
-
x
i
z
i
j
+
x
i
+
1
-
x
-
2
x
+
3
x
i
+
1
-
x
i
z
i
,
j
+
1
+
x
i
+
1
-
x
i
y
-
y
j
-
2
x
+
x
i
+
1
-
x
i
y
j
+
1
-
y
j
z
i
+
1
,
j
+
1
+
x
i
+
1
-
x
i
y
j
+
1
-
y
-
2
x
+
3
x
i
+
1
-
x
i
y
j
+
1
-
y
j
z
i
+
1
,
j
.The four conditions correspond to the division domains I, II, III, and IV in Figure 3, respectively. In the rest of this paper, S
x
,
y will be used to represent the output of RPFS and P
i
j
x
,
y the rectangular pyramid membership function at peak point (
x
i
,
y
j
).Figure 3
The division of small rectangular area[
x
i
,
x
i
+
1
]
×
[
y
j
,
y
j
+
1
] of S
x
,
y.


## 4. Approximation Property of Rectangular Pyramid Fuzzy System

In this section, in order to introduce the basic approximation property of RPFS, the definition and properties of fuzzy basic functions are firstly given. From the expressions of the output of RPFS, it is easy to find thatS
x
,
y can be represented by a linear combination of one kind of functions; for example,(26)
φ
i
,
j
x
,
y
=
P
i
,
j
x
,
y
P
i
,
j
x
,
y
+
P
i
+
1
,
j
x
,
y
+
P
i
+
1
,
j
+
1
x
,
y
+
P
i
,
j
+
1
x
,
y
.Thus, this kind of functions can be defined as fuzzy basic functions of RPFS. The exact definition is as follows.Definition 5.
Define fuzzy basic functions of RPFS as(27)
φ
i
2
,
j
2
x
,
y
=
P
i
2
,
j
2
x
,
y
P
i
,
j
x
,
y
+
P
i
+
1
,
j
x
,
y
+
P
i
+
1
,
j
+
1
x
,
y
+
P
i
,
j
+
1
x
,
y
,where i
2
=
i
,
i
+
1; j
2
=
j
,
j
+
1. According to Definition 5, it is obvious that(28)
φ
i
,
j
x
,
y
+
φ
i
+
1
,
j
x
,
y
+
φ
i
+
1
,
j
+
1
x
,
y
+
φ
i
,
j
+
1
x
,
y
=
1
.Now the output of RPFS can be represented as(29)
S
x
,
y
=
φ
i
,
j
x
,
y
z
i
,
j
+
φ
i
+
1
,
j
x
,
y
z
i
+
1
,
j
+
φ
i
+
1
,
j
+
1
x
,
y
z
i
+
1
,
j
+
1
+
φ
i
,
j
+
1
x
,
y
z
i
,
j
+
1
,where φ
i
2
,
j
2
(
x
i
3
,
y
j
3
)
=
1
i
3
=
i
,
i
+
1
;
j
3
=
j
,
j
+
1, when i
2
=
i
3 and j
2
=
j
3, and, inversely, φ
i
2
,
j
2
(
x
i
3
,
y
j
3
)
=
0, when i
2
≠
i
3 or j
2
≠
j
3.From the above analysis, we can conclude as follows. The basic idea of RPFS is a kind of piecewise interpolation function with the conditions(30)
S
x
i
,
y
j
=
f
x
i
,
y
j
i
=
1,2
,
…
,
M
;
j
=
1,2
,
…
,
N
.Fuzzy basic functions play the same role in RPFS as the interpolation basis functions do in computational mathematics. The output of RPFS is a weighted sum with the corresponding fuzzy basic function values as the weights on x
i
,
x
i
+
1
×
y
j
,
y
j
+
1.Denote byC
(
D
′
) the collection of all the continuous functions mapping D
′ into the real numbers. The distance between f and g in C
(
D
′
) can be measured as f
-
g
=
sup
⁡
x
,
y
∈
D
′
f
x
,
y
-
g
x
,
y. The problem of approximation can be described as follows: given f
x
,
y
∈
C
(
D
′
) and any ε
>
0, is it possible for RPFS to approximate the function f
x
,
y on an arbitrary compact domain D
′ to ε level? The following theorem addresses the above posed problem.Theorem 6.
For any given real continuous functionf
x
,
y on the compact set D
′
⊂
R
2 and arbitrary ε
>
0, there exists a RPFS S
x
,
y such that (31)
S
-
f
=
sup
⁡
x
,
y
∈
D
′
S
x
,
y
-
f
x
,
y
<
ε
.Proof.
Without losing generality, the proof is discussed on one partition[
x
i
,
x
i
+
1
]
×
[
y
j
,
y
j
+
1
] of the domain D
′. We can now prove the theorem with the help of the interpolation property of RPFS. From (30), we have(32)
S
x
,
y
-
f
x
,
y
=
S
x
,
y
-
S
x
i
,
y
j
+
f
x
i
,
y
j
-
f
x
,
y
≤
S
x
,
y
-
S
x
i
,
y
j
+
f
x
i
,
y
j
-
f
x
,
y
.Using Lagrange Mean Value Theorem, there exist (
ξ
1
,
η
1
) and (
ξ
2
,
η
2
) which both belong to (
x
i
,
x
i
+
1
)
×
(
y
j
,
y
j
+
1
) such that(33)
S
x
,
y
-
f
x
,
y
=
∂
S
∂
x
(
ξ
1
,
η
1
)
x
-
x
i
+
∂
S
∂
y
(
ξ
1
,
η
1
)
y
-
y
j
+
∂
f
∂
x
(
ξ
2
,
η
2
)
x
-
x
i
+
∂
f
∂
y
(
ξ
2
,
η
2
)
(
y
-
y
j
)
≤
∂
S
∂
x
ξ
1
,
η
1
+
∂
S
∂
y
ξ
1
,
η
1
+
∂
f
∂
x
ξ
2
,
η
2
+
∂
f
∂
y
ξ
2
,
η
2
h
,where h
=
max
⁡
⁡
{
|
x
-
x
i
|
,
|
y
-
y
j
|
}. As (
|
∂
S
/
∂
x
ξ
1
,
η
1
|
+
|
∂
S
/
∂
y
ξ
1
,
η
1
|
+
|
(
∂
f
/
∂
x
)
ξ
2
,
η
2
| + |
(
∂
f
/
∂
y
)
ξ
2
,
η
2
|
) is a constant, when h is sufficiently small, it is evident that for any ε
>
0 the following inequality can be obtained:(34)
S
x
,
y
-
f
x
,
y
<
ε
∀
x
,
y
∈
D
′
.Then(35)
S
-
f
=
sup
⁡
x
,
y
∈
D
′
S
x
,
y
-
f
x
,
y
<
ε
.The proof is completed.In conclusion, Theorem6 shows that RPFS is capable of approximating any real continuous function of two variables on a compact set to arbitrary accuracy.


## 5. Sufficient Condition of Approximation of Rectangular Pyramid Fuzzy System

In this section, we will establish one sufficient condition on the premise that RPFS can approximate any continuous functions of two variables on a compact domain (in Section4). It is impossible to give a formula of the needed rule number of RPFS to satisfy the required approximation accuracy for all continuous functions. However, for a special class of continuous functions, this is possible. In the below theorem, continuous functions with bounded partial derivatives are approximated by RPFS. Now, we present the main result of this section.Theorem 7.
Letf
:
a
,
b
×
c
,
d
→
m
,
n be a continuous function which satisfies f
x
x
,
y
≤
M
1 and f
y
x
,
y
≤
M
2, where M
1 and M
2 are both constants. For any approximation error bound ε
>
0, there exists a RPFS S
x
,
y that satisfies S
x
,
y
-
f
x
,
y
<
ε
∀
x
,
y
∈
a
,
b
×
c
,
d when(36)
N
1
=
max
⁡
N
,
M
>
4
M
1
b
-
a
+
4
M
2
d
-
c
ε
.Proof.
Note that, from (28), we have(37)
S
x
,
y
-
f
x
,
y
=
φ
i
j
x
,
y
f
i
j
+
φ
i
+
1
,
j
x
,
y
f
i
+
1
,
j
+
φ
i
+
1
,
j
+
1
x
,
y
f
i
+
1
,
j
+
1
+
φ
i
,
j
+
1
x
,
y
f
i
,
j
+
1
-
f
x
,
y
=
φ
i
j
x
,
y
f
i
j
-
f
x
,
y
+
φ
i
+
1
,
j
x
,
y
f
i
+
1
,
j
-
f
x
,
y
+
φ
i
+
1
,
j
+
1
x
,
y
f
i
+
1
,
j
+
1
-
f
x
,
y
+
φ
i
,
j
+
1
x
,
y
f
i
,
j
+
1
-
f
x
,
y
.Applying the triangle inequality and Lagrange Mean Value Theorem, we get, in light of φ
i
1
,
j
1
x
,
y
≤
1
i
1
=
i
,
i
+
1
;
j
1
=
j
,
j
+
1,(38)
S
x
,
y
-
f
x
,
y
≤
f
i
j
-
f
x
,
y
+
f
i
+
1
,
j
-
f
x
,
y
+
f
i
+
1
,
j
+
1
-
f
x
,
y
+
f
i
,
j
+
1
-
f
x
,
y
=
f
x
ξ
1
′
,
η
1
′
x
-
x
i
+
f
y
ξ
1
′
,
η
1
′
y
-
y
j
+
f
x
ξ
2
′
,
η
2
′
x
-
x
i
+
1
+
f
y
ξ
2
′
,
η
2
′
y
-
y
j
+
f
x
ξ
3
′
,
η
3
′
x
-
x
i
+
1
+
f
y
ξ
3
′
,
η
3
′
y
-
y
j
+
1
+
f
x
ξ
4
′
,
η
4
′
x
-
x
i
+
f
y
ξ
4
′
,
η
4
′
y
-
y
j
+
1
≤
M
1
x
-
x
i
+
M
2
y
-
y
j
+
M
1
x
-
x
i
+
1
+
M
2
y
-
y
j
+
M
1
x
-
x
i
+
1
+
M
2
y
-
y
j
+
1
+
M
1
x
-
x
i
+
M
2
y
-
y
j
+
1
.It is simple to show that(39)
x
-
x
i
≤
b
-
a
M
,
x
-
x
i
+
1
≤
b
-
a
M
,
y
-
y
j
≤
d
-
c
N
,
y
-
y
j
+
1
≤
d
-
c
N
.So let(40)
S
x
,
y
-
f
x
,
y
≤
4
M
1
b
-
a
M
+
4
M
2
d
-
c
N
<
ε
,Where (
ξ
1
′
,
η
1
′
), (
ξ
2
′
,
η
2
′
), (
ξ
3
′
,
η
3
′
), and (
ξ
4
′
,
η
4
′
)
∈
(
x
i
,
y
j
)
×
(
x
i
+
1
,
y
j
+
1
). Simplifying the above formula, we obtain(41)
N
1
=
max
⁡
N
,
M
>
4
M
1
b
-
a
+
4
M
2
d
-
c
ε
.The proof is completed.


## 6. Simulation

In this section, we compare the approximation performance of RPFS with the conventional fuzzy system (using Gaussian membership functions) mentioned in Section2 by approximating four typical functions as follows:(42)
f
1
x
,
y
=
0.52
+
0.1
x
3
+
0.28
y
3
-
0.06
x
y
,
iiiiiiii
x
,
y
∈
-
1,1
×
-
1,1
;
f
2
(
x
,
y
)
=
x
3
+
y
3
,
x
,
y
∈
[
-
1,1
]
×
[
-
1,1
]
;
f
3
(
x
,
y
)
=
sin
(
x
+
y
)
,
x
,
y
∈
[
-
1,1
]
×
[
-
1,1
]
;
f
4
(
x
,
y
)
=
0.5
sin
(
x
y
)
,
x
,
y
∈
[
-
1,1
]
×
[
-
1,1
]
.For convenience, some notations are stated as follows: System I represents rectangular pyramid fuzzy system and System II represents the conventional fuzzy system (mentioned in Section2) using Gaussian membership functions. Let the distances between the peak points of the two fuzzy systems be 0.2, and the distances between the sample points are chosen as 0.01. The membership functions of rule antecedents of RPFS are given in Figure 4. The original and simulation surfaces and the approximation error surfaces are shown in Figure 5. The max approximation errors and the standard deviations of System I and System II are presented in Tables 1 and 2, respectively.Table 1
The maximum approximation errors of System I and System II.
Function
Error
System I
System II
f
1
0.0212
0.0344
f
2
0.1211
0.2004
f
3
0.0353
0.0638
f
4
0.0217
0.0214Table 2
The standard deviations of System I and System II.
Function
Standard deviation
System I
System II
f
1
0.0056
0.0097
f
2
0.0265
0.0457
f
3
0.0126
0.0247
f
4
0.0040
0.0083Figure 4
Membership functions of rule antecedents of RPFS in the simulation.Figure 5
(a) The original and simulation surfaces off
1. (b) The approximation error surface of f
1. (c) The original and simulation surfaces of f
2. (d) The approximation error surface of f
2. (e) The original and simulation surfaces of f
3. (f) The approximation error surface of f
3. (g) The original and simulation surfaces of f
4. (h) The approximation error surface of f
4.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)It can be seen from Figure5 that the simulation surfaces of RPFS almost coincided with the original surfaces. RPFS achieves a better approximation performance comparing with the conventional fuzzy system as shown in Tables 1 and 2. We can conclude that the proposed fuzzy system improves the approximation capability of the conventional fuzzy system to some extent.


## 7. Conclusions

A new type of fuzzy system based on the rectangular pyramid membership function is proposed in this paper. The model of the system has been introduced mainly by replacing the compound of the two rule antecedents using t-norm with the rectangular pyramid membership function, and the concrete derivation process is given. As the application problem of fuzzy system is essentially a function approximation problem, it is necessary to know about the approximation capability of RPFS. We proved that RPFS can approximate any continuous function of two variables to arbitrary degree of accuracy on any compact domain. Furthermore, the sufficient condition which reflects the relationship between the rule number and the approximation accuracy is also given combing the approximation property of RPFS. Finally, the simulation results demonstrate that the approximation performance of RPFS is found to be better than the conventional fuzzy system in the maximum approximation errors and the standard deviations. It means that RPFS has successfully improved the performance of function approximation of the conventional fuzzy system to some degree.



---

*Source: 682989-2015-03-19.xml*