Stacking optimization method and system for energy storage mass blocks
Through the automated control system of synchronous motor and dynamic programming algorithm, the problems of low mass stacking and loading and unloading efficiency and insufficient path optimization in traditional gravity energy storage systems are solved, and efficient and stable mass stacking and loading and unloading are achieved, improving system response Capacity and energy conversion efficiency.
Patent Information
- Application Number
- CN202411140887.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-20
- Publication Date
- 2024-11-22
AI Technical Summary
Traditional gravity energy storage systems have problems such as inefficient efficiency in mass stacking and loading and unloading, insufficient path optimization, and insufficient monitoring and feedback control, resulting in poor system response capabilities and unstable stacking.
An automated control system based on synchronous motor and dynamic programming algorithm is adopted to monitor the motor stator current signal in real time, calculate the current change rate, optimize the stacking path and strategy, and automatically complete the stacking and loading and unloading process of mass blocks.
It significantly improves stacking and loading and unloading efficiency, enhances the system's response capability and stability, optimizes space utilization, reduces operation and maintenance costs, and improves energy conversion efficiency.
Smart Images

Figure CN119005472A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of gravity energy storage, and in particular to a stacking optimization method and system for energy storage mass blocks. Background Art
[0002] With the continuous development of renewable energy, the rapid growth of fluctuating power sources, mainly wind and solar energy, has led to prominent power imbalance contradictions and an increasing demand for various energy storage technologies in the power grid. Energy storage is an important technology and basic equipment to support new power systems. It is of great significance to promote green energy transformation, ensure energy security, and achieve carbon peak and carbon neutrality. The role of energy storage technology includes: supporting the operation of power systems with a high proportion of renewable energy, improving the flexibility and reliability of diversified energy systems, providing support for energy management and path optimization of diversified energy systems, and increasing the freedom of energy trading.
[0003] Energy storage technology can be divided into large-scale energy storage technology and distributed energy storage technology according to capacity. Among them, large-scale energy storage technology will occupy a core position in the future power grid because it can achieve the decoupling of power supply and demand in time and space, smooth the volatility of new energy power stations to assist their friendly access to the grid, etc. Low-cost, highly adaptable, large-capacity new energy storage technology is one of the disruptive technologies for building a new power system.
[0004] Energy storage technology can be divided into mechanical energy storage, electrochemical energy storage, chemical energy storage, electrical energy storage and thermal energy storage according to the form of energy storage. Among them, mechanical energy storage technology can be divided into kinetic energy storage technology (such as flywheel energy storage), elastic potential energy storage technology (such as compressed air energy storage) and gravity potential energy storage technology.
[0005] Gravity energy storage is a physical energy storage that is competitive in both environmental protection and economy. It has significant advantages such as environmental friendliness, flexible layout, high safety, long life, and no self-discharge. It has outstanding research and development value and broad application prospects. At present, gravity energy storage technology is still in the exploratory stage and needs further exploration to promote preliminary research, program planning and technology development, and provide backup support for the long-term development of new energy.
[0006] Compared with pumped storage, which uses water as weight, its development is greatly restricted by geographical conditions and has a construction period of 7-8 years. The energy storage technology based on solid gravitational potential energy uses high-density solids as weights, and has outstanding advantages in site adaptability, expansion flexibility, energy density, efficiency, and economy. Compared with electrochemical energy storage and hydrogen energy storage, solid gravity energy storage technology has natural grid synchronization and inertia, and is better in economy and safety. Therefore, it is very likely to partially replace the existing mainstream large-scale energy storage technology and change the existing large-scale energy storage pattern.
[0007] my country's new energy power generation resources such as wind power and photovoltaic power are mainly distributed in the "Three Norths" and western regions, but generally lack the conditions for pumped storage construction. Solid gravity energy storage technology has strong geographical adaptability and flexible and rapid response. It is very suitable for construction and operation in such areas and large-scale new energy sources, as a beneficial supplement to pumped storage technology. In recent years, solid gravity energy storage technology has attracted more and more widespread attention. Foreign solid gravity energy storage technology-related concepts have generally transitioned from theoretical verification to engineering application. However, the current related research lacks a systematic summary of the various technical routes of solid gravity energy storage and its development status, and lacks evaluation indicators for large-scale energy storage. Solid gravity energy storage technology and other energy storage technologies still need further comparative analysis to clarify its application positioning and development prospects.
[0008] Traditional gravity energy storage systems have problems such as low efficiency, insufficient path optimization, and insufficient monitoring and feedback control in the stacking and loading and unloading of mass blocks. The stacking and loading and unloading of mass blocks mainly rely on manual operations, which is difficult to meet the needs of large-scale energy storage systems. In addition, the lack of scientific path optimization algorithms leads to long stacking and loading and unloading times for mass blocks, affecting the system's rapid response capabilities. At the same time, the lack of real-time monitoring and feedback control systems makes it impossible to dynamically adjust the stacking and loading and unloading process of mass blocks, which is prone to stacking instability and collision problems.
[0009] In order to overcome the above shortcomings, the present invention provides an automatic stacking and loading and unloading technology for energy storage mass blocks based on synchronous motors and dynamic programming algorithms. This technology achieves accurate and efficient stacking and loading and unloading of mass blocks by real-time monitoring of motor stator current signals, calculation of current change rate, optimization of paths based on dynamic programming algorithms, automatic control of stacking landing gear and cranes, real-time monitoring and feedback control, thereby improving the operating efficiency and response speed of the system. Summary of the invention
[0010] In view of the above-mentioned problems, the present invention is proposed.
[0011] Therefore, the technical problem solved by the present invention is: how to solve the problems of low efficiency, insufficient path optimization, and insufficient monitoring and feedback control in the traditional gravity energy storage system in terms of mass block stacking and loading and unloading.
[0012] In order to solve the above technical problems, the present invention provides the following technical solutions: a stacking optimization method of an energy storage mass block, comprising: real-time monitoring and collecting stator current signals of a synchronous motor, and converting the stator three-phase AC signals into two-phase DC signals;
[0013] Calculate the rate of change of the stator current, and determine whether the mass block is in the slope section or the stack platform according to a threshold value of the rate of change;
[0014] According to the position of the mass block, the optimal stacking path and strategy are calculated based on the dynamic programming algorithm;
[0015] The stacking and loading and unloading processes of the mass blocks are automatically completed according to the optimized stacking path and strategy.
[0016] As a preferred solution of the stacking optimization method of the energy storage mass block described in the present invention, wherein: the converting of the stator three-phase AC signal into a two-phase DC signal includes converting the stator three-phase AC signal into a two-phase DC signal I by Park transformation d and I q , the expression is:
[0017] Among them, I d Indicates the direct axis current, I q represents the quadrature axis current, represents the three-phase stator current signal of the synchronous motor, ω represents the electrical frequency, t represents the time, and ωt represents the electrical angle.
[0018] As a preferred solution of the stacking optimization method of the energy storage mass block described in the present invention, wherein: the calculation of the change rate of the stator current includes that when the mass block is in the slope section, the gravity component and friction force of the mass block along the slope are constant values, and the combined force acts on the motor to show the mechanical torque T of the motor. m , at this time the electromagnetic torque T provided by the synchronous motor e and the mechanical torque T m equal;
[0019] When the mass block reaches the stacking platform, the motor is subjected to a mechanical torque T` m The friction force f' on the mass block causes the mechanical torque to change, which in turn causes the electromagnetic torque provided by the synchronous motor to change. Since the magnetic field in the q-axis direction affects the rotation of the rotor, the electromagnetic torque T e and the stator q-axis current I q Correspondingly, the stator q-axis current I q Can determine the electromagnetic torque T of synchronous motor e Whether there is a change, and then judge the running position of the mass block;
[0020] Real-time monitoring of synchronous motor stator q-axis current I q , and calculate I q Regarding the change rate K of time t, the threshold of the change rate K is set to M. When the change rate K is less than the threshold M, it means that the running position of the mass block is on the slope. When the change rate K is greater than the threshold M, it means that the running position of the mass block has left the slope section.
[0021] As a preferred solution of the stacking optimization method of the energy storage mass block described in the present invention, the threshold setting of the change rate K is as follows:
[0022]
[0023] When the mass block runs stably on the slope section, I q The average value of the rate of change is denoted by K si (i>0), where i represents the number of mass blocks on the slope segment, and the number of mass blocks on the slope is adjusted;
[0024] Assume that the maximum number of mass blocks running simultaneously on the slope is n, monitor and calculate the I corresponding to different numbers of mass blocks running on the slope q The mean rate of change, denoted by K si (i>0), take K s =max(K si );
[0025] In order to accurately judge the running position of the mass block and avoid misjudgment of the running position due to fluctuations when running on the slope section, the q-axis current I is set q The duration of the change rate K being greater than the threshold M is T;
[0026] When the rate of change K is greater than the threshold M and the duration is greater than T, it is determined that the running position of the mass block has changed and has left the slope running area; when the rate of change K is greater than the threshold M but the duration is less than T, or the rate of change K is less than the threshold M, it is determined that the running position of the mass block is in the slope area.
[0027] As a preferred solution of the stacking optimization method of the energy storage mass block described in the present invention, wherein: the calculation of the optimal stacking path and strategy includes, when the position of the mass block is determined to be a stacking platform, dividing the stacking platform into a plurality of tracks, assuming that the stacking track numbers are represented from left to right as L 1 ,L 2 ,…,L n , the number of mass blocks that can be stacked on each track is represented by a 1 ,a 2 ,a 3 ,…,a n ;
[0028] The length of the buffer track corresponding to each stacking track is l 1 ,l 2 ,l 3 ,…,l n , the mass block travels on the track at a speed of v m / s under standard conditions,
[0029] Due to the difference in friction, let the speed of the mass block on the i-th track be k i ×v, where k i represents the friction coefficient;
[0030] Taking the shortest time to stack all the mass blocks as the objective function, construct the objective function T:
[0031]
[0032] Among them, x i represents the number of mass blocks allocated on the ith track, l i represents the buffer length of the ith track, k i represents the friction coefficient, v represents the standard speed, and L represents the length of each mass block;
[0033] Set the track congestion threshold CO. When the congestion level in track i exceeds the congestion threshold CO, there is a constraint condition, which is expressed as:
[0034]
[0035] The boundary conditions are:
[0036]
[0037] When the congestion level in track i does not exceed the congestion threshold CO, its boundary condition is:
[0038]
[0039] Among them, a i represents the maximum number of mass blocks that can be stacked on the ith track; m represents the total number of mass blocks; Indicates the total number of mass blocks that can be stacked on all tracks.
[0040] As a preferred solution of the stacking optimization method of the energy storage mass block described in the present invention, wherein: the calculation of the optimal stacking path and strategy also includes, according to the position and track state of the mass block, using a dynamic programming algorithm to calculate the optimal stacking path, setting the initial state to S 1 , let the optimal value function f k (S k ) indicates that the initial state of the kth stage is S k , the minimum time obtained from stage k to stage n;
[0041] Starting from the nth stage, the recursive equation is used to solve the optimal value:
[0042]
[0043] Among them, D n (S n ) indicates that the state S n The set of permissible decisions for the determined nth stage;
[0044] Get the optimal solution xn =x n (S n ) and the optimal value f n (S n (;
[0045] In the n-1th stage, it is expressed as:
[0046]
[0047] s n =T n-1 (s n-1 ,x n-1 )
[0048] The optimal solution is x n-1 =x n-1 (S n-1 ), the optimal value is f n-1 (S n-1 );
[0049] In the kth stage, it is expressed as:
[0050]
[0051] in:
[0052]
[0053] Solve the optimal solution:
[0054]
[0055] And the optimal value:
[0056] f k (s k )
[0057] Until the first stage, it can be expressed as:
[0058]
[0059] in:
[0060] s 2 =T 1( s 1 ,x 1 )
[0061] Solve to get the optimal solution x 1 =x 1 (S 1 ) and the optimal value f 1 (S 1 );
[0062] Finally, the optimal decision and path for each stage are determined through the reverse method, and the calculation of the optimal stacking path and strategy is completed.
[0063] As a preferred solution of the stacking optimization method of the energy storage mass block described in the present invention, the automatic completion of the stacking and loading and unloading process of the mass block includes: using a control system to control a crane of the stacking landing gear to move the unloaded bracket to the target mass block position;
[0064] At the target mass block position, rotate the bracket to the loaded state and lift the bottom of the mass block;
[0065] The crane lifts the mass block and moves it horizontally to the predetermined stacking track position;
[0066] The crane descends at the predetermined stacking track position and places the mass block at the designated stacking position;
[0067] The rotating bracket returns to the no-load state;
[0068] Monitor the position and status of the mass block in real time to ensure that the mass block is accurately placed in the predetermined stacking position;
[0069] After all the masses have been stacked and loaded and unloaded, a final inspection is performed on the position and status of each mass, and a report on the stacking and loading and unloading process is generated.
[0070] A stacking optimization system for energy storage mass blocks includes: a stator current signal monitoring module: real-time monitoring and collection of stator current signals of synchronous motors, and conversion of stator three-phase AC signals into two-phase DC signals;
[0071] Mass block position judgment module: calculates the rate of change of the stator current and judges whether the position of the mass block is in the slope section or the stack platform according to the threshold of the rate of change;
[0072] Stacking path and strategy calculation module: According to the position of the mass block, based on the dynamic programming algorithm, the optimal stacking path and strategy are calculated;
[0073] Automatic mass stacking and loading and unloading module: automatically completes the stacking and loading and unloading process of mass blocks according to the optimized stacking path and strategy.
[0074] A computer device comprises: a memory and a processor; the memory stores a computer program, wherein: the processor implements the steps of any one of the methods of the present invention when executing the computer program.
[0075] A computer-readable storage medium stores a computer program, wherein: when the computer program is executed by a processor, the steps of any one of the methods of the present invention are implemented.
[0076] Beneficial effects of the invention: The invention realizes efficient stacking and loading and unloading of energy storage mass blocks through an automated control system, real-time monitoring and a dynamic programming algorithm. It significantly improves stacking and loading and unloading efficiency, enhances the responsiveness of the system, improves operational stability and safety, optimizes space utilization, reduces operation and maintenance costs, and improves energy conversion efficiency. The technology is highly adaptable and has broad application prospects. BRIEF DESCRIPTION OF THE DRAWINGS
[0077] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for describing the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. Among them:
[0078] Figure 1 A flowchart of a stacking optimization method for energy storage mass blocks provided in a first embodiment of the present invention;
[0079] Figure 2 A schematic diagram of a force analysis of a mass block of an energy storage mass block stacking optimization method provided by the first embodiment of the present invention;
[0080] Figure 3 A schematic diagram of mass block force analysis of a stacking optimization method of energy storage mass blocks provided in the first embodiment of the present invention;
[0081] Figure 4 A flow chart of obtaining a change rate threshold value of a stacking optimization method for energy storage mass blocks provided in a first embodiment of the present invention;
[0082] Figure 5 A flow chart of mass block position determination of a stacking optimization method for energy storage mass blocks provided by the first embodiment of the present invention;
[0083] Figure 6 A diagram of the installation position of a landing gear for stacking a trolley in a stacking area of an energy storage mass block stacking optimization method provided by the first embodiment of the present invention;
[0084] Figure 7 A structural diagram of a landing gear conveyor chain for a stacking trolley in a stacking area of an energy storage mass block stacking optimization method provided by the first embodiment of the present invention, wherein Figure (a) is a top view and Figure (b) is a side view;
[0085] Figure 8 A schematic diagram of a path-finding problem solved by dynamic programming for a stacking optimization method of energy storage mass blocks provided in the first embodiment of the present invention. DETAILED DESCRIPTION
[0086] In order to make the above-mentioned purposes, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are described in detail below in conjunction with the drawings of the specification. Obviously, the described embodiments are part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary persons in the art without creative work should fall within the scope of protection of the present invention.
[0087] Example 1
[0088] Reference Figures 1 to 8 , as an embodiment of the present invention, provides a stacking optimization method for energy storage mass blocks, comprising:
[0089] S1: Monitor and collect the stator current signal of the synchronous motor in real time, and convert the stator three-phase AC signal into a two-phase DC signal.
[0090] In the "slope-type" gravity energy storage system, a synchronous motor can be used to ensure that the system can provide a certain inertial support. The discrete energy storage mass block is directly connected to the motor rotor shaft through a transmission system. Taking the system charging process as an example, when the mass block runs on a slope, the electrical energy is converted into the gravitational potential energy of the mass block. The stator current of the synchronous motor is relatively large to generate an electromagnetic torque to allow the mass block to run stably. When the mass block runs to the stack platform, the electromagnetic torque provided by the synchronous motor decreases, which is reflected in the current as a decrease in the stator current. Therefore, the position of the mass block can be judged by the change in the stator current of the synchronous motor.
[0091] First, the three-phase stator current of the electric motor / generator for the ramp-type gravity energy storage system is obtained. According to the principle of synchronous motor vector control, the stator three-phase AC signal is converted into a two-phase DC signal I through Park transformation. d ,I q .
[0092]
[0093] Among them, I d Indicates the direct axis current, I q represents the quadrature axis current, represents the three-phase stator current signal of the synchronous motor, ω represents the electrical frequency, t represents the time, and ωt represents the electrical angle.
[0094] S2: Calculate the rate of change of the stator current, and determine whether the position of the mass block is in the ramp section or the stack platform according to the threshold of the rate of change.
[0095] In the slope gravity energy storage system, the mass block is located in two main places, namely the stack platform and the slope section. The mass block is pulled by a synchronous motor. Taking the charging process of the energy storage system as an example, during operation, the mass block is mainly affected by three forces along the direction of movement, such as Figure 2 As shown, there are the pulling force provided by the synchronous motor, the gravity component of the mass block along the slope, and the friction force. The relationship between the three can be expressed as:
[0096] F 1 =mgsinθ+f
[0097] In the formula, F 1 is the pulling force provided by the synchronous machine, m is the mass of the mass block, g is the acceleration of gravity, θ is the slope angle, and f is the friction force on the mass block.
[0098] When the mass block is in the slope section, the gravity component and friction force of the mass block along the slope are constant. The combined force of the two acts on the motor as the mechanical torque Tm received by the motor. At this time, the synchronous motor runs stably, that is, the electromagnetic torque Te provided by the synchronous motor is equal to the mechanical torque Tm received. Figure 2 As shown; when the running position of the mass block reaches the stack platform, the mechanical torque Tm' of the motor is only provided by the friction force f' of the mass block, as shown Figure 3 As shown in the figure, the mechanical torque changes, which in turn causes the electromagnetic torque provided by the synchronous motor to change. Since the magnetic field in the q-axis direction affects the rotation of the rotor, the electromagnetic torque T e and the stator q-axis current I q Correspondingly, the stator q-axis current I q Can determine the electromagnetic torque T of synchronous motor e Whether there is any change, then determine the running position of the mass block.
[0099] Real-time monitoring of synchronous motor stator q-axis current I q , and calculate I q Regarding the change rate K of time t, the threshold of the change rate K is set to M. When the change rate K is less than the threshold M, it means that the running position of the mass block is on the slope. When the change rate K is greater than the threshold M, it means that the running position of the mass block has left the slope section.
[0100]
[0101] For the threshold setting of the change rate K, when the mass block runs stably in the slope section, I q The average value of the rate of change is denoted by K si (i>0), where i represents the number of mass blocks on the slope segment. Adjust the number of mass blocks on the slope. Assuming that the maximum number of mass blocks running on the slope at the same time is n, monitor and calculate the corresponding I of different numbers of mass blocks running on the slope. q The mean rate of change, denoted by K si (i>0), take K s =max(K si ), the value of the change rate threshold M retains a certain margin and is set to Ks Twice, the process of obtaining it is as follows Figure 4 shown.
[0102] M=2K s
[0103] In order to accurately judge the running position of the mass block and avoid misjudgment of the running position due to fluctuations when running on the slope section, the q-axis current I is set q The duration during which the change rate K is greater than the threshold M is T.
[0104] When the rate of change K is greater than the threshold M and the duration is greater than T, it is determined that the running position of the mass block has changed and has left the slope running area; when the rate of change K is greater than the threshold M but the duration is less than T, or the rate of change K is less than the threshold M, it is determined that the running position of the mass block is in the slope area. The specific position determination process is as follows: Figure 5 shown.
[0105] S3: According to the position of the mass block, the optimal stacking path and strategy are calculated based on the dynamic programming algorithm.
[0106] When the position of the mass block is determined to be the stacking platform, the stacking platform is divided into multiple tracks. The site is designed to be circular or rectangular according to the terrain. The stack is arranged vertically, and the upper end is the mass block running track, from which the mass block enters and exits the stacking site. Assume that the stacking tracks are numbered from left to right as L 1 ,L 2 ,…,L n ; The number of mass blocks that can be stacked on the track is a 1 ,a 2 ,a 3 ,…,a n , each standard mass block is L meters long, and the mass blocks are closely arranged when stacked; the length of the buffer track corresponding to each stacking track is l 1 ,l 2 ,l 3 ,…,l n , under standard conditions, the speed of the mass block on the track is v meters per second.
[0107] Dynamic programming is one of the important methods for finding the optimal method. This method regards a problem as a multi-stage process with a chain structure, which is called a multi-stage decision-making process. The most typical example is the shortest route problem: given a line network, the number on the line between two points represents the distance between the two points, and find a pipe-laying route from A to G that makes the total distance the shortest.
[0108] according to Figure 8, from point A to point G can be divided into 6 stages: in the first stage, A is the starting point, and the end point can be selected from B1 or B2. If the decision is to choose B2, then B2 is the result of the first stage decision, which is both the end point of the first stage route and the starting point of the second stage route; in the second stage, starting from point B2, the set of available end points is {C2, C3, C4}. If C2 is selected, C2 is the end point of the second stage and the starting point of the third stage; and so on. Obviously, when the starting point of a certain stage is given, it will affect the route of the subsequent stages and the length of the total route, while the development of the routes of the subsequent stages is not affected by the decisions of the previous stages. Therefore, the requirement of this problem is to choose an appropriate decision at each stage and obtain the shortest total route through the decision sequence composed of these decisions.
[0109] The important characteristics of the shortest route are: if the shortest route from starting point A through points P and H to end point G is a shortest route, then the sub-route from point P through point H to end point G must also be the shortest route for all possible routes from point P to the end point. For example, in the shortest route problem, if A→B1→C2→D1→E2→F2→G is found to be the shortest route from point A to point G, then D1→E2→F2→G is the shortest route from point D1 to point G. Based on the characteristics of the shortest route, we can get a method to obtain the shortest route using the inverse method.
[0110] In the process of solving the problem using the dynamic programming algorithm, the given problem can be divided into several interrelated stages. Each stage has multiple states. The evolution from one state to another can be expressed by the state transition equation:
[0111] s k+1 =T k (s k ,u k )
[0112] The iteration between stage k and stage k+1 k push ( close ) It is called a recursion equation, or a fundamental equation:
[0113] k=n,n-1,…,1
[0114] The indicator function is used to measure the quality of the implemented process and can be in the form of the sum or product of the indicators of each stage.
[0115] When solving dynamic programming problems, you can choose to use the reverse solution or the forward solution according to the known conditions of the problem. When the initial state is given, the reverse solution can simplify the problem. When the terminal state is given, the forward solution can simplify the problem. Suppose the known initial state is S 1 , and assume that the optimal value function f k (Sk ) indicates that the initial state of the kth stage is S k , the maximum benefit obtained from stage k to stage n.
[0116] Starting from stage n, we have:
[0117]
[0118] Among them, D n (S n ) is the state S n The set of permissible decisions for the nth stage is determined by solving this one-dimensional extreme value problem and obtaining the optimal solution x n =x n (S n ) and the optimal value f n (S n ).
[0119] In the n-1th stage, it is expressed as:
[0120]
[0121] s n =T n-1 (s n-1 ,x n-1 )
[0122] The optimal solution is x n-1 =x n-1 (S n-1 ), the optimal value is f n-1 (S n-1 ); in the kth stage, there is
[0123]
[0124] in
[0125] s k+1 =T k (s k ,x k )
[0126] Solve the optimal solution:
[0127] x k =x k (s k )
[0128] And the optimal value:
[0129] f k (s k )
[0130] And so on, until the first stage, there are:
[0131]
[0132] in:
[0133] s 2 =T 1 (s 1 ,x 1 )
[0134] Solve to get the optimal solution x 1 =x 1 (S 1 ) and the optimal value f 1 (S 1 ).
[0135] Since the initial state S 1 Known, so x 1 =x 1 (S 1 ) and f 1 (S 1 ), so x 2 =x 2 (S 2 ) and f 2 (S 2 ) can also be determined.
[0136] In this way, by calculating in the reverse order of the above recursive process, the decisions and benefits of each stage can be gradually determined.
[0137] There are n tracks and m mass blocks, and each track has a certain number of positions for the mass blocks to be stacked (as one of the boundary conditions);
[0138] There are n stages in the setup;
[0139] Set variable x: the number of mass blocks allocated from the kth track to the nth track;
[0140] The speed through the buffer is assumed to be the same as the corresponding stacking track;
[0141] The objective function is to take the shortest time required to stack all the mass blocks.
[0142] The objective function is obtained as:
[0143]
[0144] When the tracks are crowded, there must be a mass block on each track to put all the mass blocks into the stack. At this time, the boundary condition of the i-th track is no longer greater than zero and less than the maximum stacking number, but:
[0145]
[0146]
[0147] Otherwise, the boundary conditions are
[0148]
[0149] Given the initial state, use the inverse method:
[0150] Assume that the initial state is S 1 , and assume that the optimal value function f k (S k ) indicates that the initial state of the kth stage is S k , the minimum time obtained from stage k to stage n.
[0151] Starting from stage n, we have
[0152]
[0153] Solving this one-dimensional extreme value problem, we can obtain the optimal solution and optimal value of the nth stage;
[0154] In the n-1th stage, we have:
[0155]
[0156] s n =T n-1 (s n-1 ,x n-1 )
[0157] The optimal solution is x n-1 =x n-1 (S n-1 ), the optimal value is f n-1 (S n-1 );
[0158] And so on, until the first stage, there are:
[0159]
[0160] Since the initial state S 1 Known, so x 1 =x 1 (s 1 ) and f 1 (s 1 ),thereby:
[0161] s 2 =T 1 (s 1 ,x 1 )
[0162] It can be determined that x2 =x 2 (s 2 ) and f 2 (s 2 ) can be determined, and then the reverse recursion can be performed.
[0163] S4: Automatically complete the stacking and loading and unloading process of the mass blocks according to the optimized stacking path and strategy.
[0164] During the stacking and loading and unloading process of the mass blocks, the mass blocks are transported between the docking trolley and the stacking track by a dedicated stacking landing gear, the structure of which is as follows: Figure 6 shown.
[0165] Figure 6 The horizontal track in the middle is the track for the docking trolley, and the vertical track is the track for the stacking area. Figure 7 (a) From the top view, it can be seen that the landing gear is divided into two parts: a fixed bracket and a movable crane. The cranes are divided into groups of two and can move longitudinally. Two L-shaped rotatable brackets are installed on the crane. The L-shaped brackets are parallel to the long sides of the fixed brackets in the unloaded state, that is, the bottom sides of the two L-shaped brackets are in the same straight line (called the unloaded state). With the movable crane, it can move in various directions; when loading, it first moves to the target mass block, and the L-shaped bracket rotates to be perpendicular to the long sides of the fixed bracket, that is, the bottom sides of the two L-shaped brackets are parallel and not in the same straight line (becoming a loaded state), thereby lifting the bottom of the mass block for transportation. Figure 7 (b) The steps to move the mass block from position ① to position ③ are:
[0166] Step 1: Move the unloaded L-shaped bracket to position ①, and rotate the L-shaped bracket to the loaded state to support the bottom of the mass block;
[0167] Step 2: The crane lifts the mass block, then moves it horizontally to position ②, and then descends to position ③;
[0168] Step 3: The L-shaped bracket rotates from a loaded state to an unloaded state.
[0169] This completes the process of placing the mass from the docking trolley to the stacking track (or vice versa).
[0170] It should be noted that the gravity energy storage system has the ability to cope with power changes, and the shorter the time it takes for the mass block to enter the running track from the stack area, the stronger the system's ability to cope with power changes. Take the ramp-type gravity energy storage system that uses synchronous motors for charging and discharging as an example. When the system responds to the grid dispatching command and enters the full-power running state from the half-power running state, because the synchronous machine has always been at the synchronous speed and the track running speed remains unchanged, the number of mass blocks on the running track should be doubled, that is, the time interval for the mass block to enter the running track from the stack area is reduced to half of the original. In a gravity energy storage system, the shorter the time it takes for the mass block to enter the running track from the stack area, the more it can meet the time requirements for the mass block to enter and exit the stack during full-power operation, and the stronger the system's ability to cope with power changes. Therefore, it is necessary to use a method to obtain a stacking method that minimizes the time it takes for the mass block to enter and exit the stack.
[0171] The above embodiment also includes a stacking optimization system for energy storage mass blocks, including:
[0172] Stator current signal monitoring module: monitors and collects the stator current signal of the synchronous motor in real time, and converts the stator three-phase AC signal into a two-phase DC signal;
[0173] Mass block position judgment module: calculates the rate of change of the stator current and judges whether the position of the mass block is in the slope section or the stack platform according to the threshold of the rate of change;
[0174] Stacking path and strategy calculation module: According to the position of the mass block, based on the dynamic programming algorithm, the optimal stacking path and strategy are calculated;
[0175] Automatic mass stacking and loading and unloading module: automatically completes the stacking and loading and unloading process of mass blocks according to the optimized stacking path and strategy.
[0176] The computer device may be a server. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected via a system bus, and the communication interface is connected to the system bus via the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data cluster data of the power monitoring system. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a stacking optimization method of an energy storage mass block is implemented.
[0177] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory may include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory may include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but are not limited to this.
[0178] Example 2
[0179] The following is an embodiment of the present invention, which provides a stacking optimization method for energy storage mass blocks. In order to verify the beneficial effects of the present invention, a scientific demonstration is carried out through simulation experiments.
[0180] There are three tracks, and the parameters of the tracks are a 1 =10,a 2 =8,a 3 =7; l 1 =2,l 2 =1,l 3 =1; k 1 =1.2,k 2=1.1,k 3 =1; standard speed is v=1(m / s); the length of the mass block is L=1m; the number of mass blocks is 15.
[0181] The objective function is
[0182]
[0183] The boundary conditions are:
[0184] untie:
[0185] The problem is divided into three stages: 1 Stage: All placed:
[0186] s 3 =x 3 s 3 +x 2 =s 2 s 2 +x 1 =s 1 =15
[0187] The third stage,
[0188] The second stage is to find the minimum value of this function
[0189]
[0190] The result is:
[0191]
[0192] In the first stage, we find the minimum value of this function:
[0193]
[0194] The minimum value is x 1 =5.3.
[0195] Reverse the process and the result is an integer value of 5 or 6.
[0196] x 1 =5
[0197] s 2 =15-5=10
[0198] x 2 =5.8≈6
[0199] s 3 =s 2 -x 2 =4
[0200] x 3 =s 3 =4
[0201] Substituting the number of mass blocks at each stage into the formula, we get
[0202] minT=20.83+24.55+18=63.38(s)
[0203] x 1 =6
[0204] s 2 =15-6=9
[0205] x 2 =3.7≈4
[0206] s 3 =s 2 -x 2 =5
[0207] x 3 =s 3 =5
[0208] Substituting the number of mass blocks at each stage into the formula, we get
[0209] minT=27.5+12.73+25=65.23(s)
[0210] So choose the first case.
[0211] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.
Claims
1. A stacking optimization method for energy storage mass blocks, characterized in that: include: Real-time monitoring and collection of the stator current signal of the synchronous motor, converting the stator three-phase AC signal into a two-phase DC signal; Calculate the rate of change of the stator current, and determine whether the mass block is in the slope section or the stack platform according to a threshold value of the rate of change; According to the position of the mass block, the optimal stacking path and strategy are calculated based on the dynamic programming algorithm; The stacking and loading and unloading processes of the mass blocks are automatically completed according to the optimized stacking path and strategy.
2. The stacking optimization method of energy storage mass blocks according to claim 1, characterized in that: The step of converting the stator three-phase AC signal into a two-phase DC signal includes converting the stator three-phase AC signal into a two-phase DC signal by Park transformation. d and I q , the expression is: Among them, I d Indicates the direct axis current, I q represents the quadrature axis current, represents the three-phase stator current signal of the synchronous motor, ω represents the electrical frequency, t represents the time, and ωt represents the electrical angle.
3. The stacking optimization method of the energy storage mass block according to claim 2, characterized in that: The calculation of the rate of change of the stator current includes that when the mass block is in the slope section, the gravity component and friction force of the mass block along the slope are constant, and the combined force acts on the motor to show the mechanical torque T of the motor. m , at this time the electromagnetic torque T provided by the synchronous motor e and the mechanical torque T m equal; When the mass block reaches the stacking platform, the motor is subjected to a mechanical torque T` m The friction force f' on the mass block causes the mechanical torque to change, which in turn causes the electromagnetic torque provided by the synchronous motor to change. Since the magnetic field in the q-axis direction affects the rotation of the rotor, the electromagnetic torque T e and the stator q-axis current I q Correspondingly, the stator q-axis current I q Can determine the electromagnetic torque T of synchronous motor e Whether there is a change, and then judge the running position of the mass block; Real-time monitoring of synchronous motor stator q-axis current I q , and calculate I q Regarding the change rate K of time t, the threshold of the change rate K is set to M. When the change rate K is less than the threshold M, it means that the running position of the mass block is on the slope. When the change rate K is greater than the threshold M, it means that the running position of the mass block has left the slope section.
4. The stacking optimization method of energy storage mass blocks according to claim 3, characterized in that: The threshold setting of the change rate K is as follows: When the mass block runs stably on the slope section, I q The average value of the rate of change is denoted by K si (i>0), where i represents the number of mass blocks on the slope segment, and the number of mass blocks on the slope is adjusted; Assume that the maximum number of mass blocks running simultaneously on the slope is n, monitor and calculate the I corresponding to different numbers of mass blocks running on the slope q The mean rate of change, denoted by K si (i>0), take K s =max(K si ); Assume that the q-axis current I q The duration of the change rate K being greater than the threshold M is T; When the rate of change K is greater than the threshold M and the duration is greater than T, it is determined that the running position of the mass block has changed and has left the slope running area; when the rate of change K is greater than the threshold M but the duration is less than T, or the rate of change K is less than the threshold M, it is determined that the running position of the mass block is in the slope area.
5. The stacking optimization method of energy storage mass blocks according to claim 4, characterized in that: The calculation of the optimal stacking path and strategy includes, when the position of the mass block is determined to be the stacking platform, dividing the stacking platform into a plurality of tracks, and assuming that the stacking tracks are numbered from left to right as L1, L2, ..., L n , the number of mass blocks that can be stacked on each track is represented by a1, a2, a3, …, a n ; The buffer track lengths corresponding to each stacking track are l1, l2, l3, ..., l n , the mass moves on the track at a speed of v m / s under standard conditions; Due to the difference in friction, let the speed of the mass block on the i-th track be k i ×v, where k i represents the friction coefficient; Taking the shortest time to stack all the mass blocks as the objective function, construct the objective function T: Among them, x i represents the number of mass blocks allocated on the ith track, l i represents the buffer length of the ith track, k i represents the friction coefficient, v represents the standard speed, and L represents the length of each mass block; Set the track congestion threshold CO. When the congestion level in track i exceeds the congestion threshold CO, there is a constraint condition, which is expressed as: The boundary conditions are: When the congestion level in track i does not exceed the congestion threshold CO, its boundary condition is: Among them, a i represents the maximum number of mass blocks that can be stacked on the ith track; m represents the total number of mass blocks; Indicates the total number of mass blocks that can be stacked on all tracks.
6. The stacking optimization method of energy storage mass blocks according to claim 5, characterized in that: The calculation of the optimal stacking path and strategy also includes calculating the optimal stacking path using a dynamic programming algorithm according to the position of the mass block and the track state, setting the initial state to S1, setting the optimal value function f k (S k ) indicates that the initial state of the kth stage is S k , the minimum time obtained from stage k to stage n; Starting from the nth stage, the recursive equation is used to solve the optimal value: Among them, D n (S n ) indicates that the state S n The set of permissible decisions for the determined nth stage; Get the optimal solution x n =x n (S n ) and the optimal value f n (S n ); In the n-1th stage, it is expressed as: s n =T n-1 (s n-1 ,x n-1 ) The optimal solution is x n-1 =x n-1 (S n-1 ), the optimal value is f n-1 (S n-1 ); In the kth stage, it is expressed as: in: s k+1 =T k (s k ,x k Solve the optimal solution: x k =x k (s k And the optimal value: f k (s k ) Until the first stage, it can be expressed as: in: s2=T1(s1,x1) Solve to obtain the optimal solution x1=x1(S1) and the optimal value f1(S1); Finally, the optimal decision and path for each stage are determined through the reverse method, and the calculation of the optimal stacking path and strategy is completed.
7. The stacking optimization method of energy storage mass blocks according to claim 6, characterized in that: The process of automatically completing the stacking and loading and unloading of the mass block includes using a control system to control a crane for stacking the landing gear to move the unloaded support to the target mass block position; At the target mass block position, rotate the bracket to the loaded state and lift the bottom of the mass block; The crane lifts the mass block and moves it horizontally to the predetermined stacking track position; The crane descends at the predetermined stacking track position and places the mass block at the designated stacking position; The rotating bracket returns to the no-load state; Monitor the position and status of the mass block in real time to ensure that the mass block is accurately placed in the predetermined stacking position; After all the masses have been stacked and loaded and unloaded, a final inspection is performed on the position and status of each mass, and a report on the stacking and loading and unloading process is generated.
8. A stacking optimization system for energy storage mass blocks using the method according to any one of claims 1 to 7, characterized in that: Stator current signal monitoring module: monitors and collects the stator current signal of the synchronous motor in real time, and converts the stator three-phase AC signal into a two-phase DC signal; Mass block position judgment module: calculates the rate of change of the stator current and judges whether the position of the mass block is in the slope section or the stack platform according to the threshold of the rate of change; Stacking path and strategy calculation module: According to the position of the mass block, based on the dynamic programming algorithm, the optimal stacking path and strategy are calculated; Automatic mass stacking and loading and unloading module: automatically completes the stacking and loading and unloading process of mass blocks according to the optimized stacking path and strategy.
9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.
10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.
