# Introducing Dynamic Programming and Persistently Exciting into Data-Driven Model Predictive Control

Authors: Hong Jianwang; Ricardo A. Ramirez-Mendoza; Ruben Morales-Menendez
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

In this paper, one new data-driven model predictive control scheme is proposed to adjust the varying coupling conditions between different parts of the system; it means that each group of linked subsystems is grouped as data-driven scheme, and this group is independently controlled through a decentralized model predictive control scheme. After combing coalitional scheme and model predictive control, coalitional model predictive control is used to design each controller, respectively. As the dynamic programming is only used in optimization theory, to extend its advantage in control theory, the idea of dynamic programming is applied to analyze the minimum principle and stability for the data-driven model predictive control. Further, the goal of this short note is to bridge the dynamic programming with model predictive control. Through adding the inequality constraint to the constructed model predictive control, one persistently exciting data-driven model predictive control is obtained. The inequality constraint corresponds to the condition of persistent excitation, coming from the theory of system identification. According to the numerical optimization theory, the necessary optimality condition is applied to acquire the optimal control input. Finally, one simulation example is used to prove the efficiency of our proposed theory.


---

## Body

## 1. Introduction

The main mission of advanced control theory is to design a detailed controller in open loop or closed loop structure so that this designed controller can drive the output of a plant to track an expected set point or to satisfy a given target. Two categories exist for controller design, i.e., model-based approach and data-driven approach. Considering the first model- based approach, a mathematical model of the considered plant is required for the next controller design. It tells that no mathematical model means no controller. Constructing the corresponding mathematical model for the unknown plant is very necessary for this first type of model-based approach, and it is also the most difficult step as it needs some knowledge of other subjects, such as probability theory and linear and nonlinear system theory. This modeling process corresponds to model identification or system identification, which is adopted to obtain the mathematical model exploiting measured data from experiment on the considered open loop or closed loop system. The whole steps for system identification include four main steps, i.e., model structure selection, optimal input design, parameter estimation, and model validation. These above four steps are implemented iteratively until getting one satisfying model, so system identification is the first step or premise for the next controller design, i.e., the idea of identification for control.Usually, while trying to apply different system identification strategies to produce a mathematical model, this mathematical model maybe high order and high property of nonlinearity, and then it leads to controllers with high order and high nonlinearity. Thus, due to the controllers with high nonlinearity, one extra controller reduction procedure is added in the practical application because the complex controllers are difficult or costly to design and implement. Generally, the obtained controller, designed by model-based approach, depends on the identified model for the unknown plant. It means the above four identification processes are repeated again and again, while guaranteeing that the identified model can be used to replace the original plant perfectly.To alleviate the dependence on the identified model for the controller, notion of data-driven approach is widely studied in recent years. The attracting property of data-driven approach is that the controller is designed directly based on measured data. As data-driven approach is still in its infancy, different names are called in the references to describe it, such as data driven, data based, and model free. To the best of our knowledge, the principles between data-driven approach and system identification are similar to each other, as the measured data are applied to get the mathematical model for the unknown plant in the framework of system identification but to get the approximated controller for the case of data-driven approach. The idea of direct data-driven control was first proposed in machine learning; then, it attracted many researchers in the advanced control field recently. Now, this data-driven theory is widely applied in control field, for example, direct data-driven control, data-driven estimation, data-driven detection, data-driven optimization. The common property among them is that the measured data are used to achieve our main goals; then, it means some useful information is extracted from these measured data. On the other hand, data-driven approach needs lots of measured data, i.e., the number of measured data is sufficiently large. This requirement is feasible in our information period, and data-driven approach was born to overcome the limitation of model-based approach, so data-driven approach is studied very popularly from theory and practice application.Due to the application of data-driven approach widely in control field and the similar point between data-driven approach and system identification, we call their combination as identification for control, i.e., system identification for direct data-driven control. More specifically, we describe a concise introduction or contribution on system identification for direct data-driven control, which belongs to data-driven approach. In case of the unknown but bounded noise, one bounded error identification is proposed to identify the unknown systems with time varying parameters. Then, one feasible parameter set is constructed to include the unknown parameter with a given probability level. In [1], the feasible parameter set is replaced by one confidence interval, as this confidence interval can accurately describe the actual probability that the future predictor will fall into the constructed confidence interval. The problem about how to construct this confidence interval is solved by a linear approximation/programming approach [2], which can identify the unknown parameter only for the linear regression model. According to the obtained feasible parameter set or confidence interval, the midpoint or center can be deemed as the final parameter estimation, and further a unified framework for solving the center of the confidence interval is modified to satisfy the robustness. This robustness corresponds to other external noises, such as outlier and unmeasured disturbance [3]. The abovementioned identification strategy, used to construct one set or interval for unknown parameter, is called as set membership identification, dealing with the unknown but bounded noise. There are two kinds of descriptions on external noise, one is probabilistic description and the other is deterministic description, corresponding to the unknown but bounded noise here [4]. For the probabilistic description on external noise, the noise is always assumed to be one white noise, and its probabilistic density function (PDF) is known in advance. On the contrary for deterministic description on external noise, the only information about noise is bound, so this deterministic description can relax the strict assumption on probabilistic description. In reality or practice, bounded noise is more common than white noise. Within the deterministic description on external noise, set membership identification is adjusted to design controllers with two degrees of freedom [5], and it corresponds to direct data-driven control or set membership control. Set membership control is applied to design feedback control in a closed loop system with the nonlinear system in [6], where the considered system is identified by set membership identification, and the obtained system parameter will be benefitted for the prediction output. After substituting the obtained system parameter into the prediction output to construct one cost function, reference [7] takes the derivative of the above cost function with respect to control input to achieve one optimal input. Set membership identification can be not only applied in MC but also in stochastic adaptive control [8], where a learning theory-kernel is introduced to achieve the approximation for the nonlinear function or system. Based on the bounded noise, many parameters are also included in known intervals in prior, and then robust optimal control with adjustable uncertainty sets are studied in [9], where robust optimization is introduced to consider uncertain noise and uncertain parameter simultaneously. To solve the expectation operation with dependence on the uncertainty, sample size of random convex programs is considered to replace the expectation by finite sum [10]. Generally, many practical problems in systems and control, such as controller synthesis and state estimation, are often formulated as optimization problems [11]. In many cases, the cost function incorporates variables that are used to model uncertainty, in addition to optimization variables, and reference [12] employs uncertainty described as probabilistic variables. Reference [13] studies data-driven output feedback controllers for the nonlinear system and applies event triggered mode to analyze the robust stability. Data-driven estimation is used to achieve hybrid system identification [14], whose nonlinearity is described by one kernel function. During these recent years, the first author studies this direct data-driven control too, for example, the closed relation between system identification and direct data-driven control [15] and data-driven model predictive control [16]. Based on above descriptions on direct data-driven control and our existed research about system identification, model predictive control, direct data-driven control, and convex optimization theory, our mission in this paper is to combine our previous results and apply them in practical engineering. Robust analysis is considered in more detail for data-driven model predictive control [15], where the idea of convex optimization and semidefinite relaxation scheme is proposed to achieve this goal.In this paper, we continue to do a deep research on the data-driven model predictive control scheme and apply the idea of dynamic programming to complete the study on the data-driven model predictive control scheme. Dynamic programming deals with situations where decisions are made in stages. The outcome of each decision may not be fully predictable but can be anticipated to some extent before the next decision is made. More specifically, data-driven model predictive control is considered in this short note, and the detailed description of the proposed algorithm is provided. As data-driven model predictive control formulates the problem of designing controller into one constrain optimization, the idea of dynamic programming can be applied to analyze the minimum principle of that constrain optimization, which corresponds to one general case. Moreover, after defining one concept of stability for data-driven model predictive control, stability condition is also derived through the idea of dynamic programming. To the best of our knowledge, dynamic programming is only studied in optimization theory, not in control research yet. In our published paper [17], dynamic programming is firstly introduced to balance the desire for lower present cost with the undesirability of high future cost in multi UAVs formation anomaly detection. So, this is the first analysis regarding dynamic programming into data-driven model predictive control. The main contributions of out short note are those minimum principle and stability analysis are presented for data-driven model predictive control through the idea of dynamic programming. During the above theoretical analysis about dynamic programming for our constructed data-driven MPC strategy, no other constraint is considered for that numerical optimization problem, i.e., only one simple cost function exists in the whole analysis process. So, for the sake of completeness, one inequality constraint is considered or added in the original numerical optimization problem. However, this added inequality constraint is not related with the common observed input or output variable, and it responds to the condition of persistent excitation. This property of persistent excitation is crucial in many adaptive schemes, where parameter convergence is guaranteed, as parameter convergence is one of the primary objectives of the adaptive system. After defining our persistent excitation and combining this constrain condition with the original cost function, one quadratic programming problem with inequality constraint is needed to solve. Through our own simple but tedious calculations, this constrain optimization problem can be solved, while satisfying the necessary optimality conditions.


## 2. Problem Formulation

The whole system is divided into its components, i.e., pairs composed by a gate and its downstream research, forming a setN=1,2,…,N of subsystems. The dynamics of each subsystem i∈N are described as the following linear model:(1)xik+1=Aiixik+Biiuik+dik,dik=∑j≠iAijxjk+Bijujk,where xi∈Rnxi and ui∈Rnui are the state and input, respectively, of subsystem i, Aij∈Rnxi×nxjandBij∈Rnxi×nuj are the state transaction and the input-to-state matrices of compatible dimension, and dik denotes the influence of other subsystems on subsystem i.The overall system can be described as follows:(2)xNk+1=ANxNk+BNuNk,where xNk=x1k,x2k,…,xNkTanduNk=u1k,u2k,…,uNkT are the grouped states and inputs and AN=Aiji,j∈NandBN=Biji,j∈N are the state transaction and the input-to-state global matrices. All the control systems may communicate through a data network, whose topology is described by means of the undirected graph N,Λ. From the study by Wang et al. [17], when agents in the same communication component will benefit from cooperation, i.e., sharing information to aggregate their control links, then such components are named as data driven. This idea of data driven is carried out in different ways, and then the information flow and one broadened control feedback are constructed.


## 3. Data-Driven Model Predictive Control

The partition from a given network topologyΛk is defined as follows:(3)NΛ=C1,C2,…,CN/Λ,where . is the cardinality of the set, the set of indices is defined as NΛ=1,2,…,N/Λ. Data-driven idea are disjoint sets, such that(4)Ci⊆N,for alli∈1,2,…,N,and∪i=1NCi⊆N.Then, the state cost corresponding toCi⊆N is gixi,ui, and local controllers aggregate into a data driven with their efforts to achieve a better performance. At time instant k, a control sequence for all subsystems j∈Ci is derived by the following constrain optimization of the model predictive control problem:(5)minuikJiuik=∑k=0N−1gixik,uik+gNxiNsubject toxik+1=Aiixik+Biiuik+dikk=0,1,…,N−1,ui∈Ui,x0:given.Problem (5) is solved independently for each agent Ci⊆N, and the overall control problem can be formulated as follows:(6)minN,Λ∑i∈1,2,…,NJixik,uik+JiΛsubject toxik+1=Aiixik+Biiuik+dik,ui∈Ui,x0=xi0,where JiΛ is defined as follows:(7)JiΛ=∑i=0Nxik.Problem (6) corresponds to one centralized model predictive control with N sums, and also it constitutes a dynamic optimization with mixed integer variables, which is solved by the latter dynamic programming strategy.


## 4. Minimum Principle with the Idea of Dynamic Programming

As our goal is to study the data-driven model predictive control in this short note, we concern on that constrain optimization problem (5) and apply the idea of dynamic programming to analyze its minimum principle.As we want to find a control sequence(8)ui0,ui1,…,uiN−1,and a corresponding state sequence(9)xi0,xi1…,xiN,for constrain optimization problem (5), then we minimize that(10)minuikJiuik=∑k=0N−1gixik,uik+gNxiN,subject to the following linear model:(11)xik+1=Aiixik+Biiuik+dik,and the control constraints as follows:(12)ui∈Ui.Firstly, we develop an expression for the gradient as follows:(13)▽Jiui0,ui1,…,uiN−1,after using the chain rule, and then we obtain that(14)▽uiN−1Jiui0,ui1,…,uiN−1=▽uiN−1gNAiixiN−1+BiiuiN−1+diN−1+gN−1xiN−1,uiN−1=▽gNBii+▽uiN−1gN−1,where all gradients are evaluated along the control trajectory ui0,ui1,…,uiN−1 and the corresponding state trajectory xi0,xi1,…,xiN. Similarly, for all k,(15)▽uikJiui0,ui1,…,uiN−1=▽uikxik+1▽xik+1xik+2,…,▽xiN−1xiN▽gN+▽uikxik+1▽xik+1xik+2,…,▽xiN−2xiN−1×▽xiN−1gN−1+⋯+▽uikxik+1▽xik+1gk+1+▽uikgk,and substituting that linear model into equation (15), it holds that(16)▽uikJiui0,ui1,…,uiN−1=BiiAii,…,Aii▽gN+BiiAii⋯Aii▽xiN−1gN−1+⋯+Bii▽xik+1gk+1+▽uikgk=BiiAiiN−k−1▽xiN−1gN−1+⋯+Bii▽xik+1gk+1+▽uikgk,which can be rewritten in the following form:(17)▽uikJiui0,ui1,…,uiN−1=▽uikxik+1pk+1+▽uikgk=Biipk+1+▽uikgk,for an appropriate vector pk+1, and(18)▽uikJiui0,ui1,…,uiN−1=▽uikHkxik,uik,pk+1,where Hkxik,uik,pk+1 is the Hamiltonian function defined by(19)Hkxik,uik,pk+1=gkxik,uik+pk+1xik+1.From equation (18), we see that the vectors pk+1 are generated backwards by the following adjoint equation:(20)pk=▽xikpk+1+▽xikgk=Aiipk+1+▽xikgk,k=1,2,…,N−1,with terminal condition(21)pN=▽gN.If the constraint setsUi are convex, the optimality condition is applied:(22)∑k=0N−1▽uikJiui∗0,ui∗1,…,ui∗N−1×uik−ui∗k≥0,for all feasible solution ui0,ui1,…,uiN−1, and then this condition can be decomposed into the following N conditions:(23)Jiui∗0,ui∗1,…,ui∗N−1uik−ui∗k≥0,for alluk∈Uk,k=0,1,…,N−1.Generally, based on above derivations, this minimum principle from the idea of dynamic programming is applied to analyze the constraint optimization problem for the data-driven model predictive control. Then, we obtain the following Theorem1.Theorem 1.
Suppose thatui∗0,ui∗1,…,ui∗N−1 is an optimal control input and xi∗0,xi∗1,…,xi∗N is the corresponding state trajectory for our considered data-driven model predictive control. Sets Uk are convex, and then for all k=0,1⋯N−1, we have(24)▽uikHkxi∗k,ui∗k,pk+1uik−ui∗k≥0,where vectors p1,p2,…,pN are obtained from the adjoint equation.(25)pk=Aiipk+1+▽xikgk,k=1,2,…,N−1,with terminal condition(26)pN=▽gNxi∗N.Further, Theorem1 can be reformulated as one flowchart in Figure 1, where all the detailed processes are covered, and it is similar to the commonly used closed loop system structure.Figure 1
A flowchart of Theorem1.


## 5. Stability Analysis with the Idea of Dynamic Programming

Here, in order to apply the idea of dynamic programming to analyze the stability for that data=driven model predictive control (5), one explicit form about the cost per stage is needed. Without loss of generality, the cost per stage is quadratic.(27)xiTkQxik+uiTkRuik,k=0,1,…,where Q and R are two positive definite symmetric matrices, and also we impose state and control constraints.(28)xik∈Xik,uik∈Uik,k=0,1,….For all initial statexi0∈Xi, the state of the closed loop system(29)xik+1=Aiixik+Biiui∗k+dik,satisfied the state and control constraints, and ui∗k is one stationary controller.Definition 1.
The stability concept is defined as that the total cost over an infinite number of state is finite, i.e.,(30)∑k=0∞xiTkQxik+ui∗kRuik<∞.
Letxi0,ui0,xi1,ui1,… be the state and control sequence generated by data-driven model predictive control, so that(31)uik=ui∗k,xik+1=Aiixik+Biiui∗k+dik,k=0,1,….
DenoteJ^ixi as the optimal cost of the M stage problem solved by data-driven model predictive control, and J˜ixi be the optimal cost starting at x0 of a corresponding M−1 stage problem. It means the optimal value of the quadratic cost.(32)∑k=0M−2xiTkQxik+ui∗kRuik<∞,xiM−1=0.
Since that deriving the state to 0 can not decrease the optimal cost, we have for allxik∈Xik(33)J^ixi≤J˜ixi.
From the definitions ofJ^ixi and J˜ixi, we have for all k,(34)minui∈UixiTkQxik+uiTkRuik+J˜ixik+1=xiTkQxik+uiTkRuik+J˜ixik+1=J^ixik,and by using equation (33), we have that(35)xiTkQxik+uiTkRuik+J^ixik+1≤J^ixik,and summing these equations for arbitrary values K>0, it holds that(36)J^ixik+1+∑k=0KxiTkQxik+uiTkRuik≤J^ixi0.
SinceJ^ixik+1≥0, it holds that(37)∑k=0KxiTkQxik+uiTkRuik≤J^ixi0.
Taking the limit on above inequality asK⟶∞, we have that(38)∑k=0KxiTkQxik+uiTkRuik≤J^ixi0<∞.
This completes the proof of that stability concept (30), whose total cost over an infinite number of state is finite.


## 6. Persistently Exciting Data-Driven Model Predictive Control

Observing equation (21) again, no other constraint is considered there, except only one simple cost function with quadratic form. In case of equality or inequality constraints for equation (21), one quadratic programming problem is obtained with one inequality constraint, named as the condition of persistent excitation.Firstly, here the definition of persistent excitation is given as follows.Definition 2.
(persistent excitation). A bounded input signalut is persistent excitation with a level of excitation α0>0 if there exist constants α1>0andN>0 such that(39)α0≤∑t=0NuTtut≤α1.
This condition can be interpreted as a condition on the energy of input signalut in all direction, and this persistent excitation can guarantee the parameter estimation be exponentially fast in system identification and adaptive control.
Combining equations (21) and (23) and inequality (39), one persistently exciting data-driven MPC is formulated as the following quadratic programming problem with inequality constraint:(40)minu0,…,uN∑t=0Ny^t−ydestTQy^t−ydest+utTSut=∑t=0Ny^TtQy^t−2ydestQy^t+utTSutsubject toα0≤∑t=0NuTtut≤α1.
The goal of the following theoretical analysis is to solve the above constrain optimization problem and give one explicit form for the optimal control inputut, while satisfying the condition of persistent excitation.
To simplify that cost function in equation (40), we have(41)∑t=0NutTSut=u0u1…uNS0…00S…0⋮⋮…⋮00…S×u0u1…uN=uTSINu,where IN is the identity matrix with dimension N.(42)∑t=0Ny^TtQy^t=y^0y^1…y^NQ0…00Q…0⋮⋮…⋮00…Q×y^0y^1…y^N=yTQINy,where vector u and y are defined as follows:(43)u=u0u1…uN,y=y^0y^1…y^N.
To simplify notation, setx=y,u, then(44)∑t=0Ny^TtQy^t+∑t=0NutTSut=yTQINy+uTSINu=yuQIN00SINyu=xTAx,A=QIN00SIN.
Similarly, we get(45)∑t=0NydestQy^t=y^0y^1…y^NQydes0ydes1⋮ydesN=Qydes0ydes1…ydesN00…0y^0y^1⋮y^Nu0u1⋮uN=−bTxwhere(46)−bT=Qydes0ydes1…ydesN00…0.
Through these two equations (28) and (29), that cost function in (25) can be rewritten as follows:(47)∑t=0Ny^TtQy^t−2ydestQy^t+utTSut=xTAx+2bTx.
For the right part for that persistent excitation (39), we rewrite it as follows:(48)∑t=0NuTtut≤α1u0u1…uNu0u1…uN≤α1,yu0N00INyu≤α1.
It means that(49)xTM1x≤α1M1=0N00IN.
Similarly, we have(50)−∑t=0NuTtut≤−α0xT−M1x≤−α0.
Combining inequality constraints (49) and (50), we obtain that(51)xTM1−M1x≤α1−α0.
Set(52)M=M1−M1,N=α1−α0.
Based on the above constructed matrices and vectors, we get Theorem2.Theorem 2.
Then, the constructed quadratic programming problem with inequality constraint (49) can be reformulated as follows:(53)minxxTAx+2bTxsubject toxTMx≤N.
In order to obtain the optimal input signalu=u0u1,…,uN, we need to identify the optimization variable x, as u is included in xm, i.e., x=yu.
Observing quadratic programming problem with inequality constraint (53) again, Lagrangian multiplier lambda is introduced corresponding to the inequality constraint, and the following Lagrangian function Lx,λ is constructed:(54)Lx,λ=xTAx+2bTx−λxTMx−N.
Taking the partial derivative with respect to the optimization variablex and setting the derivative equal to zero, it holds that(55)∂Lx,λ∂x=2A−λMx+2b=0,x=−A−λM−1b,and substituting the optimal variable x into Lagrangian function again, we have(56)Lx,λ=bTA−λM−1A−λMA−λM−1b−2bTA−λM−1b+λN=−bTA−λM−1b+λN.
So, the dual problem is(57)maxλ−bTA−λM−1b+λN=minλbTA−λM−1b−λN.
Applying the necessary optimality condition to getbTMb−NA−λM2=0, it means that A−λM=M/Nb, where MM=M. After substituting it into equation (58) again, we have(58)x=−MNb−1b=−b−1NMb=−b−1N1/2M−1/2b,where(59)N=N1/2N1/2andI=M1/2M−1/2.Then, we choose the lastN elements as the optimal input variable u=u0u1,…,uN.Generally, from above two sections, we can see that after data-driven model predictive control is constructed, dynamic programming strategy is applied for simple cost function without inequality constraint, and persistently exciting data-driven model predictive control holds for case of inequality constraint.


## 7. Simulation Example

Now, we propose one example to illustrate the nature of the above results. Then, the data-driven model predictive control strategy is applied in flutter suppression for one small helicopter, hovering in the laboratory in Figure2.Figure 2
One small helicopter in the laboratory.Due to the limitation of the experimental physical devices, some constraints exist on the control input and observed variables. Helicopters have complex dynamics and special flight conditions, and their dynamics change accordingly with the flight altitude and flight conditions. The helicopter model corresponds to one state space system with three inputs and three outputs. More specifically, the three inputs include spray angleu1, acceleration u2, and rise angle u3. Furthermore, three outputs are relative height y1, forward speed y2, and roll angle y3. The corresponding state space system is given as follows:(60)A=−0.3220.0640.0364−0.99170.00030.000800010.0037000−30.640−3.6780.0046−0.73330.131508.53960−0.025−0.476−0.0319−0.06200000−20.20000000−20.2000057.29000,C=1000000010000057.30000000057.29580000,B=000020.2000000020.20,D=0,where observed noise ek is one white noise with zero mean and its covariance EekekT=10−4I. Collect 1000 sampled data in one experiment and choose the sampled period as 0.2 second. One initial control is chosen as uk=0.5γk−yk. Reference signal γk is also one white noise with zero mean, and its covariance is 4×10−4I. Two matrices are Q=R=0.01I, and constraints are considered as follows:(61)0≤u1u2u3≤10.21,0≤y1y2y3≤1060100.During the test, sensors and actuating devices are needed to measure the relevant signals. At this time, the selection of the device, the layout of the location, and the selection of excitation points need to be considered. For dynamic systems, Controllability and observability require that the excitation point and sensor arrangement are not at the node of the studied flutter mode. When the excitation point or all sensors are at the node of a certain order, the mode and its frequency multiplication mode cannot be identified. From the perspective of mechanics, we see that when the excitation point is at the node, the excitation energy cannot be input to the modal, and the modal motion cannot be excited; on the other hand, the response measured by the sensor is a subset of the system response. The first-order modal node does not contain the modal component in the measurement subset.For the optimization problem (53) of data-driven model predictive controller, the dynamic programming scheme is used to solve the optimal predictive controller. In order to verify the performance of the closed loop system, the initial state of the system is selected as x0=10I. The specific process using a joystick control of helicopter attitude is as follows: Firstly, the helicopter will bow down to about 3 degree and move action for 3 seconds until down to 0 degree, before it starts to fly rod. Secondly, the helicopter will loose rod for 5 second and then it will pull back to 3 degree after it returns to zero degree. The simulation response curve of the closed loop system under above operation is shown in Figure 3.Figure 3
Pitch attitude control response curve.
(a)(b)Figure4 shows that the attitude control of the model machine in the experiment is relatively stable under our considered data-driven model predictive controller, and the attitude control accuracy is about 1, and the heading control accuracy is about 3, which better suppresses the effect of flutter.Figure 4
Attitude curves.


## 8. Conclusion

In this paper, data-driven model predictive control is considered to adjust the varying coupling conditions between different parts of the system. The idea of dynamic programming is proposed to analyze the minimum principle and stability condition for the data-driven model predictive control, respectively. Through adding the inequality constraint to the constructed model predictive control, one persistently exciting data-driven model predictive control is obtained. The inequality constraint corresponds to the condition of persistent excitation. As this is the first theoretical analysis, regarding dynamic programming, persistent excitation, and model predictive control so that how to combine game theory and dynamic programming for persistently exciting data-driven model predictive control is our next ongoing work.



---

*Source: 9915994-2021-05-26.xml*