0% found this document useful (0 votes)
86 views

Unit 4 Fuzzy Systems

The document discusses fuzzy systems and fuzzy logic. It defines key concepts like fuzzification, membership functions, fuzzy rules and inference engines. It provides examples of a fuzzy logic system for controlling room temperature using linguistic variables like cold, warm, hot. The development process involves defining terms and membership functions, constructing a knowledge base of rules, fuzzifying inputs, performing inference and defuzzification. Advantages of fuzzy logic systems are that they can handle imprecise data and resemble human reasoning.

Uploaded by

indu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
86 views

Unit 4 Fuzzy Systems

The document discusses fuzzy systems and fuzzy logic. It defines key concepts like fuzzification, membership functions, fuzzy rules and inference engines. It provides examples of a fuzzy logic system for controlling room temperature using linguistic variables like cold, warm, hot. The development process involves defining terms and membership functions, constructing a knowledge base of rules, fuzzifying inputs, performing inference and defuzzification. Advantages of fuzzy logic systems are that they can handle imprecise data and resemble human reasoning.

Uploaded by

indu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 79

Fuzzy systems

Soft Computing

3/26/2019 Indu Bhardwaj 1


Unit 3
• Essential Elements of Fuzzy Systems,
• Classical Inference Rule,
• Classical Implications and Fuzzy Implications,
• Crisp Relation and Fuzzy Relations,
• Composition of fuzzy relations,
• Cylindrical Extension and Projection.
• Fuzzy IF-THEN rules,
• Inference: Scaling and Clipping Method,
• Aggregation,
• Fuzzy rule based Model: Mamdani Model, TSK model
• Fuzzy Propositions, Defuzzification: MOM, COA

3/26/2019 Indu Bhardwaj 2


Fuzzy logic
• Fuzzy Logic (FL) is a method of reasoning that
resembles human reasoning.
• involves all intermediate possibilities between
digital values YES and NO.
• The conventional logic block that a computer
can understand takes precise input and
produces a definite output as TRUE or FALSE,
which is equivalent to human’s YES or NO.

3/26/2019 Indu Bhardwaj 3


Fuzzy logic
• The inventor of fuzzy logic, Lotfi Zadeh, observed
that unlike computers, the human decision
making includes a range of possibilities between
YES and NO, such as CERTAINLY YES
POSSIBLY YES
CANNOT SAY
POSSIBLY NO
CERTAINLY NO

• The fuzzy logic works on the levels of possibilities


of input to achieve the definite output.
3/26/2019 Indu Bhardwaj 4
Fuzzy system
• A fuzzy system (FS) is any Fuzzy Logic
based system, which either uses Fuzzy Logic
as the basis for knowledge representation
using different forms of knowledge. 
• Fuzzy Logic Systems (FLS) produce acceptable
but definite output in response to incomplete,
ambiguous, distorted, or inaccurate (fuzzy)
input.

3/26/2019 Indu Bhardwaj 5


Why fuzzy logic?
• Fuzzy logic is useful for commercial and
practical purposes.
– It can control machines and consumer products.
– It may not give accurate reasoning, but acceptable
reasoning.
– Fuzzy logic helps to deal with the uncertainty in
engineering.

3/26/2019 Indu Bhardwaj 6


Elements of Fuzzy Logic Systems
• It has four main parts as shown

3/26/2019 Indu Bhardwaj 7


Elements of Fuzzy Logic Systems
• Fuzzification− It transforms the system inputs,
which are crisp numbers, into fuzzy sets. It
splits the input signal into five steps such as −
LP x is Large Positive
MP x is Medium Positive
S x is Small
MN x is Medium Negative
LN x is Large Negative

3/26/2019 Indu Bhardwaj 8


Elements of Fuzzy Logic Systems
• Knowledge Base − It stores IF-THEN rules
provided by experts.
• Inference Engine − It simulates the human
reasoning process by making fuzzy inference
on the inputs and IF-THEN rules.
• Defuzzification Module − It transforms the
fuzzy set obtained by the inference engine
into a crisp value.

3/26/2019 Indu Bhardwaj 9


Membership Function
• Membership functions allow you to quantify linguistic
term and represent a fuzzy set graphically. A membership
function for a fuzzy set A on the universe of discourse X is
defined as μA:X → [0,1].
• Here, each element of X is mapped to a value between 0
and 1. It is called membership value or degree of
membership. It quantifies the degree of membership of
the element in X to the fuzzy set A.
– x axis represents the universe of discourse.
– y axis represents the degrees of membership in the [0, 1]
interval.

3/26/2019 Indu Bhardwaj 10


Membership Function
• All membership functions for LP, MP, S,
MN, and LN are shown as below

3/26/2019 Indu Bhardwaj 11


Membership Function
• The triangular membership function shapes
are most common
• various other membership function shapes
such as trapezoidal, singleton, and Gaussian.
• Here, the input to 5-level fuzzifier varies from
-10 volts to +10 volts. Hence the
corresponding output also changes.

3/26/2019 Indu Bhardwaj 12


Example of a Fuzzy Logic System

• Let us consider an air conditioning system with


5-level fuzzy logic system.
• This system adjusts the temperature of air
conditioner by comparing the room
temperature and the target temperature
value.

3/26/2019 Indu Bhardwaj 13


Example of a Fuzzy Logic System

3/26/2019 Indu Bhardwaj 14


Algorithm

• Define linguistic Variables and terms (start)


• Construct membership functions for them. (start)
• Construct knowledge base of rules (start)
• Convert crisp data into fuzzy data sets using
membership functions. (fuzzification)
• Evaluate rules in the rule base. (Inference Engine)
• Combine results from each rule. (Inference Engine)
• Convert output data into non-fuzzy values.
(defuzzification)
3/26/2019 Indu Bhardwaj 15
Development
Step 1 − Define linguistic variables and terms
• Linguistic variables are input and output variables in
the form of simple words or sentences. For room
temperature, cold, warm, hot, etc., are linguistic
terms.
• Temperature (t) = {very-cold, cold, warm, very-warm,
hot}
• Every member of this set is a linguistic term and it can
cover some portion of overall temperature values.

3/26/2019 Indu Bhardwaj 16


Development
Step 2 − Construct membership functions for
them
• The membership functions of temperature
variable are as shown −

3/26/2019 Indu Bhardwaj 17


Development
• Step3 − Construct knowledge base rules
• Create a matrix of room temperature values
versus target temperature values that an air
conditioning system is expected to provide.
RoomTemp.
Very_Cold Cold Warm Hot Very_Hot
/Target

Very_Cold No_Chang Heat Heat Heat Heat


e

Cold Cool No_Chang Heat Heat Heat


e

Warm Cool Cool No_Chang Heat Heat


e

Hot Cool Cool Cool No_Chang Heat


e

Very_Hot Cool Cool Cool Cool No_Chang


e

3/26/2019 Indu Bhardwaj 18


Development
• Build a set of rules into the knowledge base in
the form of IF-THEN-ELSE structures.

Sr. No. Condition Action

IF temperature=(Cold OR Very_Cold) AND Heat


1 target=Warm THEN

IF temperature=(Hot OR Very_Hot) AND Cool


2 target=Warm THEN

IF (temperature=Warm) AND (target=Warm) THEN No_Chang


3 e

3/26/2019 Indu Bhardwaj 19


Development
Step 4 − Obtain fuzzy value
• Fuzzy set operations perform evaluation of
rules. The operations used for OR and AND are
Max and Min respectively. Combine all results
of evaluation to form a final result. This result
is a fuzzy value.

3/26/2019 Indu Bhardwaj 20


Development
Step 5 − Perform defuzzification
• Defuzzification is then performed according to
membership function for output variable.

3/26/2019 Indu Bhardwaj 21


Advantages of FLSs

• Mathematical concepts within fuzzy reasoning are very


simple.
• FLS can be modified by just adding or deleting rules
due to flexibility of fuzzy logic.
• Fuzzy logic Systems can take imprecise, distorted, noisy
input information.
• FLSs are easy to construct and understand.
• Fuzzy logic is a solution to complex problems in all
fields of life, including medicine, as it resembles human
reasoning and decision making.
3/26/2019 Indu Bhardwaj 22
Disadvantages of FLSs

• There is no systematic approach to fuzzy


system designing.
• They are understandable only when simple.
• They are suitable for the problems which do
not need high accuracy.

3/26/2019 Indu Bhardwaj 23


Classical Inference Rule

• Classical Rule of inference used in logic are


• Generalized Modus Ponens (GMP )
– (latin for "mode that affirms")
• Generalized Modus Tollens (GMT)
– (the mode that denies)

3/26/2019 Indu Bhardwaj 24


Generalized Modus Ponens (GMP)
• According to this rule, we can infer the truth
of preposition B from the truth of A and the
implication A ͢ B

Premise 1 (rule) If A ͢ B is true


Premise 2 (fact) A is true
Consequence (Conclusion) B is true

3/26/2019 Indu Bhardwaj 25


Example 1 of GMP
• Consider the following argument...
– "If you have a current password, then you can log on to the network"
– "You have a current password"

Therefore:
– "You can log on to the network“

• This has the form:


–P→q
–p
– ∴ q

• This form of argument is calls Modus Ponens (latin for "mode that affirms“)

3/26/2019 Indu Bhardwaj 26


Example 2 of GMP
• Premise 1 (Rule) : If the tomato is red then
the tomato is ripe
• Premise 2 (Fact ) : If tomato is red
• Conclusion : Tomato is ripe

3/26/2019 Indu Bhardwaj 27


Generalized Modus Tollens (GMT)
Premise 1 (Rule): If x is A Then y is B
Premise 2 (Fact ) : y is B’
Conclusion : x is A ‘

3/26/2019 Indu Bhardwaj 28


Example
• Consider the following argument...
– You can't log into the network
– If you have a current password, then you can log into the network

• Therefore
– You don't have a current password.
• This is an argument of the form:
¬q
p→q

•  ¬p

This form of argument is called modus tollens (the mode that denies).

3/26/2019 Indu Bhardwaj 29


Crisp and Fuzzy Relations
• A relation is of fundamental importance in all engineering fields.
Relations can be also be used to represent similarity. Relations are
involved in logic, classification, pattern recognition, and control
• Some relations concern elements within the same universe: one
measurement is larger than another, one event occurred earlier
than another, one element resembles another, etc.
• Other relations concern elements from disjoint universes: the
measurement is large and its rate of change is positive, the x-
coordinate is large and the y-coordinate is small, for example.
• These examples are relationships between two objects, but in
principle we can have relationships which hold for any number of
objects.

3/26/2019 Indu Bhardwaj 30


Crisp Relation
• A Crisp Relation R from a set A to a set B assigns to
each ordered pair exactly one of the following
statements:
(i) “a is related to b” or
(ii) “a is not related to b’’
• The Cartesian Product AxB is the set of all possible
combinations of the items of A and B
• For example when:
A = {a1 ,a2 ,a3} and B = {b1 ,b2}
3/26/2019 Indu Bhardwaj 31
Crisp Relation
• The Cartesian product yields the shown figure.
Which means:
• AxB = {(a1 ,b1),(a1 ,b2),(a2,b1),(a2,b2),(a3
,b1),(a3,b2)}

3/26/2019 Indu Bhardwaj 32


E.g. Of crisp relations
• example 1: “Owning Cars”-Crisp Relation
– X = {Aly, Baher, Kamel}
– Y = {BMW, Chrysler, Ford, Mazda, Fiat}

3/26/2019 Indu Bhardwaj 33


E.g. Of crisp relations
• example 2: “Close to”-Crisp Relation
– X = Y = {1, .......,8}

3/26/2019 Indu Bhardwaj 34


Fuzzy Relation
• Fuzzy relations map elements of one universe, say U, to
those of another universe, say V, through the Cartesian
product of the two universes. However, the ‘‘strength’’ of
the relation between ordered pairs of the two universes is
measured with a membership function expressing various
‘‘degrees’’ of strength of the relation on the unit interval
[0,1].
• As an example a fuzzy relation “Friend” describes the
degree of friendship between two persons (in contrast to
either being friend or not being friend in classical
relation!)
3/26/2019 Indu Bhardwaj 35
E.g. Of Fuzzy Relation
• Ex.3 Fuzzy relation “Similarity” U = V = {1, . . . ,
8}

3/26/2019 Indu Bhardwaj 36


E.g. Of Fuzzy Relation

3/26/2019 Indu Bhardwaj 37


Composition of Fuzzy Relations
• A fuzzy relation R is defined on sets A, B and
another fuzzy relations S is defined on sets
B,C. That is, R ⊆ A x B, S ⊆ B x C.
• The composition S • R = SR of the two
relations R and S expresses the relation from A
to C.

3/26/2019 Indu Bhardwaj 38


Composition of Fuzzy Relations
• This composition is defined by an inner
product. The inner product is similar to an
ordinary matrix (dot) product, except
Multiplication is replaced by Minimum and
Summation by Maximum.
• Thus this composition is defined by the
following
µ S • R (a, c) = max [ min (µR (a, b), µS (b, c))]

3/26/2019 Indu Bhardwaj 39


Example of fuzzy composition

3/26/2019 Indu Bhardwaj 40


Example of fuzzy composition

3/26/2019 Indu Bhardwaj 41


Example of fuzzy composition

3/26/2019 Indu Bhardwaj 42


Projection of Fuzzy Relation

3/26/2019 Indu Bhardwaj 43


Example of Projection of Fuzzy Relation

3/26/2019 Indu Bhardwaj 44


Cylindrical extension of fuzzy relation

3/26/2019 Indu Bhardwaj 45


Example of Cylindrical extension

3/26/2019 Indu Bhardwaj 46


Fuzzy IF-THEN rules
• Also known as fuzzy rule, fuzzy implication, and
fuzzy conditional statement
• If x is A then y is B
– “x is A” is antecedent or premise which tells the fact
– “y is B” is consequence or conclusion
The whole statement is the rule.
• These if then rules are the base of fuzzy
reasoning.

3/26/2019 Indu Bhardwaj 47


Examples of Fuzzy IF-THEN rules
– If pressure is high, then volume is small.
– If the road is slippery, then driving is dangerous.
– If a tomato is red, then it is ripe.
– If the speed is high, then apply the brake a little.

3/26/2019 Indu Bhardwaj 48


Types of Fuzzy IF-THEN rules
• If then rules are of different types:
1. Single rule with single antecedent
2. Single rule with multiple antecedent
3. Multiple with multiple antecedent

3/26/2019 Indu Bhardwaj 49


Types of Fuzzy IF-THEN rules
• Single rule with single antecedent
Rule: if x is A then y is B
Fact: x is A’
Conclusion: y is B’
• Single rule with multiple antecedent
Rule: if x is A and y is B then z is C
Fact: x is A’ and y is B’
Conclusion: z is C’
• Multiple rules with multiple antecedent
Rule 1: if x is A1 and y is B1 then z is C1
Rule 2: if x is A2 and y is B2 then z is C2
Fact: x is A’ and y is B’
Conclusion: z is C’

3/26/2019 Indu Bhardwaj 50


Interpretation of Fuzzy if-then rule
Interpreting if-then rules is a three-part process. This process is explained in
detail in the next section:
• Fuzzify inputs: Resolve all fuzzy statements in the antecedent to a degree of
membership between 0 and 1. If there is only one part to the antecedent,
this is the degree of support for the rule.
• Apply fuzzy operator to multiple part antecedents: If there are multiple parts
to the antecedent, apply fuzzy logic operators and resolve the antecedent to
a single number between 0 and 1. This is the degree of support for the rule.
• Apply implication method: Use the degree of support for the entire rule to
shape the output fuzzy set. The consequent of a fuzzy rule assigns an entire
fuzzy set to the output. This fuzzy set is represented by a membership
function that is chosen to indicate the qualities of the consequent. If the
antecedent is only partially true, (i.e., is assigned a value less than 1), then
the output fuzzy set is truncated according to the implication method.

3/26/2019 Indu Bhardwaj 51


Interpretation of Fuzzy if-then rule

3/26/2019 Indu Bhardwaj 52


Fuzzy Inference
• Fuzzy inference is the process of formulating
the mapping from a given input to an output
using fuzzy logic.
• Fuzzy inference process comprised of
following steps 1) Fuzzification, 2) Rule
Evaluation, 3) Aggregation of Rules, and 4)
Defuzzification.

3/26/2019 Indu Bhardwaj 53


Fuzzy inference process
• Fuzzification is the first step in the fuzzy inferencing
process. This involves a domain transformation
where crisp inputs are transformed into fuzzy inputs.
• Rule Evaluation: Rule evaluation consists of a series
of IF-THEN rules.
• Aggregation: Aggregation is the process of
unification of the outputs of all rules
• Defuzzification involves the process of transposing
the fuzzy outputs to crisp outputs

3/26/2019 Indu Bhardwaj 54


Fuzzy rule based Model

• Fuzzy rule based Model are of two types


1. Mamdani Model,
2. TSK model

3/26/2019 Indu Bhardwaj 55


Mamdani Fuzzy Inference
• The most commonly used fuzzy inference
technique is the so-called Mamdani method.
• In 1975, Professor Ebrahim Mamdani of
London University built one of the first fuzzy
systems to control a steam engine and boiler
combination. He applied a set of fuzzy rules
supplied by experienced human operators.

3/26/2019 Indu Bhardwaj 56


Mamdani Fuzzy Inference
• The Mamdani-style fuzzy inference process is performed in four steps:

1. Fuzzification of the input variables

2. Rule evaluation (inference)

3. Aggregation of the rule outputs (composition)

4. Defuzzification.

3/26/2019 Indu Bhardwaj 57


Mamdani Fuzzy Inference
We examine a simple two-input one-output problem that includes three rules:

Rule: 1 Rule: 1
IF x is A3 IF project_funding is adequate
OR y is B1 OR project_staffing is small
THEN z is C1 THEN risk is low

Rule: 2 Rule: 2
IF x is A2 IF project_funding is marginal
AND y is B2 AND project_staffing is large
THEN z is C2 THEN risk is normal

Rule: 3 Rule: 3
IF x is A1 IF project_funding is inadequate
THEN z is C3 THEN risk is high

3/26/2019 Indu Bhardwaj 58


Step 1: Fuzzification
• The first step is to take the crisp inputs, x1 and y1 (project funding and
project staffing), and determine the degree to which these inputs
belong to each of the appropriate fuzzy sets.

Crisp Input Crisp Input


x1 y1

1 1 B1 B2
A1 A2 A3 0.7
0.5
0.2 0.1
0 0
x1 X y1 Y
 (x = A1) = 0.5  (y = B1) = 0.1
 (x = A2) = 0.2  (y = B2) = 0.7

3/26/2019 Indu Bhardwaj 59


Step 2: Rule Evaluation
• The second step is to take the fuzzified inputs, (x=A1) = 0.5, (x=A2) =
0.2, (y=B1) = 0.1 and (y=B2) = 0.7, and apply them to the antecedents of the
fuzzy rules.

• If a given fuzzy rule has multiple antecedents, the fuzzy operator (AND or
OR) is used to obtain a single number that represents the result of the
antecedent evaluation.

• This number (the truth value) is then applied to the consequent


membership function.

3/26/2019 Indu Bhardwaj 60


Step 2: Rule Evaluation
RECAL:
To evaluate the disjunction of the rule antecedents, we use the OR fuzzy
operation. Typically, fuzzy expert systems make use of the classical fuzzy
operation union:

AB(x) = max [A(x), B(x)]

Similarly, in order to evaluate the conjunction of the rule antecedents, we


apply the AND fuzzy operation intersection:

AB(x) = min [A(x), B(x)]

3/26/2019 Indu Bhardwaj 61


Step 2: Rule Evaluation
1 1 1
A3 B1 C1 C2 C3
0.1 OR 0.1
0.0
(max)
0 x1 X 0 y1 Y 0 Z

Rule 1: IF x is A3 (0.0) OR y is B1 (0.1) THEN z is C1 (0.1)


1 1 1
0.7
C1 C2 C3
A2 0.2 B2 AND 0.2
(min)
0 x1 X 0 y1 Y 0 Z
Rule 2: IF x is A2 (0.2) AND y is B2 (0.7) THEN z is C2 (0.2)
1 1
A1 0.5 0.5 C1 C2 C3

0 x1 X 0 Z
Rule 3: IF x is A1 (0.5) THEN z is C3 (0.5)
3/26/2019 Indu Bhardwaj 62
Step 2: Rule Evaluation
• Now the result of the antecedent evaluation can be applied to the
membership function of the consequent.

• There are two main methods for doing so:


– Clipping
– Scaling

3/26/2019 Indu Bhardwaj 63


Step 2: Rule Evaluation
• The most common method of correlating the rule consequent with the
truth value of the rule antecedent is to cut the consequent membership
function at the level of the antecedent truth. This method is called
clipping (alpha-cut).

• Since the top of the membership function is sliced, the clipped fuzzy set
loses some information.

• However, clipping is still often preferred because it involves less complex


and faster mathematics, and generates an aggregated output surface that
is easier to defuzzify.

3/26/2019 Indu Bhardwaj 64


Step 2: Rule Evaluation
• While clipping is a frequently used method, scaling offers a better
approach for preserving the original shape of the fuzzy set.

• The original membership function of the rule consequent is adjusted by


multiplying all its membership degrees by the truth value of the rule
antecedent.

• This method, which generally loses less information, can be very useful in
fuzzy expert systems.

3/26/2019 Indu Bhardwaj 65


Step 2: Rule Evaluation

Degree of Degree of
Membership Membership
1.0 1.0

C2 C2

0.2 0.2

0.0 0.0
Z Z
clipping scaling

3/26/2019 Indu Bhardwaj 66


Step 3: Aggregation of the rule outputs
• Aggregation is the process of unification of the outputs of all rules.

• We take the membership functions of all rule consequents previously


clipped or scaled and combine them into a single fuzzy set.

• The input of the aggregation process is the list of clipped or scaled


consequent membership functions, and the output is one fuzzy set for
each output variable.

3/26/2019 Indu Bhardwaj 67


Step 3: Aggregation of the rule outputs

1 1 1
C1 C2 C3
0.5 0.5
0.2 0.2
0.1 0.1
0 Z 0 Z 0 Z 0 Z
z is C 1 (0.1) z is C 2 (0.2) z is C 3 (0.5) 

3/26/2019 Indu Bhardwaj 68


Step 4: Defuzzification
• The last step in the fuzzy inference process is defuzzification.

• Fuzziness helps us to evaluate the rules, but the final output of a fuzzy
system has to be a crisp number.

• The input for the defuzzification process is the aggregate output fuzzy set
and the output is a single number.

3/26/2019 Indu Bhardwaj 69


Step 4: Defuzzification
• There are several defuzzification methods, but probably the most
popular one is the centroid technique. It finds the point where a
vertical line would slice the aggregate set into two equal masses.
Mathematically this centre of gravity (COG) can be expressed as:

b
  A  x  x dx
COG  a
b
  A  x  dx
a

3/26/2019 Indu Bhardwaj 70


Step 4: Defuzzification
• Centroid defuzzification method finds a point representing the centre
of gravity of the fuzzy set, A, on the interval, ab.
• A reasonable estimate can be obtained by calculating it over a sample
of points.
(x)
1.0
0.8

0.6 A

0.4
0.2
a b
0.0 X
150 160 170 180 190 200 210

3/26/2019 Indu Bhardwaj 71


Step 4: Defuzzification
D
egreeof
Membership
1.0
0.8
0.6

0.4
0.2
0.0
0 10 20 30 40 50 60 70 80 90 100
67.4 Z

(0  10  20)  0.1  (30  40  50  60)  0.2  (70  80  90  100)  0.5


COG   67.4
0.1  0.1  0.1  0.2  0.2  0.2  0.2  0.5  0.5  0.5  0.5

3/26/2019 Indu Bhardwaj 72


Sugeno Fuzzy Inference
• Mamdani-style inference, as we have just seen, requires us to find the
centroid of a two-dimensional shape by integrating across a continuously
varying function. In general, this process is not computationally efficient.

• Michio Sugeno suggested to use a single spike, a singleton, as the


membership function of the rule consequent.

• A singleton, or more precisely a fuzzy singleton, is a fuzzy set with a


membership function that is unity at a single particular point on the
universe of discourse and zero everywhere else.

3/26/2019 Indu Bhardwaj 73


Sugeno Fuzzy Inference
• Sugeno-style fuzzy inference is very similar to the Mamdani method.
Sugeno changed only a rule consequent. Instead of a fuzzy set, he used a
mathematical function of the input variable. The format of the Sugeno-
style fuzzy rule is

IF x is A
AND y is B
THEN z is f(x, y)

where x, y and z are linguistic variables; A and B are fuzzy sets on universe
of discourses X and Y, respectively; and f(x, y) is a mathematical function.

3/26/2019 Indu Bhardwaj 74


Sugeno Fuzzy Inference
• The most commonly used zero-order Sugeno fuzzy model applies fuzzy
rules in the following form:

IF x is A
AND y is B
THEN z is k

where k is a constant.

• In this case, the output of each fuzzy rule is constant. All consequent
membership functions are represented by singleton spikes.

3/26/2019 Indu Bhardwaj 75


Sugeno Rule Evaluation
1 1 1
A3 B1
0.1 OR 0.1
0.0
(max)
0 x1 X 0 y1 Y 0 k1 Z

Rule 1: IF x is A3 (0.0) OR y is B1 (0.1) THEN z is k1 (0.1)


1 1 1
0.7
A2 0.2 B2 AND 0.2
(min)
0 x1 X 0 y1 Y 0 k2 Z
Rule 2: IF x is A2 (0.2) AND y is B2 (0.7) THEN z is k2 (0.2)
1 1
A1 0.5 0.5

0 x1 X 0 k3 Z
Rule 3: IF x is A1 (0.5) THEN z is k3 (0.5)
3/26/2019 Indu Bhardwaj 76
Sugeno Aggregation of the Rule Outputs

1 1 1 1
0.5 0.5
0.2
0.1 0.2 0.1
0 k1 Z 0 k2 Z 0 k3 Z 0 k1 k2 k3 Z

z is k1 (0.1) z is k2 (0.2) z is k3 (0.5) 

3/26/2019 Indu Bhardwaj 77


Sugeno Defuzzification
Weighted Average (WA)

(k1)  k1  (k 2)  k 2  (k 3)  k 3 0.1 20  0.2  50  0.5  80


WA    65
(k1)  (k 2)  (k 3) 0.1  0.2  0.5

0 z1 Z

Crisp Output
z1

3/26/2019 Indu Bhardwaj 78


Mamdani or Sugeno?
• Mamdani method is widely accepted for capturing expert knowledge. It
allows us to describe the expertise in more intuitive, more human-like
manner. However, Mamdani-type fuzzy inference entails a substantial
computational burden.

• On the other hand, Sugeno method is computationally effective and works


well with optimisation and adaptive techniques, which makes it very
attractive in control problems, particularly for dynamic nonlinear systems.

3/26/2019 Indu Bhardwaj 79

You might also like