ADAPTIVE CONTROL BASED ON ORTHONORMAL SERIES REPRESENTATION By Christos Constantine Zervos B. Sc. University of Athens, Athens, 1981 M. Eng. McGill University, Montreal, 1984 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY in THE FACULTY OF GRADUATE STUDIES DEPARTMENT OF ELECTRICAL ENGINEERING We accept this thesis as conforming to the required standard THE UNIVERSITY OF BRITISH COLUMBIA March 1988 Â© Christos Constantine Zervos In presenting this thesis in partial fulfilment of the requirements for an advanced degree at the University of British Columbia, I agree that the Library shall make it freely available for reference and study. I further agree that permission for extensive copying of this thesis for scholarly purposes may be granted by the head of my department or by his or her representatives. It is understood that copying or publication of this thesis for financial gain shall not be allowed without my written permission. Department of ELECTRICAL ENGINEERING The University of British Columbia Vancouver, Canada Date OCTOBER 26, 1988 DE-6 (2/88) Abstract This thesis describes a novel approach to adaptive control systems design using or-thonormal series representation. The class of adaptive algorithms considered is that commonly referred to as self-tuning controllers developed for discrete-time systems. A common characteristic of the self-tuning schemes so far studied for industrial appli cations is that they are usually based on ARMAX models. These existing adaptive control algorithms have been shown to be globally asymptotically stable under certain theoretical assumptions and they have performed well in various applications. These theoretical assumptions are somehow too restrictive from an engineering and practical point of view. Real industrial plants always contain considerable time delays, have unmodeled dynamics, exhibit time varying dynamics and are subject to various distur bances. The purpose of this thesis is to explore a new way of representing and controlling dynamic systems in an effort to find another way, probably better and more robust, to handle a certain class of industrial applications. The behaviour of adaptive controllers in the presence of unmodelled dynamics and in the presence of time-varying plant de lays along with the need for reduced a-priori information as dictated by the conditions encountered usually in practice have led us to abandon the usual ARMA transfer func tion representation for a new representation by orthonormal series. Our new approach is advantageous because it eliminates the need for assumptions about the plant order and the time-delay, i.e. accurate assumptions about their true values are not necessary. A physical dynamical plant, including its time delay, is modelled by an orthonormal set of functions. The sets considered here are mainly the Laguerre set, a modified version ii of it, and a set based on complex poles. Other orthonormal functions may also be used. A simple predictive control law is proposed from which an adaptive controller is then designed. The schemes developed are explicit and implicit, deterministic and stochastic. Some multivariable schemes are also presented. Simulations of these new controllers show they are easy to use, able to handle non-minimum phase plants, and more robust than the conventional model-based approaches. Results from industrial trials confirm the applicability of these new schemes. iii Table of Contents Abstract ii List of Tables viList of Figures xii Acknowledgement xii1 Introduction 1 1.1 General Introduction1.2 Brief summary of previous work . 4 1.3 Contribution of this thesis 11 1.4 Outline of the Thesis 3 2 Laguerre Functions in Modeling and Identification 14 2.1 Signal Description by Orthonormal Functions 12.2 The Laguerre functions 18 2.2.1 Introducing the Laguerre orthonormal set 12.2.2 Least Squares Estimation of the Laguerre gains 22 2.2.3 Statistics of the estimates 26 2.2.4 The Discrete-time Laguerre set 31 2.3 Modelling of dynamic systems 35 3 Deterministic Adaptive Control 41 iv 3.1 The Predictive Control Law 41 3.2 The Self-tuning Controller . 8 3.2.1 A Deterministic Explicit Self-Tuner . 43.2.2 A Deterministic Implicit Self-tuner 53 3.3 Simulation results 53.4 Robustness issues â€¢ 64 3.5 Practical Aspects and Implementation 73 3.5.1 Choice of Laguerre filter time constant 73.5.2 Number of niters . . 74 3.5.3 Choice of d and a . 75 4 Stochastic Adaptive Control 6 4.1 Introduction . . 74.2 An explicit stochastic control law 7 4.2.1 Stability analysis 81 4.2.2 Practical Aspects and Simulation 85 5 Multivariate Self-Tuning Control 93 5.1 Introduction 95.2 Deterministic Multivariate Self-Tuning Control . 94 5.3 Stochastic Multivariable Self-Tuning Control 99 5.4 Simulation examples 102 6 An Industrial Application 110 6.1 Introduction . . . 116.2 Laguerre-based adaptive control of pH in an industrial bleach plant ex traction stage Ill v 7 Using other orthonormal sets 7.1 A modified Laguerre set 7.2 A set with discrete complex exponentials 8 Conclusions Bibliography vi List of Tables 2.1 The values of the 12 identified Laguerre gains for each case 39 4.2 Example 4.1: The choice of the various parameters during the simulation runs 87 6.3 The 15 Laguerre gains as recorded at September 4, 20:45. 117 c vii List of Figures 2.1 Approximation of a transfer function by a linear combination of or thonormal filters. . . . . . . . . . . . ...... 19 2.2 Laguerre Ladder Network, v 21 2.3 The Continuous Network Compensation of G"(s) . . 33 2.4 Impulse response of a triangle-hold G^(a) 34 2.5 Example 2.1 : Unit step responses of the true plant and the identified one for the case without output noise (The 2 curves are identical). . . . 39 2.6 Example 2.1 : Unit step responses of the true plant (3), the identified one when cr = 0.5 (2), and when a = 0.8 (1). 40 3.7 System to be controlled in Example 3.1. 54 3.8 Example 3.1: Output responses of Â£f(g-1), (a) with and (b) without noise, fcj = 1 56 3.9 Example 3.1: Output responses, (a) with and (b) without noise, when H(q~1) is under Laguerre self-tuning control, kd â€” 1, d â€” 2 56 3.10 Example 3.1: Output responses, (a) with and (b) without noise, when H(q~l) is under Laguerre self-tuning control, kj = 3, d = 4. ...... 57 3.11 Example 3.2: System response under Laguerre self-tuning control, 1*' order plant. 58 3.12 Example 3.2: System response under Laguerre self-tuning control, 2nd order plant.3.13 Example 3.3: Laguerre self-tuning Control of a system with integrator. 60 viii 3.14 Example 3.4: Manipulator Arm tracking a circular trajectory. Payload increase, 7712 = lOKgr .62 3.15 Example 3.4: Manipulator Arm tracking a step trajectory. Response of 2nd joint angle. Inductance increase. d â€” A. . â€¢ â€¢ â€¢ 62 3.16 Example 3.4: Manipulator Arm tracking a step trajectory. Response of .1** joint angle. Inductance increase, d = 12. â€¢ â€¢ â€¢ â€¢ â€¢ â€¢ 63 3.17 Example 3.5: Plant output following a square-wave setpoint when an implicit self-tuner was employed. ...................... 63 3.18 Example 3.5: Controller's output for the implicit self-tuning scheme. . . 64 3.19 Example 3.6: Output tracking the reference input when N = 1,T = 0. 1,d = 2 â€¢ â€¢ â€¢ â€¢ . . 3.20 Example 3.6: Bode plots for the true (solid lines) and identified (dash lines) systems, when N = 1, T = 0.1, d â€” 2. 3.21 Example 3.6: System output tracking the reference input when N = 1, T = 0.01, d = 10. (The 2 curves are almost identical) 3.22 Example 3.6: (a) System output tracking the reference input when N = 2, T = 0.01, d = 2. (b) An enlargment portion from T = 20 to 23. (The 2 curves are almost identical.) 3.23 Example 3.6: Bode plots for true (solid lines) and identified (dash lines) systems,when N = 2,T = 0.01,d = 2 3.24 Example 3.7: System output tracking the reference input (above) and controller output (below). (N = 16,p = 0.8, d = 10,T = 1.0. At the 800th point we switch to a different plant) 4.25 Orthonormal Modelling of a stochastic system 69 69 71 72 73 78 ix 4.26 Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 1 of Table 4.2. 88 4.27 Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 2 of Table 4.2. . . 88 4.28 Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 3 of Table 4.2. . 89 4.29 Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 4 of Table 4.2 89 4.30 Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 5 of Table 4.2. 90 4.31 Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 6 of Table 4.2 . . . 90 4.32 Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 7 of Table 4.2. 91 4.33 Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 8 of Table 4.2 91 4.34 Example 4.1: Implicit stochastic self-tuner. System output tracking a square wave set-point 92 5.35 Multivariable 2x2 input-output linear system 94 5.36 Laguerre Ladder Network for a Multivariable 2x2 input-output linear system 95 5.37 Stochastic multivariable 2x2 linear system 99 5.38 Example 5.1: Explrcit multivariable self-tuning control of a 2 x 2 plant. System outputs tracking two respective reference trajectories. 103 x 5.39 Example 5.1: Explicit multivariable self-tuning control of a 2 x 2 plant. Controller outputs 104 5.40 Example 5.2: Headbox of a paper-machine. . . 105 5.41 Example 5.2: Headbox multivariable self-tuning control. Stock level (upper curve), and Total head pressure (lower) changes. . . . 109 6.42 Titration curve of the caustic extraction 113 6.43 Bleach Plant. 1" Alkaline Extraction stage . . 114 6.44 Block diagram of 1*' Alkaline extraction stage. . 115 6.45 pH loop. Alkaline extraction stage. Open-loop step response. . . . ... 115 6.46 Tower exit pH with the outer loop always under PID control. 3 min/sample-point 116 6.47 pH loop. Comparison of regulation performances. 3 min/sample-point. . 119 6.48 Step response of identified pif-loop. 8min/sample-point 120 6.49 Self-tuner output in pH values. 3 min/sample-point 120 6.50 Alkaline extraction stage. Caustic flow. 3 min/sample-point 121 6.51 Alkaline extraction stage. J-Tube exit pH. 3 min/sample-point. . . . . . 121 6.52 Alkaline extraction stage. Performance over the period 28-30 November, 1987, (3 min/sample-point) 122 6.53 Autocorrelation comparisons between the PID/Manual and Self-tuner performance on the piTloop. . . 123 7.54 Modified Laguerre Ladder Network 125 7.55 Ladder Network for the orthonormal set of functions with complex poles. 131 7.56 Example 7.1: Step-response comparison of the true plant (solid) and the identified one (dash line) using the Laguerre set (N = 12) 134 xi 7.57 Example 7.1: Step-response comparison of the true plant (solid) and the identified one (dash Une) using the Complex set (N = 6). ........ 134 7.58 Example 7.1: Bode-plot comparison of the true plant (solid) and the identified one (dash line) using the Complex set (N = 6). ........ 135 xii Acknowledgement A Ph.D. thesis represents not only a piece of technical research work but among other things it is to be considered as a positive contribution to knowledge representing one of the first phases of one's professional life. This achievement would not have been possible without the contribution of many other motivational factors. Thus Itake this time to acknowledge and thank not only those who aided with the research itself and those who aided me personally through the years of research, but also those who brought me to point where I was prepared to undertake the task of earning a doctorate. Among the technical contributors I especially thank Prof. Guy Dumont my thesis advisor, for guiding my progress throughout the research, for his interest and enthu siasm about the subject, for his continuous supporting help and guidance and for his belief and trust in me. I thank Dr. Pertti Makila and Dr. K. Natarajan while they stayed as post-doctoral fellows with the UBC Pulp and Paper Centre, for their time in discussing any topic of interest, including many details of this thesis. They also proved to be invaluable friends and their advice and concern was a big motivational factor for me. I especially also thank Mr. Darrell Wong for performing the simulation runs for the manipulator arm example presented in Chapter 3 of this thesis. Thanks also to Dr. C.J. Bennington for providing the data for the Figure 6.42. Foremost among those who brought me to the point where a Ph.D was in the realm of possibility are my parents, Constantine and Alice Zervos. The knowledge they imparted through the loving attention I received during my stay in their "old-fashioned" home and through the interest and loving care they showed me during all my student years in Canada are ones of the most valuable experiences that I have ever had in my xiii life. I also thank my sisters, Stella , Lila and her husband George and my lovely niece Katerina for their immesurable love and care they always showed me especially during the hard times. I thank all the teachers I have had through all of these twenty-four years of formal education, especially Prof. Evangelos Servetas, my supervisor while I stayed at the Nuclear Research Centre, "Demokritos", Athens , Greece, for he was the one who initiated me in the field of Control Engineering and paved my entrance to the way that led me to earn these higher graduate studies. I also very much thank, Prof. Pierre Belanger my M.Eng. thesis advisor from McGill University for all his help, support, interest, new ideas, enthousiasm and especially his guidance. My greatest thanks go to Prof. Guy A. Dumont from the Pulp and Paper Research Institute of Canada, and his wonderful loving family. His friendly attitude, technical expertise, academic knowledge, cooperative manners, thoughtful consideration and their advice and assistance proved invaluable to me and strengthened my courage to continue and complete my studies. I would also like to thank all the professors and students from the Pulp and Paper Centre and from the Electrical Engineering Department of UBC. I thank Ed Casas, Jim Reimer, Alan Kot, for their valuable friendship and the constructive times we had together during my stay at UBC. I would like also to thank all my friends who have helped me with one way or another during all these schooling years. Near their loving support I found all these exceptional nice qualities that make this world a better place to live. I thank the Dumonts, the Davies, the Terezakis, the Khayats, and all who have touched my life years in Vancouver, Montreal and Athens and helped to make them good. The research of this thesis was carried out at the Electrical Engineering Department and at the Pulp and Paper Centre with support provided by the Pulp and Paper Research Institute of Canada under an F.L. Mitchel memorial scholarship and by the xiv N.S.E.R.C. under grant No A-5960. Chapter 1 Introduction 1.1 General Introduction Over the last two decades, there has been an extensive interest in feedback control systems which automatically adjust their controller settings to compensate for changes in the process or the environment. Numerous adaptive control schemes have been de veloped and tested with various degrees of success. The number of applications, though small in relation to the activity in the field, is now sufficient to give credibility to adap tive control techniques. Adaptive controllers have become popular despite the fact of their non-linear structure because of their inherent practical design philosophy that renders them as a solution to the problem of tuning industrial controllers. They have considerable potential for process control problems since they provide a systematic, flexible approach for controlling processes which are not well understood or which have significant non-linearities or time-varying parameters. A class of these adaptive control systems, introduced as an approximation of the general non-linear stochastic problem, has the capability to provide good control. They are generally known as self-tuning reg ulators (Kalman, 1958 ; Astrom and Wittenmark, 1973; Clarke and Gawthrop, 1975). Research on adaptive control has emphasized two general approaches: Self-Tuning con trollers , and Model Reference adaptive controllers (MRAC), (Landau,1974). Despite their apparently different formulation, objectives, and origins, the two approaches are closely related (Egardt, 1980 ; Landau, 1978). 1 Chapter 1. Introduction 2 In the MR AC approach, the design addresses the problem of self-adjusting the parameters of a controller in order to stabilize the dynamic characteristics of a negative feedback control system while the closed-loop system follows a pre-determined reference model. MRAC can be traced back to the well-known "MIT rule" (Whitaker et al, 1958). Parks in 1966 introduced the stability theory concepts into the design procedures. The multivariable case was then treated by Landau in 1973. Other model reference adaptive algorithms were proposed for non-minimum phase systems by Ionescu and Monopoli (1977) and Narendra et al (1980) with some results on convergence and stability analysis under stringent conditions. The self-tuning control approach has been proposed mainly as a means for tuning digital controllers for industrial processes. In this case an adaptive algorithm can first be used for tuning the controller parameters, and then be removed after the param eters have converged to proper values. The method of designing these regulators is generally by first performing an identification experiment to get a model of the process and its disturbances and then determining an optimal controller to satisfy a certain performance criterion. At each sampling instant, a dynamic model of the process is updated by estimating the model parameters from input-output data and then the controller parameters are updated based on the newly-obtained model parameters and on a predefined optimization objective. The scheme is either called Indirect if the iden tification gives a model of the process itself or, Direct if the controller's parameters are directly identified. Two basic assumptions are usually made to simplify the regulator design : (a) the Certainty Equivalence principle where the unknown true parameter values are replaced by the estimated ones and (b) the Separation principle i.e. the sep aration of the estimation of the process parameters and the computation of the control signal (Wittenmark, 1975). A common characteristic for the schemes so far is that they are model-based. In particular, for the input-output case, the discrete polynomial Chapter 1. Introduction 3 ARMAX (Autoregressive-Moving Average-Exogenous) model representation for the dy namics plus noise transfer functions has been widely used as the main mathematical tool in designing, studying, and analysing these regulators (Astrom, 1983). Various identification methods (e.g. Least Squares, Maximum Likelihood, Instru mental Variables, Stochastic approximation, etc.) have been developed for building mathematical models of dynamic systems based on observed data (Astrom and Eykhoff, 1971). A vast variety of control laws (e.g Minimum Variance, Pole/Zero Placement, Linear Quadratic Gaussian, Model Reference, Predictive Control, etc.) has been pro posed for implementing the necessary feedback to control succesfully a dynamic system and realize a self-tuning scheme. A thorough review of various self-tuning schemes is given by Goodwin and Sin (1984). A common thread to this work is the use of transfer function models. If the actual plant can be described by the structure of the model, these schemes behave well. However, when this is not the case, performance degra dation with potential destabilization occurs (Rohrs et al., 1985). Current adaptive control schemes deal well with structured uncertainty, but cannot adequately handle unstructured uncertainty. This explains why the behaviour of adaptive controllers in the presence of unmodelled dynamics has been a topic of concern in the adaptive con trol community in recent years. In summary, typical problems arising in the design of a self-tuning scheme are: (a) the robust behaviour of the algorithm in presence of unmodelled dynamics, (b) the rate of convergence, (c) the stability of the closed- loop system, (d) the reduction of the need for exact a-priori information about the plant e.g. the order, the time delay, the phase characteristics, the number of poles and ze roes, and (e) the numerical properties of the algorithm as they appear in the actual implementation and its capability to deal with a variety of linear or non-linear plants. The problem of controlling an unknown, non-linear, slowly-time-varying process subject to stochastic disturbances is a common situation in the process industry. The Chapter 1. Introduction 4 limitations often imposed by the lack of knowledge about the plant and its stochastic environment present another major difficulty in the problem formulation. A robust adaptive control scheme requiring minimal a-priori information and capable of produc ing satisfactory control is a very desirable and attractive solution to the problem. Since the self-tuning control idea is based on a procedure for on-line estimation of a model for the plant dynamics before any control is applied it is imperative that this identification procedure is really robust. Our search for a robust adaptive control requiring minimal a priori information has led us to the development of unstructured adaptive control. We abandoned the usual ARM AX model for an orthonormal series representation of the plant dynamics. The major advantage of this approach is that any stable plant can be modelled without structural knowledge, i.e. without assumption about the true plant order and time delay. The approach of using orthonormal functions to build models for systems and plants is not new. However, the approach of using these functions to simultaneously model and control plants in a self-tuning scheme is completely new and has never been reported elsewhere. 1.2 Brief summary of previous work Adaptive control has been a great challenge to control engineers for a long time and it has raised an abundant interest in the recent years equally among mathematicians and engineers. Many schemes have been proposed, some of which have found their way succesfully into industrial practice (Astrom, 1980b, 1983 ; Goodwin and Sin, 1984). There are also products on the market such as Electromax V from Leeds and Northrup (Hoopes et al, 1983), the Novatune from ASEA (Bengtsson and Egardt, 1984), the Autotuner from NAF Controls, the Exact from Foxboro, and few others. Chapter 1. Introduction 5 Adaptive control has certain advantages (Goodwin and Sin ,1984) when compared with other classical control techniques and methods: â€¢ Adaptive control diminishes system sensitivity. f â€¢ Systems with unknown parameters can be controlled. â€¢ The effects of changes in the dynamics can be corrected in real time. â€¢ Simplicity in structure and design. â€¢ Numerical requirements are not that demanding. â€¢ Attractive solution for automatic tuning of process control loops. The present interest in self-tuning controllers was initiated by the work of Astrom, and Wittenmark, (1973), who applied recursive least squares and a minimum variance strategy to obtain a self-tuning minimum variance regulator. Similar approaches had previously been proposed by Kalman (1958) and Peterka (1970). A more general ap proach was presented by Clarke and Gawthrop (1975) to include control of stable non-minimum phase systems by using a generalized output function and employing a cost function which included a penalty on the control input. Similar self-tuning algorithms were developed for pole-zero placement control schemes (Wellstead, Edmunds, Prager, Zanker, 1979 ; Astrom and Wittenmark, 1980; Astrom, 1980a; Elliot, 1982). The use of a long range predictor in adaptive control was first considered by Ydstie (1982) for SISO systems known as Extended Horizon Predictive Control, (Ydstie 1984). A sim ilar predictive adaptive control scheme known as APCS (Adaptive Predictive Control System) had also been studied by Martin-Sanchez (1976). The Generalized Predictive Control (GPC) strategy introduced by Clarke, Mohtadi and Tuffs (1987) is based on Chapter 1. Introduction 6 the minimization of a finite-time horizon quadratic cost function of the future errors and control increments. To overcome the problem that a precise knowledge of the model structure was re quired a-priori in the implementation of the control system many authors (Akaike, 1974; Rissanen, 1979) derived criteria which take model complexity into account in order to obtain a parsimonious model. The Model Predictive Heuristic Control adap tive strategy proposed by Richalet, Rault, Testud, and Papon (1978) relied on the impulse response representation of the process, which constituted the internal model. A predictive control scheme was used for control. Because of the non-structural model approach of that scheme it gained considerable success in many industrial applications. Although the scheme was initially non-adaptive the concepts are easily carried over to the self-tuning approach. An innovative approach of a self-tuning controller utiliz ing unity feedback and an internal model of the exogenous signals ensuring stability, asymptotic tracking and regulation in the presence of finite parameter perturbations, has been reported by Song, Shah and Fisher (1986). The controller has an error-driven robust structure (Francis and Wonham, 1975; Davison,1976). Recently, self-tuning controllers based on a generalized control law to guarantee asymptotic stability for stable, unstable, minimum and non-minimum-phase plants have been reported by Grimble (1987). As the theory underlying the single-input, single-output (SISO) self-tuning control has been well studied during the last decade, attention has turned toward extension of these ideas to more complex situations where effects of disturbances, nonlinearities and unmodeled dynamics are considered. The already published literature on the implicit and explicit algorithms of stochastic adaptive control is vast. Many algorithms have been described in the literature (Astrom, 1981) for the adaptive control of linear systems (for a survey see, Seborg et al, 1986). Algorithms that combine various on-line Chapter 1. Introduction 7 identification techniques and different controller design schemes. Of these algorithms, those based on minimum variance control have received particular attention. This has probably been a result of two main factors : the relative ease of implementing these algorithms and the availability of substantial supporting theory. MRAC and self tuning schemes have been found to work well when parameters of the model structure are known, but fail to give stable control performance when high frequency modelling errors or perturbations are present (Rohrs, 1982 ; Rohrs et al, 1982). Most adaptive controllers are based on a separation between the estimation of the unknown parameters and state variables, and the determination of the control signal. This means that the control laws have not been designed to facilitate the identification. As a solution to this problem dual adaptive controllers emerged. In a dual controller there is an interaction between identification and control in the sense that the controller must compromise between a control action and a probing action (Feldbaum 1960,1961). Although this approach is very attractive and necessary to assure that the controller will not give "turn off' of the control signal, the solution leads to a functional equation which in most cases is difficult to solve. As a continuation of the SISO stochastic adaptive control system design, significant progress has been made to extend the SISO design to the multi-input, multi-output (MIMO) case. The extension of the algorithms to the MIMO case rests upon the determination of an appropriate generalisation of the notion of the delay and the non-commutativity of the various polynomial matrices involved (Goodwin and Sin, 1984). Along these lines a number of different schemes have been developed. MIMO control schemes have been investigated for a long time. The first ones were based on frequency response analysis and classical control theory. Early workers on the field were more interested of achieving decoupling among the inputs and the outputs of the system by applying decoupling pre- and post- compensators, and then having to deal only Chapter 1. Introduction 8 with separate SISO control loops (Dahlin et al, 1968 ; Owens, 1978 ; Rosenbrock, 1979; MacFarlane 1979). The development of self-tuning controllers based on state-space the ory included SISO and MIMO systems under one general main framework. Adaptive schemes based on LQG control have been reported in the literature as schemes combin ing extended Kalman filtering (Jazwinski, 1970) and LQG (liriear-quadratic-gaussiari) control theory (Athans, 1971). Peterka and Astrom (1973) proposed a multivariable self-tuning regulator based on linear quadratic optimal control of processes with un certain parameters. Ljung (1977) has developed a general procedure for analyzing recursive stochastic algorithms, which is useful in the study of the adaptive controllers. Borison (1979) extended the basic minimum variance self-tuning controller to the mul tivariable case. Koivo (1980) and Keviczky and Kumar (1981) extended Clarke and Gawthrop's method to a MIMO self-tuning controller. These first algorithms dealt only with square systems only where the number of inputs is the same as the num ber of outputs. Prager and Wellstead (1980) used a pole placement design procedure. Goodwin, Ramadge and Caines (1981) applied martingale theory to study an algorithm based on a modified stochastic approximation identification procedure and a minimum variance design. It was shown that, subject to a positive realness condition, the inputs and outputs are mean square bounded, and that the algorithm gives convergence to the optimal minimum variance controller. Some implicit and explicit LQG self-tuning schemes were studied by Astrom (1980), and Grimble (1984). Some of them depend upon the solution of either a steady state Riccati equation or involved a minimum variance control law and a spectral factorization stage. Lam (1980) developed a state-space based self-tuner in which the numerical problems involved in iterating the Riccati equation were avoided. Problems arise when the number of inputs is not the same as the number of outputs and if different time delays exist between each input and output. Lam's results drew some attention in the recent research work on the adaptive control Chapter 1. Introduction 9 of MIMO adaptive stochastic systems, and algorithms of non-square systems have been derived (Goodwin et al, 1982 ; Grimble and Moir, 1983). Elliot and Wolovich (1982) put the above work into a more general framework by showing that the notion of the delay in the MIMO case was intimately related to the interactor matrix as introduced by Wolovich and Falb (1976). Goodwin and Diigard (1983) finally treated a simple derivation of the minimum variance controller in the case of a general interactor ma trix and a globally convergent algorithm was developed. The SISO extended-horizon predictive control scheme introduced by Ydstie (1982) was extended to MIMO systems by Dugard, Goodwin and Xianya (1984). Makila (1984) suggested an explicit adaptive method of solving an LQG control problem of stochastic systems with fixed structure regulators. The optimization of the regulator's parameters was achieved from the so lution of a Ricatti-type equation (Anderson and Moore, 1971). Despite the number of proposed MIMO adaptive control schemes very few pilot-plant applications have been reported however (Toivonen, 1984; Martin-Sanchez and Shah, 1984). In the past years, parameter identification of linear systems via orthogonal functions and polynomials has received some attention. Generally speaking, any signal can be considered as a signal vector in an infinite-dimensional signal space. The projection of the signal vector in a certain finite-dimensional subspace is then the least-square approximation of the signal by the basis functions spanning this subspace. And the error of this approximation is orthogonal to the subspace. One of the basic problems in signal representation is then to find a minimum-dimensional subspace in such a way that the information-bearing attributes of a specific class of signals are retained. Historically, the use of orthogonal functions for obtaining approximations is well established. The approximating properties of Fourier series, the sine and cosine terms of which satisfy the orthonormality condition, are well known. The first application of other orthogonal sets to the transient problem was provided in 1932 by Y.W. Lee. For Chapter 1. Introduction 10 a causal system, such as the process loops under study, the impulse response may exist over the whole positive time axis. On this interval an appropriate, simple, convenient and well known orthogonal basis set is the Laguerre set (Lee, 1960). The Laguerre functions, a complete orthonormal set in -L2[0,oo), have been used often both for their convenient network realization and for their similarity to transient signals (Young and Huggins, 1961; King and Paraskevopoulos, 1977; Nurges and Jaaksoo, 1981 ; Dumont, Zervos and Belanger, 1985). Wiener (1956) also proposed Laguerre functions for pre diction and for non-linear systems. Other polynomial approximations of time functions have been used by many researchers to solve either continous or discrete control prob lems in recent years. In particular, the application of continuous Walsh polynomials to system identification was introduced by Corrington (1973) by constructing Walsh tables and by Chen and Hsiao (1975) who developed the Walsh integration opera tional matrix. The computational algorithm to calculate the expansion coefficients was simplified by using the derived integration operational matrix. The Walsh operational method was applied to various problems such as the analy sis, synthesis and optimization of time-invariant and time-varying systems, to bilinear systems, delay systems, distributed systems, multi- input-multi-output systems and also integral equations (for details see Horng and Ho, 1986). A parameter identifica tion method of continuous-time systems, developed by expressing integral functions in terms of periodic input-output data suitable for implementation on a microprocessor by use of Walsh functions has been proposed by Bohn (1982). In order to facilitate digital image processing, the discrete Walsh series were developed by Kak (1974) to manipulate the integral transform characterization of patterns of a finite binary se quence. Other typical series applied to signal estimation, model-reduction problems, linear control problems and functional ordinary differential equations, are the Legendre (Chang and Wang, 1985), the Chebychev polynomials (Liu and Shih, 1984) and Jacobi Chapter 1. Introduction 11 polynomials (Lee, Tsay and Horng, 1986). Although effective recursive formulae were proposed, the computation was still tedious. The inversion of a high-dimensional ma trix is often encountered in solving these problems. King and Paraskevopoulos (1979) applied the discrete Laguerre polynomials to solve the parametric identification prob lem. Hwang and Shih (1983) used the discrete Laguerre orthogonal polynomials and the discrete Chebyshev orthogonal polynomials, to solve the model reduction problem. Similarly, Horng and Ho (1985) applied the discrete Laguerre orthogonal polynomi als and the discrete Chebyshev orthogonal polynomials to solve the discrete optimal control problem. Most of the proposed methods in estimation and control that used orthogonal poly nomials were essentially data compression works. The time domain data sequences (input and/or output) were transformed into discrete orthogonal polynomial spectra which are much shorter than the data sequences. Handling these shorter spectra, mem ory saving and computational advantage are obvious. 1.3 Contribution of this thesis In this thesis the behaviour of several discrete self-tuning schemes based on the series representation of some orthonormal sets of functions is analyzed and implemented. The analysis, and the results obtained employing this new transfer function representation, are particularly favourable and they are considered to be well-suited to the adaptive control problems. It is our belief that this topic will inspire confidence in the adaptive control community in the potential use of orthonormal functions as a tool in estimation and control, and will also spur more research activity in the subject. Although the use of orthonormal functions is a very popular topic in estimation theory and signal pro cessing, especially for the description of electrical signals, their use in adaptive control Chapter 1. Introduction 12 has not been much investigated. In this thesis we actually propose a method to develop a self-tuning adaptive control scheme based on orthonormal series representation. The use of three sets is investigated: (a) the set of Laguerre functions, (b) a modified set based on the Laguerres and (c) a set with complex poles. The results are encouraging and establish the succesful applicability of this new method. The reasons for using Laguerre functions are described later. The contributions of this work to the theory of adaptive control are as follows: â€¢ To introduce the orthonormal functions as a valuable tool in modelling plant dynamics and in the development of adaptive control algorithms. In particular the major features of the Laguerre set and two more others are investigated and their applicability is analysed. â€¢ The demonstration of an analysis method for implementing adaptive control al gorithms based on orthonormal sets of functions. The major advantages of the self-tuning schemes studied being: (a) the need of less a-priori knowledge about the order, the delay, the number of poles and zeroes and the phase characteristics of the plant, (b) the Finiteness property of the orthonormal sets as an advanta geous way to increase on-line the number of filters for proper identification, (c) superior handling of time delays and non-minimum phase characteristics and (d) the flexibility and simple structure of the proposed algorithms that make them very attractive for industrial applications. â€¢ The robustness properties of the new algorithms and their potential use in control ling plant dynamics efficiently are verified first by various computer simulations and second by an industrial application. â€¢ To demonstrate the efficiency and applicability of the proposed schemes, the Chapter 1. Introduction 13 first industrial application of an adaptive self-tuning scheme using orthonormal functions is presented in detail. Although Laguerre functions were chosen initially, because of their simplicity and their similarity to transient signals, other orthonormal functions such as Legendre func tions may be used. The Laguerre functions exhibit strong advantages in identifying time-delays (a situation common in process control) because of their similarity to Pade approximants. As the model is expressed in a state-space form, state-space control design techniques may be used. A predictive control law is preferred because of its simplicity and ease of use. The common thread and novel aspect for all those schemes is the use of unstructured models based on orthonormal functions. 1.4 Outline of the Thesis The idea of modelling and identifying linear systems using orthonormal functions, and especially using the Laguerre set is introduced in Chapter 2. Two deterministic self-tuning control schemes, one explicit and one implicit, based on this approach and accompanied by some theoretical results, robustness issues, simulations results and a discussion on the practical aspects of the algorithm, are presented in Chapter 3. The stochastic self-tuning control approach including some closed-loop stability and simulation results are considered in Chapter 4. A multivariable control scheme is developed in Chapter 5 and two simulation examples are given, including a paper-machine headbox example. An industrial application based on the Laguerre-series self-tuning approach and performed on a pH-control loop in a bleach plant at a pulp mill site is documented in Chapter 6. Chapter 7 deals with self-tuning control based on a modified Laguerre set of functions and also on a set of functions having complex exponential poles. Chapter 2 Laguerre Functions in Modeling and Identification 2.1 Signal Description by Orthonormal Functions In the past years many different identification and parameter estimation methods for linear dynamic systems have been described in the literature (Ljung, 1987). In an effort to improve the operation and control of existing industrial processes and the design of new efficient control algorithms, an increasing interest was shown in the measurement of system dynamics. Any method which can give good measurement of the dynamics in the presence of plant disturbances within a reasonably short time with a small amount of data , and without significantly affecting the normal operation of the process, would be more attractive. The basis of estimation and identification consists of the mathematical description of the relation between the input and the output functions of the process under study. These functions are generally contaminated by noise, and the process dynamics may be subject to change from internal or external disturbances. In dealing with the problem of identifying an unknown process in discrete time, two major decisions have to be taken in advance: (a) what mathematical model is to be used for the plant representation and (b) what estimation method is to be applied in or der to find the unknown parameters. A common answer to (a) above is the well-known ARMAX mathematical model. Any of the proposed identification techniques in the literature deal with this mathematical model, and many of the self-tuning schemes are based on ARMAX series representation (Seborg et al, 1986). Other ways which have 14 Chapter 2. Laguerre Functions in Modehng and Identification 1.5 been proposed for modelling system dynamics include the impulse response description and the orthonormal functions representation. For the impulse response description a number of control schemes have been developed and some practical applications have been reported (Richalet et al, 1975 ; Rouhani and Mehra, 1982). Their philosophy can easily be extended to adaptive self-tuning schemes. As for the choice of estimation methods be applied there is a variety of choices. Correlation techniques, Least squares, Instrumental Variables, Maximum Likelihood, Stochastic Approximation, Gradient es timation techniques, Extended Least Squares, Weighted Least Squares, are some of the choices (Ljung , 1987). Each one has specific advantages, the simplest and most frequently used being the Least Squares scheme. Considered in this study are the use of orthonormal functions to represent sys tem dynamics and the estimation method of Least Squares (Extended Least Squares) for parameter identification in the deterministic (stochastic) case. This combination provides strong features and, as it will be shown later, it resembles the Instrumental Variable identification method, well known for its robust properties (Trulsson, 1983). This combination has also been used before with success in an off-line method for the optimal tuning of industrial PID controllers in process control, (Zervos, Belanger and Dumont, 1985). Extended results from industrial trials have been reported in Dumont, Zervos and Belanger (1984). The optimal PID tuning scheme also performed relatively well when it was compared to an adaptive predictive control scheme on the same pH-loop of a bleach plant in a pulp and paper mill, (Dumont, Martin-Sanchez and Zervos, 1988). If the approximation of the plant's impulse response g{t) is carried out by developing the given function into an infinite expansion, (Kautz, 1954), oo *(Â«) = Â£'â€¢.â€¢/<(<) (2-1) Chapter 2. Laguerre Functions in Modeling and Identification 16 in terms of certain functions, fi(t), then by selecting as the approximation the first TV terms of this expansion, $(0 = f>*/i(0 (2.2) The constants r; are the coefficients of the expansion. The functions fi (which can be sums of damped exponentials and/or exponentially damped sinusoids, or polynomials, must be chosen so that, â€¢ Convergence is rapid and uniform, thereby producing an accurate approximation for any fixed number of terms. â€¢ The coefficients do not depend upon the number N. o The calculation of the N coefficients, rj, is simple. â€¢ The mean-squared error between g(t) and g(t) is minimum for a given value of Most of these properties are achieved by selecting the functions fi(t) to form an or thonormal set. Some of the advantages of signal representation by orthonormal functions are, â€¢ The coefficients of expansion can be determined by invoking orthonormality. A set of orthonormal functions can be generated from a set of linearly independent functions by using the Schmitt orthogonalization procedure (Stewart, 1973) and the normality condition. â€¢ Good sensitivity behaviour in terms of changes of the function being approxi mated. â€¢ Minimization of the mean squared error for a function to be approximated by a truncated linear combination of functions. Chapter 2. Laguerre Functions in Modeling and Identification 17 â€¢ Wide application area in predicting or extrapolating signals. A set of real and continuous functions { fi(t),â€¢ f2(^)1 â€¢ â€¢ â€¢ } LS said to be orthonormal in the range [a, 6] if, ' 0 if i ^ j fi(t)fj(t)dt = { Ja 1 if i = j (2.3) where, i,j â€” 1,2,3,â€” Completeness is another desirable fact apart from linear independence of the or thogonal functions. The orthonormal set {fi(t)} with, rb f ff(t)dt.< 00, i = 1,2,.. Ja is called complete or closed in L2[a,6] if for any continuous and real function g(t) in L2[a, b] and for any given real number e > 0, there exists an integer N such that, E= fb\g(t)-S(t)\2dt<e (2.4) Ja where, S(t) = Erifi(t) = rTÂ£ (2.5) Â«=i Where, = [ rx r2 ... rN ], and â€¢Â£T == [ fx f2 ... fN ]. The constants r^'s are called the spectrum gains and for deterministic signals can be computed from (Lee, 1960): ri = J g{t)fi(t)dt. (2.6) For ergodic stochastic signals the integral in equation (2.6) is replaced by the expec tation operator giving the cross-correlation at zero lag between the two signals, i.e. r{ = EW)fi{t)]. An orthonormal set is said to be finite if when increasing the number of orthonormal filters in the signal representation of a specific square-integrable function from a low Chapter 2. Laguerre Functions in Modeling and Identification 18 order to a high order, the low-order spectrum gains remain unchanged; The high-order approximation thus adds more terms for achieving a better approximation of the function and minimizing the error in the equation (2.4). The approximation of a signal by a sum of a finite number of orthogonal functions in the minimum-integral-squared-error sense leads to the same coefficients as given above by equation (2.6), (Eykhoff, 1964). For an unknown function to be approximated, con sider the Figure 2.1. The output y(t) of a process is compared with a linear combination of {h(t)}, the outputs of the filters Fi(s), ^(a),...,Fff(s). w(t) represents any internal or external noise disturbances. If the input, u(t), is a white stochastic stationary signal then the gains of the filters are given by the equation, Ryl.(O) where the symbol Rx. v.(0) stands for the correlation function between the two signals Xi(t) and yi(t) at zero time-lag. The numerator is the cross-correlation at zero lag between the output y(t) and each filter's output and the denominator is the auto correlation of the input (Zervos, Belanger and Dumont, 1988). The orthogonality condition and the equation (2.7) are fullfilled only if the transfer functions of the filters are orthogonal to each other. 2.2 The Laguerre functions 2.2.1 Introducing the Laguerre orthonormal set The Laguerre functions, a complete orthonormal set in L2[0, oo), have been used often because of their convenient network realization (Lee, 1960) and their similarity to transient signals. Their similarity to Pade approximants for time delay representations makes them particularly attractive for our purpose. All these remarkable features make Chapter 2. Laguerre Functions in Modeling and Identification 19 0 hit) r2 Summing Circuit Process y(t) -G> s(t) '+ e(t) w Figure 2.1: Approximation of a transfer function by a linear combination of orthonormal filters. Chapter 2. Laguerre Functions in Modeling and Identification 20 â€¢ the Laguerre functions a candidate of choice for use in identifying plant dynamics. Because of their good properties we plan also to incorporate them in the structure of an adaptive self-tuning control scheme. In particular their advantages as a complete orthonormal set are summarized in. short in the following : â€¢ Advantageous and simple representation and flexible structure. â€¢ Easy to model and construct. â€¢ Similarity to transient signals that are common in process control. â€¢ Similarity to Pade approximants providing superior representation and handling of time delays to the extent that it is possible to recover an estimate of the time delay during identification. â€¢ They have been used before with success for transient signal representation (e.g. Lee, Young and Huggins, King and Paraskevopoulos, Nurges and Jaksoo, Du-mont, Zervos and Belanger). â€¢ They have also been used for non-linear systems by Wiener who also recomended them for signal extrapolation and prediction. In continuous time the Laguerre functions are described by (Lee,1960): AW = ^^M^,M-2pt)] = y/2^(-l)*-1exp(-pt)A_1(2p<) where i is the order of the function (i = 1, ..N), p > 0 is the time-scale, and Ci(x) are the Laguerre polynomials, well-known in mathematical literature. These functions form Chapter 2. Laguerre Functions in Modeling and Identification 21 v/2p LzZ >+p *+p y(*) T2 Summing Circuit Figure 2.2: Laguerre Ladder Network. an orthonormal set in the time-domain [0,oo] and the corresponding Laplace transform for this set is, Fi(3) = v^77^r . ; = i,~,iv (2.8) The orthonormality property from the time domain is preserved in the j-domain. This set is generated by the simple and convenient ladder network of Figure 2.2. The simplicity of the phase-shift chain in the Laguerre Network is a significant advantage for implementation. Besides Laguerre, other useful real-pole sets may be derived from and related to Chapter 2. Laguerre Functions in Modeling and Identification 22 other orthogonal polynomials, such as those of Tchebycheff, Legendre, and Jacobi. However, only the Laguerre set lends itself to a simplified determination of the coef ficients ri, (Kautz, 1954). Laplace-transforming equation (2.1) and substituting the expression for the Laguerre functions from equation (2.8) we get, Now, letting (s â€” p)/(s + p) = w, or s = p(l 4- w)/(l â€” w) and rearranging the factors somewhat, gives: V^TTV (PiÂ±^) = Â£>^ (2'10) v (1 â€” w) V 1 â€” w J ~[ This expression may be regarded as the first 7Y terms of the power series expansion of the quantity on the left. That is, the first N terms of the power series expansion, TV = Y,riwi (2.11) Â»=p(l+u;)/(l-u>) i=l may be computed numerically to determine the when the function g{t) is analytically known. 2.2.2 Least Squares Estimation of the Laguerre gains For identification purposes of a given La open-loop process it was shown in Section 2.1 that the Laguerre spectrum gains may be computed using simple correlation techniques. If the input is stationary white noise then the cross-correlations at zero lag between the individual filter outputs are all theoretically zero because of the orthogonality property in the orthonormal set. In that case the following proposition relates the spectrum gains of a transfer function with the spectrum gains of its output when the input is white noise. Proposition 1 Consider the system in Figure2.1, where {fi(t)} is an orthonormal set of functions andu(t) is a stochastic input signal. Assume the process's impulse response {s-p) G(s) Chapter 2. Laguerre Functions in Modeling and Identification 23 is g(t) and its output is y(t) and let their orthonormal expansions be, N . *(*) = !></<(*)" (2-12) i=l with, r{= H g{t)fi{t)dt (2.13) and, N -y(*) = I>W (2-14) with, c< = ny(t)li(t)} (2.15) If u(t) is stationary white noise with variance cr2 , then C{ = cr2r;. Proof: Interchanging between the expectation and integral operators we have, d = E[Ji(*)y(t)] = E[ fÂ°Â° fi{t - nHr^n fÂ°Â° g{t - r2)u{r2)dr2} Jo Jo /â€¢oo /Â»oo = E[ / / - Tl)5(< - T2)u{rx)u{T2)dTidr2} Jo Jo â€¢ - lÂ°Â° r - riM* - r2)EKr1)u(r2)](ir1<iT2 Jo Jo poo roo = ' fi{t-Tl)g(t-T2)<T28(T-i;-T2)dTldT2 Jo Jo fOO fOO / hit-Tx) I g{t - T2)6(TX - r2)dr2drx Jo Jo roo roo / fi{t - n)g{t - rx)drx = cr2 / fi(t)g{t)dt JofOO = <T2 = cr2 = cr2Ti. where 8 stands for the Kronecker delta. â€¢ The Laguerre filter gains may be computed using simple correlation functions as shown above but because in practice the computation of the correlation functions is Chapter 2. Laguerre Functions in Modeling and Identification 24 done digitally and based on limited length of data, the use of least-squares parameter estimation is more efficient, (Zervos, 1984). Consider the Figure 2.1. At every time instant the output of the time-invariant plant y(t) can be written as, y(t) = Er-' / fi{t - r)u{r)dr + w(t) (2.16) letting, k(t)= f fi(t - r)u{T)dr (2,17) Jo then equation (2.16) becomes for the fc time-instant, y(k) = J2cMk)+â„¢(k)=lU + w(k) (2.18) t=i where 1^ = [li(k) /2(fc)... lrt(k)] , and c_r = [ci c2.... CAT]. NOW, collecting data up to the fc sampling instant we get the vector-matrix form, y(i) Mi) â€¢ â€¢ IN(1) Ci w(l) y(2) *i(2) h(2) â€¢ â€¢ IN{2) c2 + w(2) y(*) li(k) h{k) â€¢ â€¢ lN(k) w(k) (2.19) which can be put by inspection into the generalised linear form, y = Mc + w (2.20) For statistical and probabilistic considerations the number of observations fc, needs to be much larger than the number N of parameters to be estimated. Then the least-squares estimate of the vector gain c is given by the Normal equation (Eykhoff,1967 ; Strejc,1980), cLS = (MTM)-1MTy (2.21) If we form explicitly the matrix (MTM) each entry will be of the form : (MTM)ij = Ylm=i k(rn)lj(rn), fÂ°r i,j = 1> â€¢ â€¢ â€¢ ,N. This matrix is diagonally dominant for large set Chapter 2. Laguerre Functions in Modeling and Identification 25 of data because of the orthonormality of the Laguerre filters. As the number of data k â€”â€¢ oo the above matrix tends to be diagonal (a multiple of the unity matrix). If u(t) is white noise with variance cr2 and 8{j is the Kronecker delta then we get for the elements of that matrix, nUWjit)] = <T26{j ~ lim WiM (2-22) k-*oo k ~~, m=l In the same way if we form explicitly the vector (Mry_) each entry will be of the form (MTy)i = Em=i li(m)y(m), for i = 1,... ,N. Computer simulations have indicated that when using least squares the general fit to the transfer function to be approximated is much better than use of the simple correlation approach described earlier and that fewer data points are required. Another interesting fact is the relation between the actual length of the parameter vector to be estimated and the number of available data points. The matrix (MTM) becomes nearly singular to working precision as the number of Laguerre filters increases and the number of data points decreases. An even more interesting fact is that the inverse of the above matrix can be pre-computed separately for a pre-determined input noise sequence and a fixed set of Laguerre filters, e.g. if the time-scale coefficient p has always a fixed value and a time-scaling technique is used for the sampling time of an input of PRBS, (Zervos et al, 1985). An obvious fact here is that by examining the matrix (MTM), the kind of least-squares identification described above resembles very much the Instrumental Variable identification method which has proved to be quite robust (Ljung and Soderstrom, 1983). Chapter 2. Laguerre Functions in Modeling and Identification 26 2.2.3 Statistics of the estimates Any method for the identification of the parameters of an unknown plant requires experimental data. Due to observation noise or disturbances, the data may be provided with a specified tolerance. For the simple correlation method, in the estimation of the Laguerre gains, a crude check as to whether certain values of the cross-correlation functions could be effectively zero may be made by comparing the corresponding cross-correlation estimates with their approximate standard errors obtained from a formula (Bartlett, 1955; Bendat and Piersol, 1966; Box and Jenkins, 1976). For normal zero-mean signals, the "crude check" may be obtained (Zervos, 1984) using the formula, k k Var[ci] = 1/k2 Â£ Â£ [H-y^-fa - â€¢m)^li,y{n ~ m) + Ry,y(n ~ m)Rli,ii(n ~ m)l n=l m=l where the correlation functions estimates can be computed digitally using the usual approximative summation expression. Since limited lengths of measurement data will be used over a finite time rather than over an infinite time, an expression for the standard error of the cross-correlation estimates would be useful in order to check how far from the true value the estimate may be. For normal stochastic input signals with zero mean value and variance of cr2, the estimate of a Laguerre filter gain is given in discrete form by, ri = j-2ci = ^-2J2y(n)li(n) (2.23) where k is the number of data that was used, and t = 1,2,..., iV. In matrix-vector form for the whole parameter vector: Lor = -^iMTy (2-24) where M was defined from equations (2.19),(2.20). Now using equation (2.24) and the assumption that the plant noise is uncorrelated with the Laguerre filter outputs Chapter 2. Laguerre Functions in Modeling and Identification 27 (Figure 2.1), the expected value of the parameter vector given the input gives, . Eff^/M] = ^{E[(MrM)r]+E[Mrw]} = -LE[(MrM)j:] This means that the simple correlation estimates of the Laguerre gains, given the input, are biased. Clearly for large number of data (fc â€”â€¢ oo) the matrix (MTM) â€”> (o~2I), where i" is the identity matrix. However over all possible inputs the expected value of the simple correlation estimate of a Laguerre gain is unbiased as shown below, Rather than calculating the variance of every single estimate of the Laguerre gains, may as well just show what the typical standard error (e) of the gain vector looks like for various fc and possibly N. Better still, e = E[rcor/M]-r = {^iMrM-/}Â£ (2.25) In general, given, e = M'r (2.26) where M' is the matrix inside the curly brackets in equation (2.25), we have, Amiâ€ž(M'rM')|z|2 < |r|2 < Amox(M^M')|r|2 (2.27) where A stands for the eigenvalue of a matrix. If the matrix is symmetric then, (M'TM') = M'2 and A(M/rM') = A2(M'), and we finally get, |Amin(M')| < y\ < |Amax(M')| (2.28) r Chapter 2. Laguerre Functions in Modeling and Identification 28 This result shows that the error in the estimates is always bounded depending on the number of data (fc) and the number of filters (N). To apply this, one has to calculate the minimum and the maximum eigenvalue for the matrix M' and use equation (2.28). Both should of course go to zero for large fc. For finite fc, they give a good indication of the error in the expected value. For the Least Squares parameter estimation case, the estimates of the Laguerre gains appear actually to be unbiased. Using equations (2.20) and (2.21) one can easily get the following result for the expected value of the parameter vector given the input, E[cL5/M] .= E[{MTM)-1MT{M^ + w)) = c + E[(MTM)-1MTw] = c It is worthwhile to mention here that the above is true even if the noise w(t) corrupting the output of the plant is coloured, as long as it is uncorrelated with the filter outputs. Suppose that a system at the kth sampling instant is described by, y(k) = Â£ Cili(k) + w{k) = fc + w(k) (2.29) t=i where lÂ£ = [h{k) ^(fc) â€¢ â€¢ â€¢ Jjv(fc)] , and = [ci c2... CJV]. Collecting data up to the kth sampling instant we get the vector-matrix equation (2.20), i.e., y = Mc0 + w (2.30) Now multiplying both sides of the above equation by (|Mr) we get, (Â±-MT)y_={Â±MTM)cQ +(^Mr)w (2.31) And finally for the parameter vector we get, ^^{\MTM)-\\MT)y + {\MTM)-\\MT)YL (2.32) /C K /c fc Chapter 2. Laguerre Functions in Modeling and Identification 29 If we define the following, R(k) = \{MTM), h(k) = Â±(MTy) (2.33) then equation (2.31) can also be written as, â€¢ h(k) = H(fc)co + e(fc) (2.34) Now the following proposition as in Trulsson (1983) on the open-loop identification of a system is presented using the least-squares technique. Proposition 2 Suppose that z,(t) is an instrumental variable vector of the form zT(t) = [l1(t) l2(t) ... lN(t)} (2.35) and is such that, (a) 1 k e(k) = â€” ^ z(m)w(m) â€”â€¢ Q, as k â€”* 00 w.p.l (2.36) * m=l (b) With probability 1 the smallest singular value of R(k) does not tend to zero, <rmin[R(k)]Q. (2.37) Suppose also that either of the following exists and is known (a) A lower bound 60 of ]imsup[crmin[R{k)}} (2.38) kâ€”*oo or (b) A function j(k) such that Â£(^)/T(^) ~~* Q- a3 k â€”> 00 w.p.l, and j{k) â€”*â€¢ 0 as k â€”> 00. (2.39) Chapter 2. Laguerre Functions in Modeling and Identification 30 Then it is possible to construct a sequence {Â£(&)} with dime = dimc0, such that , â€” C(,| â€”â€¢ 0 as k â€”â€¢ oo w.p.l. (2.40) Proof: Define c(k) as, c(k) = R-'itik)) h(t(k)) (2.41) where t(k) is the largest integer t < k such that, <rmin(R(t)) > S0/2 in case (2.38) (2.42) <rmin(R{t)) > 7(0 in case (2.39) (2.43) . From equation (2.34) and equations (2.42), (2.43), we can write, |Â£(*)| = \c(k) - = \R-\t(kMt(k))\ < [crmin(R(t(k)))}-%(t(k))\ ^| Â£\e(t(k))\ in case (2.38) ^ 1 (7(*(fc)))_1|Â£(<W)l in case (2.39) From equations (2.36), (2.37) and equation (2.44) it can be seen that equa tion (2.40) is true if t(k) â€”Â»â€¢ oo as k â€”Â» oo. In case of equation (2.38) this follows from equation (2.42), and in case of equation (2.39) this follows from equation (2.43). â€¢ The conditions described by equations (2.36) and (2.37) define the desired properties of the instrument vector {z,(t)}. The instruments satisfy these properties because they are uncorrelated with the noise {w(t)}, by the way they were denned in equation (2.35), and because z_(i) = l(t) , they guarantee the validity of the condition in equation (2.37). The analysis so far was made under the assumption that no feedback input is used. If Chapter 2. Laguerre Functions in Modeling and Identification 31 however a feedback input is used then an external white noise process v(t) independent of w(t) must be injected also in the system as it was suggested in Trulsson (1983). A price is paid here for the additional noise disturbance, input but this can be made so small that it has only a small influence on the closed-loop behaviour. 2.2.4 The Discrete-time Laguerre set So far the continous-time Orthonormal Laguerre set has been discussed. The discrete form of the orthonormal Laguerre set is particularly important for use with digital computers when it comes to implementation. This requires the transformation of the orthonormal functions from the continuous form into the sampled-data form. One ap parent solution would be to apply direct Z-transform, however the Z-transform of con tinuous orthonormal exponentials are not themselves orthogonal in Z-domain (Young and Huggins, 1962). This is due to the fundamental property of sampling that a signal with a frequency spectrum higher than the sampling frequency is not exactly repro ducible from its sampled data. The Z-transforms of a signal involves the values of the signal at equal-spaced instants separated by the sampling interval, T â€” 2ir/u, where a; is the sampling angular frequency. According to the sampling theorem only a signal having a frequency spectrum lower than u) is exactly reproducible from the sampled data. However the exponential functions, which vanish identically over half of the time-axis, have a non-zero spectrum extending over almost all frequencies. As a result orthogonality in the s-domain does not yield orthogonality in the z-domain representatives of these functions. Also the iterative procedure used in continuous time to define the Nth Laguerre filter is not guaranteed to hold in discrete time after the Z-transformation. In the present study the discretization of the Laguerre Ladder Network is accom plished by the continuous network compensation method (Jury,1958) for each of the Chapter 2. Laguerre Functions in Modeling and Identification 32 blocks in Figure 2.2. In this way the properties of the continuous-time orthonormal set are preserved while expressing them efficiently in discrete time. The simple, flexible and convenient forms the functions have in continuous time while working in discrete time are also kept. This method involves the use of linear networks in either the for ward or the feedback path of a sampled-data system. Consider for example Figure 2.3. The input to the block Gh{s) consists of a set of impulse samples of u(t) and its out put is continuous and fed continuously to the plant G(s). The network compensator can be determined from the desired time-response qualities, for instance to describe a continuous output whose sampled values coincide with the sampled response of the sampled-data control system (Nease, 1957). The fictitious interpolator Gh($) in this case is employed to produce a piece-wise straight-line approximation of the continuous signal between successive sampling instants. This method is based on the fact that G(s) has an impulse response which is well represented by straight lines between sampling instants, a fact which is usually true for most of the process control loops encountered in industry. Thus the transformed sampled-data control system output coincides with the sampled values of the continuous system output at the sampling instants. Another possibility for improving the approximation is to use second or higher-degree interpo lators which give better smoothing properties. The goal is to obtain a highly accurate representation without increasing mathematical complexity. By using the above pro posed discretization method the signal representations are kept accurate while having simple mathematical expressions. The function of the fictitious hold Gh(s) is to reconstruct as much as possible the continuous function being sampled. If GH{S) is chosen so that its output is a straight-line approximation between successive sampling points then the transfer function of Chapter 2. Laguerre Functions in Modeling and Identification 33 U(a) y GH(S) y T T G*(s) -Figure 2.3: The Continuous Network Compensation of G*(s) such a hold is, Gh(s) eT'-2 + e -Tt Ts2 (2.45) The impulse response of such a filter which has a triangular shape is shown in Figure 2.4. By inspection, this kind of linear triangle-hold interpolator provides a polygonal approximation of the output function. The function in equation (2.45) is not physically realizable since the shape of its impulse response from Figure 2.4 reveals a non-causal function. However, when it is cascaded with a continuous-time plant G(s) then it is possible to evaluate the Z-transform of the overall system, which is physically realizable. Looking at the Laguerre ladder network in Figure 2.2 for process signal synthesis the discretization is done in the following way. If T is the sampling period then the first input box, F[{s) = V5p (2.46) (* + p) is preceded by a zero-order hold and then it is Z-transformed to give the discrete-time Chapter 2. Laguerre Functions in Modeling and Identification 34 Time Figure 2.4: Impulse response of a triangle-hold (^(.s) transfer function, V2p(l-e-pT) (2.47) p {z-e~PT) Each of the remaining similar section boxes in Figure 2.2 is a phase-shift all-pass 1-*'-order filter which is discretized with the use of the triangle-hold linear interpolator filter given by equation (2.45), giving the discrete-time transfer function, Fl(z) _ z(T + 2(e->T - l)/p) - - 2(e-*r - l)/p (2.48) If we define, n = e~pT r2 = T +1) V r3 = -Te~pT - -(e~pT - 1) V Chapter 2. Laguerre Functions in Modeling and Identification 35 r4 = d Zp-P then the difference input-output equation for each of the outputs /{(<).of the Laguerre ladder network is given by, k(t) = â€¢ (-lrVrVi^ + raJ/r-1 + (-lr^-^T^ + ra)/^"2 Z2(Â« - 1) + â€¢â€¢â€¢ + (-l)(r1r2 + r3)/r k.^-1) + 7i - 1) + (-lrVrS/T'-1 u(f-l) (2.49) 2.3 Modelling of dynamic systems Described so far has been the Laguerre orthonormal set of functions and their impor tant role in systems identification has been stated. The convenient representation of the Laguerre ladder network as shown in Figure 2.2 can be expressed in several math ematical ways. For our purpose it is convenient to represent it in a state-space form. This will enable us to derive predictive expressions of plant outputs in a straightforward manner. The outputs k(t), (i â€” 1, â€¢ â€¢ â€¢, N) from each block in Figure 2.2 are taken to be the states of the Laguerre ladder network. Defining the state vector as LT(t) = [h(t) l2(t) .... lN(t) } (2.50) then by discretizing each block as it was described by equations (2.47),(2.48) and using equation ((2.49) a discrete-time state space representation of the Laguerre network can be readily available in the form, l(t + 1) = Al{t) + Â£u(f) (2.51) Chapter 2. Laguerre Functions in Modeling and Identification 36 where l{t) is the iV-dimensional state vector, and u{t) is the system input. A is a lower triangular N x N matrix where the same elements are found respectively across the diagonal or every sub diagonal. If T is the sampling period then, (2.52) and Â£T = [r4 ,(-r2/r)r4 ...; (-rs/r)^]. (2.53) The above state-space system is stable (p > 0), observable, and controllable. The output of the process to be modelled is then approximated by the weighted sum of the outputs of the Laguerre filters having the form, y(t) = cTl_(t) (2.54) The above weighted sum in equation (2.54) can be taken as the projection of the plant output onto the linear space whose basis is the orthonormal set of Laguerre functions. The standard calculation of the Laguerre spectrum gains employs equation (2.6) using well-known correlation techniques. A more efficient way is to use the least-squares parameter estimation method described in Section 2.2.2. In the open-loop case, the identification can be performed by exciting the system with a white noise sequence, i.e. both the system shown in Figure 2.2 and the system whose impulse response is g(t) are excited by a white noise sequence (or PRBS), and k output sample-points are collected. Then in the least-squares sense the normal equations can be used in vector-matrix form as given by equation (2.21). The parameters obtained in that way were proved in Section 2.2.3 to be unbiased even if the output of the plant was corrupted -rmâ€”n A = 0 0 0 J'N-l Chapter 2. Laguerre Functions in Modeling and Identification 37 by coloured noise. If the identification is performed under closed-loop operation, as it is the case when a self-tuning scheme is employed, then the output of the controller is not a white noise sequence. However input-output data can still be collected for on line plant identification. Simulations have shown that this least-squares identification technique produces very good results. An advantage using an orthonormal series representation to identify a plant is that when the identification order is increased then the low-order coefficients stay practically constant. Thus, the model order can be changed on-line with minimal transient. On the other hand, for an ARMAX model, increasing the model order means change in all parameters and thus the identification procedure goes through a significant transient period. Another advantage is that time-delays can be easily modeled since this approach does not require distinction from the actual plant dynamics. As a consequence an estimate of the delay can also be derived. Laguerre functions show very strong features in this situation because of their similarity to Pade approximants. Results from the following simulation example outline both the above advantages. Example 2.1 : Consider the following underdamped (Â£ = 0.45) second-order continuous-time plant that contains also a significant time-delay (k^ = 10) within its dynamics, &{3) ~ U(s) ~ (s* + 0.453 + 0.25) (2-55) Assume that all time units are in seconds. The natural angular frequency of the second-order plant is u>0 = O.brad/s and its settling time is ~ 25 sees. The above plant, including its long time-delay, was simulated in continuous time, using ACSL, and its input was excited with 5 identical periods of DIBN (Discrete Interval Binary Noise; Chow and Davies, 1964) sequences, each one of 64 samples periods , for a total of 320 points. The sampling time of the DIBN sequence was Chapter 2. Laguerre Functions in Modeling and Identification 38 2 sec, its absolute amplitude was 1 (i.e. of standard error cr = 1.0) and the data points from the plant's output were collected every 2 sec, for a total of 320 points. No noise disturbance was added to the output of the plant. Upon collection of the data an identification experiment was performed using the already described Least-squares Laguerre functions method. The number of Laguerre functions used was N = 12 and their time-scale was p = 0.5. The 12 identified Laguerre spectrum gains are given in the first column of Table 2.1. The step responses of the true plant and the identified one are given in Figure 2.5. The two responses are almost identical. The time delay of kd = 10 and the underdamping second-order dynamics have been very well represented with the use of just the 12 weighted Laguerre functions. If one used the correlation method to find the Laguerre gains (which nevertheless would give biased estimates) then 3000 points would not have been enough even to get a proper identification (see Zervos, 1984, Experiment 1). As a second experiment the output of the plant was corrupted with correlated noise before performing the identification. White noise was passed through a first-order linear transfer function of the form (xn(s) = (0.2a + l)/(s -j- 1), and then was added to the plant's output. Everything else remained the same as in the first experiment above. Two identification experiments were performed: (a) One with Standard Error of 0.5, and (b) one with Standard Error of 0.8. The 12 identified Laguerre spectrum gains for each case are given respectively in Table 2.1. The second and third columns contain the gains for the case with output noise, cr = 0.5 and cr = 0.8, respectively. The step responses of the true plant and the identified ones are shown in Figure 2.6. The responses of the identified plants match the response of the true plant very well despite the corruption of the plant's output by correlated noise. Chapter 2. Laguerre Functions in Modeling and Identification 39 Identified Laguerre G ains No output Noise Noise noise <r = 0.5 <x = 0.8 Cl 0.000795 0.003251 0.004725 c2 -0.014922 -0.015017 -0.015074 c3 0.101046 0.088314 0.080674 c4 -0.317984 -0.323456 -0.326739 c5 0.362282 0.376566 0.385135 C6 0.197190 0.202946 0.206398 cr -0.388695 -0.386242 -0.384770 cs -0.381893 -0.385412 -0.387523 c9 -0.011724 -0.018451 -0.0224867 ClO 0.156156 0.151452 0.148630 cu 0.093519 0.088498 0.085485 cu 0.019635 0.019029 0.018666 Table 2.1: The values of the 12 identified Laguerre gains for each case. -.2 H i 1 1 : 1 -i r 0 5 10 15 20 25 30 Time (2 sec/sampling-point) Figure 2.5: Example 2.1 : Unit step responses of the true plant and the identified one for the case without output noise (The 2 curves are identical). Chapter 2. Laguerre Functions in Modeling and Identification Figure 2.6: Example 2.1 : Unit step responses of the true plant (3), the identified when cr = 0.5 (2), and when cr = 0.8 (1). Chapter 3 Deterministic Adaptive Control 3.1 The Predictive Control Law As was first suggested by Dumont and Zervos (1986) the derived state-space represen tation of the orthonormal set of Laguerre functions presented in Section 2.3 can be used as the basis to formulate a predictive expression for the plant output. Simple Predictive Control concepts can then be employed to construct an adaptive self-tuning control scheme. Recalling from before, the state-space representation of the Laguerre Ladder Network is of the form, L(t + 1) = Al_(t) + bu(t) (3.56) y(i) = cTl(t) (3.57) The convenience of the above state-space representation is that any standard state-space design techniques can be used for state-feedback control. However, simplicity and implementation considerations suggests the development of a predictive control law. In the past decade, several predictive control laws have been proposed, e.g. by Martin-Sanchez (1976), Richalet et al. (1978), Ydstie (1984), Clarke et al. (1987). Their major advantages are, simplicity of use, intuitive appeal, and easy handling of varying time-delay and non-minimum phase behaviour. From equation (2.54) we can write for the cf-steps ahead output, y(t + d) = y(t) + cT[l(t + d)-l{t)} (3.58) 41 Chapter 3. Deterministic Adaptive Control 42 The recursive use of equation (2.51) gives for d future sample points: â€¢ l(t + 1) =â€¢ Al{t) + bu(t) l(t + 2) = Al(t + I) + bu(t + I) l(t + d) = Al(t + d - 1) + bu(t + d) (3.59) Using the equations (3.59) in a continuing recursive substitution and assuming, u(t) = u(t + l) = â€¢â€¢â€¢ =u(t + d-l) (3.60) we get the <i-steps ahead predictive expression: l_{t + d) = Adl{t) + (Ad~> + â€¢ â€¢ â€¢ + I)bu{t) . (3.61) Substituting equation (3.61) in equation (3.58) we finally get, y{t + d)=y{t) + kTl{t)+/3u{t) (3.62) where, kT = cT(Ad-I) (3.63) (3 = cT{Ad-1 + â€¢â€¢â€¢ + I)b (3.64) If d > kd, where kj is the plant time-delay, the right-hand side of the above equation can be equated to the desired reference trajectory for the plant output. As in Richalet et al. (1978) we define a first order set-point reference trajectory based on the equations: yr{t + I) = ay(t) + {I - a)y,p (3.65) yr{t + i) = ayr{t + i-l) + {l-a)yn, i=2,...,d (3.66) Chapter 3. Deterministic Adaptive Control 43 where 0 < a < 1 and y,p is the desired setpoint. By recursive substitution yT(t + d) can be written as: yr(t +d) = <xdy(t) + {1-<xd)y,p . (3.67) Setting y(t -f <f) = yT(t + d), and equating the right-hand parts of the equations (3.62) and (3.67) we can solve for the required control input u(t) to get, u{t) = {yT-y{t)-kTl(t))/0 (3.68) Remark 1: Let fcj be the plant time-delay. For a minimum-phase plant with delay kj, it is easy to show that d > kj and /? 7^ 0 are equivalent. However, for non-minimum phase systems, if one does not look sufficiently beyond the non-minimum phase behaviour, it is possible that /? = 0. In practice, one has to choose d such that (3 is of the same sign as the process static gain, and of sufficiently large amplitude. By definition, /3 = cT(Ad-1 + --- + I)b This shows that j3 is the sum of the first d sampling points of the impulse response of the plant. Remark 2: The control law (3.68) can be expressed in velocity form. Equation (3.68) can be written as u(t) = (yr - y(t))/0 - cTS(Al_{t) - Al(t - 1) - bu(t - 1))//? (3.69) Using the definition of (3 and rearranging, one gets Au(t) = (yr-y(t)-dLTAl(t))(3-1 (3.70) where 5 = {Ad~x+â€¢â€¢â€¢+/), Â£T = cTSA, Au(i) = u{t)-u{t-l), and Al(t) = l{t)-l(t-l). Remark 3: An alternate, receding control law as in Ydstie (1984) can also be derived. Then, at each step a control sequence u(t),...,u(t â€¢+- d â€” 1) that satisfies Chapter 3. Deterministic Adaptive Control 44 y(t + d) â€” yT(t + d) and that minimizes d-i Jd = X>2(*-Â») (3.71) i=0 is determined, but only u(t) is implemented. Such a control sequence is given by, utt i n 7<[Â».(' + ^)-Â»(')-iri(0] + .TJ+.-. + TJ,, (3-?2) where, 7. = crAd_1"'6, for i = 0,ci-1. The following proposition shows clearly the value of the derived predictive control law given by equation (3.68) with respect to cost indexing the control input. Proposition 3 Let the system be described by (2.51) arid (2.54)- Then the control law, under the assumption (3.60), that satisfies y(t + d) â€” yr(t + d) is the same one as the control law that both satisfies y{t + d) = yT(t + d) and at each step minimizes the cost index: Jo = u{t)2 (3.73) Proof : Consider (y(t + d) â€” yr(t + d) = 0) as the constraint equation for the minimization of the cost function (3.73) then, the gradient of the Lagrangian function with respect to the input u(t) is given by, 2Â«(<)-A*(7o + -"+-7d-i) = 0 (3.74) where p. is the Lagrangian multiplier and the assumption (3.60) was used. Solving the above equation for u(t) and substituting in (3.62) we get, 2(yr(t + d)-y(t)-kTl_(t)) . (7o + --- + Td-i)2 ^ ' ) Now substituting (3.75) in (3.74) we derive for the control law u(t) the same equation as (3.68). This is the reason why the equations (3.68) and (3.72) give similar simulation results. â€¢ Chapter 3. Deterministic Adaptive Control 45 The following Theorem proves, for the case of known fixed plant parameters, the convergence of the derived predictive control law. Theorem 1 Let the system described by (2.51) and (2.54) be controlled by (3.68) where 0 is nonzero, and assume y,p constant. Then there is some finite prediction horizon d > kj, such that, lim y{t) = y,p lim u(t) = u Â«â€”oo v ' where u is a constant.^ Proof: The first part of the proof consists in proving the stability of the closed-loop system. For that the closed-loop system equations are derived and examined for the conditions of stability. The closed-loop system can be expressed by, . l(i+l)MA-&cr(l-ad)^ (3.76) Using equation (3.63), one can write kT = cT{Ad-I) (3.77) Substituting above in equation (3.76) and after some simple manipula tions one obtains: ? . L(t + l) = (A-rbQTadr1-k&Tr1Ad)l(t) + b(l-ad)(3-1y.P (3.78) For stability we examine the matrix, {A + kcTad(3-1 - 6cr/r1 Ad) (3.79) Chapter 3. Deterministic Adaptive Control 46 As long as the eigenvalues of the above matrix, for some value of d, are inside the unit disk in the z-plane then the closed-loop system is stable. A is a stable matrix and its eigenvalues are always inside the stable region and not necessarily on the boundary zone. Therefore a proper choice of d can be found that will relocate the eigenvalues of the expression (3.79) inside the stable region. The choice of d has to be such as to keep the eigenvalues of the above matrix expression inside the unit disk. This condition must be met for stability. However, for sufficiently large d, and while f3 ^ 0 the second term in expression (3.79) approaches zero because by definition 0 < a < 1. The third term in expression (3.79) also approaches zero, for sufficiently large d, because the square matrix A is a lower triangular and the eigenvalues of A appear along its main diagonal. It is straightforward then to show that the powers Ad approach zero (Strang, 1976) because all the eigenvalues of A are less than one in modulus (|Aj(A)| < 1). Finally, the first term in the expression (3.79) is always, by construction, a stable matrix and thus the closed-loop system is stable. Determining the steady-state of the system is then trivial. From equa tion (3.77) and using (A*-1 H h - A) = (I - Ad), one can write, kT = cTS(A-I) Premultiplying (3.76) by <?S and using the above expression for J:7, after some manipulations one obtains, cTSl_(t + l) = cT(S-(l-ad)I)l(t) + {l-cxd)y,p (3.80) From the above equation it is obvious that the steady-state is such that y = y,p, (because lime^ \\l{t + 1) - l(t)\\ = 0). â€¢ Chapter 3. Deterministic Adaptive Control 47 Remark 4: It is worthwhile to mention here that in practice, during the simula tions, to increase d to very large values was hardly ever needed for stability, because as long as d > kd then the number N of the Laguerre filters can be always accordingly adjusted for a proper identification. And this is true for most of the process control loops encountered in practice. Of course if everything else fails then, in the above case, by increasing d to some large value, stability can always be achieved. Remark 5: Using {Ad~l -j \- /)(/ - A), = (I - Ad), one can write, f3 = cT{I- Ad){I - A)~lb When d is sufficiently large then, in the limit, we get, (3 = cT(I - A)~1b which is the static gain of the transfer function G(z) of the state-space system (A,b,cT), G(z) = cT(zI - A)~lb lim G(z) = cT(I - A)'1 b In practice the static gain of the transfer function G(s) can be computed roughly from, lim.^oG(s) = lim.^{ ^fje-iiZjELl ) = ^5 E(-l)'"1 ^ i=x {3 + p) v i=i where c< 's are the identified Laguerre gains. Remark 6: It is easy- to show that the closed-loop characteristic equation is d oo J2cTAi-1b + cT{Ad-adI)^2Ai-1q-i+1b^ 0 (3.81) t=l i=l When d = k,i and a â€” 0, the l.h.s. of the above equation is the impulse response of the plant. If it happens to be non-minimum phase, then the regulator is unstable. The best way to shift the regulator poles back inside the unit circle is to increase d. Chapter 3. Deterministic Adaptive Control 48 3.2 The Self-tuning Controller 3.2.1 A Deterministic Explicit Self-Tuner As was suggested in Zervos and Dumont (1988a), it is straightforward to design an ex plicit deterministic adaptive control scheme based on the formulation described above. In principle, other orthonormal functions could be used, although Laguerre functions prove to be a good choice. The problem of identifying on-line the Laguerre spectrum gains (i.e. the parameter vector c) is addressed by using the recursive least-squares (RLS) Identification method. Given {P(0) > ea7 > 0, c(0), 1(0), A(0)} then starting from t = 1 we compute the parameter vector at any given sampling instant by using the following equations: =^ -i}+m+7wpf%M)m ~f{t -im (3-82) p(t) = p(t -1) - :;~:p:;j:;rK;~^ (^) p{t - i)i(t)iT(t)p{t -1) \{t)+iT{t)p{t-i)i(t) where \(t) is the forgetting factor (0 < X(t) < 1) and is used to discount away past data using exponentially decaying weights when tracking slowly time-varying parameters. It is also important in the computations above for the covariance matrix to factor P(t) and update either the \JP(i) or the UD factors separately (Bierman, 1977; Ljung and Soderstrom, 1983). To include immunity against bias in the parameter identification such as those induced by offsets, the least-squares identification scheme uses increments of l(t), u(t) and y(i) instead of full values. The control law (3.68) is then computed at every sampling instant. Remark 1: Suppose, 1 ' liminf-Â£!(;)Ir(i) > e2I (3.84) 00 ^ t=i Chapter 3. Deterministic Adaptive Control 49 and \(t) = 1, then, limsup||c(f)|| < K (3.85) tâ€”*oo for some small e > 0 and some finite positive constant K. Proof: Assuming that w(t) is a uniformly bounded sequence then by some algebraic manipulations (Ydstie, Kemna, Liu, 1987) we have, "'"^"-"-(HfOT-W)^'"' (3.86) where e(t) is the prediction error defined by, e{t) = y(t)-lT(t)c{t-l) ' (3.87) and V(t) is a scalar Lyapunov function given by, ^(i) = (Â£-Â£W)rP-1(i)U-c(<)) (3.88) By summing up we get, 7^(0 < 7 EÂ«a(*) +0(1/*) (3.89) 1 1 i=l where the second term in the r.h.s. is due to the effect of non-zero initial conditions and decays as 1/t. Now using the matrix inversion lemma we can write, p-\t) = p-1(t-l)-fl(f)ir(i) =â€¢ EKO^O + ^W (3.90) i=l and from equations (3.90), (3.89) and from the assumption (3.84) we can get, 1 ' limsup||c-i(i)||2 <limsup j^u;2(i)/e (3.91) * i=l fcâ€”.oo fcâ€”*oo t â€¢_ and the result of equation (3.85) follows since w(i) was assumed to be a uniformly bounded sequence. The condition on the vector I is referred to as the persistency Chapter 3. Deterministic Adaptive Control 50 excitation condition. This is rarely satisfied in practice so in order to avoid parameter drift problem that may occur when not enough information is fed to the estimator one can turn off the estimation when there is not enough process excitation. This can be achieved by using a dead zone A with the property, -if |e(*)'| < A, A > 0 (3.92) Â£(*) = c(r-l) {. P(t) = P(t - 1) J In that case the estimation algorithm is turned off when the prediction error is small. The proper size for A is determined by the measurement noise in the system. The estimation should also be turned off if either the input or output signals hit constraints. Remark 2: Assume \(t) =1 and define, If q satisfies, Then, x(t) = 1 + lT(t)P(t -l)L{t) q' = rmnlf:(y(i)-cTl(i)r - 1 i=i v 1 V< < (3.93) (3.94) (3.95) Remark 3: If the forgetting factor is less than unity then a similar result as above holds. Suppose 0 < A(i) < A < 1, then if e Yl KO^W > el > 0 , for all t> m (3.96) iâ€”tâ€”m where m is a finite positive integer, then, and, lim sup |c(r)| < K < oo tâ€”Â»oo r 1 v e2{i) < hmsup-^â€”-<g tâ€”Â»oo t "^v'/ (3.97) (3.98) Chapter 3. Deterministic Adaptive Control 51 The Remarks 2,3, show the boundness of the normalized parameter estimation error for 0 < A < 1 and their proof techniques follow along the same lines as those presented in Ydstie, et al. (1987). The adaptive control scheme as described so far is globally convergent, as shown by the following theorem. Theorem 2 Assume that the plant is described by y(t) = cÂ£l(t), then provided that the projection or least-squares algorithm (3.82), (3.83) is used to find c(t), that dime = dimco, and that f3 ^ 0, then the indirect adaptive control scheme described above is globally convergent in the sense that i) {u(t)}, {y(t)} are bounded for all time t. ii) limt^00[y(t) - yap(t)] = 0 â€¢ Proof: Using standard arguments (Samson and Fuchs, 1981; Goodwin and Sin, 1984), the parameter adaptation scheme can be shown to be such that: 1. {c(t)} is bounded, 2. lime_oo||Â£(t)-c(t-l)|| =0, 3. There exist non-negative sequences {Â£(*)}, {^(*)} that converge to zero and such that: (3.99) Assuming, for simplicity purposes that the parameter a in equation (3.67) is zero, one can write the closed-loop system as: l(t + 1) = (A - b cTAd$~1)l(t) + bfi-\y,p + y(t) - y(t)) (3.100) Chapter 3. Deterministic Adaptive Control or l{t + I) = F{t)l(t) + v{t) (3.101) From Theorem 1, it is easy to show there for a proper choice of d the free system l_{t + 1) = F{t)l(t) is exponentially stable. With \m\\<m\0\-\M + \m--m) if for simplicity y,p .= 0, then using the properties of the adaptation scheme (equation (3.99)), we can write N<)ll<7(0IIK0ll + *(0 with T(0 = 11*11 i(t) tfr1 6(t) = II&II m \$r Because both {j(t)} and {S(t)} converge to zero, then from Theorem 2.1 in Payne (1987), {/(<)} aim" {^(<)} are bounded and converge to zero. When y.p ^ 0, {L{t)} and {v(t)} are bounded and it is trivial to show that they converge such that: lim v(t) = b0-xyap tâ€”Â»oo lim cT{t)l(t) =y,p tâ€”â€¢OO â€¢ Chapter 3. Deterministic Adaptive Control 53 3.2.2 A Deterministic Implicit Self-tuner A deterministic implicit self-tuner can also be derived using the Laguerre orthonormal set. The controller parameters are then estimated instead of the model ones. The identification would involve the model, - 'y{t)-y(t-d)=Â£l(t-d)+-Mt--d)+ .:.â€¢+fau^-l)'- (3.102) where the vector parameter gain k and the input coeffients /3j's are identified on line. The control law then is, u(t) = {yr-y(t)-kTl(t))$-l (3.103) where J3tot = f3i + ... + [3d- An example follows showing the applicability of the derived implicit scheme. 3.3 Simulation results The described adaptive self-tuning schemes based on the Laguerre series representation have been tested extensively in simulations. Some examples showing their potential ap plicability and illustrating their practicality follow. The simulations were performed on a MicroVAX-II/VMS supermicro computer using Fortran-77 and/or ACSL (Advanced Continuous Simulation Language). Example 3.1: Consider the closed-loop system 7J(tj-1) of Figure 3.7 B{q '-i + ch-'W.-) (3'104) with, _u v 1 + 0.6048Y-1 Gc{q ) = 0 3697^-i where K' = Â°-3397 (3-105) 0.0193(1 + 0.06729-1) _k G(5 ' - i + i.9048,-- -o.m*r>< (3J06) Chapter 3. Deterministic Adaptive Control y(t) Laguerre STR Figure 3.7: System to be controlled in Example 3.1 Chapter 3. Deterministic Adaptive Control 55 Figure 3.8 shows the step responses of H(q~1) (i.e from u. to y) with kj = 1, with and without noise. Note the oscillatory nature of the response as well as the load disturbance of amplitude 0.2 from time t=240. For the noisy response, an FIR noise filter with unity C polynomial has been added to corrupt the plant output. The Laguerre adaptive controller is used to control the system H(q~1) as in Figure 3.7, with N â€” 10 Laguerre filters and p = 0.1. Initial parameter estimates are zero. The initial covariance matrix is 100 x I, and the forgetting factor is 1. Figure 3.9 shows the behaviour of the adaptive controller with a prediction horizon d â€” 2 and the driver block filter time constant a = 0.5, both with and without noise. The start-up transient has a very small amplitude. Both the response to the setpoint change and the load disturbance rejection are excellent. As expected from Theorem 1 there is no steady-state offset. Figure 3.10 shows runs when the dead time kj in G{q~l) is increased from 1 to 3 sampling intervals, both with and without noise. The scheme is exactly the same as in Figure 3.9 except for d = 4 and a = 0.7. Again, a load disturbance of amplitude 0.2 was applied from time t==240. Further simulations have shown the good performance of that scheme for the regulator problem as well. Example 3.2: This time, we consider the non-minimum phase plant described by y{t) - 0.7y{t - 1) = u(t - 1) + 2.u(t - 2) (3.107) This plant was used by Clarke (1984) to demonstrate a pole placement self-tuning controller. Here, we shall use the same sequence of setpoint changes and the same commissioning period as in Clarke (1984). Figure 3.11 shows the output of the above plant tracking a square-wave setpoint when it is under Laguerre self-tuning control, started with zero initial parameter estimates, and set with d = 2 and a = 0.7, i.e. the same conditions as in Figure 3.9. The performance is very good, and compares well with that obtained by Clarke with a pole-placement self-tuner based on a model of Chapter 3. Deterministic Adaptive Control 56 3 . Q. 2.0 .'â€¢5 1.0 0.0 -0.5 -1.0 -1.5 -2.0 1 1 1 1 i i i T 1 r -V v v ^ H 1 1 i i Time in Samples 150 200 250 300 350 Â«00 Time in Somples Figure 3.8: Example 3.1: Output responses of H(q 1), (a) with and (b) without noise, kd = 1. 2.0-1.5-1.0->- 0.5-5. 0.0 -"5 o -0.5--1.0--1.5--2.0-â€¢ 150 200 250 300 350 400 Time in Samples WO is'o 200 250 300 350 Â«0C Time in Somples Figure 3.9: Example 3.1: Output responses, (a) with and (b) without noise, when H(q~l) is under Laguerre self-tuning control, kd = 1, d = 2. Chapter 3. Deterministic Adaptive Control 57 ' " . â€¢ I L [j-T 50 WO ISO 200 250 300 350 400 Time in Somples Figure 3.10: Example 3.1: Output responses, (a) with and (b) without noise, when H(q~l) is under Laguerre self-tuning control, kj, â€” 3, d = 4. exactly the same structure as the plant. However, as noted by Clarke, his scheme does not behave well in the presence of unmodelled dynamics. Indeed when applied to the plant, y{t) - 1.7y(t- 1) + 0.72y(t - 2) = 0.1u(t - 1) + 0.2u(f - 2) (3.108) the Clarke pole-placement self-tuner based on a first-order model eventually destabilizes the plant. The Laguerre self-tuner was used on this 2nd-order plant with exactly the same design parameters as with the lst-order plant. Results presented on Figure 3.12 show the excellent behaviour of this scheme. Note that Figures 3.9, 3.11 and 3.12 have all been obtained with the same Laguerre self-tuning scheme and the same initial set-up parameters, although the three plants are all different. This is an indication of the robustness of the Laguerre self-tuner. Example 3.3: The present method is limited to stable plants. It is thus interesting to see what happens when applied to a plant containing an integrator, a common 50 WO 150 200 250 300 350 400 TimÂ« in Samples 2.0-1.5 â€¢ 1.0 -0.5-O -0.5 --1.0 -1.5 -2.0 r Chapter 3. Deterministic Adaptive Control 80-70-60-50 ->-. 40-O--3 30-0 20-10-0--10 -J I I I I L. T 1 r 50 100 150 200 250 300 350:400 Time in Samples Figure 3.11: Example 3.2: System response under Laguerre self-tuning control order plant. 0 50 100 150 200 25.0 300 350 400 Time in Samples Figure 3.12: Example 3.2: System response under Laguerre self-tuning control order plant. Chapter 3. Deterrninistic Adaptive Control 59 occurrence in process control. A logical way to represent a plant with integrator is, l_{t + 1) = Al(t) + bu(t) (3.109) Ay(t) = cTl_(t) (3.110) We now assume, u(t)^0, u(t + l) = --- = u(t + d-l) = 0. The d-step ahead predictor is then, y{t + d) = y(t) + Ay(t + 1) + â€¢ â€¢ â€¢ + Ay(t + d) (3.111) y{t + d)=y(t)+Â£Tl{t)+f3u(t) (3.112) The control law is then (see equation 3.70 for definition oi di), Au(t) = (yr(t + d)-y(t)-dLTl(t))(3-1 (3.113) Compare with (3.68) and (3,70). Now, consider the plant described by, y{k) = -1.9048y(fc - 1) + 0.9048y(fc - 2) + 0.5(u(fc - 1) + 0.0672u(/fe - 2)) (3.114) This plant contains an integrator. Figure 3.13 shows a simulation run when the plant is under Laguerre self-tuning control and the output is tracking a square-wave setpoint. The Laguerre parameters used were, N = 8, p = 0.25 and d â€” 3. Good simulation results were also obtained in the range 0.05 < p < 0.5. Note that a load disturbance was introduced from t = 240 to t = 260. Example 3.4: The dynamics of an existing two-link manipulator were simulated using Paul's equations (Paul, 1981) and ACSL (Advanced Continuous Simulation Lan guage) on a DEC VAX-11/750 computer. The manipulator has two degrees of freedom Chapter 3. Deterministic Adaptive Control 60 2.0 1.5 1.0 >- 0.5' 1 0.0-O -0.5--1.0--1.5--2.0 -0 100 200 300 400 500 600 700 800 900 1000 Time in Samples Figure 3.13: Example 3.3: Laguerre self-tuning Control of a system with integrator. on the horizontal plane. Each link has a mass of lKg and length of 0.5m. All forces due to gravity, coupling inertia, centripetal acceleration and Coriolis acceleration were included in the dynamics of the arm. Two single-input/output Laguerre self-tuning controllers were implemented, one for each link. Each self-tuner controls the joint angle by the manipulation of the motor armature drive voltage. Several reference tra jectories were implemented to test the reliablity of the proposed self-tuning algorithm including desired angles of 90Â° and 270Â°, and circular and linear trajectories. Other tests involved increasing the mass at the end point of the second link (equivalent of picking up a payload) part way into the trajectory, and adding armature inductance to test the ability of the controllers to deal with an unexpected pole in the system. The controllers generally performed quite satisfactorily. The initial values and the parameter settings used for both controllers, were : N = 8, p = 2, sampling time T = 0.02.S, d = 4, a = 0.2 for the first 100 points and 0.7 subsequently. The pa rameter estimates were initialized to zero and the controllers outputs were limited to 1 1 I 1 1 1 1 1 1 : 1â€”iâ€”â€”â€”r â€¢ i Chapter 3. Deterministic Adaptive Control 61 Â±20 Volts, the maximum voltage the motors can sustain. The incremental version of the controllers was used. All the initial manipulator angles were set to 0Â°. For the particular experiment regarding the on-line increase of the payload, at t â€” 4.0a during a clockwise circular trajectory centered at (0.5,0.0) of radius 0.15, the mass at the end of the second link has been increased from 0 to lOKg to simulate the pickup of a load. The arm was still capable of tracking the reference circle (as seen from Figure 3.14). In another experiment we increased the armature inductance in both motors from lOOpH up to lOOmif to see if the unexpected poles could be handled without having to increase N or change p. For values of the inductance Lm less than lOmH the controllers continued to track well (Figure 3.15) while at lOOmH the 2-link manipulator system became eventually unstable. However by increasing the prediction horizon d to 12 the system was capable again of giving acceptable results (Figure 3.16) with a penalty on the rise time. A side benefit is the reduced overall overshoot. The results showed that tracking circles , lines and square waves proved to be no problem for the controllers. The only problems were the observed overshoot and some slight torque and controller chatter. Torque chatter was not eliminated although the armature inductor acted like a low pass filter and reduced the amplitude and frequency of the chatter. As far as the overshoot is concerned the increase of the prediction horizon d contributed toward reducing it. Example 3.5: Consider the same plant as in the Example 3.1, whose block diagram appears in Figure 3.7. The delay of the plant was set to fcj = 3. Everything else remains the same. An implicit self-tuning scheme was now applied in the place of the Laguerre-self-tuner block. The parameters used were, N = 10, p = 0.3, d = 4, a = 0.7. The response of the plant's output following a square-wave setpoint sequence is shown in Figure 3.17, and the controller's output is shown in Figure 3.18. Chapter 3. Deterministic Adaptive Control 62 8 -0.x -t.m o.ii t.B Â«.w o.n i.ao Figure 3.14: Example 3.4: Manipulator Arm tracking a circular trajectory. Payload increase, m2 = lOKgr. Figure 3.15: Example 3.4: Manipulator Arm tracking a step trajectory. Response of 2nd joint angle. Inductance increase, d = 4. Chapter 3. Deterministic Adaptive Control 63 oo <rCT-So I. .100 t.i.x'l*. 0.00 S.W 6.40 9.60 T (sec) 12.6 16.0 Figure 3.16: Example 3.4: Manipulator Arm tracking a step trajectory. Response of 1"'joint angle. Inductance increase, d = 12. 0 1000 200 400 600 800 Time in sampling points Figure 3.17: Example 3.5: Plant output following a square-wave setpoint when an implicit self-tuner was employed. / Chapter 3. Deterministic Adaptive Control 64 4 -D a o 2 -0-2-2-c o (J -4 -0 II II 200 400 600 800 1000. . Time in sampling points Figure 3.18: Example 3.5: Controller's output for the implicit self-tuning scheme. 3.4 Robustness issues Because this method does not rely on a predefined model structure with a fixed number of poles and zeros, and because it does not separate the delay from the dynamics, we expect it to be more robust than the schemes based on transfer function models. The simple analysis and the examples that follow seem to indicate that this is the case. Let the true deterministic plant be represented by the state-space equations: Xt+1 = AQx^ + b0ut (3.115) (3.116) And let the Laguerre ladder network model of the above plant be represented by the equations: lt+i = Alt + but , (3.117) yt = cTlt (3.118Chapter 3. Deterministic Adaptive Control 65 Where x and I are the state vectors respectively, not necessarily of the same order. Let the system be under self-tuning control using the (non-linear w.r.t. the identified parameter vector) predictive control law derived in section 3.1, equation (3.68), i.e. ut = {Vr ~ yt)P~l - ^Lj-1 (3.119) Where yT is the cf-steps-ahead (ci > kd) pre-defined reference trajectory as given by, yr = adyt + (1 - ad)y,p . (3.120) Where, 0 < a < 1. Using the above control law (equation (3.119) and substituting for it in equations (3.115), (3.117), we get the following set of equations respectively: 3k+l = Aoxt + Uivr - yt)P~x -bflj-1) (3-121) It+i = Alt + b{{yr-yt)p-1-tflj-1) (3.122) Substituting yt from equation (3.116) and yr from equation (3.120), the above set of equations can be written in a form to describe the closed-loop system as: ie+i A0 - (I - ad)l3-%<Â£ -bokT0-1 'to ' + . 1*. b â€¢. â€ž .x. (l-ad)fy,p -(1 - ad)0-lkÂ£ A-bk(3-1 (3.123) For stability, the A-matrix of the above closed-loop state-space description must have all of its eigenvalues inside the unit disk. If not, the closed-loop system will be unstable. Let us further assume that the output model mismatch between the true plant and the identified (modelled) one can be described by some arbitrary function, say (,{t), which has the property that it stays always well bounded for all t, i.e. |C(*)| 5: Z < oo where Z is a positive real number (Z E 3?+). The signal Â£(f) can be any bounded deterministic or stochastic signal, e.g. measurement noise, sensor drifts, modelling residual,-ate. Then we can write, yt = yt + Ct , or, \yt-yt\ = IC*I < Z (3.124) Chapter 3. Deterministic Adaptive Control 66 SU ' bo" + b /H(iCO (3.126) Expressing yt in terms of yt by using equations (3.124) and (3.118) then the closed-loop state-space description given in (3.123) can be further written as, Ao -io((l - ocd)cT +.kT)0~1 (3.125) Where 0 is an all-zero matrix of the appropriate dimensions. Now let us define the A-matrix in equation (3.125) as, Ao -feo((l-Â«d)Â£r + Ar)/?"1 0 A-b{{l-ad)cT -rk7^-1 We can now present the following theorem concerning the stability of the closed-loop system. Theorem 3 Let a stable discrete-time system be represented by the set of state-space equations (3.115),(3.116) and let it be sampled every T sees and be under predictive control law with d > kj as described in Section 3.1 (i.e. equation (3.119)). Assume that the output model mismatch between the true plant and the identified (modelled) one can be expressed by any bounded arbitrary deterministic or stochastic signal Â£(t) such that \C{t)\ < Z < oo. Then there is some prediction horizon d such that the closed-loop adaptive system remains always stable. â€¢ Proof: Is is easy to show the validity of the above statement when condition (3.124) is true by evaluating the Aci expression given by equation (3.126). Under the condition of equation (3.124) the closed-loop system can be put in state-space description as shown before by the set of expressions in equation (3.125). The stability of the overall system is then determined by the upper block-triangular matrix Aci as given by equation (3.126). Chapter 3. Deterministic Adaptive Control 67 Because of its special structure the eigenvalues of the matrix Acj are just the eigenvalues of the matrix Ao plus the eigenvalues of the matrix : Acl(2'2> - A- b({l - <xd)cT + Â£r)/T1 (3.127) Now since the true plant under study was assumed to be stable then the eigenvalues of the matrix A0 are always inside the unit disk. Besides, stan dard arguments from the proofs of Theorem 1 and Theorem 2 indicate that the matrix Aji'2'2' is also to be stable, for a proper choice of d, and have all its eigenvalues less than unity in modulus (compare equation (3.76) with (3.127)). As a result the closed-loop system remains always stable. â€¢ An illustrative example follows that makes use of the stability study described above. Example 3.6: Let the continuous-time stable plant (Rohrs et al., 1985) of the form: 2 229 Â°W = (, + !)(*â€¢ .+ 30. + 229) (3-128) be sampled very T sees. The input-output data is recursively used at every sampling step (RLS) to derive a discrete model of the plant in terms of a Laguerre orthonormal series as described in Section 2.3, and a predictive control law is then computed,as described in Section 3.1, which is applied to the plant on-line thus forming a closed-loop self-tuning system. First let the sampling time be O.laec and the reference input be sin(u;t) with u> = lrad/s. Underestimating the plant order and assuming that it is of a first order, only one Laguerre gain is estimated during the identification (N = 1,T = 0.1,p = 0.5, d = 2, a = 0.3). Figure 3.19 shows the plant output y(t) tracking the sine-wave reference input yT. Figure 3.20 shows the Bode plots of the true and identified plant respectively. Chapter 3: Deterministic Adaptive Control 68 8 8 in o ' 0.00 10.0 20.0 30.0 T (SEC) 40.0 so.o Figure 3.19: Example 3.6: N = 1,T = 0.1,d = 2. Output tracking the reference input when The identified Laguerre gain came out to be 1.45. If we evaluate the eigenvalues of the A-matrix from equation (3.123) we find out that for the above sampling frequency the system is stable. Increasing the sampling frequency to T = 0.01, while keeping everything else the same, the system becomes eventually unstable. Let us investigate more the instability mechanism when the sampling time is T = O.Olsec . According to Theorem 3.4 if the output model mismatch is bounded ( i.e. equation (3.124) is true), then there is always a prediction horizon d such that for every sampling time T the closed loop self-tuning system remains stable. In this case if we increase d we should expect system stability. Actually when the reference input is lrad/s we do get stability by increasing d. For values d > 8 the closed-loop system appears to be stable. Figure 3.21 shows the system output tracking the reference input when d = 10. Actually in the single parameter case (N = 1) the Laguerre state-space model Chapter 3. Deterministic Adaptive Control 69 Figure 3.21: Example 3.6: System output tracking the reference input when JV = 1,T = 0.01, d = 10. (The 2 curves are almost identical) Chapter 3. Deterministic Adaptive Control 70 given by the set of equations (3.117),(3.118) transforms to simple scalar expressions. The eigenvalues of the Aci matrix then can be evaluated from, A;(Aci) = \i(A0) [j \i(A - 6((1 - ad)cT + fcr)/?_1) (3.129) Since the plant under study was assumed to be stable then the eigenvalues of the first term in the r.h.s. of equation (3.129) are always inside the unit disk. The second term in the r.h.s. of the above equation is a scalar expression and its value is always less than one as shown below (note that the terms, A = exp(â€”pT) > 0 and 6, c, k are now all scalars ^ 0, and |a| < 1), A - b{(l - ctd)c + ie)/}-1 â€” I A â€” A*-ad 1 _ I Ad~l +...+A+ad I ^ 1 ~ |^ â€” | A^+.-.+A+l I Thus all the eigenvalues of the Acj matrix are inside the unit circle and the closed-loop system is stable. When the reference input u> was lrad/s stability was achieved by increasing d, because the output model mismatch was bounded. But the system appears to be unstable for any value of d if the reference input is increased tow = 16.lrad/s. When condition (3.124) is not true then the stability of the closed loop system depends on the stability of the A-matrix in equation (3.123). It can be proved that for T = 0.01 sampling time and for the particular plant of equation (3.128) the estimated Laguerre gain goes to zero (Dumont, 1988) and then the A-matrix in equation (3.123) has 2 eigenvalues outside of the unit disk, i.e the closed-loop system is unstable. The reason why the closed loop is unstable is that, for fixed N = 1 the order of identification is inadequate either to represent sufficiently the dynamics of the given plant or make the model mismatch bounded at the specified sampling frequency and at the specified reference input. A _ b((l-ai)c+c(A'l-l)) Chapter 3. Deterministic Adaptive Control 71 Figure 3.22: Example 3.6: (a) System output tracking the reference input when N = 2,T = 0.01, d = 2. (b) An enlargment portion from T = 20 to 23. (The 2 curves are almost identical.) In this case this leads to 2 possible solutions, either keep the identification error always bounded in case an a priori knowledge of the plant is available, or increase the order of the identification. By increasing the order of the estimation from 1 to 2 the system is always stable for values of sampling times 0.1 and 0.01 and for sinusoid reference inputs from 1 to 20rad/s. Figure 3.22 shows the output tracking the refer ence input and Figure 3.23 shows the bode plots of the true and the identified plant respectively (N = 2,T = 0.01,p = 0.5, d = 2,u> = 16.1). By increasing the order of the identified model, stability has been achieved. Because the low-order Laguerre gains stay practically constant during an order increase, this can be done on-line without the system going through a transient phase. Flexibility in varying the dimensions of the problem on-line without system-upset is an advantage of this new controller. Chapter 3. Deterministic Adaptive Control 72 4 to to'1 10Â° I01 Â»oa io: FREQUENCY (RAO/SECI Figure 3.23: Example 3.6: Bode plots for true (solid lines) and identified (dash lines) systems,when TV = 2,T = 0.01,d = 2. Example 3.7: Let a plant be described by the input-output equation: y(k) = 0.9979y(fc - 1) - 0.0777u(A: - 2) + e(k) - 0.618e(fc - 1) - 0.378e(A: - 2) (3.130) At the 800"* sampling interval, we suddenly switch to the following plant, y(k) = 0.934y(fc - 1) - 0.1102u(fc - 9) + e{k) - 0.559e(/fc - 1) - 0.350e(fc - 2) (3.131) where e(t) is a white noise sequence iV(0, 0.1). Figure 3.24 shows the output of the plant tracking a square wave set-point using the self-tuning scheme mentioned in Example 3.3. The parameters used were, N = 16, p = 0.8, = 10. Despite the sudden transition from one transfer function to another and despite the presence of noise the output is capable of following successfully the setpoint. Chapter 3. Deterministic Adaptive Control 73 Z3 CL IS -2. f \ V 0.00 200. 400. 000. 800. 1000. IJOQ. 1400. 1800. Z5 z s.o 2.5 0.0 -2.S -S.O 0.00 200. 400. 000. 800. 1000. 1200. 1400. ISOO. TIME IN SAMPLES Figure 3.24: Example 3.7: System output tracking the reference input (above) and controller output (below). (N = 16,p = 0.8, ci = 10, T = 1.0. At the 800th point we switch to a different plant). 3.5 Practical Aspects and Implementation 3.5.1 Choice of Laguerre filter time constant Although, as found from simulations, the choice of the parameter p used in the Laguerre ladder network is not crucial, it does influence the accuracy of the approximation of a given plant as a truncated Laguerre series. In the simulations, an extensive range of values for the parameter p was found to give acceptable adaptation performance results for a given plant. A method to optimize the parameter p that was tried in practice and found to perform very well was to store an array of plant input-output data for a period of time and then try a modified constrained Hooke-Jeeves optimization technique (Hooke and Jeeves, 1961) on them to obtain an optimum value for the parameter p by minimizing the residual error obtained from the least squares identification. The method performed very well in practice with the only drawback being the additional Chapter 3. Deterministic Adaptive Control 74 memory requirement and the computational expense involved in allowing the direct search optimization routine to converge. Since at this time no analytical method is available for the choice of the parameter p, its choice is empirical, as explained below. The ability to control the bandwidth of adaptive control schemes in order to avoid exciting unmodelled high frequencies dynamics is desirable for robustness. An inter esting feature of the Laguerre ladder network is that the first block is a first-order low-pass filter with cut-ofT frequency 1/p and the rest of the blocks are all-pass filters. This provides some filtering qualities to the Laguerre self-tuner and allows some control over its bandwidth. Thus the choice of the parameter p can be made as to have 1/p roughly around the cross-over angular velocity UJ of the plant. Moreover if a plant with a long time delay kj is to be controlled then because of an apparent similarity of the Laguerre functions to Pade approximants a suitable choice for p can be made. The Pade approximation (in Laplace transform) of a continuous time delay kd is given by, kÂ«=Â£3, (rrt) (3-132) The above representation resembles the all-pass phase-shift block chain encountered in the Laguerre Ladder Network (figure 2.2). A good choice for p would then be, p = 2n/kd-3.5.2 Number of niters The number of filters required in the representation relates primarily to the presence of underdamped modes and the time delay in the plant. The reason is that the orthonor mal filters are used to model all dynamics including the delay. For low-order plants with significant delay relative to the dominant time constant, simulations show that 5-10 filters give satisfactory results in many cases. For high-order underdamped plants Chapter 3. Deterministic Adaptive Control 75 with substantial delays the number has to increase from 10-15 filters. Of course, when the delay is not substantial, fewer filters are required. By monitoring the Laguerre spectrum or the residual error on-line, it is easy to vary the dimension of the problem by increasing or decreasing the order of the identification. 3.5.3 Choice of d and a The driver block pole relates to the desired performance and is easy to choose. The prediction horizon can be automatically altered to make sure that J3 is nonzero and that non-minimum phase zeros are not cancelled. The latter can be achieved by checking the roots of equation (3.81). A simpler method is to choose d such that /? is of the same sign as the estimated process gain, and of significant amplitude. A simple criterion can be P > ecT{I- A)-lb (3.133) where e Â« 0.5 and (I â€” A)~xb can be precomputed, as it does not depend on the estimates. Chapter 4 Stochastic Adaptive Control 4.1 Introduction The development presented in Chapter 3 concerning the formulation and test of a deterministic self-tuning scheme based on Laguerre functions will now be used to build an explicit stochastic self-tuning scheme. All real processes are corrupted with external disturbances and there is always a measurement noise involved when measuring output signals. Thus it would be good to extend the ideas presented in the previous chapter and construct a self-tuning scheme suitable for a stochastic environment. A stochastic self-tuning controller is presented here that makes use of easily understood concepts showing simplicity and flexibility while capable of achieving good and robust control. Although Laguerre functions were chosen, other orthonormal functions may be used. Some other potential sets with success were tested, as it will be shown in a subsequent chapter. The scheme presented here retains all the nice properties mentioned for the deterministic case in Chapter 3. In addition, the identified model of the external disturbances is taken in account in the implementation of the control law. Simulation results are also presented to support and demonstrate the excellent behaviour, capabilities and ease of use of the proposed algorithm. 76 Chapter 4. Stochastic Adaptive Control 77 4.2 An explicit stochastic control law Models of the physical plant and of the stochastic noise environment are constructed respectively based on the representation outlined in the previous section 2.3. This is done by modelling the deterministic part (see Figure 4.25) with time-scale p, as: l(t + 1) .= Al_(t) + bu{t) (4.134) yi{t) = cTl(t) (4.135) and the stochastic part, with time scale p', by a second network: n{t + 1) = A'n(t) +k'e(t) (4.136) yn(t) = c,rn(<) + e(t) (4.137) Where l(t) and n(t) are the N and N' -dimensional plant and noise state-vectors respectively, and e(t) = iV(0,l) white noise. The parameter vectors are defined as, cT = [cj c2... CN] and, cf1" = [c[ c'2... c'N,], respectively. Combining equations (4.135,4.137) the plant process output can be represented as, y{t) = yi(t) + yn(t) = cTl{t)-rc'Tn(t) + e{t) (4.138) Note that, A, b, A',bJ, above are a-priori known while only the Â£, c' have to be estimated online, e.g. by using a Recursive Extended Least Squares (RELS) identification method (Ljung and Soderstrom, 1983). A predictive exression will now be derived for the plant output based on the above orthonormal representation. From equation (4.138) while using equations (4.135), (4.137) we can write a (/-steps ahead predictive formula for y(t) as, y(t + d) = cTl(t + d) + cTn(t + d) + e(t + d) Chapter 4. Stochastic Adaptive Control 78 u(t) h(t) F'(s) Cl k(t) c2 Summing Circuit e(t) nx{t) Figure 4.25: Orthonormal Modelling of a stochastic system Chapter 4. Stochastic Adaptive Control 79 + y{t)-cTL{t)-c'Tn{t)-e(t) = cT{l{i + d)-l{t)] + JT[n{t + d)-n{t)} + e{t + d) - e(t) + y{t) (4.139) Now if we derive predictive expressions, based on information up to time t, for l(t + d) and n(t + d) using the same recursive method described in Section 3.1 for l(t + d), while assuming u(t) = u(t + 1) = â€¢ â€¢ â€¢ = u(t + d â€” 1) , equation (4.139) gives, y(t + d) = cT[{Ad-I)l{t)-r(Ad-1 + ----rI)bu{t)} + ^[{A" - I)n{t) + A'^b'eit) + A'd-2b'e{t + 1) + â€¢ â€¢ â€¢ + b'e(t +-.d - 1)] + e(i + d) - e(t) + y(t) (4.140) By ignoring future noise terms and using the Certainty Equivalence principle the best dâ€”steps ahead (d > &<*) predictive expression for the system output y(t) can be derived as, y(t + d\t) = cT[(Ad - I)l(t) + (Ad~l + â€¢â€¢â€¢ + I)bu(t)] + c'r(A/d-/)n(t) + (c'TA'd-1&'-l)e(t) + y(<) (4.141) If we define a prescribed reference trajectory yT(t + d) (as we did in Section 3.1) and equate it to the right-hand side of equation (4.141), we can solve for the required control input signal u(t), u(t) = [yr(t + d)- y{t)-ETl{t) - R'Tn{t) - 7c(t)] IP (4.142) where, 0 = cT{Ad-' + ... + I)k Chapter 4. Stochastic Adaptive Control 80 PrT = c?{A,d - I) The output prediction error can be computed from equations (4.140),(4.141) as, y{t + d) = y(t + d) - y{t + d) â€¢= c^[A'd-2b'e(t-rl) + --- + b'e{t + d-l)] + e{t + d) (4.143) Equation (4.143) reveals that the prediction error is a Moving Average noise sequence of order (d â€” 1). The new stochastic self-tuning algorithm makes use of equation (4.138) for recur sively identifying the parameter vectors c and <:' using an extended least-squares (RELS) identification, and equation (4.142) for the calculation of the required control input. The RELS algorithm follows the standard algorithm that has been reported before in the literature, (Ljung and Soderstrom, 1983). The control law requires also an esti mate of the noise e(t) which can be computed as a residual from the identification. To include immunity against bias terms during the identification a solution similar to the one presented in Clarke, Hodgson and Tuffs (1983) was adopted to solve the offset problem. An advantage of this technique is that an estimate of the prediction error can be computed at the same time. In particular, for the evaluation of the required noise estimate we can write, y(t) = <?l{t) +-sfra(t) + e(t) (4.144) where e(t) is an estimate of the prediction error y(t | t â€” d). The above equation (4.144) can also be written as, y(t -d) = cTl_(t -d) + c^nit -d) + e(t-d) (4.145) By subtracting equation (4.145) from (4.144) we get, y(t) = y(t -d)- e(t -d) + cTAdl(t) + c^Adnit) + e(t) (4.146) Chapter 4. Stochastic Adaptive Control 81 where A^ stands for the d - order difference operator (1 â€” q~d)- In the unknown pa rameter case the prediction error will not be available so its value must be proxied. This is usually done by computing the residuals of a previous estimation i.e. solving equation (4.146) while using the parameter estimates from the previous step. For the RELS algorithm we define the new observation z(t) to be, z{t) = y(t) - y{t - d) + e(t - d) (4.147) and the following equation is employed for the RELS, z{t) = cT Ad{t) +AdR(t) + e'(t) (4.148) where e'(t) is computed from the residuals of the identification. For the required noise estimate we use, e(t) = e'{t) - e(t) (4.149) where a filtered proxying of e{t) has been employed by using the equation, e{t) = re{t - 1) + (.1 - r)e\t) (4.150) The choice of the constant r above in the high pass filter is by no means crucial and good results can be obtained for values in the range (0, 0.999]. The value e(t) derived above is then used as the required noise estimate in the computation of the control law. 4.2.1 Stability analysis The Laguerre orthonormal network (Figure 4.25) which was used as the basic model of a stochastic dynamic system was expressed in state-space form by equations (4.135) and (4.137). Note that the control law given by equation (4.142) is also in state-feedback form. Actually the whole closed loop system can be put in a state-space form. Chapter 4. Stochastic Adaptive Control 82 Assume that the true stochastic dynamic system is represented by the following state-space equations where its deterministic part is L2[0,oo): x(t + 1) = A0x(t) + bQu(t) + Tw(t) (4.151) y{t) = cTx(t) + v(t) (4.152) where w(t) and v(t) are bounded stochastic signals and have finite covariances. And let the stochastic Laguerre ladder network model of the above plant be represented by the pair of state-space descriptions, as in Section 4.2, i.e. the deterministic part as, l{t + l) = Al_{t)+bi(t) (4.153) yi(t) = cTl(t) (4.154) and the stochastic part as, n(t + 1) = A'n{t) +k'e(t) (4.155) yn{t) = c Tn{t) + e{t) (4.156) where the state vectors, x, I, n, are not necessarily of the same order. Assume that, the system is under self-tuning control using the stochastic predictive control approach described earlier in Section 4.2. For simplicity, let a recursive extended least squares (RELS) identification technique be employed for the estimation of the parameter vectors, c. and c'. Using the certainty equivalence principle the estimates, c and c', are taken as the true ones and substituted back in the controller equation. Then all the equations that follow hold for any given discrete time t during the operation of the closed-loop self-tuning system. The controller output is given by equation (4.142), u(t) = [yr(t + d)- y(t) - ETl(t) - P'Tn(t) - 7e(t)] /0 (4.157) Chapter 4. Stochastic Adaptive Control 83 where, (3 = cT{Ad-i + ... + I)b PT = cT(Ad-I) P* = c?{A'd - I) Assume the constant /3 to be bounded from below. Substituting equation (4.157) in equations (4.151) and (4.153) we get, x(t + 1) = (Ao - ludl'W) - koÂ£.Tl(t)/0 - hE!Tn{t)ll3 - bo7e(t)/0 -bf)v{t)/f3 + rw{t) + b0yr/f3 (4.158) L{t + i) = -6^I(0//? + M-&Â£^HW-&Â£,TIL(W-M0/^ -hv{t)/0 + kyr/P (4.159) And for the noise network we can write from equation (4.155), n{t + 1) = A'nit) + b'e(t) (4.160) where e(t) using equations (4.149),(4.150), can be written as, e{t) = T{y{t)-y(t-d)) + ri{t-d)-TcT(l(t)-l(t-d)) -TsFiait) - n(t - d)) - re(t - 1) (4.161) Introducing a new state variable q(t), q(t) = e(t) - Tc%x{t) + TcTl(t) + rcTn(t) (4.162) we can rewrite for the noise estimate, e(t) = q(t) + Tc%x(t) - rÂ£rI(i) - Tc!Tn{t) (4.163) Chapter 4. Stochastic Adaptive Control 84 Substituting equation (4.163) into equations (4.158),(4.159), (4.160), we get, â€¢Sit + 1) â€¢ = â€¢ (A0 - b0cZ/P - bolTC?/(3)x(t) + {-b0PT/(3 + bolrcT/l3)l(t) H-toP^/P + +bo7rcT/f3)n(t) - bo7q(t)/(3 , -b0v{t)/f3 + Tw{t)-rb0yT/(3 (4.164) + = (-b^/P-trr^/P)ii{t) + (A-bET/P + br,r^/P)l(t)^ M-kE^IP + kjTc!T//3)n(t) --bv(t)/p+byr/0 (4.165) And for the noise state-vector we get, n(t + l) = b'Tcl"x{t) - HTCTl{t) + {A' -b'rcfT)n(t) + b'q(t) (4.166) We can also write the following expression for the noise sequence using equation (4.163), e(t) = e(t-l) + (l-r)e(t)/r = e(t-l) + (l-r)q(t)/T + (l-r)sSs.{t) - (1 - r)cTl{t) - (1 - T^nit) (4.167) Introducing a new state variable r(t) and using equation (4.167) we can write, r(t) = e(t)-(l-T)q(t)/T-(l-T)<Â£x(t) + (1 - r)cTl_{t) + (1 - r)^n(t) = e(*-l) (4.168) Solving equation (4.168) w.r.t. e(t) and back substituting we can get, r(i + l) = r{t) + {l-T)q{t)jT + {l-T)s$3.{t) - (1 - r)cTl{t) - (1 - r)c'Tn(*) (4.169) Chapter 4. Stochastic Adaptive Control 85 And finally equations (4.150),(4.162) and (4.169) give, q(t + l) = (T-l)q(t) + (T-l)TC%x(t) + {l-T)TCTl{t) â€¢ + (l-T)Ts{TR(t)-Tr{t)-+(T-l)T&z{t-d + l) + {l-T)TCTl(t-d-rl) + {l-T)Tc"n(t-d-rl) + Tq(t-d+l) -Tv(t + l) + rv(t-d+l) (4.170Now if we ignore any future noise terms , equations (4.164), (4.165), (4.166), and equations (4.169), (4.170) represent the whole closed-loop system in state-space form. The state vector of this representation is defined as, Xc,r(0 = [x(t) l(t) n(t) q(t) x(i-l) I(t-l) R(t-1) q(t - 1) â€¢â€¢â€¢x{t-d+l) l{t-d+l) n(t-d+l) q{t + d-l) r(t)] (4.171) The A-matrix (AQL) of this closed-loop state-space representation can be studied for stability purposes. The closed-loop system is stable if all its eigenvalues are inside the unit disk. The order of this matrix is, deg(AcL) = {d - 1) x (deg(^) + deg(Z) -I- deg(n) + 1) + 1 An implicit stochastic control scheme has also been derived and tested with success using the new Laguerre series representation. Its derivation follows along the same lines as described in Section 3.2.2. 4.2.2 Practical Aspects and Simulation The previously described self-tuning approach has been succesfully implemented in plant simulations using efficient and fast code algorithms. For a thorough discussion Chapter 4. Stochastic Adaptive Control 86 of the choice of the Laguerre time-scale, p, the number of filters, the horizon d and the reference trajectory yr(r), plus other discussions related to the practical aspects of the new self-tuner, the reader is referred to section 3.5.1 and to Dumont and Zervos (1986) or Zervos and Dumont (1988a). A modified Hooke-Jeeves (Hooke and Jeeves, 1961) search optimization method has been implemented to search for an optimal value of the positive real time-scale p. Plants whose impulse responses were not L2[0,oo) functions have also been tested in simulations and the self-tuner worked satisfactorily. The simulation results that follow show the good behaviour and flexibility of the stochastic scheme. Example 4.1: This example demonstrates the behaviour and applicability of the newly proposed scheme. It also demonstrates a good example on the flexibility of the choice of the Laguerre parameters. Consider the following non-minimum phase plant, y{t) = 1.5y(t - 1) - 0.7y(t - 2) -f u(t - kd) + 1.5u(t-kd-l)-\-e(t)-0.7e(t - 1) + 0.4e(<-2) + 0.25e(t-3) + 0.87e(*-4) (4.172) where, kd is the plant time-delay. Table 4.2 shows analytically the simulation runs with different choices of, the time-delay kd, the number of filters N and N', and the Laguerre time-scales p,p' respectively. The set-point was a square wave of amplitude 1 and the l5t-order filter constant of the reference trajectory yr was set to a = 0.7 in all runs. In all the simulations, the initial parameter estimates were zero, the initial covari ance matrix 100 x I, the forgetting factor 1.0, a step load-disturbance of 30% of the step change was applied at t =240 and t =280, and the noise e(t) was zero-mean white with cr = 0.1. For every simulation run, 2000 sampling points are shown, recorded after the parameter identification has converged. Because of the irregular initial transient period, one can either, (a) perform an open-loop identification first and then apply the Chapter 4. Stochastic Adaptive Control 87 Table 4.2 Kd d N P N' P' Fig. 4.26 1 2 4 0.3 4 0.1 Fig. 4.27 1 2 4 6.0 4 0.5 Fig. 4.28 1 2 8 0.1 3 0.2 Fig. 4.29 1 3 8 0.3 4 0.8 Fig. 4.30 1 6 8 0.4 2 0.5 Fig. 4.31 3 5 8 0.4 2 0.5 Fig. 4.32 3 5 8 4.0 2 0.5 Fig. 4.33 6 8 12 0.3 2 0.5 Table 4.2: Example 4.1: The choice of the various parameters during the simulation runs. control action by closing the loop, or (b) start with the loop closed but with some sat uration limits on the input to limit the output deviations, or (c) apply a control input with a commissioning period. The graphs were produced using the method (b) above starting at time â€”400 and with input limits Â±50. The purpose of the experiment was to test the steady-state performance of the stochastic self-tuner using a different and mixed choice of parameters, (see Figures, 4.26, 4.27, 4.28, for system response compar isons). Figures, 4.29, 4.30 show the flexibility on the choice of the prediction horizon d. Figures, 4.31, 4.32 show two typical runs of a plant with a moderate time-delay when only the Laguerre time-scale p of the deterministic ladder network has been changed by a magnitude of order 10. Figure 4.33 shows the performance for a plant with larger time delay. Figure 4.34 shows the output performance when the implicit scheme was applied to the same plant as in Case 8 in Table 4.2, (Kd â€” 6,d=8,N = 12,p = 0.3). The results indicate that the self-tuner performed well even with different, time-scales, number of filters, and prediction horizons. It was also capable of handling relatively large delays (Figures : 4.33, 4.34). Chapter 4. Stochastic Adaptive Control 88 to O c . o -2 A* 400 800 1200 1600 2000 Time in samples Figure 4.26: Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 1 of Table 4.2. 0 400 800 1200 Time in samples 1600 2000 Figure 4.27: Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 2 of Table 4.2. Chapter 4. Stochastic Adaptive Control 89 CL O c o 0--1-ii : r r 400 800 1200 1600 2000 Time in samples Figure 4.28: Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 3 of Table 4.2. Q. o o 0 CL_1--2 400 800 1200 1600 2000 Time in samples Figure 4.29: Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 4 of Table 4.2. Chapter 4: Stochastic Adaptive Control 90 f CH o c o 400 800 1200 Time in samples 1600 2000 Figure 4.30: Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 5 of Table 4.2. I.0H O c -2 0 400 1600 2000 800 1200 Time in samples Figure 4.31: Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 6 of Table 4.2. Chapter 4.' Stochastic Adaptive Control 91 800 1200 Time in samples 1600 2000 Figure 4.32: Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 7 of Table 4.2. 400 800 1200 Time in samples 1600 2000 Figure 4.33: Example 4.1: Explicit stochastic self-tuner. System output tracking a square wave set-point. Case 8 of Table 4.2. Chapter 4. Stochastic Adaptive Control 92 2. Time in samples Figure 4.34: Example 4.1: Implicit stochastic self-tuner. System output tracking a square wave set-point. Chapter 5 Multivariable Self-Tuning Control 5.1 Introduction The basic thrust of the work presented so far in this thesis has been the development of adaptive control schemes based on orthonormal series representation, with the advan tage of reduced a-priori knowledge, easy handling of unknown and varying time delays and non-minimum phase plants, and increased robustness in presence of unmodeled dynamics. Up to now, only single-input, single-output plants (SISO) have been consid ered. However it is straightforward to extend the adaptive controllers based on Laguerre functions previously developed (Dumont and Zervos, 1986; Zervos and Dumont, 1988a; Zervos and Dumont, 1988b) to the multivariable case. The most challenging problem in this area has been the representation of time-delays of MIMO systems via a delay matrix (Mohtadi, Shah, Clarke and 1987). The delay matrix of a MIMO system is the direct generalization of the time-delay term associated with a SISO system. This matrix characterizes the infinite zeros of the MIMO process but does not have a unique structure (Elliott and Wolovich, 1984). One particular lower triangular form of the delay matrix as defined by Wolovich and Falb (1976) is known as the interactor matrix. Many early results in MIMO adaptive control considered special classes of this delay matrix : a diagonal matrix and others required prior knowledge of the triangular interactor matrix. However, the use of orthonormal functions in adaptive control can be extended to the MIMO case so that the requirement for knowing the 93 Chapter 5. Multivariable Self-Tuning Control 94 yi(<) u2(t) Figure 5.35: Multivariable 2x2 input-output linear system. system delay matrix is completely avoided. As a result, all the problems associated with the definition of the interactor matrix are completely eliminated. This is considered to be a definite advantage in the formulation of a multivariable adaptive scheme because it adds simplicity to the design and representation of the algorithm. 5.2 Deterministic Multivariable Self-Tuning Control The development of the deterministic multivariable self-tuning controller is a direct extension of the SISO equivalent controller described in details in Section 3.1. What follows is an illustrative mathematical derivation and two simulation examples that show how the principles outlined so far in this thesis can be used in modeling a mul tivariable linear system. Let us consider, for simplicity, the 2-input, 2-output linear plant G(s) shown in Figure 5.35, typical of a paper machine headbox, where, ui(t), u2(t) are the plant inputs and yi(t), y2{t) are the plant outputs. This system can be modeled by the Laguerre ladder network shown in Figure 5.36. The same principles would however apply for any (TV x N) configuration. The following equations can describe the model equations in state-space form. Two Chapter 5. Multivariable Self-Tuning Control 95 Parameter Gain Matrix yi(0 Figure 5.36: Laguerre Ladder Network for a Multivariable 2x2 input-output linear system. Chapter 5. Multivariable Self-Tuning Control 96 different sets of Laguerre orthonormal functions have been employed, one with time-scale pi and the other one with time-scale p2. For the sake of simplicity let also assume that both sets have the same number N of functions. The first set can be described by the state-space description, and the second set by, where, Li{t+-l) = A1L1{t)+kiUi{t) Â£2(t + l) = AiLiit) + b2u2(t) L.1 â€” [^12 ll2 " * â€¢ ^l/v]r L.2 â€” [hi h2 - ' â€¢ ^2iv]r If we define the combined state vector to be, and the output vector to be, T = [yi 2/2]' then we can write, = CLit) Where the parameter gain matrix C is of the form, ^-12 c1 c1 â€¢ C1N c1 c1 L21 t-22 â€¢ â€¢ C2JV c = = di Â£-22 r2 r2 cll C12 â€¢ r2 â€¢ C1N r2 C2 c21 c22 â€¢ r2 â€¢ C2N (5.173) (5.174) (5.175) (5.176) where we used the notation, Chapter 5. Multivariable Self-Tuning Control 97 and i, j are both indices. For the structure of the lower triangular matrices Ai and A2, and the input vectors bx and b2 see Section 2.3. The parameter gain matrix C can be estimated on-line by a multivariable least-squares method. In an analogous way as outlined in Section 3.1 we can derive the predictive expressions for the state vectors and for the model plant outputs. Assuming, = Â«!(* +1) = â€¢â€¢â€¢ =ua(t-Mi - 1) u2(t) = u2(t + 1) = â€¢ â€¢ â€¢ = u2(t + d2 - 1) we can write, Li(t + d1) = A*L1{t) + {Ai*-1 + --- + !)hM*) (5-177) L2(t + d2) = AÂ£L2(t) + (Ai'-1 + â€¢ â€¢ â€¢ + I)k2u2(t) (5.178) where dx and d2 are the prediction horizons. Then the required predictive output expression for y\(t) is, yi(<Mi) = C*i(A? -I)Li(t) + Cg2(A? -I)L2(t) + Cj1(Ai1-1 + --' + I)hu1(t) + C-i2Ud2l-1 + --- + I)k2u2(t) + y1(t)) (5.179) If we define, Bn =an(At-i + --. + i)b1 B12 = C*2(Ad2>-1+ â€¢â€¢â€¢ + !% Chapter 5. Multivariable Self-Tuning Control 98 Then equation (5.179) becomes, yi(t + d1)=EnL1(t)+E^L2{t) + Bnu1(t) + B12u2{t) + y1(t)) (5.180) In the same way we can derive the predictive expression for the output y2(t) to be, y2{t + d2) = ZfMi) + E22L2(t) + B21u1(0 + B22u2{t) + y2{t)) (5.181) where, p^ciMt-n Â£22 = Â£-22 ~ I) B2l=c^Mi~1 + --- + i)h B22=Â£l2{Ad*-l + --- + I)k2 Now if we define two reference trajectories yrl and yr2, in the same way as we did in Section 3.1. and equate them to the r.h.s of equations (5.180),(5.181) respectively, we get a system of 2 equations with 2 unknowns, Ui(t), u2(t). BnUl(t) + B12u2(t) = yrl - yi(t) --Ei2L2{t) B2Xux(t) + B22u2(t) = yr2 - y2(t) - E21Li{t) - E22L2(t) Defining, A = yrl - yi{t) - EnLi{i) - ETl2L2(t) D2 = yr2 - y2(t) - E2iLi{t) - E^2L2(t) then the above system (equation (5.182)) can be solved for the unknowns Ui(t), u2(t) to give in determinant form, (5.182) t*i(*) = Bi2 D2 B22 Bn B\2 B2i B22 u2{t) = Bu Dx B2i D2 Bn Bu B2\ B22 (5.183) Chapter 5. Multivariable Self-Tuning Control 99 Wl{t) Xl{t) yi(<) 4> 3> u2(f) x2(<) w2{t) Figure 5.37: Stochastic multivariable 2x2 linear system. And these are the required control inputs to form the deterministic multivariable self-The same principles outlined in Section 4.2 for the single-input, single-output case can also be applied to derive a stochastic multivariable scheme based on the Laguerre orthonormal functions. Let us consider again for simplicity a 2 x 2 linear stochastic multivariable system as shown in Figure 5.37. Where w-i(t) and w2(t) are stochastic bounded noise sequences. Following the ideas outlined in sections 4.2 and 5.2 we can write for the deterministic tuning scheme. 5.3 Stochastic Multivariable Self-Tuning Control Chapter 5. Multivariable Self-Tuning Control 100 part of the plant, Li(t + 1) = AtLiit) + ktuiit) (5.184) L2(t + 1) = A2L2{t) .+b2u2{t) (5.185) Â£-12 ' Li ' x2 C_2i Â£-22 . (5.186) where the notation of Section 5.2 and of the Figure 5.37 was followed. The stochastic part of the plant can be expressed in an analogous way by the equations, Nx{t + 1) = A'xKx{t) + b'xex(t) (5.187). v>i{t)=G!1TKi(t)-re1(t) (5.188) and, K2(t + I) = A'2K2(t) + b!2e2{t) (5.189) w2{t) = C!2TK2{t) + e2{t) (5.190) where the notation of Section 4.2 was followed and N_{ â€” [nu n& .. .niN<\ with i ~-1,2, is respectively the noise state-vector for each network representation. The noise sequences e\(t) and e2(t) are normal white noises iV(0,l). Predictive expressions can also be derived for the outputs yi(t) and y2(t) as was described in Sections 4.2 and 5.2, that is, using equations, (5.187), (5.189), yi{i) can be written as, Viit + dr) = aUAil-I)Li(t)+Gj2(At-I)L2(t) + CSMi1-1 + â€¢â€¢â€¢ + ')Vi(') + ZuiAi1-1 + â€¢â€¢â€¢ + i)k2u2(t) + Q!xT(A'xl - I)Nx(t) + CxT(A?i-lh!x(t)ex(t) + â€¢â€¢â€¢ + h!x(t)ex(t + dx + 1)) + ex{t + dx) - ex(t) + yi(t) (5.191If we define, Chapter 5. Multivariable Self-Tuning Control 101 Bu + â€¢â€¢. + /)&! Bi2=Q\r2(At-1 + --- + I)k2 Q* =0.7(A*-I) Â£=G.?{A't-%{t)-l) Then the best prediction of yi(t + di \ t) is given by, yi{t + dy\t) = P^Mt) + PnL2(t) + Bnu^t) + Bl2u2{t) + QxKl(t)-rQ1re1(t) + y1(t) _ (5.192) where ej(i) is the proxying of the estimated noise e^t) and can be calculated in the same way as it was described in Section 4.2. In a similar way the best predictive expression for y2{t) can be obtained. y2(t + d2\t) = E21Lx(t) + Â£LM<) + B2lUl{t) â€¢+ B22u2(t) + Q2N2(t) + Q2^(t) + y2(t) (5.193) where, El = Cl(Ai> - I) E22 â€” C-V2(A27 â€” I) B2X â€” C^x(Adi~l H (- I)bx B22=al2(Af-1 + --- + I)b2 Ql = Q'2T(At -I) Chapter 5. Multivariable Self-Tuning Control 102 If two reference trajectories are defined, yri and yr2, and equate them to the r.h.s. parts of equations (5.192) and (5.193) respectively, a system of 2 equations with 2 unknowns, ui(t) and u2(t), is formed. To solve for the required control inputs, the method described in Section 5.2 can be adopted. 5.4 Simulation examples For illustrative purposes two examples follow that use the deterministic multivariable self-tuning scheme, described earlier, in a stochastic environment. The first one con trols a simple second-order multivariable 2x2 linear plant. The second discusses how the same self-tuning scheme can be used to control the headbox of a paper machine. So many researchers have simulated this process in the past using various self-tuning regulators that it has become a benchmark for testing multivariable adaptive control schemes. Example 5.1: Consider the 2x2 second-order linear stochastic multivariable plant, yi(t) = 0.2y1(t-l) + 0.1y1(f-2)+u1(t-l) + 0.8ui(* - 2) + u2(t - 2) + Wi(t) y2(t) = 0.2y2(t-l) + 0.1y2(t-2)+u1{t-l) + 0.1iii(f - 2) + u2(t - 1) + w2(t) (5.194) where the covariance matrix W of the disturbances is given by, 0.2 0.35 W = (5.195) 0.35 0.6 The deterministic multivariable Laguerre self-tuner that was applied to the above plant used, Ni = N2 = 8, the Laguerre time-scales pi = 0.1, p2 = 0.7, with prediction horizons Chapter 5. Multivariable Self-Tuning Control 25 103 > CL "3 o c _o 20 -15 -10 5 0 -5 H -10 y,(t) .U I r JplÂ»|i.w|), â€¢ y,(t) 0 200 400 600 . 800 1000 Time in sampling points 1200 1400 Figure 5.38: Example 5.1: Explicit multivariable self-tuning control of a 2 x 2 plant. System outputs tracking two respective reference trajectories. dy â€” 2, d2 = 2, and the driver block filter time constants cti â€” ct2 = 0-01. All the initial parameter estimates were zero. The initial covariance matrices for the multivariable RLS algorithm were 1000 x /, and all the forgetting factors were 1. The simulation run was performed over 1400 points starting from zero reference level for both outputs. The set-point for the first output was an upward staircase-like trajectory with step jump of +3 every 200 points. The set-point of the second output was a downward staircase-like trajectory with step jump of â€”2 every 350 points. Figure 5.38 shows the two plant outputs following their respective reference trajectories. Figure 5.39 shows the behaviour of the multivariable adaptive controller outputs for the same simulation run. Example 5.2: The headbox is a vital and very important section of a paper-machine. Figure 5.40 gives a schematic description of a headbox. Its purpose is to change the turbulent flow in the tube going into the headbox to a sheet flow out of the Chapter 5. Multivariable Self-Tuning Control 104 Time in sampling points Figure 5.39: Example 5.1: Explicit multivariable self-tuning control of a 2 x 2 plant. Controller outputs. headbox. The operation of the headbox has a significant effect on the characteristics of the produced paper. The headbox and its associated flow system is a complicated hydro-dynamical device. The most. important control problem for a headbox is to maintain constant jet velocity and to have a good dynamic behaviour when changing the headbox level. The variations are changes in stockflow and airflow into the headbox. In the present study it is assumed that the air cushion of the headbox is pressurized using a compressor and that the airflow is manipulated either through the massflow i into the headbox or through a valve at the outlet (q(t) in the Figure 5.40). The control of a paper-machine headbox is a good example of an interactive mul tivariable control system. The mathematical model equations derived from physical principles show the system to be nonlinear of second order and the obtained differen tial equations fall into the category of stiff systems. However, for small perturbations around a steady state operating point the process can be considered linear (Astrom, Chapter 5. Multivariable Self-Tuning Control Figure 5.40: Example 5.2: Headbox of a paper-machine. Chapter 5. Multivariable Self-Tuning Control 106 1972). Following the principles and the headbox prototype model specifications out lined in Astrom (1972) and Natarajan (1988) the continuous state-space linearized model can be derived in the form, -0.0115 -0.1411 m = y(t) = -0.0373 -0.5270 1.0 0.0 1.0 12.2412 0.1 0.0 0.324 0.2 x(t) u_(t) (5.196) . (5.197) where, yi(t) is the stock level y2{t) is the total head pressure Xi(t) is the stock level x2(t) is the air pad density tii(t) is the stock volume flow rate u2(t) is the air mass flow rate and the operating point was chosen to be, Vi(t) - 0.5m y2{t) = 4.3339 m H20 xi(t) = 0.5m x2{t) = 1.62Jfc5/m3 iti(<) = 1.0m3/jec u2(t) = 0.24.5kg/sec (5.198) (5.199) Chapter 5. MuJti variable Self-Tuning Control 107 This model was transformed to discrete form using a sampling interval of 1 sec. The following result was obtained, x(t + 1) 0.9908 -0.1091 -0.0288 0.5922 *(0. . + 0.0803 -0.0119 0.2505 0.1556 u(t) y(t) =â€¢ x(t) 1.0 0.0 1.0 12.2412 Eliminating x(t) and adding stochastic disturbances the following model is obtained, y^t) = .-1.583yi(i-l)- 0.5836y1(r--2) + 0.0802u!(< - 1) - 0.0749^ - 2) - 0.0119ti2(* - 1) - 0.0099u2(< - 2)+iwi(t) (5.200) y2(i) = 1.583y2(t-l)- 0.5836y2(t-2) + 3.1465u!(t - 1) - 3.1411Ul(t - 2) + 1.8927u2(t - 1) -1.81u2(t - 2) + w2(t) (5.201) where the inputs, state variables and outputs represent now changes on the operating point conditions. To get a value of the covariance matrix of the noise w(t) the following assumptions were made in the simulations: (a) A white noise perturbation on either input of the headbox system was taken to have standard error of 10% of their respective values, and (b) Measurement white noises with standard errors of 10% on the level and 10% on the total head pressure value were respectively assumed. Using the above assumptions on the noise disturbances we can solve the linear stochastic difference headbox state-space equations for the steady-state output noise covariance matrix by means of a discrete Lyapunov equation (Astrom, 1970). The solution gives, 0.011 0.043 W = E[w(t)wT{t)} = 0.043 0.3127 (5.202) Chapter 5. Multivariable Self-Tuning Control 108 The deterministic multivariable Laguerre self-tuning scheme was applied to the derived stochastic linearized headbox model as to form a closed-loop system. The following parameters were used : Number of Laguerre functions for each Laguerre network Nx = N2 = 8, Laguerre time-scales pi = 0-06 and p2 = 0.6 respectively, prediction horizons d\.â€” d2 = 2. The time constants of the output reference trajectories were ct\ = a2 = 0.7. All the initial parameters were zero. For the first 200 sees the system run on its normal operating point (see Figure 5.41) in order to allow for the estimation to obtain a model of the system. To test the system, at the 200th sec the stock level set-point asked for a positive change of 0.3m for the next 200 sees while the total head pressure set-point was kept constant at its normal operating value. At the 4:00th sec the stock level set-point returned back to its normal initial operating value. At the 600th sec the total head pressure set-point asked for a positive change of 20% of its operating value for the next 200 sees while the stock level set-point was kept to its normal operating value. Finally at the 800th sec the total head pressure set-point returned back to its normal operating value. The output responses in Figure 5.41 are indicative of the good regulation obtained on both outputs. Chapter 5. Multivariable Self-Tuning Control 109 2.0 Time in sees Figure 5.41: Example 5.2: Headbox multivariable self-tuning control. Stock level (up per curve), and Total head pressure (lower) changes. Chapter 6 An Industrial Application 6.1 Introduction This chapter presents an industrial application of one of the novel self-tuning control strategies that has been presented in this thesis. The purpose of the trial was to test a newly developed adaptive schemes on an industrial process rather than to design a controller for a particular loop. The process is typical of many in the chemical process industries in that it exhibits a long and varying time delay. The results demonstrate the applicability of this methodology in an industrial environment where increasing productivity while minimizing operational cost is an important factor. The determin istic explicit self-tuning scheme based on the complete in L2[0,oo) orthonormal set of Laguerre functions (described in detail in Chapter 3) has been applied to the control of the exit pH of the first caustic extraction stage in a bleach plant of wood pulp at a kraft mill site. The plant is modelled by an orthonormal Laguerre network put in state-space form. A simple predictive control law is proposed. Accurate assumptions about the true values of the plant order and time-delay are not needed. The new approach proved to be well suited to an industrial application because it is easy to use, it can handle time-delayed and non-minimum-phase plants, it is robust and it has been shown to be superior to any PID control that was previously used by the mill's personnel, (see, Zervos and Dumont, 1988c). 110 Chapter 6. An Industrial Application 111 6.2 Laguerre-based adaptive control of pH in an industrial bleach plant extraction stage The main objectives of bleaching are, to remove the coloring materials still present in the fibers, to increase the brightness of the pulp, and to produce a white pulp of satisfactory physical and chemical properties to make it suitable for the manufacture of tissue grade papers. Modern kraft pulp bleaching is achieved in a multi-stage plant, using expensive chemicals such as chlorine, chlorine dioxide, caustic soda and oxygen. A typical North American bleach plant consists of chlprination (C), alkaline extraction (E), chlorine dioxide bleaching (D), alkaline extraction (E) and chlorine dioxide bleach ing (D) in that sequence (CEDED) for the production of high quality pulp at low cost. Other sequences less often used include, CEHDED or OCEDED, (H stands for Hypo and 0 for Oxygen). The sequence CEDED is capable of producing pulps of very high brightness at significantly lower capital costs and is the most preferable sequence practiced in North American mills (Singh, 1979). The first alkaline extraction stage (E) of a chlorinated (C bleached) kraft pulp is of great chemical and economical importance (Axegard, 1979) and is normally the 2nd stage in the commercial multi-stage pulp bleaching, process. It substantially completes the process of the pulp purification which begins in the chlorination (C) stage. Together with other techniques, it has made possible the manufacture of stronger sulfite and sulfate pulp and paper of higher brightness. It has played a significant role in improving the pulp cleanliness and it has paid for itself by reducing the bleach demand and by producing a stable brightness in the finished pulp. It is not a bleaching stage in itself but is a continuation of the delignigication in the preceding stage. It accounts for one half or more of the CE lignification. When unbleached woodpulp arrives at the bleach plant, it still contains enough Chapter 6. An Industrial Application 112 amounts of lignin and other chromophores and encrustants. In order to remove as much of the residual lignin as feasible without damaging the pulp, the pulp is normally first chlorinated. To improve the pulp quality, a caustic extraction stage follows to minimize expenditures for more costly oxidizing chemicals by removing the alkaline soluble portion of the lignin from the woodpulp. The caustic soda reacts with chlori nated lignin, as well as with the hypochloric acid formed during chlorination. Finally, a small amount binds to the cellulose itself. Three steps are generally required following the washing of the chlorinated pulp: (a) mixing of caustic solution (sodium hydroxide) with the pulp , (b) heating to the desired temperature, and (c) retention to complete the reaction. The reaction time is usually from 50 to 100 minutes depending on the grade of the pulp to be bleached. One of the most important variables that affects the pulp quality is the pH at the end of that stage, i.e. at the exit of the first caustic extraction tower. The pH of the feed stream is around 2, while the target pH after the tower is usually between 10 and 10.5. It is of great importance both chemical and eco nomical to keep its value as more constant as possible and close to specifications (in the range 10-12). Low pH values degrade the pulp quality where large values prove to be of no substantial benefit since the cost of the additional consumed caustic is very high. Thus, one must operate this plant at minimal caustic consumption while maintaining pulp quality. A good control scheme will allow keeping the pulp pH in acceptable good levels while minimizing the consumption of sodium hydroxide. Lab tests indicate that the titration curve of the reaction displays the characteristics of a strong acid, strong base reaction (see Figure 6.42). Around the 10.2 - 10.3 pH set point significant gain changes make the control of the pH rather challenging. This difficulty is compounded by the fact that the buffering effect provided by the aqueous system may vary and by the time-varying nature of the dynamics. In particular, because of the propensity of Chapter 6. An Industrial Application 113 2I 1 1 1 Li 1 0 5 0 IS 20 25 Ctuttic tddlUon Figure 6.42: Titration curve of the caustic extraction. the flowdown tower for channelling, the dead time in the process can be highly vari able. Because, the Laguerre self-tuner is robust and efficient in presence of unknown and varying dead-times, we see this loop as a good industrial benchmark. Our main purpose is to test the Laguerre self-tuner, and compare it to the existing scheme in similar circumstances. Ideally, for this particular problem, one may want to combine this scheme with the adaptive chemical invariant technique of Waller and Gustafsson (1982), although our current knowledge of the reaction chemistry may prevent this. Figure 6.43 shows the process and instrumentation diagram of the first alkaline extraction stage of a mill's bleaching process. The industrial control scheme uses 2 PID controllers in cascade loop mode, as shown on Figure 6.44. Only the Proportional and Integral part of the PID controller are used by the mill's personnel while the Derivative term is zero. This cascade configuration is justified by the long retention time in the tower. The tuning of the internal pneumatic PI controller is relatively easy since it does not involve any long dead time. The tuning of the outer digital PI presents Chapter 6. An Industrial Application NaOH flow | 114 \pH Target PDP-11/44 Â« T9 Spent Scrubber caustic E X t T r 0 a xu c t e r i 0 n Towrr unt pJt BE 1PH2 , . ch > To Waahtrj Figure 6.43: Bleach Plant. 1*'Alkaline Extraction stage. serious problems due to the long retention time involved in the first caustic tower (40 to 70 minutes) and the inherent strong non-linearity of the loop. Figure 6.45 shows an open-loop step response of the outer loop (i.e. when the outer PI is removed and the loop is opened). The dead time is in the range of 40 to 50 minutes and the settling time 50 to 70 minutes. The dead time is thus dominant and varies as a function of the production rate and because of the propencity for channelling in the tower. Because of this, this outer loop is in manual mode more often than not. Figure 6.46 shows the tower exit pH under PI computer control, when the latter is performing at its best. Note the existence of an offset, as the setpoint is 10.2. The choice of an adaptive controller over a fixed controller for this loop is justified by the poor knowledge of the time-varying nature of the dynamics and especially of the dead time. This latter however, seriously complicates the design of an adaptive control scheme, using standard techniques. With respect to the model order, if an ARMAX model was to be used then increasing its order means change in all parameters and as a Chapter 6. An Industrial Application 115 Target pH + BE1PHS + (BE1NF) Caustic Flow PI C omputer Driven Controller PI Pneumatic Valve Controller Pulp Stock Spent scrubber caustic S team Mixing Stages Retention Tube J - Tube BE1PH Extraction Tower Exit pH BE1PH2 Figure 6.44: Block diagram of 1*' Alkaline extraction stage. Figure 6.45: pH loop. Alkaline extraction stage. Open-loop step response. Chapter 6. An Industrial Application 116 11.0 On PID control 0 240 480 720 960 . 20-SEP-u:00 (Time in samples, 3min/sample) 22-SEP-t3:S7 Figure 6.46: Tower exit pH with the outer loop always under PID control. 3 min/sample-point. result a significant transient. This is why we choose an adaptive controller based on a Laguerre series representation of the plant dynamics. The time delay is then implicitly identified as part of the Laguerre model and is not guessed as an extra parameter. Any required increase on the model order on-1he-fly will not theoretically affect the low order Laguerre gains during the identification. The algorithm was implemented in the Canadian Forest Products Ltd. Howe Sound pulp division kraft mill that produces about 670 tpd of market pulp. For the imple mentation of the adaptive controller, the outer PI was removed and the new self-tuner was applied in its place. The inner PI loop was left intact since the inner PI was an integral part of the control valve that manipulates the caustic flow and it never presented any problems. The algorithm was implemented in Fortran IV on the mill process control computer, a PDP-11/44 running under RSX-11M. The following pa rameters were chosen: sampling time T = 8 min , number of filters N = 15, Laguerre Chapter 6. An Industrial Application 117 pole p = 2.0, prediction horizon d â€¢= 9, driver block pole a = 0.5. To initialize the parameter estimate vector c, we simulated a process with a response similar to that of Figure 6.45 and used the corresponding Laguerre gains. Figure 6.47 compares, on the same graph, the performance of the new self-tuning scheme to the previously used one. The target exit pH (BE1PH2) was 10.3. The graph shows a total of 2000 points, each point representing 3 min, from September 2, 04:18 a.m, to September 6, 08:15 a.m. The new self-tuner in its final form was applied on September 4, 11:32 a.m. (1106th point on the graph). The initial transient period of the Laguerre self-tuner, clearly shown on the graph, indicates the adaptation period to the dynamics of the plant. The period that follows is indicative of the good regulation performance of the self-tuner. The time period between the 684th and 792"* point on the graph (i.e. September 3, 14:30 - 16:18) was a short experimental test of the new self-tuning algorithm based on zero initial pa rameter estimates. Figure 6.48 shows a step response of the identified model using the identified Laguerre gains as recorded at September 4, 20:45 p.m. The 15 gains are given in Table 6.3. Figure 6.49 shows the output u of the self-tuning controller (BE1PHS), Laguerre Gains 1 -3.822E-04 6 -0.181398 11 -0.14379590 2 1.4819E-03 7 -1.167197 12 -9.2454E-02 3 7.8450E-04 8 -2.271191 13 -2.1657E-02 4 1.1495E-02 9 -0.939344 14 -2.1010E-02 5 2.1095E-02 10 -0.640596 15 5.83940E-03 Table 6.3: The 15 Laguerre gains as recorded at September 4, 20:45. i.e. the setpoint for the inner loop. Some of the flat leveled portions of this variable in the first half of this plot represent manual control by the bleach plant operators in their effort to control efficiently the exit pH by combining both computer and manual control. Figure 6.50 shows the caustic (NaOH) flow (BE1NF) as it was manipulated Chapter 6. An Industrial Application 118 by the inner PI controller. Figure 6.51 shows the pH obtained from a pH-probe inside and near the entrance of the J-Tube (BE1PH). The results clearly show the superior performance of the new self-tuning scheme and its excellent regulation capabilities despite disturbances caused by the first chlorination stage, by pulp stock flow, and by the additive spent scrubber caustic (mainly sodium hypochlorite (NaOCl) and NaOH) and oxygen flows. The long-term performance of the new self-tuning scheme was also tested by leaving the loop under adaptive control for a period of over 6 months. Fig ure 6.52 presents a typical 2-day run (960 points) for the period 28-30 November, 28 1987. Figure 6.53 compares the autocorrelations obtained for the pH output between the loop under manual/PID control (0-1105 points on Figure 6.47) and the loop under self-tuning control (Figure 6.52). A disandvantage of the PID controller is that in order to stay at a good level of performance, it has to be retuned periodically. In addition, the pH probes have to periodically cleaned or replaced, thus resulting in changes in process gains requiring retuning of the PID controller. A significant benefit of the adaptive controller for the mill, is that probes can be replaced and cleaned with no requirement for retuning, as the adaptive controller will automatically adjust its parameters to the new conditions. A major advantage of the Laguerre self-tuner is that it is easy to use and requires very little a-priori knowledge. Indeed, once the software was ported to the mill process computer, the scheme was commisioned in less than two working days. The purpose of this work was to demonstrate the potential of the Laguerre self-tuner in an industrial setting, not to deliver a new pH control loop to the mill. However, due to these successful tests the algorithm has been left in operation. As the current software was not written for continuous industrial operation, it has to be modified slightly. In particular, the usual jacketting for long-term operation has to be included. Also, the operators need training with the new system. Indeed, some of them not used to see Chapter 6. An Industrial Application 119 Self-tuner start 4-SEP-11:32 500 1000 1500 (Time in samples, 3min/sample) 2000 e-SEP-B:lS Figure 6.47: pH loop. Comparison of regulation performances. 3 min/sample-point. an active controller switch to manual control when the feel the controller is taking too much control action. A generic version of the algorithm would be very useful for use as a general-purpose controller for difficult loops in other parts of the mill. Chapter 6. An industrial application 15-9-Time in Hours Figure 6.48: Step response of identified p.ff-loop. 8min/sample-point. Â£15 10.9 $ W.H 1 1 , h 0 500 1000 1500 2000 2-SEP-4:1S 6-SEP-B:1S Figure 6.49: Self-tuner output in pH values. 3 min/sample-point. Chapter 6. An industrial application 121 2~SEP-4:1B (Time in samples, 3min/sample) s-SEP-8:ts Figure 6.50: Alkaline extraction stage. Caustic flow. 3 min/sample-point. 11.0 Z-SEP-4-.18 (Time in samples, 3min/sample) 6-SEP-B:is Figure 6.51: Alkaline extraction stage. J-Tube exit pH. 3 min/sample-point. Chapter 6. An industrial application _i__ ' i - i i i Q 122 T -1 1 1â€” 1 T momomomo m m â€¢<*â€¢ â€¢>*â€¢ to K) CM CM OOOUDTJ-CMOOOIO-^-CN ^ooo.ooo>o>o>o> (,_0ix) Hd Mxa 3Hdl38 i r o o o o m o II o o WdOSn -'Â«0|; >po}s JS88 (,_0lx) Hd nnd^no jaiioj^uoQ SHdL3S Figure 6.52: Alkaline extraction stage. Performance over the period 28-30 November, 1987, (3 min/sample-point). Chapter 6. An Industrial Application 123 0 20 40 60 80 100 120 Time in 3min samples Figure 6.53: Autocorrelation comparisons between the PID/Manual and Self-tuner performance on the pH loop. Chapter 7 Using other orthonormal sets 7.1 A modified Laguerre set So far the approach to solving the adaptive self-tuning control problem using orthonor mal functions has dealt mainly with Laguerre functions. Laguerre functions proved to be quite suitable for the identification of linear dynamical systems and for the develop ment of self-tuning control strategies. However, the method is not at all restrictive and other orthonormal functions can be used. Laguerre proved to be a good candidate for implementing self-tuning control strategies because of their efficient way of handling time delays and transient signals. As an extension to this well-proven orthonormal set it is important to study the location of the poles of those functions in the frequency domain. By inspection, the poles of the Laguerre functions in the s-domain are all real and lie at the point â€”p. An immediate modification would be to have the poles lie at different real locations, â€”px, â€”p2, â€”pn â€¢ FÂ°r simplicity, these poles could be located in equally-spaced points on the negative real axis between 2 boundary points. Then the Laplace transform of the nth such function would be, (Kautz, 1954), , I (3-Pi) (3-P2) â€¢â€¢â€¢â€¢ (*-Pn-i)'" Fn(s) = pVn (7.203) (S+Pl) (3+P2) â€¢â€¢â€¢ (3+Pâ€ž_i) (3+pn) Such a set of orthonormal functions could be represented by the Ladder Network of Figure 7.54. Note that in contrast with the Laguerre Ladder Network (Figure 2.2 the all-pass phase-shift chain is now a lead-lag chain. 124 Chapter 7. Using other orthonormal sets 125 u(t) kit) >+p\ V Pl (*+PJ) Pn-1 (Â«+Pn) MO 7*1 ^2 v(0 Summing Circuit Figure 7.54: Modified Laguerre Ladder Network. Chapter 7. Using other orthonormal sets 126 It will be noted that the zeros of each of these functions is located at the negatives of the poles except for the new pole not present in the previous function. Expanding each function into partial fractions and performing an inverse Laplace transform we get, Mt) = Eline~Pit (7.204) Â»=i . . â€¢ â€¢ where jin is the (real) residue in the pole at â€”pt- of the Fn(.s). Applying the same technique as in Sections 2.2.4 and 2.3 we can represent the orthonormal Ladder Network of Figure 7.54 in state-space form. In particular, defining the N-dimensional state vector l(t) as, lT(t) = [h(t) l2{t) ... lN(t) } ' (7.205) this state-space formulation has now the form, l(t + 1) = Al_{t) + bu(t) (7.206) A is again a lower triangular N x N matrix where the same elements are found respec tively across the diagonal or every subdiagonal. If T is the sampling period then, n 0 â€¢â€¢â€¢ â€¢â€¢â€¢ 0 P2T-^r^ r2 ... ... o A = _(a2Â»UL2/nULiM) TlL Pi â€¢â€¢â€¢ P2T-^ rn (7.207) and f = it: {t/Tfato--- d/r^-^nL^nL^] (7.208) where, Ti = e~PiT Chapter 7. Using other orthonormal sets 127 â€¢ /pTT pi = T + {pi.1+pi)(ri-l)/(pi_1pi) = -TT{ -{Pi-l + Pi){Ti- l)/{Pi-lPi) (= V^piC1 -TI)/PI The advantage of using such an orthonormal set of functions is that one could specify a range on the negative real axis for the location of the real poles pi instead of just a single point. This will in effect provide wider coverage on the assumption of the dominant time-constant of an unknown plant when starting the identification. The development of output predictive expressions and self-tuning schemes, either deterministic, or stochastic, based on the above set follow exactly the same procedures outlined for the Laguerre set in Chapters 3, 4, respectively. Multivariable schemes follow exactly the procedures outlined in Chapter 5. 7.2 A set with discrete complex exponentials In dealing with the problem of signal analysis, one set of very useful component func tions is the orthonormal exponential functions. Previous studies have concentrated mostly, on continuous exponentials with real exponents. The work so far in this thesis emphasized mostly exponential functions with real exponents because of their simplic ity. The motivation to develop a new set with complex poles is twofold. The first is to reduce the number of filters required for the identification of underdamped systems. This is particularly important for parsimonious identification of multivariable systems that exhibit underdamped oscillations in their response. Second, according to studies on signal representation (Young and Huggins, 1962), for nearly all classes of signals the exponents of an optimum least-squares representation have turned out to be complex. Chapter 7. Using other orthonormal sets 128 As a result, we shall devote our effort in this section toward the derivation of iden tification and control schemes based on discrete exponential functions with complex exponents. The Z-transforms of continuous orthonormal exponentials are not themselves or thogonal in Z-domain. To avoid this difficulty, we choose at the outset, discrete basis functions which are orthogonal in the z-domain and have poles in the z-domain cor responding to the s-domain poles of the continuous orthonormal exponentials. The zeros are different, however, although they are chosen in such a way that as the sam pling interval approaches zero, the chosen basis functions will approach the s-domain orthonormal exponentials (Young and Huggins, 1962). Given a set of exponential func tions with poles at â€”pkÂ±jqk, {pk > 0), a set of orthonormal exponential functions may be constructed in the frequency domain as follows, F^3) - b^(s> + aks+0k) S 7-7Tâ€”TW) (?-209) FM-bÂ»(s> + aks + A)S(*Â» + Â«,-+/*) (7,210) where, 3k = -pk + jqk, smk = -Pk - jqk ak = 2pfe, fa = p\ + ql i.e. the zeros of the polynomial (s2 + ak3 -f (3k) are: â€” pk Â± jqk. And the constants b'{ are the normalization constants. The zeros 7! can be chosen rather arbitrarily under the restriction of orthogonality, 2lTj IZo F'2^F2k^d3 = 0 (7-211) which in our case is equivalent to: j^k-ilu = Pk- (Note that: "*" stands for complex conjugate). As we mentioned before orthogonality in the s-domain does not yield Chapter 7. Using other orthonormal sets 129 orthogonality in the z-domain representatives of these continuous functions. Therefore, we would be more interested in deriving a discrete orthonormal set of exponential functions with poles in the z-domain related to the poles in the s-domain in such a way that, Zk = e'kT = e{-Pk+jqk)T Generally speaking, picking N pairs of s-plane complex poles (sfc, sÂ£) then we can construct a discrete set of orthonormal functions as follows, )" ^(i - *r')<i - S i{ (i - - Â«VÂ») (7-212) FÂ»{4-*)^*Â»(, ^.y'l _n T1* (wis) (1 -zkq ^(l -zkq l) Â£ where the 7,- satisfy the orthogonality condition, ^Tj>F:{q-')Fj{q)dz/z = % i^j (7.214) and the 6; satisfy the normality condition, ^fF;(q-1)Fi(q)dz/z = l (7.215) The contour of integration was taken along the unit circle. In that way as the sam pling interval T approaches zero, the discrete orthonormal exponentials approach the ordinary continuous exponential functions. From equation (7.214) we can derive the following expression for the 71, 72fc-l(*2fc-l + Ztk-l) ~ (1 + Z2k-\Z2k-\) ,791M 72* = 77â€” -, x jz â€”I \ (7.216) 72fc-l(l + Z2k-lZ2k-l) - KZ2k-l + z2k-l) and from equation (7.215) we can derive the following expression for the Â£>,-, (1 - Z.-Zt)(l - 2?)(1 - z?) b2 = T 3â€” 3â€” (7 217) * (i + 7,2)(i + ^;)-27i(^ + 2;) [ ] Chapter 7. Using other orthonormal sets 130 where j = integer quotient of[(i + l)/2]. One advantage of orthonormal exponentials is the relative simplicity in constructing an orthonormal filter by cascading a number of filter sections as shown in Figure 7.55. Each filter Ui{q~l) in Figure 7.55 is a unitary operator and Xi(f) is its output. The Ui are of the form, .... (*-Â«-')(<-r1) % ) = (.-4--Ki-^) (7-218) and the functions Li are given by the formula, where j = integer quotient of[(z + l)/2]. The discrete zeros (7,) and poles (z^ are computed from their s-plane counterparts. To simplify the choice of the (s-plane) zeros and poles a rather simple procedure is suggested where a semi-circular array of poles with equidistant real-part spacing is constructed. This requires only the radius of the LHP semi-circle. The real zeros of the odd-numbered filters have the same real part as the correspondent poles of the associated set and the zeros of the even-numbered functions are simply calculated from equation (7.216). If the number N of filters is odd then the last zero is the negative real part (Le mirror image) of the real part of corresponding complex pole. It will be recalled that a semi-circular array of poles has proved useful for the reproduction of signal irregularities and discontinuities (Kautz, 1954). The outputs Xfe from the unitary operators in Figure 7.55 can be expressed using the formula, Xk(t) = V'2*-i,iÂ«fc(< - 1) + i>2k-i,2Xk(t - 2) k-i + X!(-l)*_,{V'2i+3,2V'2t+5,2 â€¢ â€¢'^-1,2 [(^+1,2^-1,1 4" V^t+l.l )Xi(t - 1) t=l ~ (1 - ^21+1,2^21-1,2)Zi(* ~ 2)]} + (-l)^2fc_i,2 â€¢ â€¢ â€¢ ^3,2[^i,2Â«(0 + rpiM* ~ 1) " u(* - 2)] (7.220) Chapter 7. Using other orthonormal sets 131 u Uliq-1) U2(q-1) h(t) Hq-1) l2(t) Mq~l) X2(t) Stf-l(l) Figure 7.55: Ladder Network for the orthonormal set of functions with complex poles. Chapter 7. Using other orthonormal sets 132 where, V'.a = zj + zj , i>i,2 = -ZjZj , (7.221) where j = integer quotient of[(i-+ l)/2]. Predictive expressions can now be derived for the outputs (see Figure 7.55) based on predictive expressions for x;. We can derive (in the same way as it was described in Chapter 3) the general formula fot the d-step ahead predictive expression of the outputs l{. As an example the predictive expressions for the first two functions (i=l,2) are, l{{t + d) = IVii + â€”Tjâ€”Wn Vi2 + 7T. Wu Vi2 1! rtl â„¢ 2! 4! , (c*-4)(<Â£- 5)(d-6l^?. v, .. _ u(t _ 1)} (7_222) 3! A predictive expression for the output y(t) can then be derived based on the pre dictive expressions of the functions Zj, (i = l,...,iV). In general terms this could be expressed as, y(t + d) = y{h(t),.. .,lN(t),h(t - 1),... ,lN(t - l),u(t),u(t - 1)) (7.223) Defining a reference trajectory in the same way as we did in Chapter 3 and equating it to the function in the r.h.s. of the above equation then the required control input can be computed in order to complete the self-tuning closed-loop scheme, u{t) = U {yr{t + d),y{t),u{t),u{t - 1), ^(0, â€¢ â€¢ â€¢, M0> W - 1). â€¢ â€¢ â€¢ > M* - !)) (7-224) Chapter 7. Using other orthonormal sets 133 The example that follows shows simulation results that illustrate the use of this or thonormal set with complex poles for identification purposes. Example 7.1: Consider the 2nd order underdamped non-minimum phase plant of the form, G[q )==(i-g- + o.72g-)9 (7-225) Measurement noise of cr.'= 0.1 was added to the output and then an open-loop iden tification experiment was performed by injecting 3 PRBS of 64 points to the input. The purpose of the identification was to evaluate the set with complex exponentials and compare it with the regular Laguerre set. Both sets performed well, and as ex pected the complex set used less filters (6 instead of 12) to achieve the same identifica tion accuracy. This is advantageous especially when the plant's response is oscillatory or when implementing multivariable schemes of underdamped systems. Figure 7.56 (N = 12,p = 0.7,a = 0.7) and Figure 7.57 {N = 6, Radius = 0.9,a = 0.7) show the step responses in both cases and compare them with the plant's true one. Fig ure 7.58 shows the comparison between the obtained Bode plots of the true plant and the identified one when using the set of complex exponentials. It is worth-while to mention here that the complex set performed also well on identifying plants with overdamped responses and on plants exhibiting rather long time delays. Chapter 7. Using other orthonormal sets 134 0. 3. 10. 10. ao. 23. 30. 33. 40. TIME (SECS) Figure 7.56: Example 7.1: Step-response comparison of the true plant (solid) and the identified one (dash line) using the Laguerre set (N â€” 12). a. ( 1 1 1 1 1 1 1 1 0. S. 10. IS. 20. 25. 30. 35. 40. TIME (SECS) Figure 7.57: Example 7.1: Step-response comparison of the true plant (solid) and the identified one (dash line) using the Complex set (JV = 6). Chapter 7. Using other orthonormal sets 135 Figure 7.58: Example 7.1: Bode-plot comparison of the true plant (solid) and the identified one (dash line) using the Complex set (N = 6). Chapter 8 Conclusions In this thesis a new approach was taken to the self-tuning problem. The usual AR-MAX representation of a dynamical system was abandoned for a representation by an orthonormal series. The simple orthonormal Laguerre Ladder Network was first used for the derivation of these new self-tuning schemes. They proved to be robust, simple to use, not critical in initial parameter settings and capable of producing good control. Stability results have been obtained for the deterministic explicit self- tuning models and for some stochastic schemes. Deterministic, stochastic, single-input-single-output and multivariable schemes have been derived and were extensively tested on simulations. The proposed control schemes were designed using easily understood con cepts, required minimal a-priori information, and proved capable of coping with some of the problems usually found in an industrial environment. They showed advantages of simplicity and flexibility while capable of achieving good control performance. In vestigation has shown that the case is not at all restrictive and other orthonormal functions can also be used, although Laguerre functions proved to be a good choice for systems exhibiting time-delays and transient-signal responses. Some further examples were given based on a modified Laguerre set of functions and on a set of functions with complex exponential poles. Both these latter sets performed well and showed good identification capabilities. An industrial application was presented. One of these newly developed self-tuning schemes was tested on a real industrial bleach plant. The new self-tuner behaved well 136 Chapter 8. Conclusions 137 and it provided good control to a non-linear pH loop that exhibited a variable lengthy dead time. The results were well received by the mill's personnel because they meant a better loop performance to the bleach plant operators and process engineers along with substantial savings on the operational costs to the management. The new self-tuner proved to be robust, simple to use, capable of handling time delays and non-minimum phase plants, able to reject disturbances, and required minimal a priori information. The developed schemes in this thesis are only good for stable plants. The numerical properties of the algorithms (implemented in single-precision), proved to be sound for a proper choice of p and T and for N < 16. The orthonormal sets that were reported in this dissertation provided good control for a certain class of systems but some other sets may be used or derived depending on the type of applications. Other control laws (e.g. state space methods) may be also tried out. An advantage of the techniques presented is that by adding an external white noise to the control input then the identification gives unbiased estimates even if the output disturbance is correlated noise. A problem that was found common with the ARMAX-based self-tuners related to the sometimes irregular initial transient period, i.e. before the identification converged. It was found that the value of the constant a of the reference trajectory could be adjusted accordingly to correct some of these problems. Further research could be undertaken towards in-depth investigation of the theo retical properties of the algorithms and to present analytical results on their behaviour when compared with other existing schemes. From the application point of view a more rugged version of these control schemes can be developed as part of an expert-based system with main objectives being to simplify the application to a wide variety of pro cesses, minimize processor load and memory requirements, handle bumpless transfer from manual to auto, and handle large process disturbances smoothly. Bibliography [1] Akaike H. (1974), "A new look at the statistical model identification", IEEE Trans. Auto. Control, Vol. AC-19, p.716. [2] Anderson B.D.O. and Moore J.B., (1971), "Linear Optimal Control", Prentice-Hall, N.J. [3] Astrom, K.J., (1970), "Introduction to stochastic control theory", Academic Press, N.Y. [4] Astrom, K.J., (1972), "P rocess control in the pulp and paper industry. Notes from a course given in the Dept. of Auto. Control, Lund University, TFRT-3124. [5] Astrom, K.J., (1980a), "Design principles for self-tuning regulators", Intern. Sym posium on Adaptive Systems, Ruhr University, Bochum, Germany. [6] Astrom, K.J., (1980b), "Self-tuning regulators", in Applications of Adaptive Con trol, ed. K.S. Narendra and R.V. Monopoly, Academic Press, N.Y. [7] Astrom, K.J., (1981), "Theory and applications of adaptive control", IFAC Congress, Kyoto, Japan. [8] Astrom, K.J., (1983), "Theory and applications of adaptive control: a survey", Automatica, vol 19, pp. 471-486. [9] Ast rom, K.J. and B. Wittenmark, (1973), "On self-tuning regulators", Automatica, vol. 9, pp. 185-199. 138 Bi bliography 139 [10] Ast rom, K.J. and B. Wittenmark, (1980), "Self-Tuning controllers based on pole-zero placement", Proc. IEE, vol. 127, p.120. [11] Athans M., (1971), "Linear-Quadratic-Gaussian control system design", IEEE Trans. Auto. Control, vol. AC-16, p.529. [12] Axegard P. (1979), "Kinetics of Alkaline bleaching for the kraft CE sequence", SvenskPapperstidning, vol. 12, 361-367. [13] Bartlett M.S. (1955), "Stochastic Processes". Cambridge University Press, Cam bridge, England. [14] Bendat J.S. and Piersol A.G. (1966), "Measurement and Analysis of Random Data", John Wiley, N.Y. [15] Bengtsson G. and Egardt B., (1984), "Experiences with self-tuning control in the process industry", Proc. 9th IFAC World Congress, Budapest, Hungary. [16] Bierman G.J., (1977), "Factorization Methods for Discrete Sequential Estimation", Academic Press, N.Y. [17] Bohn E.V. , (1982), "Estimation of continuous-time linear system parameters from periodic data", Automatica, vol.18, 2, pp.27-36. [18] Borisson U. (1979), "Self-tuning regulators for a class of multivariable systems", Automatica, vol. 15, p.209. [19] Box G.P. and Jenkins G.M. (1976), "Time Series Analysis Forecasting and Con trol", Holden-Day, CA. [20] Chang R.Y. and Wang M.L., (1985), International Journal of Systems Science, vol. 16, p.1431. Bibliography 140 [21] Chow P.E.K. and Davies A.C. (1964), "The synthesis of Cyclic Code Generators", Electronic Engineering, Vol. April, pp.253-259. [22] Chen CF. and Hsiao C.H., (1975), Intern. Journal Systems Science, vol 6, p.833. [23] Clarke, D.W. (1984), "Self-tuning control of nonminimum-phase systems", Auto matica, vol. 20, pp. 501-517. [24] Clarke, D.W. and P.J. Gawthrop, (1975), "A self-tuning controller", Proc. Inst. Elec. Eng., vol 122, pp.929-934. [25] Clarke D.W., Hogdson A.J.F., Tuffs P.S. , (1983), "Offset problem and k-incremental predictors in self-tuning control", Proceedings IEE, Vol. 130, Pt. D, 5, p.217. [26] Clarke, D.W., C. Mohtadi and P.S. Tuffs, (1987), ".Generalized predictive control-Part I. The basic algorithm", Automatica, vol.23, pp.137-148. Also as Oxford Univ. OUEL Techn. Report 1555, 1557/84. [27] Corrington M.S. ,(1973), I.E.E.E. Trans. Circuit theory, vol. 20,p.470. [28] Dahlin E.B. (1968), "Designing and Tuning Digital controllers", Part 1,2, Instrum. and Control Systems, vol. 7, p.125. [29] Davison E.J., (1976), "The robust control of a servomechanism problem for linear time-invariant multivariable systems", IEEE Trans. Auto. Control, vol. AC-21, pp.25-34. [30] Dugard L., Goodwin G.C., Xianya X. , (1984), "The role of the interacor matrix in multivariable stochastic systems", Automatica, vol.20, 5, pp.701-709. Bibliography 141 [31] Dumont G.A, (1988), "On the stability of the Rohrs example", personal commu nication. [32] Dumont G.A, Martin-Sanchez J.M., Zervos CO, (1988), "Comparison of an Auto-tuned PID Regulator and an Adaptive Control System on an Industrial Bleach Plant", to appear in Automatica Journal. [33] Dumont G.A, Zervos CC, Belanger P.R., (1984), "Automatic Tuning of Industrial PID Controllers'', Technical Report PPR-505, Pulp and Paper Research Institute of Canada, Pointe-Claire,PQ. [34] Dumont G.A, Zervos CC, Belanger P.R., (1985), "Automatic PID Controller Tuning: Industrial results", American Control Conference (ACC), Boston, MA. [35] Dumont G.A. and Zervos CC, (1986), "Adaptive Controllers based on Orthonor mal Series Representation", 2nd IFAC Workshop on Adaptive Systems in Control and Signal Processing, Lund, Sweden. [36] Egardt B., (1980), IEEE Trans. Auto. Control, Vol. AC-25, p.693. [37] Elliot H., (1982), "Direct adaptive pole placement with application to non-minimum phase systems", IEEE Trans. Auto. Control, vol. AC-27, p. 720. [38] Elliott H. and Wolovich W.A. (1982), "A parameter adaptive control structure for linear multivariable systems", IEEE Trans. Auto. Control, vol. AC-27, p.340. [39] Elliott H. and Wolovich W.A. (1984), "Parametrization issues in multivariable adaptive control", Automatica, vol.20, 5, pp.533-545. [40] Eykhoff P., (1964), "Process Parameter Estimation", in Progress in Control Engi neering, ed. MacMillan R.H., Academic Press, N.Y. Bibliography 142 [41] Feldbaum A.A. (1960), "Dual control theory", Auto mn and Remote Control, vol.21, p.874. [42] Feldbaum A.A. (1961), ibid, vol.22, p.109. [43] Francis B.A. and Wonham W. M. , (1975), "The internal model principle for linear multivariable regulators", Jrnl Applied Math. Optim., vol.2, pp. 170-194. [44] Goodwin G.C. and Dugard L. (1983), "Stochastic adaptive control with known and unknown interactor matrices", IFAC Workshop on Adaptive Systems in control, San Francisco, CA. [45] Goodwin G.C., McGinnis B.C., Wang J.C. (1982), "Model reference adaptive con trol for systems having non^square transfer functions", Proc. IEEE, CDC, Orlando, FLA. [46] Goodwin G.C, Ramadge P.J., Caines P.E. (1982), "Discrete time stochastic adap tive control", SIAM, Jnl Control and Optimization, vol. 19, 6, p.829. [47] Grimble M.J. (1984), "LQG self-tuning controllers", Automatica, vol.20, p.661. [48] Grimble M.J. (1987), "H,*,- robust controller for self-tuning control applications. Part II : Self-tuners and Stability", Intern. Jnl of Control, vol. 46, No.5 , p.1819. [49] Grimble M.J., Moir T.J. (1983), "Multivariable weighted minimum variance self-tuning controllers", Preprints of IFAC Workshop on Adaptive Control and Signal Processing, San Francisco, CA. [50] Goodwin G.C. and Sin K.S., (1984), "Adaptive filtering prediction and control", Prentice-Hall Inc, N.J. [51] Jury I.E.,(1958), "Sampled-data Control Systems", J. Wiley and sons, London. Bibliography 143 [52] Hooke R., Jeeves T.A., (1961), "Direct Search Solution of Numerical and Statisti cal Problems", /. Assoc. Comp. Mach., Vol. 8, pp. 212-229. [53] Hoopes H.S., Hawk W.M, Lewis R.C. (1983), "A self-tuning controller", ISA Trans. , vol.22:3, pp.48-58. [54] Horng I.R. and Ho S.J., (1985), "Optimal control using discrete Laguerre polyno mials", Intern. J. Control, vol.41, 6, pp.1613-1619. [55] Horng I.R. and Ho S.J., (1986), "Discrete Walsh polynomials in the optimal control of linear digital systems", Intern. Journal of Control, vol. 43-2, pp.615-627. [56] Hwang R.Y., Shih Y.P., (1983), "Combined methods for model reduction via dis crete Laguerre polynomials", Intern. J. Control, vol.37, 3, pp.615-622. [57] Ionescu T. and Monopoli R.V. (1977), "Discrete model reference adaptive control", Automatica, vol.13, p.156. [58] Jazwinski A.H. (1970), "Stochastic Process and Filtering Theory", Academic Press, N.Y. [59] Kak S. , (1974), I.E.E.E. Systems, Man, Cybernetics, vol. 4, p.399. [60] Kalman, R.E., (1958), "Design of a self-optimizing control system", Trans. ASME, vol 80, pp. 468-478. [61] Kautz W.H. , (1954), "Transient synthesis in the time domain", IRE Trans. Circuit Theory, September, pp.29-39. [62] Keviczky L., Kumar K.S.P. (1981), "Multivariable self-tuning regulator with gen eralized cost-function", Intern. Jnl of Control, vol.33, p.913. Bibliography 144 [63] King R.E., Paraskevopoulos P.N. (1977), "Digital Laguerre filters", Circuit Theory and Appls., 5, 81-91. [64] King R.E., Paraskevopoulos P.N. (1979), "Parametric identification of discrete-time SISO systems", Intern. J. Control, vol.30, 6, pp.1023-1029. [65] Koivo H.N. (1980), "A Mimo self-tuning controller", Automatica, vol.16, p.351. [66] Lam K.P. (1980), "Implicit and Explicit self-tuning controllers", Research Rep. 1334/80, Engng Lab, University of Oxford. [67] Landau I.D., (1974), "A survey of Model Reference Adaptive Techniques", Auto matica, Vol. 10, p.356. [68] Landau I.D., (1978), "Adaptive Control: The Model Reference Approach", Decker Publish. Co., N.Y. [69] Lee Y.W., (1932), "Synthesis of Electrical networks by means of the Fourier trans forms of Laguerre functions", J. Math. Phys., ll,pp.83-113. [70] Lee T.T., Tsay S.C. and Horng I.R. (1986), "Shifted Jacobi series analysis of linear optimal control systems", Journal Franklin Institute, vol. 321-5, pp.289-298. [71] Lee Y.W., (1960), "Statistical theory of Communication", J. Wiley, N.Y. [72] Liu CC. and Shih Y.P., (1984), Journal of Franklin Institute, vol. 317, p.373. [73] Ljung L. (1977), "Analysis of recursive stochastic algorithms", IEEE Trans. Auto. Control, vol. AC-22, p.551. [74] Ljung L. , (1987), "System Identification", Prentice Hall, N.J. Bibliography 145 [75] Ljung L. and Soderstrom T. , (1983), "Theory and Practice of Recursive Identifi cation", The MIT Press, Cambridge, MA. [76] MacFarlane A.G.J. (1979), "Complex-variable-design methods", in Modern ap proaches to control system design, ed N. Munro, P. Peregrinus Ltd. [77] Makila P.M. (1984), "A self-tuning regulator based on optimal Output Feedback Theory", Automatica, vol.20, No.5, p.671. [78] Martin-Sanchez J.M., (1976), "A new solution to adaptive control", Proc. IEEE, vol. 46, pp. 1209-1218. [79] Martin-Sanchez S.L., Shah S.L. (1984), "Multivariable adaptive predictive control of a Binary Distilation column", Automatica, September 1984. [80] Mohtadi C, Shah S.L., Clarke D.W., (1987), "Generalized predictive control of multivariable systems", Proc. of the 5"* Yale Workshop on Appl. of Adaptive Systems, Yale Univ. [81] Narendra K.S., Lin Y.H., Valavani L.S., (1980), "Stable Adaptive Controller De sign", IEEE Trans. Auto. Control, Vol. AC-25, p. 230. [82] Natarajan K. (1988), "On the Headbox flow dynamics", personal communication. [83] Nease R.F., (1957), "Analysis and Design of Non-linear Sampled-data Control Systems", Technical Note 57-162, MIT, Boston, MA. [84] Nurges U. and Jaksoo U., (1981), "Laguerre state equations of a multivariable dis crete time system", IFAC 8th Triennial World Congress, Kyoto, Japan, pp.1153-1158. Bibliography 146 [85] Owens D.H. (1978), "Feedback and multivariable systems", IEE Control Engng series, No. 7. [86] Parks P.C. (1966), "Lyapunov redesign of model reference adaptive control sys-'terns", IEEE Trans. Auto. Control, vol. AC-11, pp.362-67. [87] Paul, R.P. (1981),"Robot manipulators - Mathematics, programming and control", MIT Press, Cambridge, MA. [88] Payne, A.N. (1987), "Stability result with application to adaptive control", Int. J. Control, vol.46, pp. 249-261. [89] Peterka V. (1970), "Adaptive digital regulation of noisy systems", IFAC Sympo sium on Ident. and Proc. Param. Estim., Prague. [90] Peterka V. and Astrom K.J. (1973), "Control of MIMO systems with unknown but constant parameters", Preprints of 3rd IFAC Symposium on Identification and process parameter Estimation, The Hague, Netherlands, p.535. [91] Prager D.L. and Wellstead P.E. (1980), "MIMO pole-assignment self-tuning regu lators", Proc. IEE, vol.128, Pt D, 1, p.9. [92] Richalet J., A. Rault, J. Testud and J. Papon (1978), "Model predictive heuristic control: Applications to industrial processes". Automatica, vol. 14, pp. 413-428. [93] Rissanen J. ,(1979), "Shortest data description and constistency of order estimates of an ARMA process", in Intern. Symposium on Systems Optimiz. and Analysis, ed. Bensoussan A., Lions J., Springer-Verlag, Berlin. [94] Rohrs CE. (1982), "Adaptive control in the presence of unmodeled dynamics", Ph.D thesis, Dept. of EE and Computer Science, MIT, LIDS, Report TH-1254. Bibliography 147 [95] Rohrs, C.E., Valavani L.S., Athans M., Stein G. (1982), "Robustness of adaptive control in the presence of unrnodeled dymnamics", Proc. of the 21st IEEE CDC, 3, Orlando, FLA. [96] Rohrs, C.E., L. Valavani, M. Athans and G. Stein (1985), "Robustness of continu ous time adaptive control algorithms in presence of unrnodeled dynamics". IEEE Trans. Automat. Contr., vol. 30, pp. 881-889. [97] Rosenbrock H.H. (1979), "Inverse Nyquist array design method" in "Modern ap proaches to control system design", ed N. Munro, P. Peregrinus Ltd. [98] Rouhani R. and Mehra R.K., (1982), "The Basic Theoretical Properties of Model Algorithmic Control", Automatica, vol. 18 ,No 4, pp.401-414. [99] Samson, C. and J.J. Fuchs (1981), " Discrete adaptive regulation of not-necessarily minimum-phase systems".Proc. IEE, vol. 128, Part D, pp. 102-108. [100] Seb'org D.L., Edgar T.F., Shah S.L., (1986), "Adaptive Control Strategies for process control: a survey", AIChE Journal, vol. 32-6, p.881. [101] Singh R.P.,editor, (1979), "The Bleaching of Pulp". TAPPI monograph on Pulp Bleaching, Tappi Press, Atlanta, GA. [102] Song H.K., Shah S.L., Fisher D.G., (1986), "A self-tuning robust controller", Automatica , vol.22, 5, pp.521-531. [103] Stewart G.W.,(1973), "Introduction to Matrix Computations", Academic Press, N.Y. [104] Strang G. (1976), Linear Algebra and its Applications, Academic Press, N.Y., pp. 223-224. Bibliography 148 [105] Strejc V. (1980), "Least Squares Parameter Estimation", Automatica, vol. 16, pp. 535-550. [106] Toivonen H. (1984), "Multivariable adaptive control", Modelling, Identification and Control, vol. 5, pp. 19-45. [107] Trulsson Eva (1983),"Adaptive Control based on explicit criterion minimization", Ph.D. Dissertation S-581-83, Linkoping University, Sweden. [108] Ydstie B.E., Kemna A.H., Liu L.K., (1987), "Robust Multivariable Predictive Control", Tech. Report, March 1987, Depart. Chem. Eng. /University of Mass. at Amherst, Amherst, MA. [109] Waller, K.V. and Gustafsson, T.K, (1982), " Chemical reaction invariants in modeling and control of pH", Technical Report Abo Akademi. [110] Wellstead P.E., Edmunds J.M., Prager D., Zanker P. , (1979), "Self-tuning pole-zero assignment regulators", Intern. Journal of Control , vol. 30, p.l. [Ill] Whitaker H.P., Yamrom J., Kezer A. (1958), "Design of Model-reference adap tive control systems for aircraft", Report R-164, Instrumentation Lab. MIT, Cam bridge, Mass. [112] Wiener N. (1956), "The theory of prediction". Modern Math, for Eng., Becken-bach (Ed), McGraw-Hill Co. N.Y. ,pp.l83-184. [113] Wolovich W. A. and Falb P.L. (1976), "Invariants and canonical forms under dynamic compensation", SIAM Jnl Control and Optimization, vol.14, p.996. [114] Ydstie, B.E. (1984), "Extended horizon adaptive control". IFAC 9th World Congress, Budapest, Hungary. Bibliography 149 [115] Young T.Y., W.H. Huggins (1961), "Representation of EKG by orthogonalized exponentials". IRE Inter. Conv. Rec, part 9, pp.145-153. [116] Zervos CC (1984) , "An off-line method for the optimal tuning of the three-term controller", M.Eng. thesis, McGill University, Montreal, PQ, Canada. [117] Zervos CC, P.R. Belanger, G.A. Dumont (1985), "On PID controller tuning method using orthonormal series identification". IFAC Workshop on Adapt. Con trol Chem. Processes. Frankfurt, FRG. Also published in Automatica Journal, March, 1988. [118] Zervos CC and Dumont G.A. (1988a), "Deterministic Adaptive Control based on Laguerre Series Representation", to appear in International Journal of Con trol. Also as PPRIC Tech. Report PGRL-391, Pulp and Paper Res. Inst. Canada, Pointe-Claire, PQ, Canada. [119] Zervos CC and Dumont G.A. (1988b), "Laguerre Orthonormal Functions in Stochastic Self-Tuning Control", IFAC Workshop on Robust Adaptive Control, Newcastle, NSW, Australia. [120] Zervos CC and Dumont G.A. (1988c), "Laguerre-based adaptive control of pH in an industrial bleach plant extraction stage", IFAC ADCHEM'88 symposium on Adaptive Control of Chem. proc, August, Lyngby, Denmark. 9
- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Adaptive control based on orthonormal series representation
Open Collections
UBC Theses and Dissertations
Featured Collection
UBC Theses and Dissertations
Adaptive control based on orthonormal series representation Zervos, Christos Constantine 1988-12-31
pdf
Page Metadata
Item Metadata
Title | Adaptive control based on orthonormal series representation |
Creator |
Zervos, Christos Constantine |
Publisher | University of British Columbia |
Date | 1988 |
Date Issued | 2010-10-18T18:45:49Z |
Description | This thesis describes a novel approach to adaptive control systems design using orthonormal series representation. The class of adaptive algorithms considered is that commonly referred to as self-tuning controllers developed for discrete-time systems. A common characteristic of the self-tuning schemes so far studied for industrial applications is that they are usually based on ARMAX models. These existing adaptive control algorithms have been shown to be globally asymptotically stable under certain theoretical assumptions and they have performed well in various applications. These theoretical assumptions are somehow too restrictive from an engineering and practical point of view. Real industrial plants always contain considerable time delays, have unmodeled dynamics, exhibit time varying dynamics and are subject to various disturbances. The purpose of this thesis is to explore a new way of representing and controlling dynamic systems in an effort to find another way, probably better and more robust, to handle a certain class of industrial applications. The behaviour of adaptive controllers in the presence of unmodelled dynamics and in the presence of time-varying plant delays along with the need for reduced a-priori information as dictated by the conditions encountered usually in practice have led us to abandon the usual ARMA transfer function representation for a new representation by orthonormal series. Our new approach is advantageous because it eliminates the need for assumptions about the plant order and the time-delay, i.e. accurate assumptions about their true values are not necessary. A physical dynamical plant, including its time delay, is modelled by an orthonormal set of functions. The sets considered here are mainly the Laguerre set, a modified version of it, and a set based on complex poles. Other orthonormal functions may also be used. A simple predictive control law is proposed from which an adaptive controller is then designed. The schemes developed are explicit and implicit, deterministic and stochastic. Some multivariable schemes are also presented. Simulations of these new controllers show they are easy to use, able to handle non-minimum phase plants, and more robust than the conventional model-based approaches. Results from industrial trials confirm the applicability of these new schemes. |
Genre |
Thesis/Dissertation |
Type |
Text |
Language | eng |
Collection |
Retrospective Theses and Dissertations, 1919-2007 |
Series | UBC Retrospective Theses Digitization Project |
Date Available | 2010-10-18 |
Provider | Vancouver : University of British Columbia Library |
Rights | For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
DOI | 10.14288/1.0098271 |
URI | http://hdl.handle.net/2429/29329 |
Degree |
Doctor of Philosophy - PhD |
Program |
Electrical and Computer Engineering |
Affiliation |
Applied Science, Faculty of Electrical and Computer Engineering, Department of |
Degree Grantor | University of British Columbia |
Campus |
UBCV |
Scholarly Level | Graduate |
Aggregated Source Repository | DSpace |
Download
- Media
- [if-you-see-this-DO-NOT-CLICK]
- [if-you-see-this-DO-NOT-CLICK]
- UBC_1989_A1 Z47.pdf [ 6.84MB ]
- [if-you-see-this-DO-NOT-CLICK]
- Metadata
- JSON: 1.0098271.json
- JSON-LD: 1.0098271+ld.json
- RDF/XML (Pretty): 1.0098271.xml
- RDF/JSON: 1.0098271+rdf.json
- Turtle: 1.0098271+rdf-turtle.txt
- N-Triples: 1.0098271+rdf-ntriples.txt
- Original Record: 1.0098271 +original-record.json
- Full Text
- 1.0098271.txt
- Citation
- 1.0098271.ris
Full Text
Cite
Citation Scheme:
Usage Statistics
Country | Views | Downloads |
---|---|---|
United States | 32 | 5 |
China | 19 | 7 |
Brazil | 10 | 2 |
Canada | 7 | 6 |
India | 5 | 0 |
Japan | 5 | 0 |
Philippines | 4 | 0 |
Thailand | 4 | 0 |
France | 4 | 0 |
Russia | 3 | 0 |
Sweden | 3 | 1 |
Tunisia | 2 | 0 |
Chile | 2 | 0 |
City | Views | Downloads |
---|---|---|
Unknown | 28 | 17 |
Washington | 12 | 0 |
Beijing | 10 | 3 |
Shenzhen | 9 | 4 |
Vancouver | 6 | 3 |
Mountain View | 6 | 2 |
Ashburn | 4 | 0 |
Bangkok | 4 | 0 |
Uberlandia | 3 | 2 |
Lund | 3 | 1 |
Fremont | 3 | 0 |
Saint Petersburg | 2 | 0 |
University Park | 2 | 0 |
{[{ mDataHeader[type] }]} | {[{ month[type] }]} | {[{ tData[type] }]} |
Share
Embed
Customize your widget with the following options, then copy and paste the code below into the HTML
of your page to embed this item in your website.
<div id="ubcOpenCollectionsWidgetDisplay">
<script id="ubcOpenCollectionsWidget"
src="{[{embed.src}]}"
data-item="{[{embed.item}]}"
data-collection="{[{embed.collection}]}"
data-metadata="{[{embed.showMetadata}]}"
data-width="{[{embed.width}]}"
async >
</script>
</div>
Our image viewer uses the IIIF 2.0 standard.
To load this item in other compatible viewers, use this url:
http://iiif.library.ubc.ca/presentation/dsp.831.1-0098271/manifest