Abstract
Interval type-2 fuzzy logic controllers (IT2 FLCs) have been attracting great research interests recently. Many reported results have shown that IT2 FLCs are better able to handle uncertainties than their type-1 (T1) counterparts. A challenging question is: What are the fundamental differences between IT2 and T1 FLCs? Once the fundamental differences are clear, we can better understand the advantages of IT2 FLCs and hence better make use of them. This chapter explains two fundamental differences between IT2 and T1 FLCs: (1) Adaptiveness, meaning that the embedded T1 fuzzy sets used to compute the bounds of the type-reduced interval change as input changes; and, (2) Novelty, meaning that the upper and lower membership functions of the same IT2 fuzzy set may be used simultaneously in computing each bound of the type-reduced interval. T1 FLCs do not have these properties; thus, a T1 FLC cannot implement the complex control surface of an IT2 FLC given the same rulebase.
Access provided by Autonomous University of Puebla. Download chapter PDF
Similar content being viewed by others
Keywords
- Fundamental differences
- Type-1 fuzzy set
- Karnik-Mendel algorithms
- Novelty
- Fuzzy logic control
- Example of interval type-2 fuzzy logic controller
- Linguistic uncertainties
- Interval type-2 fuzzy logic controller
- Switch point
- KM type-reducer
- Control surface
- Adaptive PI control
- Interval type-2 fuzzy set
- Adaptiveness
- Type-1 fuzzy logic controller
- Type-reduction
Introduction
Interval type-2 fuzzy logic controllers (IT2 FLCs) have been attracting great research interests recently. Many reported results have shown that IT2 FLCs are better able to handle uncertainties than their type-1 (T1) counterparts [1, 5, 10, 22, 23]. A challenging question is: What are the fundamental differences between IT2 and T1 FLCs? Once the fundamental differences are clear, we can better understand the advantages of IT2 FLCs and hence better make use of them. In the literature there has been considerable effort on answering this challenging and fundamental question. Some important arguments are [17]:
-
1.
An IT2 fuzzy set (FS) can better model intra-personal and inter-personal uncertainties,Footnote 1 which are intrinsic to natural language, because the membership grade of an IT2 FS is an interval instead of a crisp number in a T1 FS. Mendel [11] also showed that IT2 FS is a scientifically correct model for modeling linguistic uncertainties, whereas T1 FS is not.
-
2.
Using IT2 FSs to represent the FLC inputs and outputs will result in the reduction of the rulebase when compared to using T1 FSs [5, 10], as the ability of the footprint of uncertainty (FOU) to represent more uncertainties enables one to cover the input/output domains with fewer FSs. This makes it easier to construct the rulebase using expert knowledge and also increases robustness [20, 22, 23].
-
3.
An IT2 FLC can give a smoother control surfacethan its T1 counterpart, especially in the region around the steady state (i.e., when both the error and the change of error approach 0) [6, 20, 22, 23]. Wu and Tan [24] showed that when the baseline T1 FLC implements a linear PI control law and the IT2 FSs of an IT2 FLC are obtained from symmetrical perturbations of the T1 FSs, the resulting IT2 FLC implements a variable gain PI controller around the steady state. These gains are smaller than the PI gains of the baseline T1 FLC, which result in a smoother control surface around the steady state. The PI gains of the IT2 FLC also change with the inputs, which cannot be achieved by the baseline T1 FLC.
-
4.
IT2 FLCs are more adaptive and they can realize more complex input-output relationships which cannot be achieved by T1 FLCs. Karnik and Mendel [8] pointed out that an IT2 fuzzy logic system can be thought of as a collection of many different embedded T1 fuzzy logic systems. Wu and Tan [21] proposed a systematic method to identify the equivalent generalized T1 FSs that can be used to replace the FOU. They showed that the equivalent generalized T1 FSs are significantly different from traditional T1 FSs, and there are different equivalent generalized T1 FSs for different inputs. Du and Ying [3], and Nie and Tan [14], also showed that a symmetrical IT2 fuzzy-PI (or the corresponding PD) controller, obtained from a baseline T1 PI FLC, partitions the input domain into many small regions, and in each region it is equivalent to a nonlinear PI controller with variable gains. The control law of the IT2 FLC in each small region is much more complex than that of the baseline T1 FLC, and hence it can realize more complex input-output relationship that cannot be achieved by a T1 FLC using the same rulebase.
-
5.
IT2 FLCs have a noveltythat does not exist in traditional T1 FLCs. Wu [16, 17] showed that in an IT2 FLC different membership grades from the same IT2 FS can be used in different rules, whereas for traditional T1 FLC the same membership grade from the same T1 FS is always used in different rules. This again implies that an IT2 FLC is more complex than a T1 FLC and it cannot be implemented by a T1 FLC using the same rulebase.
This chapter explains why adaptiveness and novelty are two fundamental differences between IT2 and T1 FLCs. Methods for visualizing the effects of these two differences can be found in [17].
Interval Type-2 Fuzzy Sets and Controllers
This section introduces background materials on IT2 FSs and FLCs, and shows two numerical examples on IT2 FLCs.
Interval Type-2 Fuzzy Sets (IT2 FSs)
T1 FS theory was first introduced by Zadeh [25] in 1965 and has been successfully applied in many areas .
Definition 1
A T1 FS \(X\) is comprised of a domain \(D_X\) of real numbers (also called the universe of discourse of \(X\)) together with a membership function (MF) \(\mu _{_X}: D_X \rightarrow [0,1]\), i.e.,
Here \(\int \) denotes the collection of all points \(x\in D_X\) with associated membership grade \(\mu _{_X}(x)\). \(\quad \square \)
Despite having a name which carries the connotation of uncertainty, research has shown that there are limitations in the ability of T1 FSs to model and minimize the effect of uncertainties [4, 5, 10, 22]. This is because a T1 FS is certain in the sense that its membership grades are crisp values. Recently, type-2 FSs [26], characterized by MFs that are themselves fuzzy, have been attracting great interests. IT2 FSs [10], a special case of type-2 FSs, are currently the most widely used for their reduced computational cost.
Definition 2
[10, 12] An IT2 \(\widetilde{X}\) is characterized by its MF \(\mu _{\widetilde{X}} (x,u)\), i.e.,
where \(x\), called the primary variable, has domain \(D_{\widetilde{X}}; u\in [0,1]\), called the secondary variable, has domain \(J_x \subseteq [0,1]\) at each \(x\in D_{\widetilde{X}}; J_x \) is also called the support of the secondary MF; and, the amplitude of \(\mu _{\widetilde{X}} (x,u)\), called a secondary grade of \(\widetilde{X}\), equals 1 for \(\forall x\in D_{\widetilde{X}}\) and \(\forall u\in J_x\subseteq [0,1]\). \(\quad \square \)
An example of an IT2 FS, \(\widetilde{X}\), is shown in Fig. 1. Observe that unlike a T1 FS, whose membership grade for each \(x\) is a number, the membership of an IT2 FS is an interval. Observe also that an IT2 FS is bounded from above and below by two T1 FSs, \(\overline{X}\) and \(\underline{X}\), which are called upper membership function (UMF) and lower membership function (LMF), respectively. The area between \(\overline{X}\) and \(\underline{X}\) is the footprint of uncertainty (FOU). An embedded T1 FS is any T1 FS within the FOU. \(\underline{X}\) and \(\overline{X}\) are two such sets.
Interval Type-2 Fuzzy Logic Controllers (IT2 FLCs)
Figure 2 shows the schematic diagram of an IT2 FLC. It is similar to its T1 counterpart, the major difference being that at least one of the FSs in the rulebase is an IT2 FS. Hence, the outputs of the inference engine are IT2 FSs, and a type-reducer [8, 10] is needed to convert them into a T1 FS before defuzzification can be carried out.
In practice the computations in an IT2 FLC can be significantly simplified. Consider the rulebase of an IT2 FLC consisting of \(N\) rules assuming the following form:
\(\widetilde{R}^n\): IF \(x_1\) is \(\widetilde{X}_1^n\) and \(\cdots \) and \(x_I\) is \(\widetilde{X}_I^n\), THEN \(y\) is \(Y^n\). \(n=1,2,\ldots ,N\)
where \(\widetilde{X}_i^n\) \((i=1,\ldots ,I)\) are IT2 FSs, and \(Y^n=[\underline{y}^n,\,\overline{y}^n]\) is an interval, which can be understood as the centroid [7, 10] of a consequent IT2 FS,Footnote 2 or the simplest TSK model. In many applications [20, 22, 23] we use \(\underline{y}^n=\overline{y}^n\), i.e., each rule consequent is represented by a crisp number.
For an input vector \(\mathbf x ^{\prime }=(x_1^{\prime },x_2^{\prime },\ldots ,x_I^{\prime })\), typical computations in an IT2 FLC involve the following steps:
-
1.
Compute the membership interval of \(x_i^{\prime }\) on each \(X_i^n\), \([\mu _{\underline{X}_i^n}(x_i^{\prime }),\,\mu _{\overline{X}_i^n}(x_i^{\prime })]\), \(i=1,2,\ldots ,I\), \(n=1,2,\ldots ,N\).
-
2.
Compute the firing interval of the \(n^\mathrm{th }\) rule, \(F^n(\mathbf x ^{\prime })\):
$$\begin{aligned} F^n (\mathbf x ^{\prime }) = [\mu _{\underline{X}_1^n}(x_1^{\prime })\times \cdots \times \mu _{\underline{X}_I^n}(x_I^{\prime }), \, \mu _{\overline{X}_1^n}(x_1^{\prime })\times \cdots \times \mu _{\overline{X}_I^n}(x_I^{\prime })]\equiv [\underline{f}^n,\,\overline{f}^n] \end{aligned}$$(3)Note that the minimum \(t\)-norm may also be used in (3). However, this chapter focuses only on the product \(t\)-norm.
-
3.
Perform type-reduction to combine \(F^n (\mathbf x ^{\prime })\) and the corresponding rule consequents. There are many such methods [10]. The most commonly used one is the center-of-sets type-reducer [10], derived from the Extension Principle [25]:
$$\begin{aligned} Y_{\cos }(\mathbf x ^{\prime }) = \bigcup \limits _{f^n \in F^n(\mathbf x ^{\prime }) \atop y^n \in Y^n} \frac{\sum _{n=1}^{N} f^n y^n}{\sum _{n=1}^{N} f^n} =[y_l,\ y_r] \end{aligned}$$(4)It has been shown that [10, 13, 18]:
$$\begin{aligned} y_l&=\min \limits _{k\in [1,N-1]}\frac{\sum _{n=1}^k\overline{f}^n\underline{y}^n+\sum _{n=k+1}^N\underline{f}^n\underline{y}^n}{\sum _{n=1}^k\overline{f}^n+\sum _{n=k+1}^N\underline{f}^n}\equiv \frac{\sum _{n=1}^L\overline{f}^n\underline{y}^n+\sum _{n=L+1}^N\underline{f}^n\underline{y}^n}{\sum _{n=1}^L\overline{f}^n+\sum _{n=L+1}^N\underline{f}^n}\end{aligned}$$(5)$$\begin{aligned} y_r&=\max \limits _{k\in [1,N-1]}\frac{\sum _{n=1}^k\underline{f}^n\overline{y}^n+\sum _{n=k+1}^N\overline{f}^n\overline{y}^n}{\sum _{n=1}^k\underline{f}^n+\sum _{n=k+1}^N\overline{f}^n}\equiv \frac{\sum _{n=1}^R\underline{f}^n\overline{y}^n+\sum _{n=R+1}^N\overline{f}^n\overline{y}^n}{\sum _{n=1}^R\underline{f}^n+\sum _{n=R+1}^N\overline{f}^n} \end{aligned}$$(6)where the switch point s \(L\) and \(R\) are determined by
$$\begin{aligned} \underline{y}^L&\le y_l\le \underline{y}^{L+1}\end{aligned}$$(7)$$\begin{aligned} \overline{y}^R&\le y_r\le \overline{y}^{R+1} \end{aligned}$$(8)and \(\{\underline{y}^n\}_{n=1,\ldots ,N}\) and \(\{\overline{y}^n\}_{n=1,\ldots ,N}\) have been sorted in ascending order, respectively. \(y_{l}\) and \(y_{r}\) can be computed by the KM algorithms [8, 10] or their many variants [18, 19]. The main idea of the KM algorithms is to find the switch points for \(y_{l}\) and \(y_{r}\). Take \(y_{l}\) as an example. \(y_{l}\) is the minimum of \(Y_{\cos }(\mathbf x ^{\prime })\). Since \(\underline{y}^{n}\) increases from the left to the right along the horizontal axis of Fig. 3a, we should choose a large weight (upper bound of the firing interval) for \(\underline{y}^{n}\) on the left and a small weight (lower bound of the firing interval) for \(\underline{y}^{n}\) on the right. The KM algorithm for \(y_{l}\) finds the switch point\(L\). For \(n\le L\), the upper bounds of the firing intervals are used to calculate \(y_{l}\); for \(n>L\), the lower bounds are used. This ensures \(y_{l}\) is the minimum.
-
4.
Compute the defuzzified output as:
$$\begin{aligned} y = \frac{y_l+y_r}{2}. \end{aligned}$$(9)
Examples of IT2 FLC
A pair of T1 and IT2 PI FLCs are used in this section to illustrate the differences between them.
The T1 and IT2 PI FLCs
The MFs of the T1 PI FLC are shown in Fig. 4 as the bold dashed lines, where the standard deviation of all Gaussian MFs is 0.6. Its four rules are:
where \(\dot{u}\) is the change of the control signal, \(e\) is the feedback error, and \(\dot{e}\) is the change of error. \(y^1-y^4\) are given in Table 1. For simplicity the rule consequents are crisp numbers instead of intervals. However, they can be arbitrary numbers or intervals and do not affect the conclusions of this chapter.
An IT2 fuzzy PI controller may be constructed by blurring the T1 FSs of the T1 FLC to IT2 FSs.Footnote 3 In this chapter we blur the standard deviation of the Gaussian MFs from 0.6 to an interval \([0.5,\, 0.7]\), as shown in Fig. 4. The rulebase of the IT2 FLC is
Next, the mathematical operations in an IT2 FLC, introduced in Sect. 2.2, are illustrated using two numerical examples, which will be revisited in Sect. 4.
Example 1
Consider an input vector \(\mathbf x ^{\prime }=(\dot{e}^{\prime },\ e^{\prime })=(-0.3,-0.6)\), as shown in Fig. 4. The firing levels of the four T1 FSs are:
The firing levels of its four rules are shown in Table 2. The output of the T1 FLC is
For the IT2 FLC, the firing intervals of the four IT2 FSs are:
The firing intervals of the four rules are shown in Table 3. From the KM algorithms, we find that \(L=1\) and \(R=2\). So,
Finally, the crisp output of the IT2 FLC is:
Observe from the above example that for the same input, IT2 and T1 FLCs give quite different outputs.
Example 2
Consider another input vector \(\mathbf x ^{\prime }=(\dot{e}^{\prime },\,e^{\prime })=(-0.3,0.6)\), as shown in Fig. 5. The firing levels of the four T1 FSs are:
The firing levels of its four rules are shown in Table 4. The output of the T1 FLC is
For the IT2 FLC, the firing intervals of the four IT2 FSs are:
The firing intervals of the four rules are show in Table 5. From the KM algorithms, we find that \(L=2\) and \(R=2\). So,
Finally, the crisp output of the IT2 FLC is:
Observe again from the above example that for the same input, IT2 and T1 FLCs give quite different outputs. The next section explains the fundamental reasons behind this difference.
Fundamental Differences Between IT2 and T1 FLCs
Observe from (9), and also Examples 1 and 2, that the output of an IT2 FLC is the average of two "T1 FLCs". However, these two “T1 FLCs” are fundamentally different from traditional T1 FLCs, for the following reasons [16, 17]:
-
1.
Adaptiveness, meaning that the embedded T1 FSs used to compute the bounds of the type-reduced interval change as input changes. Take \(y_l\) in (10) and (11) as an example. The firing levels of the four rules in (10) are \(\overline{f}^1, \underline{f}^2, \underline{f}^3\) and \(\underline{f}^4\), respectively, which are computed from different lower and upper MFs, as shown in the first part of Table 6 and Fig. 6a. The firing levels of the four rules in (11) are shown in the second part of Table 6 and Fig. 6b. Comparing the two parts of Table 6, and the two sub-figures in Fig. 6, we can observe that when the input \((\dot{e}^{\prime },e^{\prime })\) changes from \((-0.3,-0.6)\) to \((-0.3,0.6)\), different embedded T1 FSs of \(\widetilde{X}_1^{\dot{e}}\) and \(\widetilde{X}_2^{e}\) are used in computing the firing levels for Rule \(\widetilde{R}^2\) and hence \(y_l\). This adaptiveness is impossible for a T1 FLC since it does not have such embedded T1 FSs.
-
2.
Novelty, meaning that the UMF and LMF of the same IT2 FS may be used simultaneously in computing each bound of the type-reduced interval. Observe from the first part of Table 6, and also Fig. 6a, that both the upper and lower MFs of \(\widetilde{X}_1^{\dot{e}}\) are used in computing \(y_{l}\), and they are used in different rules: The UMF of \(\widetilde{X}_1^{\dot{e}}\) is used in computing \(\overline{f}^1\), the firing level of Rule \(\widetilde{R}^1\), whereas the LMF of \(\widetilde{X}_1^{\dot{e}}\) is used in computing \(\underline{f}^2\), the firing level of Rule \(\widetilde{R}^2\). Similarly, the upper and lower MFs of \(\widetilde{X}_1^{e}\) are used simultaneously in different rules for computing \(y_l\). Observe also from the second part of Table 6 and Fig. 6b that the upper and lower MFs of \(\widetilde{X}_1^{e}\) and \(\widetilde{X}_2^{e}\) are used simultaneously in different rules for computing \(y_l\). This novelty is again impossible for a T1 FLC because it does not have embedded T1 FSs and the same MFs are always used in computing the firing levels of all rules.
We consider adaptiveness and novelty as two fundamental differences between IT2 and T1 FLCs. Though they are illustrated by specific numerical examples, they are fundamental to an arbitrary IT2 FLC. Furthermore, [17] presents several methods for visualizing and analyzing the effects of these two fundamental differences, including the control surface, the P-map, the equivalent generalized T1 fuzzy sets, and the equivalent PI gains. It also examines five alternative type-reducers for IT2 FLCs and explain why they do not capture the fundamentals of IT2 FLCs.
Theorem 1
[17] \(y_l\) in (5) cannot be implemented by a T1 FLC using the same rulebase.
Proof
In this proof we make use of the following two facts:
-
Fact 1: The rule firing levels used in the KM algorithms are the bounds of the firing intervals. For an upper bound, all involved embedded T1 FSs must be UMFs, and for a lower bound, all involved embedded T1 FSs must be LMFs. There is no mixture of UMFs and LMFs in computing the firing level of any rule.
-
Fact 2: \(\overline{f}^1\) and \(\underline{f}^N\) are always used for computing \(y_l\) in (5), though we are not sure about whether the upper or lower firing levels should be used for the rest of the rules. For \(\overline{f}^1\), all involved embedded T1 FSs must be UMFs. For \(\underline{f}^N\), all involved embedded T1 FSs must be LMFs.
We consider two cases separately:
-
1.
Rules\(\widetilde{R}^1\)and\(\widetilde{R}^N\)share at least one IT2 FS\(\widetilde{X}_i\). In this case, according to Fact 2, for Rule \(\widetilde{R}^1\)\(\overline{X}_i\) must be used, whereas for Rule \(\widetilde{R}^N\), \(\underline{X}_i\) must be used. This novelty cannot be implemented by a T1 FLC using the same rulebase.
-
2.
Rules\(\widetilde{R}^1\)and\(\widetilde{R}^N\)do not have any IT2 FS in common, (e.g., for \(y_l\) in (11), \(\widetilde{R}^1\) involves \(\widetilde{X}_1^{\dot{e}}\) and \(\widetilde{X}_1^{\dot{e}}\), whereas \(\widetilde{R}^4\) involves \(\widetilde{X}_2^{\dot{e}}\) and \(\widetilde{X}_2^{\dot{e}}\)). This case is more complicated than the previous one. We prove it by contradiction. Assume \(y_l\) in (5) can be implemented by a T1 FLC, where the same T1 MFs are used in computing all firing levels, e.g., if the UMF of \(\widetilde{X}_1^{\dot{e}}\) is used in computing the firing level of Rule \(\widetilde{R}^1\), it must also be used in computing the firing levels of all other rules involving \(\widetilde{X}_1^{\dot{e}}\). In this second case, it is always possible to find a Rule \(\widetilde{R}^k\) such that Rules \(\widetilde{R}^1\) and \(\widetilde{R}^k\) share at least one common IT2 FS \(\widetilde{X}_i\), and Rules \(\widetilde{R}^k\) and \(\widetilde{R}^N\) share at least one common IT2 FS \(\widetilde{X}_j\) (e.g., for \(y_l\) in (11), Rules \(\widetilde{R}^1\) and \(\widetilde{R}^2\) share \(\widetilde{X}_1^{\dot{e}}\), and Rules \(\widetilde{R}^2\) and \(\widetilde{R}^4\) share \(\widetilde{X}_2^e\)). According to Fact 2, \(\overline{X}_i\) must be used in Rule \(\widetilde{R}^1\) for computing \(\overline{f}^1\). If \(y_l\) can be implemented by a T1 FLC using the same rulebase, then \(\overline{X}_i\) must also be used in Rule \(\widetilde{R}^k\). According to Fact 1, \(\overline{X}_j\) must also be used for Rule \(\widetilde{R}^k\). For a T1 FLC, this means \(\overline{X}_j\) must also be used in Rule \(\widetilde{R}^N\), which is a contradiction with Fact 2. So, again \(y_l\) in (5) cannot be implemented by a T1 FLC using the same rulebase. \(\square \)
Theorem 2
[17] \(y_r\) in (6) cannot be implemented by a T1 FLC using the same rulebase.
The proof is very similar to that for Theorem 1, so it is omitted.
Based on Theorems 1 and 2, we can easily reach the following conclusion:
Theorem 3
[17] An IT2 FLC using the KM type-reducer cannot be implemented by a T1 FLC using the same rulebase.
Theorem 3 is very helpful in understanding why IT2 FLCs may outperform T1 FLCs. It suggests that an IT2 FLC can implement a more complex control surface than a T1 FLC: when there is no FOU, an IT2 FLC collapses to a T1 FLC; with FOU, an IT2 FLC can implement a control surface that cannot be obtained from a T1 FLC using the same rulebase. Note that Theorem 3 does not conflict with the fact that T1 fuzzy logic systems are universal approximators [2, 9]: Being a universal approximator requires a T1 fuzzy logic system to have an arbitrarily large number of MFs, whereas in this chapter we only consider IT2 and T1 FLCs with the same rulebase and a fixed (small) number of MFs.
Conclusions
IT2 FLCs have been widely used and demonstrated better ability to handle uncertainties than their T1 counterparts. A challenging question is what the fundamental differences between IT2 and T1 FLCs are. Once the fundamental differences are clear, we can better understand the advantages of IT2 FLCs and hence better make use of them. In this chapter we have explained two fundamental differences between IT2 and T1 FLCs: 1) Adaptiveness, meaning that the embedded T1 FSs used to compute the bounds of the type-reduced interval change as input changes; and, 2) Novelty, meaning that the UMF and LMF of the same IT2 FS may be used simultaneously in computing each bound of the type-reduced interval. As a result, an IT2 FLC can implement a complex control surface that cannot be achieved by a T1 FLC using the same rulebase.
Notes
- 1.
According to Mendel [11], intra-personal uncertainty describes “the uncertainty a person has about the word.” It is also explicitly pointed out by psychologists Wallsten and Budescu [15] as “except in very special cases, all representations are vague to some degree in the minds of the originators and in the minds of the receivers,” and they suggest to model it by a T1 FS. According to Mendel [11], inter-personal uncertainty describes “the uncertainty that a group of people have about the word,’ i.e., “words mean different things to different people.” It is also explicitly pointed out by psychologists Wallsten and Budescu [15] as “different individuals use diverse expressions to describe identical situations and understand the same phrases differently when hearing or reading them.”
- 2.
The rule consequents can be IT2 FSs; however, when the popular center-of-sets type-reduction method [10] is used, these consequent IT2 FSs are replaced by their centroids in the computation; so, it is more convenient to represent the rule consequents as intervals directly.
- 3.
References
Castillo, O., Melin, P.: Type-2 Fuzzy Logic Theory and Applications. Springer-Verlag, Berlin (2008)
Castro, J.L.: Fuzzy logic controllers are universal approximators. IEEE Trans. Syst. Man Cybern. 25(4), 629–635 (1995)
Du, X., Ying, H.: Derivation and analysis of the analytical structures of the interval type-2 fuzzy-PI and PD controllers. IEEE Trans. Fuzzy Syst. 18(4), 802–814 (2010)
Hagras, H.: A hierarchical type-2 fuzzy logic control architecture for autonomous mobile robots. IEEE Trans. Fuzzy Syst. 12, 524–539 (2004)
Hagras, H.: Type-2 FLCs: a new generation of fuzzy controllers. IEEE Comput. Intell. Mag. 2(1), 30–43 (2007)
Jammeh, E.A., Fleury, M., Wagner, C., Hagras, H., Ghanbari, M.: Interval type-2 fuzzy logic congestion control for video streaming across IP networks. IEEE Trans. Fuzzy Syst. 17(5), 1123–1142 (2009)
Karnik, N.N., Mendel, J.M.: Centroid of a type-2 fuzzy set. Inf. Sci. 132, 195–220 (2001)
Karnik, N.N., Mendel, J.M., Liang, Q.: Type-2 fuzzy logic systems. IEEE Trans. Fuzzy Syst. 7, 643–658 (1999)
Kosko, B.: Fuzzy systems as universal approximators. IEEE Trans. Comput. 43(11), 1329–1333 (1994)
Mendel, J.M.: Uncertain Rule-Based Fuzzy Logic Systems: Introduction and New Directions. Prentice-Hall, Upper Saddle River (2001)
Mendel, J.M.: Computing with words: Zadeh, Turing, Popper and Occam. IEEE Comput. Intell. Mag. 2, 10–17 (2007)
Mendel, J.M., John, R.I.: Type-2 fuzzy sets made simple. IEEE Trans. Fuzzy Syst. 10(2), 117–127 (2002)
Mendel, J.M., Wu, D.: Perceptual Computing: Aiding People in Making Subjective Judgments. Wiley-IEEE Press, Hoboken (2010)
Nie, M., Tan, W.: Analytical structure and characteristics of symmetric centroid type-reduced interval type-2 fuzzy PI and PD controllers. IEEE Trans. Fuzzy Syst. 20(3), 416–430 (2012)
Wallsten, T.S., Budescu, D.V.: A review of human linguistic probability processing: general principles and empirical evidence. Knowl. Eng. Rev. 10(1), 43–62 (1995)
Wu, D.: An interval type-2 fuzzy logic system cannot be implemented by traditional type-1 fuzzy logic systems. In: Proceedings of World Conference on Soft Computing, San Francisco (2011)
Wu, D.: On the fundamental differences between interval type-2 and type-1 fuzzy logic controllers. IEEE Trans. Fuzzy Syst. 20(5), 832–848 (2012)
Wu, D., Mendel, J.M.: Enhanced Karnik-Mendel algorithms. IEEE Trans. Fuzzy Syst. 17(4), 923–934 (2009)
Wu, D., Nie, M.: Comparison and practical implementation of type-reduction algorithms for type-2 fuzzy sets and systems. In: Proceedings of IEEE International Conference on Fuzzy Systems, pp. 2131–2138. Taipei, Taiwan (2011)
Wu, D., Tan, W.W.: A type-2 fuzzy logic controller for the liquid-level process. In: Proceedings of IEEE International Conference on Fuzzy Systems, vol. 2, pp. 953–958. Budapest, Hungary (2004)
Wu, D., Tan, W.W.: Type-2 FLS modeling capability analysis. In: Proceedings of IEEE International Conference on Fuzzy Systems, pp. 242–247. Reno, NV (2005)
Wu, D., Tan, W.W.: Genetic learning and performance evaluation of type-2 fuzzy logic controllers. Eng. Appl. Artif. Intell. 19(8), 829–841 (2006)
Wu, D., Tan, W.W.: A simplified type-2 fuzzy controller for real-time control. ISA Trans. 15(4), 503–516 (2006)
Wu, D., Tan, W.W.: Interval type-2 fuzzy PI controllers: why they are more robust. In: Proceedings of IEEE International Conference on Granular Computing, pp. 802–807. San Jose, CA (2010)
Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)
Zadeh, L.A.: The concept of a linguistic variable and its application to approximate reasoning-1. Inf. Sci. 8, 199–249 (1975)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wu, D. (2013). Two Differences Between Interval Type-2 and Type-1 Fuzzy Logic Controllers: Adaptiveness and Novelty. In: Sadeghian, A., Mendel, J., Tahayori, H. (eds) Advances in Type-2 Fuzzy Sets and Systems. Studies in Fuzziness and Soft Computing, vol 301. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6666-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6666-6_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-6665-9
Online ISBN: 978-1-4614-6666-6
eBook Packages: EngineeringEngineering (R0)