N Adaptive PID Controller Based On Genetic Algorithm Processor
N Adaptive PID Controller Based On Genetic Algorithm Processor
is to try to combine the well-known PID Controller with algorithms which are able to provide, on-line, a set of optimal PID parameters using inputioutput data from the system.
The genetic algorithm is very effective at finding optimal solutions to a variety of problems. This innovative technique performs especially well when solving complex problems because it doesn't impose many limitations of traditional techniques. Due to its evolutionary nature, a GA will search for solutions without regard to the specific inner working of the problem. This ability lets the same general purpose GA routine perform well on large, complex scheduling problems. There is now considerable evidence that genetic algorithms are useful for global function optimization and NP-Hard problems [4,5]. For a genetic algorithm to improve a solution, it is necessary to reject the poor solutions and only allow reproduction from the best ones. This, in turn, is again an analogy to the survival of the fittest law, which only allows an organism that adapts best to the natural environment to survive. In this case, the role of the environment is played by a so called evaluating function, measuring the degree of fitness of a candidate to problem requirements. This is equivalent to a function which tests whether a given state is a terminal one. Genetic algorithms can be applied to optimization problems or in artificial intelligence.
In this paper firstly the PID Controller will be explained with its objective function for optimization. Next we will describe the genetic algorithm principles and how a Genetic Algorithm Processor (GAP) can optimize a control module. Then a Multiple Genetic Algorithm Processor configuration will be explained. Finally we will apply our model to see how the GAP can find the best
I. INTRODUCTION
The conventional PID regulator is the most widely used control strategy in the process industry. This is because of the remarkable effectiveness, simplicity of implementation and broad applicability. Often in practice, tuning is carried out by an experienced operators using a 'tria! and error' procedure and some practical rules, This is often a time consuming and difficult activity, for example when the dynamic process is slow, partly nonlinear, contains significant dead-time or when there are random disturbances acting on the plant, Once tuned, the cor~trol performance may later deteriorate because of nonlinear or timevarying characteristics of the process under control. Although PID regulators are common and well-known, they are often poorly tuned. Evidence of this can be found in almost any industrial process. Modern adaptive control algorithms can be a good solution to such problems. They are able to self-tune the regulator and to adapt it to changes in the process, provided certain conditions are fulfilled [ 1,2,3]. When these controllers are introduced in industry, some resistance and difficulties can arise, mostly related to a lack of knowledge about their internal mechanisms by the operating personneI. An attractive alternative
Genetic Algorithms in Engineering Systems: Innovations and Applications 12-14 September 1995, Conference Publication No. 414, 0 IEE, 1995
Authorized licensed use limited to: Telecom ParisTech. Downloaded on July 26,2010 at 11:25:34 UTC from IEEE Xplore. Restrictions apply.
combination Controller.
of K
values
11. A PID CONTROLLER Designing PID Controllers, even for low order plants such as a robot arm, can be a difficult problem. Consider the system illustrated in Figure 1 where the PID Controller obeys the following control law:
The efficiency of the system can be measured by calculating the integral of the time multiplied by the error for the unit step response during [O,T]:
T
error= I t le(t)l dt
t=O
M ( S ) = ( K jl S c K p + K d * S ) E ( S )
It can be expressed in the Z domain as:
The problem confronting the designer, therefore, is to calculate the three gains of the PID Controller while ensuring that transient response (minimum error, overshoot, rising time, settling time and steady-state error) specifications are met. 111. GENETIC ALGORITHM PROCESSOR A genetic algorithm (GA) is a robust optimization technique based on natural selection. The basic goal of GAS is to optimize functions called fitness functions. GA-based approaches differ from conventional problemsolving methods in several ways [6]. First, GAS work with a coding of the parameter set rather than the parameters themselves. Second, GAS search from a population of points rather than a single point. Third, GAS use payoff (objective function) information, not other auxiliary knowledge. Finally, GAS use probabilistic transition rules, not deterministic rules. These properties make GAS robust, powerful, and data-independent. A simple GA starts with a population of solutions encoded in one of many ways. Binary encodings are quite common and are used in this report. The GA determines each string's strength based on an objective function and performs one or more of three genetic operators on certain strings in the population. 1. Reproduction (also called selection) is simply retaining a fit string in the following generation. 2. Crossover involves swapping partial strings of random length between two parent strings. 3. Mutation involves flipping a random bit in a string. These three operations primarily involve random number generation, copying, and partial string exchange. Thus GAS are simple
to implement.
Authorized licensed use limited to: Telecom ParisTech. Downloaded on July 26,2010 at 11:25:34 UTC from IEEE Xplore. Restrictions apply.
Figure 3 shows the configuration of multiple GAP. Each GAP delivers its bit slice to the control module. In the control module the bit slices combine with the best member of other GAPs to form a complete genetic member.
V. Simulation Results
GAP
Genetic Algorithms Processor simulations have been conducted for the PID Controller system in Figure 4. The reference signal (R(t)) is a step signal and it is shown in Figure 5. The transfer function for plant is equal to [IO]:
Figure 2 . Intemal architecture of the GAP A genetic algorithm processor can be constructed to directly execute the operation of a genetic algorithm [7,8,9]. It is shown i the n Figure 2. Such a processor can be used in situations where high throughput is required and where the logic of the genetic algorithm is expressible in simple units which can be synthesised in hardware. This is generally the case as genetic algorithms are inherently simple and contain only a few logic operations.
P ( S )=
a s(s- 1)(s 5 ) +
Eq. i
In this transfer function value a is made to drift from 1 in the beginning to 30 during simulations. The PID Controller transfer function is defined as:
U ( S )= ( K , / S + K p + K d * S )E ( S ) Eq. 2
A critical parameter when using a GAP in solving a complex problem is the bit length of operation. Normally complex problems require long bit length operations inside the GAP. On the other hand because the GAP is implemented in hardware long bit lengths lead to high cost and low processing speed. From the GAS point of view higher bit length means more searching in solution space and more time to solve a problem. One solution to all these difficulties is dividing the bit length across multiple GAPs. In this model each GAP is responsible to optimize one part of the total bit length [SI.
10
T (Second) I (seconaj
Figure 5 . The reference signal Figure 3 . The architecture of a multiple GAP To handle this problem we used Multiple GAPs. The arrangement of Multiple GAPs is depicted in Figure 6. Each GAP optimizes one
Authorized licensed use limited to: Telecom ParisTech. Downloaded on July 26,2010 at 11:25:34 UTC from IEEE Xplore. Restrictions apply.
91
K value from the PID Controller. The following parameters are selected for all GAPs:
3000 = Number of generations. 8-bit = Representation of the fitness value. 64 = Population size. 0.9% = Probability of crossover. 0.02% = Probability of mutation.
Figure 8 shows the result of simulation averaged over ten individual mns. In the figure the best of the three K values and the fitness values are shown after each generation. Figure 9 shows the average best response signal (Y(t)) for a=l and a=30. The characteristic of the response signal is shown in Table 1.
GAP
Figure 6 . The architecture of the Multiple GAP used for PID Controller system. To illustrate drifting in the 'a' value of the plant transfer function we incremented the value by one after each 100 ge.nerations according to Figure 7. Table 1 - Characteristic of the best member for a=l and a=30
3,)
m
'k I,
,
'0
500
1000
1600
2000
21500
3000
Number of Generations
Figure 7 . The 'a' value changes with the Number of Generations For calculating the fitness value we converted all transfer functions frorn the S domain to the 2 domain and then to the discrete values (K domain). For simulations we selected 2000 points between 0 an 10 second ( T = 10/2000 = 0.005). Then the integral of the time multiplied by the absolute error values are calculated as the fitness value.
In the Figure 8 Kp changes from about 200 for a=l to 30 for a=30. In the same time Kd changes from 130 to 20 and Ki changes from 35 to 5 . This shows when a is changing in the system the Kp in the PID Controller has the most effect on adjusting the system. The fitness value graph shows that the GAP always keeps the response signal whitin a minimum error during changes in the a value. Figure 9 shows the response signal always remains with the high quality.
VI. CONCLUSION
In this paper we have described a model of a digital processor which embodies a universal genetic algorithm. We have demonstrated the performance of this model on a PID Controller system. A new Multiple GAPS has been introduced and we showed that the Multiple GAPs can be applied to a PID Controller in a dynamic plant system. The graphs demonstrate the high performance of Multiple
GAPs in finding good K values for the PID
2000
Fitness =
k=l
((k T ) * I e( k)l)
Eq. 3
Controller.
Authorized licensed use limited to: Telecom ParisTech. Downloaded on July 26,2010 at 11:25:34 UTC from IEEE Xplore. Restrictions apply.
92
200
-;
Y
150
100
20
50.
10
0'
0 '
500
1000
1500
2000
2500
3000
3500
500
1000
1500
2000
2500
3000
2 3 0
Numberof Generations
1501
Number of Generations
lo3/ 5;O
1000
3000
35bO
Figure 8 . The results of the PID Controller simulation. The best Kp, Kd, Ki and the fitness values versus Number of Generations
Time(S)
Time(S)
Figure 9 . The Unit Step Response of the PID Controller system for a=l and a=30
Authorized licensed use limited to: Telecom ParisTech. Downloaded on July 26,2010 at 11:25:34 UTC from IEEE Xplore. Restrictions apply.
93
REFERENCES
[l] Ogata, K. , "Modem Control Engineering , Englewood Cliffs. NJ, Prentice-Hall 1970. [2] Dorf, R.C., "Modem Control Systems", Addison-Wesely Publishing, Reading, MA, 6th Eddition, 1991. [3] Paraskevopoulos, P. N., "On the Design of PID Controller for Linear Multivariable Systems", IEEE Transactions on Industrial Electronics and Control Instrumentation, Vol. IECI-27, No. 1, Feb. 1988. [4] Goldberg D. E., "Genetic Algorithms in Search, Optimization and Machine Learning", Addison-Wesley CO, 1989. [ 5 ] Holland J.H. , "Genetic Algorithms", Scientific American, July 1992. 161 Davis, L., "Handbook of Genetic Algorithms", Intemational Thomson Publishing, New York 1991. [7] Salami, M., Cain, G., "The Quest for a New Computing Architecture Based on
I'
Genetic Algorithms", Proceedings of the Electrical Engineering Congress (EEC94) , Sydney, Australia, November 1994. [8] Salami, M., Cain, G., "An Adaptive Control System Based on Genetic Algoritl-tms", Proceedings of the FLAIRS-95 International Workshop on Intelligence Adaptive Systems (IAS-95), Melbourne Beach, Florida, April 1995. [9] Salami, M., Cain, G., "Adaptive Hardwarre Optimization Based on Genetic Algorithms", Proceedings of The Eighth Jnternational Conference on Industrial Applical ion of Artificial intelligence & Expert Systems (IEA95AIE) , Melbourne, Australia, June 1995. [IO] Hwang, W.R., Thompson, W.E., "An Intelligent Controller Design Based on Genetic Algorithms" , Proceedings of the 32nd Conference on Decision and Control, San Antonio, Texas, December 1993.
Authorized licensed use limited to: Telecom ParisTech. Downloaded on July 26,2010 at 11:25:34 UTC from IEEE Xplore. Restrictions apply.