Particle swarm optimization based fuzzy gain scheduled subspace predictive control

https://doi.org/10.1016/j.engappai.2017.10.009Get rights and content

Abstract

The key feature of data-driven Subspace Predictive Control (SPC) is its capability in on-line and automatically adaptation of SPC gains with no need to obtain the explicit model of the system. This feature makes SPC suitable to control nonlinear and time-varying systems. However, in conventional SPC persistently excitation (PE) signals are required to update the SPC gains in the presence of system variations. This procedure demands high computational load and has convergency issues. In this paper we propose a new approach to eliminate the requirement of applying PE signals without degrading the SPC performance. This can be done by using Particle Swarm Optimization (PSO) based Fuzzy Gain Scheduling (FGS) method to optimally update the SPC gains directly with no need to apply PE signals. The method is denoted by PSO-based FGS-SPC. In PSO-based FGS-SPC the SPC gains are optimally adapted by utilizing and evaluating auxiliary scheduling variables, which are correlated with the changes in system dynamics, as soon as a changes are observed in system dynamics without applying PE signals. Eliminating the PE in our proposed method reduces the computational load drastically. Moreover, in PSO-based FGS-SPC, the controller gain ranges (CGRs) of FGS technique are optimally auto-tuned by minimizing the SPC cost function via the PSO algorithm. As a result, the difficulty in finding the CGRs in FGS procedure for inverting the normalized gains is overcome by applying PSO technique on FGS. Consequently, the PSO-based FGS-SPC shows more efficient controlling performance than the SPC by optimally adapting the SPC gains. In addition, PSO-based FGS-SPC shows fast convergence capability and time efficiency over the SPC. Simulation results confirm efficiency and robustness of the method in the presence of constraints and noisy data.

Introduction

In last three decades Predictive Controllers became most widely used advanced controllers in the process control in industry Qin and Badgwell (2003), Lee (2011). In general, predictive control is a control strategy which obtains the control signal by using a predictive model of the process in a cost function minimization. The procedure is done over a fixed prediction horizon in the presence of constraints. There are two different approaches for predictive control: model-based approach and data-driven approach. Model-based approach is called Model Predictive Control (MPC) Lee (2011), Wang (2009). Process model is the basic requirement of the design in MPC. Then the predictor matrices are obtained from the process model, and the controller is designed by using the predictor matrices. Therefore, in MPC the closed-loop performance of the system heavily depends on the accuracy of the process model, which is utilized to design the predictor. Since most industrial systems are nonlinear and time-varying, modeling is considered as the most challenging and time consuming work in MPC design, which demands to apply advanced and sophisticated modeling methods with any variations in the system Liu and Chan (2006), Liu et al. (2010), Kong et al. (2016). On the other hand, data-driven approach is constructed based on combination of Subspace Identification Methods (SIM) Katayama (2005), Overschee and De Moor (1996) and predictive control, which is called Subspace Predictive Control (SPC) Favoreel and De Moor (), Kadali et al. (2003). In SPC the predictor matrices are determined directly from I/O data with no need to obtain the parametric model of the process, and the predictor is called Subspace Predictor. Main advantage of SPC is its capability to adapt the SPC gains on-line by applying persistency excitation (PE) signals, collecting new I/O data and updating the subspace predictor matrices in data-driven manner. This feature makes SPC much more appropriate than MPC to control time-varying and nonlinear systems. SPC has also other features, which has made it one of the popular control strategies in industrial applications over the past decade Kadali et al. (2003), Mardi and Wang () such as, chemical engineering (Jing et al., 2015), vehicle control (Lu et al., 2015), smart grids and buildings (Shafiei et al., 2015), network control systems (Wang et al., 2017). These features are: (i) No prior knowledge is needed on the order and model structure of the system, (ii) Same cost function and same tuning parameters as MPC, but no need to solve the Diophantine equation, (iii) Is based on the reliable and numerically robust linear algebra tools such as Singular value decomposition (SVD) and QR decomposition, (iv) No need for iterative algorithms to obtain predictor matrices, (v) Easily applicable to multi-variable systems.

The main requirement to collect sufficient information from new I/O data and to predict the system outputs accurately is that the input signals have to be persistently exciting the system. These PE signals are applied to the system whenever the thresholding error is flacked. However, because of the high computational load and disruption in system operation, the all-times persistent excitation should be avoided, especially in the steady-state mode. Therefore, much attention is given to replacing this disruptive and time consuming updating process with an efficient algorithm (Zacokova et al., 2013). Although, there have been some attempts to reduce the destructive effects of applying the all-time PE signals, but none of them could completely eliminate the requirement of persistent excitation in SPC and applying PE signals is still open problem in SPC. There are several works that proposed algorithms to address the persistently excitation issues. For instance, in Aggelogiannaki and Sarimveis (2006) the excitation method is illustrated by formulating additional constraints to the optimization problem, however, this approach results in solving non-convex optimization problem to compute the control signal at each time step. A similar approach is also found in Marafioti et al. (2014) to assure PE in the input signal. In Navalkar et al. (2014) the issue of persistency of excitation is addressed in subspace predictive repetitive control and requirement of applying PE signals is relaxed and limited by using basis functions for identification. On the other hand, Hallouzi and Verhaegen (2008) adds an extra term to the cost function to ensure the PE and keeps the optimization problem convex and quadratic, however, it degraded the control performance. A recursive SPC technique based on the Givens rotations and variable forgetting factors is demonstrated in Mardi and Wang (2009), which considers a posteriori prediction error based strategy to determine the sufficient time to apply the PE signal to the system, but it cannot completely eliminate the side effect of applying PE signals and PE still disrupts the system operation in steady-state mode.

A commonly used scheme in industry to deal with the issue of dynamic behavior changes in time-varying systems is applying a Gain Scheduling (GS) technique (Astrom and Wittenmark, 1994). In GS technique the controller parameters are updated by monitoring different operating conditions of the process. GS technique was first introduced in about 1950 s with application on flight control systems (Astrom and Wittenmark, 1994), and it is very useful technique to reduce the effects of parameter variation in different processes, such as pH control, fuel-air control in car engine and ship steering (Astrom and Wittenmark, 1994). Since the parameter updating procedure is done based on open-loop or pre-programmed way, it is controversial to consider the GS technique as an adaptive system. However, by utilizing and evaluating some auxiliary scheduling variables, which are correlated with the changes in system dynamics the GS technique can be considered as an adaptive controller (Astrom and Wittenmark, 1994). In this case there is no need to estimate and identify the system parameters, because the controller parameters can be updated quickly by using the auxiliary scheduling variable values, as soon as a changes are observed in the system dynamics. The main issue in design of GS system is finding suitable auxiliary scheduling variables, which is done in model-based approach in GS technique. On the other hand, there is a fuzzy logic based approach to GS technique which can overcome this disadvantage of conventional GS technique. The approach is called Fuzzy Gain-Scheduling (FGS) technique. There are many successful implementation of FGS in the literature to control nonlinear and time-varying systems Chiu et al. (2005), Kakigano et al. (2013), Sarma (2001), Yang et al. (2014), and FGS-PID, which is one of the most popular FGS techniques in industry Bedoud et al. (2015), Huang and Yu (2001), Kanthaphayao and Chunkag (2014), Rodriguez-Martinez et al. (2011), Santos and Dexter (2002).

In Sedghizadeh and Beheshti (2016) we have proposed a new FGS-SPC method by applying the FGS algorithm for on-line updating of the SPC controller gains using a fuzzy-logic-based GS method. In proposed FGS-SPC algorithm in Sedghizadeh and Beheshti (2016), tracking error, variation of past output data and variation of past control signal are considered as the auxiliary scheduling variables of FGS procedure. Therefore, the SPC gains are updated by evaluating these auxiliary scheduling variables with no need to apply aforementioned disruptive PE signals. This feature makes the FGS-SPC method much more reliable and time efficient than the conventional SPC method. Moreover, FGS-SPC technique enables SPC controller users to apply any advanced model-free gain-scheduling algorithms such as, auto-tuning adaptive methods (Poulin et al., 1996), self-tuning fuzzy-logic based techniques Altas (1997), Muhammad et al. (2013), Visioli (2001) and fuzzy neural networks (Shen, 2001) to re-tune the SPC gains. FGS is a well-known technique in industry with various successful applications to control of nonlinear and time-varying systems Bedoud et al. (2015), Chiu et al. (2005), Huang and Yu (2001), Kakigano et al. (2013), Kanthaphayao and Chunkag (2014), Rodriguez-Martinez et al. (2011), Sarma (2001), Yang et al. (2014). However, implementing the FGS-SPC method has two issues. First, FGS-SPC is a suboptimal solution, which cannot include the SPC cost function minimization in the algorithm (Sedghizadeh and Beheshti, 2016). Second, there is a well-known issue in FGS implementation, which is the choice of controller gain ranges (CGRs), Huang and Yu (2001), Zhao et al. (1993). Currently, these CGRs are calculated in an ad hoc manner by the designer, which is a complex procedure especially for time-varying and nonlinear systems. The issue was addressed in the literature, and several methods were presented to determine the CGRs in FGS of PID controller Chaiyatham and Ngamroo (2014), Huang and Yu (2001), Woo et al. (2000), Zhao et al. (1993), Bouallegue et al. (2012). For example, in Zhao et al. (1993) CGRs are determined in FGS-PID by rule of thumb based on extensive simulation studies and by using the gain and period of oscillation at the stability limit under proportional control. The CGRs are replaced by proper adjustment rates in Huang and Yu (2001) to generate the degrees of gain difference. However, the rates still need to be selected by the user according to the several simulation results of FGS-PID. In Woo et al. (2000) the CGRs are considered as scaling factors for a PID-type fuzzy controller, and a self-tuning method is presented to tune them based on tracking-error-based functions. However, the simulation results show a considerable overshoot at the transient response of the controlled system. An optimal FGS-PID control is also presented in Chaiyatham and Ngamroo (2014) to enhance the performance of conventional PID controller. The method uses bee colony optimization technique to automatically tuning the scaling factors, membership functions and control rules of the FGS-PID controller automatically. However, on-line tuning of all membership functions and control rules is a complex task and demands high computational load. In Bouallegue et al. (2012) a Particle Swarm Optimization-based (PSO-based) strategy is provided for tuning the scaling factors in a PID-type fuzzy logic controller, by considering a cost function to minimize the maximum overshoot and the integral of absolute error. The approach is compared with standard Genetic Algorithm (GA) approach which shows computational efficiency and converges superiority of the PSO-based algorithm.

In this paper, we equip the FGS-SPC method with PSO technique to overcome the existing CGRs tuning problem of FGS and simultaneously optimizing the SPC cost function. The proposed method is denoted by PSO-based FGS-SPC. This method updates the SPC gains with no need to apply PE signals. Consequently, the PSO-based FGS-SPC can update both the SPC controller gains and the CGRs of FGS optimally by using the PSO technique. Our simulation results show the advantages of proposed PSO-based FGS-SPC method in eliminating of the need for applying PE signals without losing the optimality of the SPC algorithm.

This paper is organized as follows: Section 2 is mathematical formulation of the SPC and PSO. Section 3 is the problem statement and motivation. Design of the proposed PSO-based FGS-SPC method is discussed in Section 4. Simulation results are provided in Section 5; and finally, Section 6 is conclusion.

Section snippets

SPC

Consider a discrete linear system of order n, in innovation form as below, x(k+1)=Ax(k)+Bu(k)+Kζ(k)y(k)=Cx(k)+Du(k)+ζ(k)where k is the kth sampling time, u(k)Rm is the input, y(k)Rl is the output, x(k)Rn is the state of the system, and ζ(k)Rl is an unknown innovation sequence with E[ζ(k)ζT(k)]=SRl×l as the innovation covariance matrix. The matrices ARn×n, BRn×m, CRl×n, DRl×m are the state-space matrices that describe the system, and KRn×l is the Kalman gain of the stable system.

For

Problem statement and motivation

As it was discussed in previous section, in the existing SPC algorithms the subspace linear predictor matrices, Lu and Lw, and subsequently, the SPC gain matrices, K̃e and K̃Δwp, must be calculated off-line by using (9), (19), (20) before the control implementation. Next, in order to adapt the controller with any parameter variation in the system, the SPC matrices have to be updated by applying PE signals to the system and capturing the new I/O data from the system during the closed-loop

Proposed PSO-based FGC-SPC approach

Updating the SPC gains Ke, KΔyp and KΔup in (34) by applying PSO-based FGS method is proposed in this section. Unlike the existing SPC methods, the proposed algorithm does not need applying PE signals to update the subspace linear predictor matrices, Lu and Lw. Instead, it re-calculates the SPC gains Ke, KΔyp and KΔup based on the PSO-based FGS technique. The proposed technique can optimally calculate the controller gain ranges (CGRs) for FGS-SPC by minimizing the SPC cost function via the PSO

System description

The proposed PSO-based FGS-SPC method is tested on data set of a SISO laboratory hair dryer system Ljung (1987), Ljung (1991), for more details refer to Overschee and De Moor (1996). The input of the system is the voltage over the heating device that is a mesh of resistor wires. In this system, air is fanned through a tube and heated at the inlet. Output of the system is the air temperature that is measured by a thermocouple. The sampling time was set to Ts=0.08sec throughout the simulation.

Conclusion

In this paper, an algorithm has been provided to eliminate the requirement of disruptive and time consuming process of applying PE signals in SPC. The proposed method, denoted by PSO-based FGS-SPC, is based on optimally-automatically tuning of SPC controller gains by applying the proposed PSO-based FGS technique. In this technique, the CGRs of the FGS algorithm are calculated and updated optimally by applying the PSO technique. In PSO-based FGS-SPC, by considering the SPC cost function as PSO

References (52)

  • AggelogiannakiE. et al.

    Multiobjective constrained MPC with simultaneous closed-loop identification

    Int. J. Adapt. Control Signal Process.

    (2006)
  • Altas, I.H., 1997. A fuzzy logic controlled tracking system for moving targets. In: Proceeding of the 112th IEEE...
  • AstromK.J. et al.

    Adaptive Control

    (1994)
  • BlumC. et al.

    Swarm Intelligence, Introduction and Applications

    (2008)
  • ChaiyathamT. et al.

    Alleviation of power fluctuation in a microgrid by electrolyzer based on optimal fuzzy gain scheduling PID control

    IEEJ Transactions on Electrical and Electronic Engineering

    (2014)
  • ChiuC.S. et al.

    Fuzzy gain scheduling for parallel parking a car-like robot

    IEEE Trans. Control Syst. Technol.

    (2005)
  • ClercM. et al.

    The particle swarm - explosion, stability, and, convergence in a multidimensional complex space

    IEEE Trans. Evolut. Comput.

    (2002)
  • Eberhart, R., Kennedy, J., 1995. A new optimizer using particle swarm theory. In: Proceedings of the 6th International...
  • EngelbrechtA.P.

    Computational Intelligence: An Introduction

    (2007)
  • Favoreel, W., De Moor, B., 1999. SPC: Subspace predictive control. In: Proceeding of the 14th IFAC World Congress...
  • Hallouzi, R., Verhaegen, M., 2008. Persistency of excitation in subspace predictive control. In: Proceedings of the...
  • HallouziR. et al.

    Subspace predictive control applied to fault-tolerant control

  • HuangC.C. et al.

    Applying a fuzzy gain-scheduled PID controller to dyebath pH

    Text. Res. J.

    (2001)
  • Jing, S., Errouissi, R., Al-Durra, A., Boiko, I., 2015. A data-driven subspace predictive controller design for...
  • KadaliR. et al.

    A data driven subspace approach to predictive controller design

    Control Eng. Pract.

    (2003)
  • KakiganoH. et al.

    Distribution voltage control for dc micro-grids using fuzzy control and gain scheduling technique

    IEEE Trans. Power Electron.

    (2013)
  • Cited by (19)

    • A harmony search variant and a useful constraint handling method for the dynamic economic emission dispatch problems considering transmission loss

      2019, Engineering Applications of Artificial Intelligence
      Citation Excerpt :

      Recently there has been a surge of interest in heuristic algorithms deriving from natural phenomena and social behaviors. Because of the simplicity and high efficiency, these algorithms have a broad range of potential applications in many fields (Kadri and Boctor, 2018; Sedghizadeh and Beheshti, 2018; Li et al., 2016; Haddar et al., 2016; Mason et al., 2018; Balaji et al., 2016; Biswas et al., 2018; Ali et al., 2014; Kadhar et al., 2015; Akbari et al., 2017; Basu, 2016; Hadidi, 2017). Many heuristic algorithms such as genetic algorithm (GA) (Holl, 1975), simulated annealing (SA) (Kirpatrick et al., 1983), particle swarm optimization (PSO) (Kennedy and Eberhart, 1995), differential evolution (DE) (Storn and Price, 1995), harmony search (HS) (Geem et al., 2001), bacterial foraging optimization (BFO) (Passino, 2002), group search optimizer (GSO) (He et al., 2009), and chemical reaction optimization (CRO) (Lam and Li, 2010) have been improved to suit the DEED problem without using any approximation of its fuel cost and emission functions.

    • Implementation of narrow-width automatic digital tuner using popular swarm intelligence technique

      2019, Engineering Applications of Artificial Intelligence
      Citation Excerpt :

      Therefore, we propose the implementation of the new NWADT applying few popular evolutionary and SI techniques due to their efficacy in searching of best coefficients from a large search space as, it is the main task in any successful application of the ADT (Dash et al., 2017; Sarangi et al., 2018). Particle swarm optimization (PSO) (Carrillo-Santos et al., 2018; Rahman and Zobaa, 2017; Lee et al., 2018; Lin et al., 2016; Modiri et al., 2017; Ma and Qu, 2015; Sedghizadeh and Beheshti, 2018), differential evolution (DE) algorithm (Dash et al., 2017; Dezelak et al., 2016; Deb et al., 2014; Gong and Zhou, 2018; Biswas et al., 2018; Gupta et al., 2018; Zhang et al., 2018), and cat swarm optimization (CSO) (Saha et al., 2013; Ram et al., 2015; Kumar et al., 2014, 2017; Ansar and Bhattacharya, 2016; Pappula and Ghosh, 2018) are few most popular and effective SI techniques widely accepted for solving different complex, highly nonlinear engineering problems due to many attractive advantages like, robustness, simplicity, faster response, etc. But, all these conventional SI techniques are suffering the local trapping problem as this implementation strategy is highly nonlinear and multimodal (i.e., having multiple numbers of local minima) (Dash et al., 2017; Pappula and Ghosh, 2018).

    View all citing articles on Scopus
    View full text