System offline optimization method and device, storage medium and computer equipment
By acquiring offline data and Chino polyhedral wrapping technology, a discrete dynamics model and predictive control cost function are constructed, and input control data is optimized, which solves the problem of difficulty in optimizing complex and large-scale operating systems, and realizes effective optimization and control accuracy improvement of the system.
Patent Information
- Application Number
- CN202410974718.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-19
- Publication Date
- 2024-11-08
AI Technical Summary
Complex large-scale operating systems such as urban sewage treatment, urban solid waste combustion and urban water supply processes are difficult to establish accurate optimization models due to many uncertain factors, which makes it difficult to optimize these systems, and the existing technology cannot effectively optimize these systems.
By obtaining offline data of the target system, including input-state data sets and system process noise data represented by Chino polyhedral wrapping technology, obtaining optimized input control data, building discrete dynamics models, building model predictive control cost functions, and solving predictive control Enter the value to optimize the system operation.
Effective offline optimization of large operating systems has been achieved, the problem of difficulty in optimization in the existing technology has been overcome, and the system's operating efficiency and control accuracy have been improved.
Smart Images

Figure CN118915456A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of system offline optimization, and in particular to a system offline optimization method, device, storage medium and computer equipment. Background Art
[0002] For complex large-scale operation systems such as urban sewage treatment process, urban solid waste combustion process and urban water supply process, it is difficult to establish accurate optimization models and design controllers due to too many uncertain factors. Therefore, users are also unable to optimize large-scale operation systems based on optimization models or controllers. In summary, the existing technology has the technical defect that it is difficult to optimize large-scale operation systems. Summary of the invention
[0003] The purpose of this application is to provide a system offline optimization method, device, storage medium and computer equipment, which can overcome the shortcomings and deficiencies in the prior art.
[0004] A first aspect of an embodiment of the present application provides a system offline optimization method, comprising:
[0005] Acquire offline data of the target system, the offline data including an input-state data set and system process noise data represented by a Chino polyhedron wrapping technique;
[0006] Acquire offline optimized input control data according to the input-state data set and the system process noise data;
[0007] The target system is optimized according to the offline optimization input control data.
[0008] Further, the step of obtaining offline optimized input control data according to the input-state data set and the system process noise data comprises:
[0009] Obtaining a parameter matrix including a plurality of candidate linear model parameters according to the input-state data set and the system process noise data;
[0010] Obtain a target noise Chino polyhedron with the smallest face in the parameter matrix;
[0011] According to the target noise Chino polyhedron, optimized input control data is obtained.
[0012] Furthermore, the step of obtaining the target noise Chino polyhedron with the smallest face in the parameter matrix includes:
[0013] The target noise Chino polyhedron with the smallest surface is obtained by the following formula:
[0014]
[0015] in, Represents the target noise Chino polyhedron with the smallest face; ω min Represents the smallest noise data; zonotope.enclosepoint represents the smallest Qino polyhedron that includes the noise data.
[0016] Further, the step of obtaining optimized input control data according to the target noise Chino polyhedron includes:
[0017] Obtaining the polyhedron volume of the target noise Chino polyhedron;
[0018] Construct a discrete dynamics model of the target system and obtain a model output of the discrete dynamics model;
[0019] Constructing a model predictive control cost function according to the system expected output reference, the model output and the input data;
[0020] According to a preset prediction step length, solving the model to obtain a prediction control input value corresponding to each prediction step number;
[0021] The optimized input control data is obtained according to the predicted control input values corresponding to each of the predicted steps.
[0022] Furthermore, the step of obtaining the optimized input control data according to the prediction control input values corresponding to each of the prediction steps includes:
[0023] Get the selected target number of steps from the predicted number of steps;
[0024] The predicted control input value corresponding to the target deployment is determined as the optimized input control data.
[0025] Furthermore, the step of obtaining the polyhedron volume of the target noise Chino polyhedron includes:
[0026] The volume of the target noise Chino polyhedron is obtained by the following formula:
[0027]
[0028] Where V represents the volume of the target noisy Kino polyhedron, volume represents the algorithm formula for obtaining the volume of the noisy Kino polyhedron, Represents the target noisy Qino polyhedron with the smallest face.
[0029] Furthermore, the model predictive control cost function is:
[0030]
[0031] Among them, J represents the objective function of the model predictive control cost function, (k+i|k) represents the predicted value at the k+ith moment, E represents the difference between the model output and the system expected output reference, Z represents the prediction interval, Q and R represent the weight matrix, and F represents the terminal error matrix.
[0032] Compared with the prior art, the present application first obtains the offline data of the target system, and then obtains the optimized input control data based on the input-state data set and the system process noise data in the offline data; wherein the system process noise data is the noise data wrapped by the Chino polyhedron wrapping technology; then the input data of the target system is optimized and controlled according to the optimized input control data, and the offline optimized input control data is obtained for optimizing the operation of the target system, and the offline optimized input control data can be obtained according to the offline data of the large operation system to optimize the large operation system.
[0033] The second embodiment of the present application discloses a system offline optimization device, including:
[0034] An offline data acquisition module, used to acquire offline data of a target system, wherein the offline data includes an input-state data set and system process noise data wrapped by a Chino polyhedron wrapping technique;
[0035] An offline optimized input control data acquisition module, used for acquiring offline optimized input control data according to the input-state data set and the system process noise data;
[0036] A system optimization module is used to optimize the target system according to the offline optimization input control data.
[0037] A third embodiment of the present application discloses a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the system offline optimization method described above are implemented.
[0038] The fourth embodiment of the present application discloses a computer device, including a memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the processor implements the steps of the system offline optimization method described above when executing the computer program.
[0039] In order to provide a clearer understanding of the present application, the specific implementation of the present application will be described below in conjunction with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0040] Figure 1 This is a flow chart of a system offline optimization method according to an embodiment of the present application.
[0041] Figure 2This is a flowchart of steps S21-S23 of a system offline optimization method according to an embodiment of the present application.
[0042] Figure 3 This is a flowchart of steps S231 - S235 of a system offline optimization method according to an embodiment of the present application.
[0043] Figure 4 This is an algorithm flow chart of a system offline optimization method according to an embodiment of the present application.
[0044] Figure 5 This is a structural diagram of an intelligent water supply system for a system offline optimization method according to an embodiment of the present application.
[0045] Figure 6 A schematic diagram of water level changes in an intelligent water supply system of a system offline optimization method according to an embodiment of the present application.
[0046] Figure 7 This is a schematic diagram of module connections of a system offline optimization device according to an embodiment of the present application.
[0047] 1. Offline data acquisition module; 2. Offline optimization input control data acquisition module; 3. System optimization module. DETAILED DESCRIPTION
[0048] In order to make the objectives, technical solutions and advantages of the present application more clear, the embodiments of the present application will be further described in detail below with reference to the accompanying drawings.
[0049] It should be clear that the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the embodiments of the present application.
[0050] When the following description relates to the accompanying drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. In the description of the present application, it should be understood that the terms "first", "second", "third", etc. are only used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence, nor can they be understood as indicating or implying relative importance. For those of ordinary skill in the art, the specific meanings of the above terms in the present application can be understood according to the specific circumstances. The singular forms of "a", "said" and "the" used in the present application and the appended claims are also intended to include the majority form, unless the context clearly indicates other meanings. The words "if" / "if" used herein can be interpreted as "at the time of" or "when" or "in response to determination".
[0051] In addition, in the description of this application, unless otherwise specified, "plurality" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the associated objects are in an "or" relationship.
[0052] See also Figure 1 , which is a system offline optimization method according to an embodiment of the present application, comprising:
[0053] S1: Obtain offline data of the target system, wherein the offline data includes an input-state data set and system process noise data represented by a Chino polyhedron wrapping technique;
[0054] S2: acquiring offline optimized input control data according to the input-state data set and the system process noise data;
[0055] S3: Optimizing the target system according to the offline optimization input control data.
[0056] See also Figure 2 In a feasible embodiment, the step S2: obtaining offline optimized input control data according to the input-state data set and the system process noise data comprises:
[0057] S21: obtaining a parameter matrix including a plurality of candidate linear model parameters according to the input-state data set and the system process noise data;
[0058] S22: Obtain the target noise Chino polyhedron with the smallest face in the parameter matrix;
[0059] S23: Acquire optimized input control data according to the target noise Chino polyhedron.
[0060] In a feasible embodiment, the step of obtaining the target noise Chino polyhedron with the smallest face in the parameter matrix includes:
[0061] The target noise Chino polyhedron with the smallest surface is obtained by the following formula:
[0062]
[0063] in, Represents the target noise Chino polyhedron with the smallest face; ω min Represents the smallest noise data; zonotope.enclosepoint represents the smallest Qino polyhedron that includes the noise data.
[0064] See also Figure 3In a feasible embodiment, the step S23: obtaining optimized input control data according to the target noise Chino polyhedron comprises:
[0065] S231: Obtain the polyhedron volume of the target noise Chino polyhedron;
[0066] S232: construct a discrete dynamics model of the target system and obtain a model output of the discrete dynamics model;
[0067] S233: constructing a model predictive control cost function according to the system expected output reference, the model output and the input data;
[0068] S234: solving the model according to a preset prediction step length to obtain a prediction control input value corresponding to each prediction step number;
[0069] S235: Obtain the optimized input control data according to the predicted control input values corresponding to each of the predicted steps.
[0070] In a feasible embodiment, the step S231: obtaining the polyhedron volume of the target noise Chino polyhedron includes:
[0071] The volume of the target noise Chino polyhedron is obtained by the following formula:
[0072]
[0073] Where V represents the volume of the target noisy Kino polyhedron, volume represents the algorithm formula for obtaining the volume of the noisy Kino polyhedron, Represents the target noisy Qino polyhedron with the smallest face.
[0074] In a feasible embodiment, the step S235: obtaining the optimized input control data according to the prediction control input values corresponding to the prediction steps, comprises:
[0075] S2351: Obtain the selected target number of steps from the predicted number of steps;
[0076] S2352: Determine the predicted control input value corresponding to the target deployment as the optimized input control data.
[0077] In a feasible embodiment, the model predictive control cost function is:
[0078]
[0079] Among them, J represents the objective function of the model predictive control cost function, (k+i|k) represents the predicted value at the k+ith moment, E represents the difference between the model output and the system expected output reference, Z represents the prediction interval, Q and R represent the weight matrix, and F represents the terminal error matrix.
[0080] Compared with the prior art, the present application first obtains the offline data of the target system, and then obtains the optimized input control data based on the input-state data set and the system process noise data in the offline data; wherein the system process noise data is the noise data wrapped by the Chino polyhedron wrapping technology; then the input data of the target system is optimized and controlled according to the optimized input control data, and the offline optimized input control data is obtained for optimizing the operation of the target system, and the offline optimized input control data can be obtained according to the offline data of the large operation system to optimize the large operation system.
[0081] Below, in order to facilitate understanding of the technical solution of the present application, the principle of the technical solution of the present application will be provided:
[0082] Definition Notes:
[0083] In this paper, we use Define n-dimensional Euclidean space, is a positive real number, is defined for natural numbers including 0, The definition of natural numbers does not include 0. is the set of all closed intervals [a, b], such as And a≤b and is the set of all m×n real matrices and real symmetric matrices.
[0084] Definition 1: (Minkowski Sum) The Minkowski sum of two sets of vectors A and B in Euclidean space is obtained by adding each vector in A to each vector in B:
[0085]
[0086] in, Expressed as a Minkowski sum.
[0087] Definition 2: (Zonotope) Given a center and generate vector Then the Chino polyhedron is defined as:
[0088]
[0089] use Simply expressed as Its linear mapping is obtained by the following calculation:
[0090]
[0091] Given two Chino polyhedra and Its Minkowski and It can be calculated as:
[0092]
[0093] and use definition Represents the difference between two Chino polyhedra.
[0094] Definition 3: (Matrixzonotope) Given a center and the generator matrix Then a matrix Qino polyhedron is defined as:
[0095]
[0096] use Represents the matrix Qino polyhedron.
[0097] Definition 4: (Intervalmatrix) An interval matrix Indicates that each matrix element is at the left limit and the right limit The interval of all possible values between:
[0098]
[0099] The conversion of a matrix Zonotope to an interval matrix can be expressed as:
[0100]
[0101] Problem description:
[0102] Consider an unknown discrete-time nonlinear dynamic system (i.e., the target system) :
[0103]
[0104] in, Indicates the status of the system. represents the input of the system, Represents the unknown noise of the system. is a discrete time function. In this work, f p Assume that it is unknown and there is no information about f pThis technical solution requires the construction of a dynamic system model to capture f p The dynamic behavior of the unknown system is determined and optimized. The following are the assumptions about the data.
[0105] Assumption 1: (Data) Assume that T input-state trajectories have been obtained, each containing different lengths N j , j = 1…T data set:
[0106]
[0107] The set of system states and inputs is closed, bounded, and locally connected. The assumption that the system states are bounded is reasonable with reference to physical constraints or safety criteria.
[0108] Based on Assumption 1, the data is represented by the following matrix A collection of sequences:
[0109]
[0110] U0 represents the unknown system input data matrix at time k; X0 represents the unknown system state data matrix at time k; X1 represents the unknown system state data matrix at time k+1. For simplicity, we use Represents the above data series set.
[0111] Since the input-state data set in the offline data of the target system includes input data and state data at multiple moments, the system offline optimization method proposed in this application needs to specifically identify the data at each moment and then perform model predictive control. The process is as follows:
[0112] Specific identification method for each moment:
[0113] Assume that a set of state-input data is obtained through experiments And the following data identification valid information conditions must be met.
[0114] Proposition 1: If the input-state data If the following conditions are met, the data set is considered to be informative for system identification:
[0115]
[0116] Therefore, if the data satisfies the previous formula, then there exists a right inverse matrix [V1 V2] that satisfies:
[0117]
[0118] Proposition 1 shows that It needs to be full rank, and for unknown process disturbances, it can be regarded as noise, and ω is used to represent noise data. Then for T, different lengths N j , j = 1, ...T, the superimposed noise matrix W can be expressed as:
[0119] W=[ω (1) (0)…ω (1) (N1-1)…ω (T) (0)…ω (T) (N k -1)]
[0120] In order to effectively represent noise data, this application uses the Chino polyhedron wrapping generation set technology, which can well represent different types of noise data. As shown in the form of Definition 2, it is expressed as Then, the superposition noise matrix W can be represented by the matrix Qino polyhedron shown in Definition 3, which is:
[0121]
[0122]
[0123] in,
[0124]
[0125] Obviously, the matrix Qino polyhedron is composed of multiple noisy Chino polyhedra Then the matrix pair [AB] containing all the possibilities of the system can be expressed as:
[0126]
[0127] Next, the noise matrix Qino polyhedron is used to calculate the system matrix [AB] pair containing all possibilities of the set of data. The following is a method for calculating the system matrix based on the noise matrix Qino polyhedron: Given an unknown system input-state trajectory D = (U0, X) and ensuring that the matrix Full rank, then the matrix Zino polyhedron containing all possible dynamic matrices is calculated as:
[0128]
[0129] Consistent with the data D = (U0, X) and the noisy Qino polyhedron, The previous formula only uses the data D = (U0, X) to provide a purely data-based calculation method for the unknown system matrix [AB], and the previous formula uses the right inverse theory, which requires For full rank.
[0130] By using the previous formula, we can calculate t i , i=k, k+1, ..., k+m contain all possible system matrices of the unknown system at the moment. In other words, through the above set operation method, the system matrix parameters of the unknown system can be determined within a certain effective range. However, since the operation result is performed under the assumption that the noise Qino polyhedron is large enough, the obtained system matrix {[AB]} is further optimized to find more accurate system matrix parameters. The application also discloses an optimal parameter solution algorithm, which is expressed as follows:
[0131]
[0132]
[0133]
[0134] Where Θ: = {A, B} is the decision variable, volume represents the target noise Chino polyhedron Volume. In the range, by continuously searching for a set of [AB], the calculation results of X1-{AX0+BU0}} are all wrapped in the smallest Chino polyhedron Therefore, it can also be understood as finding the optimal system matrix parameters {[AB]} corresponding to the smallest Chino polyhedron containing all unknown noise data by gradually reducing the encapsulation range of the unknown noise Chino polyhedron. Therefore, by optimizing with the previous formula, it can be ensured that all unknown noises of the system are encapsulated in the smallest noise Chino polyhedron, and at the same time determine the system model matrix parameters represented by this set of data. Of course, in the optimization process, the smaller the volume of the noise Chino polyhedron, the closer it is to the actual system, and the model error is also the smallest.
[0135] Based on the above content, the present application also discloses that the previous formula can be solved by Algorithm 1, wherein the solution process of Algorithm 1 is as follows:
[0136]
[0137] Among them, lines 1-4 in Algorithm1 are used to find the smallest Zino polyhedron that encloses the noise data and the optimal system matrix parameters {[AB]}. Zonotope.enclosepoint means the smallest Zino polyhedron that encloses the noise data, (:, s) means all rows in the sth column, [A k B k ] means from [AB] range Take [AB] corresponding to k, size(*) represents the length of data(*). Algorithm1 can be calculated by YALMIP toolbox in MATLAB / SIMULINK programming software.
[0138] The optimal control input calculation at each moment is:
[0139] Obtain the discrete dynamics model of the unknown system (target system):
[0140]
[0141] where C is the identity matrix of appropriate dimensions and D is 0.
[0142] The MPC cost function (model predictive control cost function) J is defined by the tracking error between the system expected output reference r and the model output y and the input u:
[0143]
[0144] In the above formula, J represents the objective function of the model predictive control cost function, (k+i|k) represents the predicted value at the k+i moment, E represents the difference between the model output and the system expected output reference, Z represents the prediction interval, Q and R represent weight matrices, and F represents the terminal error matrix.
[0145] MPC can be optimized as:
[0146]
[0147] subject to
[0148]
[0149]
[0150] ξ p (k|k)=ξ p (k)
[0151] ξ p (k+1)=Aξ p (k)+Bu(k) (12)
[0152] In the above formula, (*) lb and(*) ub represents the infimum and supremum of (*), where the optimized constraints can be given by Algorithm2 as follows:
[0153] MPC optimization control input calculation steps.
[0154]
[0155] The system offline optimization method of this application combines the algorithm flow chart of Algorithm 1 and Algorithm 2 as shown below: Figure 4 shown.
[0156] The following is an example of an intelligent water supply system. The structure diagram of the intelligent water supply system is as follows: Figure 5 As shown:
[0157] The system includes a water supply tank simulating a water source, three parallel water supply tanks simulating regional water supply, and a recycling water tank at the bottom. In terms of instruments, it is equipped with a pump, a control valve, and a detection instrument to form an intelligent water supply system with recyclable water resources. The system changes the water level of the three water tanks by changing the valve opening of each branch. The pump runs at a constant speed. The control input signal of the system is the opening of the control valve of the three branch water tanks, and the state is the difference between the to-be-stabilized water level h of the parallel water supply tanks and the current water level h. The system can be regarded as a multi-input and multi-output system with three inputs and three states. The goal of the intelligent water supply system control experiment is to use a small amount of input-state data of the unknown system and the algorithm proposed in this paper to achieve stable control of the water level of the three branch water tanks at a given reference value.
[0158] First, the offline data of the system is as follows. Each sampling time interval is 5s. Different input values are randomly input, and the state data corresponding to each input value is recorded to obtain the input-state data set. Based on the input-state data, the experiment assumes that the noise Chino polyhedron of the water tank system is I is the unit matrix of appropriate dimension. Then, according to lines 1-4 of Algorithm1, the unknown system can be calculated to contain all possible system matrices [AB] pairs, thereby obtaining the linear state space equations represented by the set of data. The MPC control algorithm parameters are set to Q=I, F=I, R=0.1*I. The MPC prediction step size is set to N=5, that is, it includes 5 steps, the initial state is set to the last state of the input-state data, and the state constraint is -3<ξ p <3, the input constraint is 0<u<0.01, corresponding to the valve opening 0°~90°. The water level height of the water tank to be stabilized is Through the system offline optimization method of this application, the optimization effect of the intelligent water supply system is as follows: Figure 6 As shown, it is beneficial for the intelligent water supply system to improve the control accuracy of the water level heights of the three water tanks, and can prevent the water level heights of the three water tanks from being significantly higher than the water level height to be stabilized in the water tanks.
[0159] See also Figure 7The second embodiment of the present application discloses a system offline optimization device, comprising:
[0160] An offline data acquisition module 1 is used to acquire offline data of a target system, wherein the offline data includes an input-state data set and system process noise data wrapped by a Chino polyhedron wrapping technique;
[0161] An offline optimized input control data acquisition module 2 is used to acquire offline optimized input control data according to the input-state data set and the system process noise data;
[0162] The system optimization module 3 is used to optimize the target system according to the offline optimization input control data.
[0163] It should be noted that the system offline optimization device provided in the second embodiment of the present application only uses the division of the above-mentioned functional bodies as an example when executing the system offline optimization method. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. In addition, the system offline optimization device provided in the second embodiment of the present application and the system offline optimization method of the first embodiment of the present application belong to the same concept. The implementation process is detailed in the method embodiment, which will not be repeated here.
[0164] A third embodiment of the present application discloses a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the system offline optimization method described above are implemented.
[0165] The fourth embodiment of the present application discloses a computer device, including a memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the processor implements the steps of the system offline optimization method described above when executing the computer program.
[0166] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.
[0167] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing device to work in a specific way, so that the instructions stored in the computer-readable memory produce a product including an instruction device, which implements the function selected in the process. Figure 1 A process or multiple processes and / or boxes Figure 1 function selected in a box or multiple boxes.
[0168] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 steps for the function selected in a box or multiple boxes.
[0169] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.
[0170] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.
[0171] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.
[0172] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0173] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included within the scope of the claims of the present application.
Claims
1. A system offline optimization method, characterized in that: include: Acquire offline data of the target system, wherein the offline data includes an input-state data set and system process noise data wrapped by a Chino polyhedron wrapping technique; Acquire offline optimized input control data according to the input-state data set and the system process noise data; The target system is optimized according to the offline optimization input control data.
2. The system offline optimization method according to claim 1, characterized in that: The step of obtaining offline optimized input control data according to the input-state data set and the system process noise data comprises: Obtaining a parameter matrix including a plurality of candidate linear model parameters according to the input-state data set and the system process noise data; Obtain a target noise Chino polyhedron with the smallest face in the parameter matrix; According to the target noise Chino polyhedron, optimized input control data is obtained.
3. The system offline optimization method according to claim 2, characterized in that: The step of obtaining the target noise Chino polyhedron with the smallest face in the parameter matrix comprises: The target noise Chino polyhedron with the smallest surface is obtained by the following formula: in, Represents the target noise Chino polyhedron with the smallest face; ω min Represents the smallest noise data; zonotope.enclosepoint represents the smallest Qino polyhedron that includes the noise data.
4. The system offline optimization method according to claim 2, characterized in that: The step of obtaining optimized input control data according to the target noise Chino polyhedron comprises: Obtaining the polyhedron volume of the target noise Chino polyhedron; Construct a discrete dynamics model of the target system and obtain a model output of the discrete dynamics model; Constructing a model predictive control cost function according to the system expected output reference, the model output and the input data; According to a preset prediction step length, solving the model to obtain a prediction control input value corresponding to each prediction step number; The optimized input control data is obtained according to the predicted control input values corresponding to each of the predicted steps.
5. The system offline optimization method according to claim 4, characterized in that: The step of obtaining the optimized input control data according to the prediction control input values corresponding to the prediction steps comprises: Get the selected target number of steps from the predicted number of steps; The predicted control input value corresponding to the target deployment is determined as the optimized input control data.
6. The system offline optimization method according to claim 4, characterized in that: The step of obtaining the polyhedron volume of the target noise Chino polyhedron comprises: The volume of the target noise Chino polyhedron is obtained by the following formula: Where V represents the volume of the target noisy Kino polyhedron, volume represents the algorithm formula for obtaining the volume of the noisy Kino polyhedron, Represents the target noisy Qino polyhedron with the smallest face.
7. The system offline optimization method according to claim 4, characterized in that: The model predictive control cost function is: Among them, J represents the objective function of the model predictive control cost function, (k+i|k) represents the predicted value at the k+ith moment, E represents the difference between the model output and the system expected output reference, Z represents the prediction interval, Q and R represent the weight matrix, and F represents the terminal error matrix.
8. A system offline optimization device, characterized in that: include: An offline data acquisition module, used to acquire offline data of a target system, wherein the offline data includes an input-state data set and system process noise data wrapped by a Chino polyhedron wrapping technique; An offline optimized input control data acquisition module, used for acquiring offline optimized input control data according to the input-state data set and the system process noise data; A system optimization module is used to optimize the target system according to the offline optimization input control data.
9. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the system offline optimization method according to any one of claims 1 to 7 are implemented.
10. A computer device, characterized in that: The system comprises a memory, a processor and a computer program stored in the memory and executable by the processor, wherein the processor implements the steps of the system offline optimization method according to any one of claims 1 to 7 when executing the computer program.
Citation Information
Cited By
Tracking control system finite time secrecy attack test method and device
CN120993875A
