An Introduction To Fuzzy Control
An Introduction To Fuzzy Control
discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/220045378
CITATIONS
READS
1,211
771
1 author:
Dimiter Driankov
rebro universitet
94 PUBLICATIONS 4,065 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Abstract
In this report, some of the basic mathematical definitions and rules
of fuzzy system theory are described inasmuch as they are relevant for
fuzzy control. Two examples are covered in detail, viz., a fuzzy closedloop halting control scheme for the forward motion of a mobile robot in
an automatic factory and a dog chasing a cat using fuzzy control.
Issues of computational efficiency are discussed. And some recommendations to potential designers of fuzzy controllers are summarized.
After studying this report, the reader should be in a position to design
simple fuzzy controllers and simulate the behaviour of the resulting fuzzy
control system on a general purpose digital computer.
IMRT Press
c Measurement and Control Laboratory
ii
CONTENTS
iii
Contents
1 Fuzzy Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2 Fuzzification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3 Fuzzy Logic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
4 Fuzzy Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . .
4.1 Introducing Fuzzy Variables . . . . . . . . . . . . . . . . . . . . .
4.2 Fuzzification Revised . . . . . . . . . . . . . . . . . . . . . . . . .
4.3 Fuzzy Vectors . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3
3
4
4
5 Fuzzy Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.1 Fuzzy SISO-Rule . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.2 Fuzzy AND-Rules . . . . . . . . . . . . . . . . . . . . . . . . . .
5.3 Other Fuzzy Rules . . . . . . . . . . . . . . . . . . . . . . . . . .
5
5
5
6
. . . . . . . . . . . . . . . . . . . . .
7 Defuzzification . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
8
8
10
15
9 Computational Issues . . . . . . . . . . . . . . . . . . . . . . . . . 18
9.1 Efficient Defuzzification . . . . . . . . . . . . . . . . . . . . . . . 18
9.2 Derivatives of the Control Function . . . . . . . . . . . . . . . . . 20
9.3 Observations and Suggestions . . . . . . . . . . . . . . . . . . . . 21
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
22
iv
FUZZY SETS
Fuzzy Sets
NS
@
@
@
@
-10
-20
Z
PS
1
A
T
T
T A
T
A
T
T
T A
T
T0 A
T
0
10
PL
- X
20
R
xf (x) dx
c= R
f (x) dx
where all of the integrals are taken over the signal space X.
Fuzzification
Fuzzy Logic
Fuzzy logic defines the rules governing the operators intersection and union of
fuzzy sets.
Consider two fuzzy sets s1 = (X, f1 ) and s2 = (X, f2 ) defined on the same
signal space X and their associated sets S1 X and S2 X, respectively.
Definition: An arbitrary element x X belongs to the union s1 s2 of the
two fuzzy sets s1 and s2 with degree d = max(f1 (x), f2 (x)).
Definition: An arbitrary element x X belongs to the intersection s1 s2 of
the two fuzzy sets s1 and s2 with degree d = min(f1 (x), f2 (x)).
Consequently, the union operator and the intersection operator yield the
fuzzy sets s1 s2 = (X, max(f1 , f2 )) and s1 s2 = (X, min(f1 , f2 )), respectively.
Notice that the intersection s1 s2 is a degenerated fuzzy set in the sense that
its set membership function min(f1 , f2 ) does not map onto the interval [0, 1] as
requested by the definition of a fuzzy set. This detail is not pursued any further
here because in fuzzy control, all calculations are done with fuzzy variables
rather than with fuzzy sets.
FUZZY VARIABLES
Fuzzy Variables
4.1
6g, f
b)
p p p p fp p
p
p
ppp
p pp
ppp
ppp
g
pp p
p
pp p
@p p p p
pp
ppp
@
pp
pp
@
p
0
X
1
4.2
Fuzzification Revised
4.3
Fuzzy Vectors
As the example in Section 4.2 shows, introducing vector notation in the range
space of the fuzzification operator F is efficient.
Again, consider a signal space X covered by the N fuzzy sets s1 , . . . , sN .
The fuzzification F(x) of an arbitrary element x X can be represented by an
N -vector in several equivalent ways:
v1
v2
F(x) =
...
vN
(s , f (x))
1 1
(s2 , f2 (x))
(x) =
..
.
(sN , fN (x))
f (x)
1
f2 (x)
= ..
.
fN (x)
. =
..
..
. =
..
.
.
.
vn
gn
(sn , dn )
(wgn , cgn )
FUZZY RULES
Fuzzy Rules
Fuzzy rules are used in fuzzy control in order to define the map from the fuzzified
input signals (error signals, measured signals, or command signals) of the fuzzy
controller to its fuzzy output signals (control signals).
5.1
Fuzzy SISO-Rule
Consider a fuzzy set se = (E, fe ) defined on the signal space E where the error
signal e lives and a fuzzy set su = (U, fu ) defined on the signal space U where
the control signal u lives. (Usually, E = R and U = R, hence the designation
SISO-rule.)
Definition: The SISO-rule mapping the fuzzy input variable ve = (se , de ) to
the fuzzy output variable vu = (su , du ) (of the fuzzy controller) is defined by
vu = (su , de ).
In the jargon of control engineering, this definition should be read as follows:
If the value e(t) of the error signal belongs to the fuzzy set se to degree de then
the fuzzy set su of the control signal is fired to degree du = de , i.e., modulated
by du = de .
In shorthand notation, the fuzzy SISO-rule is denoted by se su , where
the degree of firing du = de is implied.
The value u(t) of the control signal is obtained later by defuzzification
after all of the fuzzy rules pertaining to the control signal have been processed.
5.2
Fuzzy AND-Rules
Consider two fuzzy sets se1 = (E1 , fe1 ) and se2 = (E2 , fe2 ) defined on the signal
spaces E1 and E2 , respectively, where the error signals e1 and e2 live and a
fuzzy set su = (U, fu ) defined on the signal space U where the control signal u
lives.
Definition: The AND-rule mapping the fuzzy input variables ve1 = (se1 , de1 )
and ve2 = (se2 , de2 ) to the fuzzy output variable vu = (su , du ) is defined by
vu = (su , min(de1 , de2 )).
In the jargon of control engineering, this definition should be read as follows:
If the value e1 (t) of the first error signal belongs to the fuzzy set se1 to degree
de1 and the value e2 (t) of the second error signal belongs to the fuzzy set se2 to
degree de2 then the fuzzy set su of the control signal is fired to the smaller of
the two degrees, i.e., du = min(de1 , de2 ).
In shorthand notation, the fuzzy AND-rule is denoted by se1 se2 su ,
where the degree of firing du = min(de1 , de2 ) is implied.
5.3
For a fuzzy controller, the collection of all of its fuzzy rules is called the fuzzy
associative memory.
For every control cycle, each of the fuzzy rules is evaluated. This can be
done by massively parallel processing. The output of each fuzzy rule is a fuzzy
variable.
The output of the fuzzy associative memory is equal to the (vector) sum of
all these fuzzy variables:
In the case of a scalar control signal u(t), the signal space is the real
P line,
U = R. Summing the fuzzy variables involves calculating the sum gu = j gj of
their modulated functions gj . Notice that the fuzzy variable vu at the output
of the fuzzy associative memory is represented exclusively by the (modulated)
function gu . (I.e., this fuzzy variable has no directly underlying fuzzy set which
is modulated by some degree du to yield the function gu .)
In the case of a vector control signal u(t) Rm , typically, the signal space
1, . . . , m.
of each of the components ui (t) is the real line, i.e., Ui = R for i = P
Summing the fuzzy variables involves calculating the m sums gui = j gij of
index i, i = 1, . . . , m.
the modulated functions gij for eachP
Of course, the summing operator
takes the pointwise sum of its argument
functions. As mentioned in Section 4.1, the sum g(u) may execeed 1 for some
values of the argument u. This poses no problem (cf. Section 7). (Clipping g(u)
to the maximal value 1 would be counterproductive because the centroid of g
would be shifted.)
DEFUZZIFICATION
Defuzzification
Defuzzification is the process of assigning a representative value to a fuzzy variable. Consider a fuzzy variable vu on the signal space U = R which is represented by the modulated function gu .
Definition: The defuzzification operator D maps the fuzzy variable vu to the
centroid u of the modulated function gu ,
R
gu () d
,
u = D{vu } = D{gu } = R
gu () d
where both of the integrals are calculated over the signal space U = R. The
defuzzification operator D is understood to accept an arbitrary representation
of the fuzzy variable vu as its argument.
Upon conclusion of the fuzzy control algorithm, precise values u1 (t), . . . , um (t)
must be assigned to the components of the control vector. However, the fuzzy
associative memory P
yields m fuzzy variables vui (t) represented by their sum
functions gui (, t) = j gij (, t). Defuzzifying yields the control signals
R
gui (, t) d
ui (t) = D{vui (t)} = R
gui (, t) d
i = 1, . . . , m
8
8.1
- i e+
CF F
uo
uc - ?
iu+
CF B
-y
Figure 3: Fuzzy control system consisting of the plant P , the fuzzy feedback
controller CF B , and the fuzzy feed-forward controller CF F .
in Figure 3 are precise (i.e., crisp or non-fuzzy) signals. The internal structures
of the feed-forward controller and the feedback controller are identical.
Figure 4 depicts the major components of the fuzzy feedback controller CF B ,
viz., the fuzzifier F, the fuzzy associative memory F AM , and the defuzzifier D.
e(t)
ve (t)
vu (t)
- F > F AM > D
uc (t)
-
>
i
1
AN D >
>
pp
pp
1
>
j
M
AN D >
>
ve1
- F >
p
vuc
p
+ > D
p
ve2
p
- F >
N
>
k
1
AN D >
>
pp
pp
N
>
`
M
AN D >
>
e1
e2
u
-c
10
8.2
In a fully automatic factory, parts, subassemblies, and the finished products are
transported by several identical mobile robots. The navigation of the mobile
robots about the factory is fully automated. In this example, the forward motion
along the trajectories is considered only. Getting away from one station and
cruising to the next station is under closed-loop speed control. The robot should
stop at the next station within a very small tolerance for the position error.
Therefore, closed-loop halting control must be implemented.
The problem of designing a fuzzy control scheme for halting control is investigated here.
The following information is available: The robot has a mass of anywhere
between 150 and 450 kg, depending on the actual payload. The maximal cruising
speed is 2 m/s. The positioning error at a station must be less than 1 mm. The
maximal traction force for acceleration and deceleration is 500 N. The nominal
2
deceleration in the approach to a station is a = 1 m/s . There is no requirement
for the smoothness of the acceleration. At every station, within a reach of 2.5 m,
a precise measurement of the instantaneous distance to the stop is transmitted
to the robot at a very high rate. Furthermore, the robot has a precise velocity
sensor.
The following concept for a fuzzy halting controller is chosen:
The control law for the forward motion of the robot is switched from cruise
control to fuzzy halting control as soon as the simultaneous measurements p
and v of the position and the velocity, respectively, satisfy the inequality
v2
.
2a
At the switching time, a non-fuzzy signal generator for the setpoint variable
wp (t) for the position, the setpoint variable wv (t) for the velocity, and the feedforward force uo (t) is initialized as follows:
|p|
wp (0)
wv (0)
uo (0)
= p
p
= sign(p) 2a|p|
= sign(p)mnom a = 250 N .
While the robot is in the halting control mode, the signal generator furnishes
the setpoint values wp (t) and wv (t) and the feed-forward control signal uo (t)
according to the formulae
wp (t)
at2
2
11
The error signals ep (t) = wp (t) p(t) and ev (t) = wv (t) v(t) are processed
in a fuzzy feedback controller which produces the feedback force uc (t). The
detailed block diagram of this fuzzy two-input one-output feedback controller
corresponds to the one shown above in Figure 5. Finally, the total traction force
is u(t) = sat{uo (t) + uc (t)}. (It is clipped to +500 N or 500 N, respectively,
whenever the sum exceeds the limit of the available traction force.)
The fuzzy halting control law is deactivated as soon as the velocity vanishes
for the first time, v(t) = 0. Simultaneously, the parking brakes are set.
The fuzzy sets covering the signal space Ep = R where the position error
ep (t) lives are shown in Figure 6. The fuzzy sets covering the signal space
Ev = R where the velocity error ev (t) lives are shown in Figure 7.
fpi
6
PNL
PNS
PZ
PPS
1
HH
@
A
@
HH
@
A
@
HH @
A
@
HH@
A
@
A
HH
@
@
0
-4
-2
0
2
PPL
- p
[mm]
Figure 6: Fuzzy sets for the position error: P N L (negative large), P N S (negative small), P Z (zero), P P S (positive small), and P P L (positive large).
V NL
@
V NS
@
@
-4
@
-2
@
@
fvi
6
VZ
1
@
@
V PS
@
@
@0
0
V PL
@
@
- v
[mm/s]
Figure 7: Fuzzy sets for the velocity error: V N L (negative large), V N S (negative small), V Z (zero), V P S (positive small), and V P L (positive large).
The fuzzy sets chosen for the feedback traction force uc (t) are depicted in
Figure 8. Notice that the centroids of the fuzzy sets U P X and U N X are
located at 500 N and +500 N, respectively, in order to give the fuzzy feedback
controller full authority over the range 500 . . . + 500 N. Furthermore, no fuzzy
set U Z centered at 0 N is introduced in order to obtain stiff characteristics of
the fuzzy feedback control law.
In Figure 9, the set of 20 fuzzy rules defining the fuzzy associative memory
of the fuzzy feedback controller is displayed. The entries of this tabloid should
12
- u
[N]
Figure 8: Fuzzy sets for the control of the traction force: U N X (negative extra
large), U N L (negative large), U N S (negative small), U P S (positive small),
U P L (positive large), and U P X (positive extra large).
be read as explained in the following example. Shorthand explanation: P N L
V N L U N X. Longhand explanation: If ep (t) belongs to the fuzzy set P N L to
degree d1 and if ev (t) belongs to the fuzzy set V N L to degree d2 then the fuzzy
set U N X is fired to the smaller of the two degrees, i.e., to degree d = min(d1 , d2 ).
V PL
V PS
vv :
velocity
error
VZ
UNL UNS
UPS UPL
UPS
13
= v(t)
p(0) = 2 m
1
{u(t) sign(v(t))mg}
v(t)
=
m
v(0) = 2 m/s ,
where m = 150 . . . 450 kg is the true mass of the robot, g = 9.81 m/s2 the
gravitational constant, and = 0.01 the coefficient of roll friction. For the
simulations, digital control with a sampling and control rate of 500 Hz is assumed. This fairly high sampling rate is chosen in order to prevent mechanical
resonances in the mobile robot.
In Figures 10 and 11, the trajectory of the robot is shown in the phase plane
(p, v) in several scales for a true mass m = 450 kg and m = 150 kg, respectively.
For the complete trajectory labelled a), the units for p and v are m and m/s,
respectively. For the increasingly enlarged final parts b), c), and d) of
the trajectory, the units are dm and dm/s, cm and cm/s, and mm and mm/s,
respectively.
As the Figures show, the heaviest robot (m = 450 kg) overshoots the station
by less than 0.2 mm, whereas the lightest robot (m = 150 kg) stops less than
0.2 mm short of the station. Hence, the specifications are met.
This servo control example is deceptively simple because the plant under consideration essentially is a double integrator and because with a PD-controller
or with the equivalent linear state feedback controller one cannot arrive at an
unstable control system, provided the signs of the two control gains are chosen
correctly. The only open question is whether the specifications for the precision
of halting are met.
From the next example it can be inferred that asymptotic stability of a
fuzzy control system is not necessarily obtained by choosing the fuzzy control
scheme with straightforward commonsense logic. As a matter of fact, proving
the asymptotic stability of a fuzzy control system (even of moderate complexity)
can turn out to be very difficult.
14
Figure 10: Trajectory of a robot with a mass of 450 kg in the phase plane (p, v).
Scales: a) m and m/s; b) dm and dm/s; c) cm and cm/s; d) mm and mm/s.
Figure 11: Trajectory of a robot with a mass of 150 kg in the phase plane (p, v).
Scales: a) m and m/s; b) dm and dm/s; c) cm and cm/s; d) mm and mm/s.
8.3
15
In this example, a dog chasing a cat is considered. Like most dogs, this dog
is not smart enough to use proportional navigation. Rather, he tries to always
run in the direction where he sees the cat. The dog would probably explain his
scheme of navigation by the following qualitative rules for choosing the direction
of his next leap: If the cat is straight ahead, I take the next leap in the same
direction; if the cat is a little bit to the left (right), I turn a little bit to the left
(right) for the next leap; if the cat is pretty much to the left (right), I turn quite
a bit to the left (right) for the next leap.
Obviously, a fuzzy one-input one-output feedback controller for this scheme
of navigation can be formulated with five fuzzy sets for the line of sight angle
(tk ), five fuzzy sets for the change of the dogs heading angle (tk ) for the
next leap, and five fuzzy SISO-rules.
Figure 12 shows the fuzzy sets covering the signal space A = [180 , 180 ]
where the line of sight angle (tk ) lives. Figure 13 shows the fuzzy sets covering
the signal space U = R where the change of the dogs heading angle (tk )
lives.
AN L
-180
fi
6
AN S AZ AP S
1
A A B A
A A B A
A A B A
A A0 B A
-45
0
45
AP L
-
180
Figure 12: Fuzzy sets for the line of sight angle: AN L (negative large), AN S
(negative small), AZ (zero), AP S (positive small), and AP L (positive large).
UNL
-180
-90
6fui
UNS UZ UPS
1
@ B B B
@ B B B
@B B B
@B 0 B B
-45
0
45
UPL
@
90
@
@
@
180
Figure 13: Fuzzy sets for the dogs change of heading angle: U N L (negative
large), U N S (negative small), U Z (zero), U P S (positive small), and U P L (positive large).
The five fuzzy rules of the fuzzy associative memory of the fuzzy feedback
controller can be written in shorthand as follows: AN L U N L, AN S U N S,
16
Figure 14: The dog chases the cat with gain K = 0.5.
17
18
Computational Issues
9.1
Efficient Defuzzification
Notice that for piecewise linear functions gj (u), the sum g(u) is also a piecewise linear function and both of the integrals of the defuzzification operation can
be calculated analytically. Therefore, using fuzzy sets with piecewise linear set
membership functions only (such as triangles, trapezoids, or piecewise linear approximations of more sophisticated smooth functions) can lead to rather
efficient program code.
In order to further reduce the run time of the simulation significantly, the
result of the following lemma is needed.
Consider the modulated functions gj , j = 1, . . . , N , and the corresponding
PN
function g = j=1 gj of the fuzzy control signal vu . Let wgj and cgj be the
weights and the centroids, respectively, of the modulated functions gj , i.e.,
Z
w gj =
and
gj (u) du
Z
cg j = Z
ugj (u) du
gj (u) du
1
=
wgj
Z
ugj (u) du .
COMPUTATIONAL ISSUES
19
wgj cgj
j=1
u = D(vu ) =
N
X
.
wgj
j=1
Proof:
Z
ug(u) du
u = D(vu ) = Z
N
X
gj (u) du
j=1
N Z
X
ugj (u) du
j=1
= N Z
=
= Z N
X
X
g(u) du
gj (u) du
gj (u) du
j=1
j=1
N
X
wgj cgj
j=1
N
X
.
wgj
j=1
Notice that the weight wgj and possibly the centroid cgj vary as the degree
dj of firing for the corresponding fuzzy set sj varies.
However, if the linear modulation scheme is used, the variable weights wgj
and centroids cgj can be expressed by the constant weights wj and centroids cj
of the set membership functions fj as follows:
wgj = dj wj
cgj cj
for j = 1, . . . , N .
j=1
N
X
.
dj wj
j=1
20
centroid ci
500 N
250 N
100 N
100 N
250 N
500 N
weight wi
277
167
111
111
167
277
centroid ci
90
15
0
15
90
weight wi
9
1
1
1
9
9.2
Notice that j numbers the fuzzy rules rather than the fuzzy sets defined for the
control signal. One and the same fuzzy set of the control signal may be fired by
more than one fuzzy rule (cf. Figure 9).
Discontinuities of these partial derivatives are caused both by the corners
of the (piecewise linear) set membership functions of the fuzzy sets covering
the signal spaces where e1 , . . . , ep live and the corners of the functions
dj = min( ) of the fuzzy AND-rules.
COMPUTATIONAL ISSUES
9.3
21
For the sake of simplicity, consider a fuzzy SISO feedback controller. From the
formulae for the defuzzification operator and for the derivative of the control
function, the following observations and suggestions ensue:
If none of the fuzzy sets of the control signal u is fired to a strictly positive
degree, the value of the defuzzified control signal is undefined. Therefore,
the signal space E, where the error signal e lives, must be covered completely by its collection of fuzzy sets, and these fuzzy sets should overlap.
In other words, every error e E should belong to at least one fuzzy set to
a strictly positive degree. Furthermore, in the associative memory, every
fuzzy set of the error signal should fire (at least) one of the fuzzy sets of
the control signal.
If two neighbouring fuzzy sets of the error signal touch at e1 but do not
overlap, the control function is discontinuous at e1 . For e = e1 , the result
of the defuzzification operator is undefined. The value of the control signal
must be defined separately. In Example 1 (fuzzy halting control), the
analogous situation occurs for ep = ev = 0. The obvious extra definition
is uc (0, 0) = 0.
Assume that the linear modulation scheme is applied. If in some interval
[ea , eb ] E the error e belongs to exactly one fuzzy set to a strictly positive
degree, the control function is constant on this interval, irrespective of the
shape of this fuzzy set for the error signal. In Example 2 (dog chasing
cat), the dog will turn by = sat{K 15 } if the line of sight angle
is in the interval [15 , 22.5 ], or by = sat{K 90 } if the line of sight
angle exceeds 45 . (Obviously, the dog could improve his performance
significantly by choosing the centroids +45 and 45 for the fuzzy sets
U P L and U N L, respectively, and the doggy gain K = 1.)
Assume that the linear modulation scheme is applied. For the purpose of
implementing a finished design of a fuzzy controller, only the weights wi
and the centroids ci of the fuzzy sets for the control signals are needed in
the defuzzification operation (cf. Section 9.1). On the other hand, the
complete specifications of the set membership functions of the fuzzy sets
for the control signals are needed, if the fuzzy rules of the controller must
be learnt by watching an expert performing the task at hand. This topic
is beyond the scope of this report. The interested reader is referred to [1],
and [8], and the references cited there.
In Section 8, static fuzzy controllers are considered only. The reader
should have no problem in extending these ideas to fuzzy controllers incorporating dynamic compensation. In the simplest case the input signals
of the fuzzy dynamic compensator include the most recent error signals
22
References
[1] B. Kosko, Neural Networks and Fuzzy Systems: A Dynamical Systems Approach to Machine Intelligence, Prentice-Hall, Englewood Cliffs, NJ, USA,
1992.
[2] H.-J. Zimmermann, Fuzzy Set Theory and its Applications, 2nd ed., Kluwer,
Boston, MA, USA, 1991.
[3] W. Pedrycz, Fuzzy Control and Fuzzy Systems, Electronic & Electrical Engineering Research Studies, Control Theory and Applications Series, vol. 3,
Research Studies Press (Wiley), Taunton, Somerset, England, 1989.
[4] D. J. Dubois, H. M. Prade, Fuzzy Sets and Systems, Academic Press, New
York, NY, 1980.
[5] L. A. Zadeh, Fuzzy Sets and Applications: Selected Papers, Wiley-Interscience, New York, NY, USA, 1987.
[6] M. M. Gupta, T. Yamakawa, (eds.), Fuzzy Computing, Hardware, and Applications, North-Holland, Amsterdam, Netherlands, 1988.
[7] M. Sugeno, (ed.), Industrial Applications of Fuzzy Control, North-Holland,
Amsterdam, Netherlands, 1985.
[8] C.-T. Lin, C. S. G. Lee, Neural-Network-Based Fuzzy Logic Control
and Decision Systems, IEEE Transactions on Computers, vol. 40(1991),
pp. 13201336.
[9] S. Ginsburg, R. Wimmer, H. P. Geering, Clever Dog versus Smart Cat,
Proceedings of the International ICSC Symposium on Fuzzy Logic, pp. A99
A104, Zurich, Switzerland, May, 1995.
[10] H. Kiendl, Fuzzy Control methodenorientiert, Oldenbourg, Munich, Germany, 1997.