View
221
Download
0
Category
Preview:
Citation preview
Fuzzy expert systems
Chapter #9
1
The Development of Fuzzy Expert System
2
Problem Domain
Fuzzifications
Fuzzy Rule Base (If then fuzzy)
Evaluations
Defuzzifications
(Marimin, 2002)
Fuzzy Inference (Fuzzy Reasoning)
3
Mamdani fuzzy inference Tsukamoto Fuzz Inference Sugeno fuzzy inference Case study Summary
Fuzzy inferenceFuzzy 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.
4
Mamdani fuzzy inference The Mamdani-style fuzzy inference
process is performed in four steps:
5
We examine a simple two-input one-output problem that includes three rules:
Rule: 1 Rule: 1IF x is A3 IF project_funding is adequateOR y is B1 OR project_staffing is smallTHEN z is C1 THEN risk is low
Rule: 2 Rule: 2IF x is A2 IF project_funding is marginalAND y is B2 AND project_staffing is largeTHEN z is C2 THEN risk is normal
Rule: 3 Rule: 3IF x is A1 IF project_funding is inadequateTHEN z is C3 THEN risk is high
Step 1: FuzzificationThe 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 Inputy1
0.1
0.71
0y1
B1 B2
Y
Crisp Input
0.20.5
1
0
A1 A2 A3
x1
x1 X
(x = A1) = 0.5
(x = A2) = 0.2
(y = B1) = 0.1
(y = B2) = 0.7
project fundingproject funding project staffingproject staffing7
Step 2: Rule Evaluation• take the fuzzified inputs, (x=A1) = 0.5, (x=A2) = 0.2,
(y=B1) = 0.1 and (y=B2) = 0.7• 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.
8
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:
AB(x) = max [A(x), B(x)]
Similarly, in order to evaluate the conjunction of the rule antecedents, we apply the AND fuzzy operation intersection:
AB(x) = min [A(x), B(x)]9
Mamdani-style rule evaluationMamdani-style rule evaluation
A3
1
0 X
1
y10 Y
0.0
x1 0
0.1C1
1
C2
Z
1
0 X
0.2
0
0.2C1
1
C2
Z
A2
x1
Rule 3:
A11
0 X 0
1
Zx1
THEN
C1 C2
1
y1
B2
0 Y
0.7
B10.1
C3
C3
C30.5 0.5
OR(max)
AND(min)
OR THENRule 1:
AND THENRule 2:
IF x is A3 (0.0) y is B1 (0.1) z is C1 (0.1)
IF x is A2 (0.2) y is B2 (0.7) z is C2 (0.2)
IF x is A1 (0.5) z is C3 (0.5)
10
• Now the result of the antecedent evaluation can be applied to the membership function of the consequent.
• 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. 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.
11
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.
12
Clipped and scaled membership functionsClipped and scaled membership functions
Degree ofMembership1.0
0.0
0.2
Z
Degree ofMembership
Z
C2
1.0
0.0
0.2
C2
13
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.
14
Aggregation of the rule outputsAggregation of the rule outputs
00.1
1C1
Cz is 1 (0.1)
C2
0
0.2
1
Cz is 2 (0.2)
0
0.5
1
Cz is 3 (0.5)
ZZZ
0.2
Z0
C30.5
0.1
15
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.
16
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
aA
b
aA
dxx
dxxx
COG
17
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.0
0.2
0.4
0.6
0.8
160 170 180 190 200
a b
210
A
150X
18
Centre of gravity (COG):Centre of gravity (COG):
4.675.05.05.05.02.02.02.02.01.01.01.0
5.0)100908070(2.0)60504030(1.0)20100(
COG
1.0
0.0
0.2
0.4
0.6
0.8
0 20 30 40 5010 70 80 90 10060
Z
Degree ofMembership
67.4
19
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.
Sugeno fuzzy inferenceSugeno fuzzy inference
20
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 AAND y is BTHEN 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.
21
The most commonly used zero-order Sugeno fuzzy model applies fuzzy rules in the following form:
IF x is AAND y is BTHEN 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.
22
A3
1
0 X
1
y10 Y
0.0
x1 0
0.1
1
Z
1
0 X
0.2
0
0.2
1
Z
A2
x1
IF x is A1 (0.5) z is k3 (0.5)Rule 3:
A11
0 X 0
1
Zx1
THEN
1
y1
B2
0 Y
0.7
B10.1
0.5 0.5
OR(max)
AND(min)
OR y is B1 (0.1) THEN z is k1 (0.1)Rule 1:
IF x is A2 (0.2) AND y is B2 (0.7) THEN z is k2 (0.2)Rule 2:
k1
k2
k3
IF x is A3 (0.0)
Sugeno-style rule evaluationSugeno-style rule evaluation
23
Sugeno-style Sugeno-style aggregation of the rule outputsaggregation of the rule outputs
z is k1 (0.1) z is k2 (0.2) z is k3 (0.5) 0
1
0.1Z 0
0.5
1
Z0
0.2
1
Zk1 k2 k3 0
1
0.1Zk1 k2 k3
0.20.5
24
Weighted average (WA):Weighted average (WA):
655.02.01.0
805.0502.0201.0
)3()2()1(
3)3(2)2(1)1(
kkk
kkkkkkWA
0 Z
Crisp Outputz1
z1
Sugeno-style Sugeno-style defuzzificationdefuzzification
25
How to make a decision on which method How to make a decision on which method to apply to apply Mamdani or Sugeno? 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 optimization and adaptive techniques, which makes it very attractive in control problems, particularly for dynamic nonlinear systems.
26
Building a fuzzy expert system: case studyBuilding a fuzzy expert system: case study
A service centre keeps spare parts and repairs failed ones.
A customer brings a failed item and receives a spare of the same type.
Failed parts are repaired, placed on the shelf, and thus become spares.
The objective here is to advise a manager of the service centre on certain decision policies to keep the customers satisfied.27
Process of developing a fuzzy expert systemProcess of developing a fuzzy expert system
1. Specify the problem and define linguistic variables.
2. Determine fuzzy sets. (Fuzzifications)
3. Construct fuzzy rules.
4. Encode the fuzzy sets, fuzzy rules and procedures
to perform fuzzy inference into the expert system.
5. Evaluate and tune the system.28
Step Step 11: Specify the problem and define: Specify the problem and define linguistic variableslinguistic variables
There are four main linguistic variables: There are four main linguistic variables: average waiting time (mean delay) average waiting time (mean delay) mm, , repair utilization factor of the service repair utilization factor of the service centre centre , number of servers , number of servers ss, and , and number of spare parts number of spare parts nn..
29
Linguistic variables and their rangesLinguistic variables and their ranges
30
Step Step 22: Determine fuzzy sets: Determine fuzzy sets
Fuzzy sets can have a variety of shapes. Fuzzy sets can have a variety of shapes. However, a triangle or a trapezoid can However, a triangle or a trapezoid can often provide an adequate often provide an adequate representation of the expert knowledge, representation of the expert knowledge, and at the same time, significantly and at the same time, significantly simplifies the process of computation.simplifies the process of computation.
31
Fuzzy sets of Mean Delay m
0.10
1.0
0.0
0.2
0.4
0.6
0.8
0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1Mean Delay (normalised)
SVS M
Degree of Membership
32
Fuzzy sets of Fuzzy sets of Number of Servers sNumber of Servers s
0.10
1.0
0.0
0.2
0.4
0.6
0.8
0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
M LS
Degree of Membership
Number of Servers (normalised)
33
Fuzzy sets of Fuzzy sets of Repair Utilisation Factor Repair Utilisation Factor
0.10
1.0
0.0
0.2
0.4
0.6
0.8
0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1Repair Utilisation Factor
M HL
Degree of Membership
34
Fuzzy sets of Fuzzy sets of Number of Spares nNumber of Spares n
0.10
1.0
0.0
0.2
0.4
0.6
0.8
0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
S RSVS M RL L VL
Degree of Membership
Number of Spares (normalised)
35
Step Step 33: Construct fuzzy rules: Construct fuzzy rules
To accomplish this task, we might ask To accomplish this task, we might ask the expert to describe how the problem the expert to describe how the problem can be solved using the fuzzy linguistic can be solved using the fuzzy linguistic variables defined previously.variables defined previously.
Required knowledge also can be Required knowledge also can be collected from other sources such as collected from other sources such as books, computer databases, flow books, computer databases, flow diagrams and observed human diagrams and observed human behaviour. behaviour. 36
The square FAM representationThe square FAM representation((Fuzzy Associative Memory )Fuzzy Associative Memory )
m
s
M
RL
VL
S
RS
L
VS
S
M
VS S M
L
M
S
37
The rule tableThe rule table
38
Rule Base 1Rule Base 1
39
Cube FAM of Rule Base 2Cube FAM of Rule Base 2
VS VS VSVS VS VSVS VS VS
VL L M
HS
VS VS VSVS VS VSVS VS VSM
VS VS VSVS VS VSS S VSL
s
LVS S M
m
MH
VS VS VS
LVS S M
S
m
VS VS VSM
S S VSL
s
S VS VS
MVS S M
m
VS S M
m
S
RS S VSM
M RS SL
s
S
M M SM
RL M RSL
s
40
Step Step 44: Encode the fuzzy sets, fuzzy rules: Encode the fuzzy sets, fuzzy rules and procedures to perform fuzzyand procedures to perform fuzzy inference into the expert systeminference into the expert systemTo accomplish this task, we may choose To accomplish this task, we may choose one of two options: to build our system one of two options: to build our system using a programming language such as using a programming language such as C/C++ or Pascal, or to apply a fuzzy C/C++ or Pascal, or to apply a fuzzy logic development tool such as MATLAB logic development tool such as MATLAB Fuzzy Logic Toolbox or Fuzzy Knowledge Fuzzy Logic Toolbox or Fuzzy Knowledge Builder.Builder.
41
Step Step 55: Evaluate and tune the system: Evaluate and tune the system
The last, and the most laborious, task is to evaluate The last, and the most laborious, task is to evaluate and tune the system. We want to see whether our and tune the system. We want to see whether our fuzzy system meets the requirements specified at fuzzy system meets the requirements specified at the beginning. the beginning.
Several test situations depend on the mean delay, Several test situations depend on the mean delay, number of servers and repair utilisation factor. number of servers and repair utilisation factor.
The Fuzzy Logic Toolbox can generate surface to The Fuzzy Logic Toolbox can generate surface to help us analyse the system’s performance.help us analyse the system’s performance.
42
Three-dimensional plots for Rule Base 1Three-dimensional plots for Rule Base 1
00.2
0.40.6
0.81
0
0.2
0.4
0.6
0.2
0.3
0.4
0.5
0.6
number_of_serversmean_delay
nu
mb
er_
of_
spa
res
43
Three-dimensional plots for Rule Base 1Three-dimensional plots for Rule Base 1
00.2
0.40.6
0.81
0
0.2
0.4
0.6
0.2
0.3
0.4
0.5
0.6
utilisation_factormean_delay
nu
mb
er_
of_
spa
res
44
Three-dimensional plots for Rule Base 2Three-dimensional plots for Rule Base 2
00.2
0.40.6
0.81
0
0.2
0.4
0.6
0.15
0.2
0.25
0.3
0.35
number_of_serversmean_delay
nu
mb
er_
of_
spa
res
45
Three-dimensional plots for Rule Base 2Three-dimensional plots for Rule Base 2
00.2
0.40.6
0.81
0
0.2
0.4
0.6
0.2
0.3
0.4
utilisation_factormean_delay
num
ber
_of_
spar
es
0.5
46
However, even now, the expert might not be However, even now, the expert might not be satisfied with the system performance. satisfied with the system performance.
To improve the system performance, we may use To improve the system performance, we may use additional sets additional sets Rather SmallRather Small and and Rather LargeRather Large on the universe of discourse on the universe of discourse Number of ServersNumber of Servers, , and then extend the rule base.and then extend the rule base.
47
Modified fuzzy sets of Modified fuzzy sets of Number of Servers sNumber of Servers s
0.10
1.0
0.0
0.2
0.4
0.6
0.8
0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1Number of Servers (normalised)
RS M RL LS
Degree of Membership
48
Cube FAM of Rule Base 3Cube FAM of Rule Base 3
VS VS VS
VS VS VS
VS VS VS
VS VS VS
VS VS VS
VS VS VS
VS VS VS
VS VS VS
VS VS VS
VS VS VS
VS VS VS
VS VS VS
VS VS VS
S S VS
S S VS
VL L M
VL RL RS
M M S
RL M RS
L M RS
HS
M
RL
L
RS
s
LVS S M
m
MH
VS VS VS
VS VS VS
VS VS VS
S S VS
S S VS
LVS S M
S
M
RL
L
RS
m
s
S VS VS
S VS VS
RS S VS
M RS S
M RS S
MVS S M
m
VS S M
m
S
M
RL
L
RS
s
S
M
RL
L
RS
s
49
Three-dimensional plots for Rule Base 3Three-dimensional plots for Rule Base 3
00.2
0.40.6
0.81
0
0.2
0.4
0.6
0.15
0.2
0.25
0.3
0.35
number_of_serversmean_delay
num
ber
_of_
spar
es
50
Three-dimensional plots for Rule Base 3Three-dimensional plots for Rule Base 3
00.2
0.40.6
0.81
0
0.2
0.4
0.6
0.2
0.3
0.4
utilisation_factormean_delay
nu
mb
er_
of_
spa
res
0.5
51
Tuning fuzzy systems Tuning fuzzy systems
1. Review model input and output variables, and if required redefine their ranges.
2. Review the fuzzy sets, and if required define additional sets on the universe of discourse. The use of wide fuzzy sets may cause the fuzzy system to perform roughly.
3. Provide sufficient overlap between neighbouring sets. It is suggested that triangle-to-triangle and trapezoid-to-triangle fuzzy sets should overlap between 25% to 50% of their bases.
52
4. Review the existing rules, and if required add new rules to the rule base.
5. Examine the rule base for opportunities to write hedge rules to capture the pathological behaviour of the system.
6. Adjust the rule execution weights. Most fuzzy logic tools allow control of the importance of rules by changing a weight multiplier.
7. Revise shapes of the fuzzy sets. In most cases, fuzzy systems are highly tolerant of a shape approximation.
53
Recommended