Planning strategy for PMU location and bandwidth allocation to ensure power grid observability
By combining grid observability, effective capacity theory and simulated annealing algorithm, PMU location and bandwidth allocation are optimized, the problems of grid observability and cost are solved, and the balance between 99.99% observability and minimum cost of the grid is achieved.
Patent Information
- Application Number
- CN202210374482.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-04-11
- Publication Date
- 2024-11-08
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The prior art is difficult to use the minimum number of PMUs and the minimum bandwidth size while ensuring the observability of the power grid, thereby reducing the problem of investment costs.
Combining grid observability, effective capacity theory, simulated annealing algorithm and binary search algorithm, PMU location and bandwidth allocation are planned, and by defining the objective function and calculating the observable probability and cost of the power grid, the penalty function method and effective capacity theory model of wireless communication channels are used. Uncertainty, optimize PMU layout and bandwidth allocation.
The grid is observable at a 99.99% probability while minimizing system overhead, providing significant performance gain, finding a trade-off between the number of PMUs and bandwidth costs, and meeting grid planning needs.
Smart Images

Figure BDA0003589743860000021 
Figure BDA0003589743860000032 
Figure BDA0003589743860000034
Abstract
Description
Technical Field
[0001] The present invention relates to the fields of mobile communication system technology and power grid control system, and in particular to a planning strategy for PMU location and bandwidth allocation for ensuring power grid observability. Background Art
[0002] The energy crisis and the concept of sustainable development have promoted the development of a series of new concepts such as renewable energy, electric vehicles, and energy storage systems. These potential power sources are gradually being integrated into the power grid. As a result, the network topology of the power grid has become more complex than ever before. Therefore, an effective energy management system is needed to guide the flow of energy. In addition, the volatility and variability of renewable energy, the uncertainty associated with electric vehicles, and the load changes over time due to changes in electricity prices have brought new challenges to the power system. In order to achieve stable operation of the power system, a balance between supply and demand must be achieved. In order to dynamically regulate, the observability of the power grid needs to be maintained. Such a goal can only be achieved with the help of PMU. Summary of the invention
[0003] The technical problem to be solved by the present invention is to provide a PMU placement and bandwidth planning strategy that can ensure that the power grid is observable with a probability of 99.99% while using the minimum number of PMUs and the minimum bandwidth size, thereby reducing the investment cost.
[0004] To solve the above technical problems, the present invention combines the observability of the power grid, the effective capacity theory, the binary search algorithm and the simulated annealing algorithm. It includes the following steps:
[0005] (1) Define the objective function;
[0006] (2) Generate an initial plan for PMU deployment locations and bandwidth allocation;
[0007] (3) Save the current solution as the initial solution;
[0008] (4) Calculate the objective function based on the current solution and related parameters, and save the result as the current function value f(·);
[0009] (5) Save the global optimal function value f best (·) is the current function value f(·);
[0010] (6) Save the global optimal solution as the current solution;
[0011] (7) Set the initial temperature to T max , the termination temperature is T min ;
[0012] (8) Set the current temperature T as the initial temperature;
[0013] (9) Randomly generate new PMU deployment locations and bandwidth allocation plans;
[0014] (10) Calculate the objective function based on the new solution and related parameters, and save the result as the new function value f′(·);
[0015] (11) Compare the current function value f(·) with the new function value f′(·), save the current solution as the new solution with a certain probability, and save the current function value as the new function value;
[0016] (12) Compare the current function value f(·) with the global optimal function value f best (·), if f(·) <f best (·) then update the global optimal solution and the global optimal function value;
[0017] (13) Repeat steps (9) to (12) M times;
[0018] (14) Update the current temperature T, setting T = T × 0.99;
[0019] (15) Repeat steps (9) to (14) until T ≤ T min ;
[0020] (16) Output the global optimal solution.
[0021] Preferably, the specific steps of step (1) include:
[0022] (11) The cost of grid construction is defined as follows:
[0023]
[0024] Where c is the total cost, Price pmu Define the price of PMU, N is the number of grid buses; binary column vector x = {x1, x2, …, x N} T Indicates which buses have PMU installed. If x i =1, it means that bus i has a PMU installed, otherwise it means that it is not installed; is the total number of PMUs installed; the parameter Price B represents the cost per unit of bandwidth, is the total bandwidth required, B i is the bandwidth required by each PMU for wireless communication; the total cost is defined as the sum of the PMU cost and the bandwidth cost;
[0025] (12) The penalty function method is used to limit the observable probability of the power grid and obtain a new objective function as follows:
[0026] f(B,x)=c+g1(P th -p ob )
[0027] The new objective function is defined as f(B,x), where B = {B1, B2, …, B N} T , P th is the value that the power grid observability probability is required to reach, p ob is the observable probability value of the power grid actually achieved by the current scheme; function g1(x) is a penalty function, which satisfies that the penalty is positive when x>0 and zero when x≤0, as shown below, where max(·) represents the maximum value of the element in the brackets;
[0028] g1(x)=max(0,x) 2 .
[0029] Preferably, the specific steps of step (2) include:
[0030] (21) Assume that all buses are equipped with PMUs, that is, let x = {1,1,…,1} T ;
[0031] (22) Order Among them B total The maximum bandwidth allowed is 500 kHz.
[0032] (23) Allocate initial bandwidth to all PMUs, i.e., B = {B avg ,B avg ,…,B avg} T .
[0033] Preferably, the specific steps of step (4) include:
[0034] (41) Assume that the power grid has a total of K PMUs, denoted as PMU k , and k=1,2,…,K and With 0≤p k ≤1 means PMU k In D max The probability of completing communication transmission within time is
[0035] Pr{d k ≤D max =p k
[0036] Among them, d k For the actual PMU k The communication delay, D max is the maximum delay allowed, Pr{·} represents the probability of the event occurring;
[0037] (42) Model the observability uncertainty caused by wireless communication: Define the vector P = {P1, P2, …, P N} Characterize each PMU in D max The probability of successful transmission within time, the elements of this vector are given by: k Installed on bus i, then P i =p k , otherwise, P i = 0; thus, the grid observability vector under statistical delay guarantee is obtained It is expressed as:
[0038]
[0039] Where H represents the connection matrix of the power grid, which is determined by the network topology of the power grid. The elements of this matrix H m,n It is defined as: If bus m is connected to bus n, then H m,n =1; otherwise H m,n =0, m, n = 1, 2, ..., N; Λ Q represents the diagonal communication constraint matrix, defined as:
[0040] Λ Q =diag{Q1,Q2,…,Q N}
[0041] Q i is a binary random variable with a probability mass function given by:
[0042] Q i =1}=P i
[0043] Q i =0}=1-P i
[0044] Assume that the random variable Q i are mutually independent, observability vectors under statistical delay guarantee is a random vector;
[0045] (43) The effective capacity theory is introduced, which models the cross-layer relationship between link layer behavior and physical channel statistical characteristics. k The effective capacity can be written as:
[0046]
[0047] Among them B k Indicates PMU k The allocated bandwidth, T represents the duration of the PMU data frame, SNRk For PMU k The average transmission signal-to-noise ratio; θ k Indicates PMU k The service quality index, θ k The smaller the size, the higher the requirement for service quality; here it can be understood as the stricter requirement for communication delay;
[0048] (44) Based on the effective capacity theory and queuing theory, we obtain:
[0049]
[0050] (45) Assume that PMU k by In order to transmit data stably, the effective capacity should be equal to the actual transmission rate. Right now
[0051]
[0052] (46) According to the equation in step (45), use the bisection method to solve θ k ;
[0053] (47) According to θ obtained in (46) k Calculate p k ;
[0054] (48) Repeat steps (46) to (47) until θ and p of all K PMUs are found;
[0055] (49) Calculate p ob , the expression is as follows;
[0056]
[0057] (410) Calculate the objective function value f(B,x).
[0058] Preferably, the specific steps of step (11) include:
[0059] (111) Let ΔE=f′(·)-f(·);
[0060] (112) If ΔE<0, save the current solution as the new solution and save the current function value as the new function value;
[0061] (113) If ΔE>0, generate a random number in the range [0,1]. If the random number is less than Save the current solution as a new solution and save the current function value as a new function value.
[0062] The beneficial effects of the present invention are as follows: the present invention first uses the effective capacity theory to incorporate the channel uncertainty of wireless communication into the model of power grid observability, and combines the dichotomy method and simulated annealing algorithm to propose a planning algorithm that can simultaneously plan the PMU location and allocate bandwidth. The algorithm can ensure that the power grid is observable with a probability of 99.99 while minimizing the system overhead. Numerical results show that the proposed algorithm can output PMU layout and bandwidth allocation for any fixed topology power grid structure, and the solution of the present invention provides significant performance gains compared to the existing PMU layout design. In addition, by changing the cost of the PMU and the cost per unit bandwidth, the trade-off between the number of PMUs and the required total bandwidth can be found. The needs of power grid planning can be effectively met. DETAILED DESCRIPTION
[0063] The IEEE14 bus power system test case, which has been widely used as a standard test case, will be used to verify the present invention. In the simulation, Rayleigh fading is selected as the fading characteristic of the wireless channel, and the effective capacity is given by:
[0064]
[0065] Assuming that the data center is located at the center of the power grid, and assuming that all PMUs generate measurement data packets at a rate of 60kbps, and that the maximum delay allowed for these data packets to be transmitted from the PMU to the control center is set to 10ms. The SNRs of the individual PMU transmissions are shown in the following table.
[0066] bus 1 2 3 4 5 6 7 SNR(dB) 10 13.2 12.55 11.53 10.93 10.13 13.97 bus 8 9 10 11 12 13 14 SNR(dB) 13.56 15.51 14.42 12 10.59 12.86 10.28
[0067] The following planning method is used, including the following steps:
[0068] (1) First, consider the use of PMU measurement data to ensure the observability of the power grid: PMU can simultaneously measure voltage, current and corresponding phase angle data to achieve real-time synchronous measurement of the operating status of the wide-area power grid. The voltage, branch current and phase angle of the node can be obtained through direct measurement or virtual measurement. Virtual measurement obtains the corresponding parameters through calculation. The calculation is based on Ohm's law and Kirchhoff's voltage and current law. In other words, PMU can not only accurately measure the power status information at the current installation location, but also obtain relevant data of adjacent nodes through measurement. Therefore, combined with the network topology of the power grid bus node and the PMU installation location given by the planning strategy, it is possible to verify whether the power grid is observable.
[0069] (2) Secondly, consider using the effective capacity theory to characterize the delay problem of PMU communicating with the data center through wireless communication. Applications related to maintaining grid observability have high requirements for network communication latency. The effective capacity theory can effectively incorporate communication latency into the grid observability model. Through the effective capacity theory, the probability of a data packet generated by the PMU being transmitted to the data center within a fixed delay time requirement is calculated.
[0070] (3) Based on the simulated annealing algorithm and the binary search algorithm, generate the PMU location and bandwidth allocation scheme. And verify the probability of the power grid maintaining observability under the current planning scheme through steps (1) and (2). If the 99.99% requirement is met, calculate the investment cost of the current scheme. Repeatedly iterate and compare the investment costs until a PMU location and bandwidth allocation scheme is obtained that guarantees the observability of the power grid with a probability of 99.99% and has the lowest investment cost.
[0071] Verifying the observability of the power grid using the network topology of the power grid bus node and the PMU installation location in step (1) includes the following steps:
[0072] (11) According to the measurement rules of PMU, in a power grid containing N buses, the connection matrix H of the power grid is determined by the network topology of the power grid. The elements of the matrix H m,n It is defined as: If bus m is connected to bus n, then H m,n =1; otherwise H m,n =0,m,n=1,2,…,N.
[0073] (12) Using a binary column vector x = {x1, x2, …, x N} T To indicate whether a node in the network is equipped with a PMU. The elements of vector x are given by: When a bus node is equipped with a PMU, x i =1, otherwise, x i =0.
[0074] (13) If the voltage and current phasors of a node can be obtained simultaneously, the node is called a fully observable node. Therefore, the bus observability vector b can be derived as:
[0075] b=Hx
[0076] where each element b in the bus observability vector b i represents the number of PMUs that can make bus i fully observable.
[0077] In step (2), the concept of using effective capacity flow to introduce wireless communication delay and calculating whether the data packet generated by the PMU can be transmitted to the data center within the fixed time requirement specifically includes the following steps:
[0078] (21) First, we introduce the communication delay. Assume that the power grid has a total of K PMUs, denoted as PMU k , and k=1,2,…,K and K≤N. Ideally, if cost and other factors are not considered, the communication system can theoretically ensure that PMU k The delay requirement is denoted as d k , less than D max However, in practice, it has been shown that it is not feasible to provide a deterministic delay bound for communication systems in most fading channel environments. Therefore, it is considered to ensure that the PMU k With probability 0≤p k ≤1 satisfies D max The communication delay requirement is
[0079] Pr{d k ≤D max}≥p k
[0080] (22) Next, consider the observability uncertainty modeling brought by wireless communication as follows: Define a vector to represent D max The success probability of each PMU transmission is P = {P1, P2, ..., P N}, the elements of this vector are given by: If PMU k Installed on bus i, then P i =p k , otherwise, P i = 0. Thus, the observability vector of the power grid under statistical delay guarantee can be obtained. It is expressed as:
[0081]
[0082] where Λ Q represents the diagonal communication constraint matrix, defined as:
[0083] Λ Q =diag{Q1,Q2,…,Q N}
[0084] Here is the Q i ,i∈{1,2,…,N}, is a binary random variable, and its probability mass function is given by the following formula.
[0085] Q i =1}=P i
[0086] Q i =0}=1-P i
[0087] Assume that the random variable Qi ,i∈{1,2,…,N} are independent of each other. Note that the observability vector under the statistical delay guarantee is a random vector.
[0088] (23) Then the effective capacity theory is introduced, which models the cross-layer relationship between link layer behavior and physical channel statistical characteristics. The effective capacity formula can be written as:
[0089]
[0090] Where C represents the throughput of the system in a single time block and T represents the duration of a time block. The QoS index θ is given by the following formula.
[0091]
[0092] Where L is the equilibrium queue length of the sender buffer. When z is large, the buffer conflict probability can be approximated as Pr{L≥z}≈e -θz Accordingly, if D delay represents the steady-state delay of the buffer, then D delay Exceeding the maximum allowed delay d max The probability of Given, where δ is determined by the characteristics of the queuing system. Therefore, the required minimum QoS index θ0 is determined by the delay constraint, and in order to guarantee delay performance, the QoS index θ must satisfy the constraint θ≥θ0. In addition, when θ→0, the efficiency approaches Shannon's capacity.
[0093] (24) Assume that PMU k Assigned B k The corresponding SNR is recorded as SNR k , by PMU k The fading channel between the PMU and the base station determines the k , its effective capacity can be expressed as:
[0094]
[0095] where θ k It is PMU k QoS index, ρ k It is PMU k The average SNR, γ k is the random instantaneous channel power gain affected by channel fading.
[0096] (25) Based on the effective capacity theory and queuing theory, we can see that:
[0097]
[0098] (26) Assume that PMU k by Obviously, in order to transmit data stably, the effective capacity cannot be less than the sending rate. Right now
[0099]
[0100] In step (3), based on the simulated annealing algorithm and the binary search algorithm, the location and bandwidth allocation scheme of the PMU is generated and the probability of the power grid maintaining observability under the current planning scheme is verified, which includes the following steps:
[0101] (31) The input cost is defined as follows:
[0102]
[0103] Where c is the total cost, and Price pmu Defines the price of PMU. Recall that x defined in (12) i ,So is the total number of PMUs installed. represents the cost per unit of bandwidth, is the total bandwidth required. Therefore, the total cost is defined as the sum of the PMU cost and the bandwidth cost.
[0104] (32) In order to ensure that the power grid is observable with a probability of 99.99%, the penalty function method is used to limit the observable probability, and the augmented objective function is obtained as follows:
[0105]
[0106] Here the new objective function is defined as f(B,x,θ * (B)). And x={x1,x2,…,x N} T , defined in (12) above. Function g1(x) is a penalty function that satisfies the penalty when x>0 and zero when x≤0. Parameter σ j It is called the penalty factor, which will continue to increase with each iteration and its index is given by the iteration number j.
[0107] (33) Solve the equation using the binary search method to obtain θ * (B) Each element in the vector. The equation is as follows:
[0108]
[0109] (34) Planning algorithm initialization, assuming that all buses are equipped with PMUs and assigning initial bandwidths to these PMUs, then using the bisection method to find the corresponding θ * , and then calculate the value of the objective function in the initial state.
[0110] (35) Randomly generate values x′ and B′ in the neighborhood of variables x and B.
[0111] (36) Calculate θ again according to the dichotomy method * (B′).
[0112] (37) Calculation
[0113] (38) Let ΔE = F′-F, if ΔE < 0, x = x′, B = B′, F = F′. Otherwise, with probability Accept the new solution, x=x′, B=B′.
[0114] (39) Repeat steps (35) to (38) until M iterations have been reached, where M is the average Markov chain length.
[0115] (310) Update the temperature, setting T = βT, where β is the temperature attenuation coefficient.
[0116] (311) Repeat (39) to (310) until the termination temperature is reached.
[0117] Although the present invention has been illustrated and described with respect to the preferred embodiments, it will be appreciated by those skilled in the art that various changes and modifications may be made to the present invention without departing from the scope of the present invention as defined by the claims.
Claims
1. A PMU location and bandwidth allocation planning strategy to ensure grid observability, characterized by: The steps include: (1) Define the objective function; (2) Generate an initial plan for PMU deployment locations and bandwidth allocation; (3) Save the current solution as the initial solution; (4) Calculate the objective function based on the current solution and related parameters, and save the result as the current function value f(·); (5) Save the global optimal function value f best (·) is the current function value f(·); (6) Save the global optimal solution as the current solution; (7) Set the initial temperature to T max , the termination temperature is T min ; (8) Set the current temperature T as the initial temperature; (9) Randomly generate new PMU deployment locations and bandwidth allocation plans; (10) Calculate the objective function according to the new scheme and related parameters, and save the result as the new function value f'(·); (11) Compare the current function value f(·) with the new function value f'(·), save the current solution as the new solution with a certain probability, and save the current function value as the new function value; (12) Compare the current function value f(·) with the global optimal function value f best (·), if f(·) <f best (·) then update the global optimal solution and the global optimal function value; (13) Repeat steps (9) to (12) M times; (14) Update the current temperature T, setting T = T × 0.99; (15) Repeat steps (9) to (14) until T ≤ T min ; (16) Output the global optimal solution; The specific steps of step (1) include: (11) The cost of grid construction is defined as follows: Where c is the total cost, Price pmu Define the price of PMU, N is the number of grid buses; binary column vector x = {x1, x2, …, x N } T Indicates which buses have PMU installed. If x i =1, it means that bus i has a PMU installed, otherwise it means that it is not installed; is the total number of PMUs installed; the parameter Price B represents the cost per unit of bandwidth, is the total bandwidth required, B i is the bandwidth required by each PMU for wireless communication; the total cost is defined as the sum of the PMU cost and the bandwidth cost; (12) The penalty function method is used to limit the observable probability of the power grid and obtain a new objective function as follows: f(B,x)=c+g1(P th -p ob ) The new objective function is defined as f(B,x), where B = {B1, B2, …, B N } T , P th is the value that the power grid observability probability is required to reach, p ob is the observable probability value of the power grid actually achieved by the current scheme; function g1(x) is a penalty function, which satisfies that the penalty is positive when x>0 and zero when x≤0, as shown below, where max(·) represents the maximum value of the element in the brackets; g1(x)=max(0,x) 2 ; The specific steps of step (2) include: (21) Assume that all buses are equipped with PMUs, that is, let x = {1,1,…,1} T ; (22) Order Among them B total is the maximum bandwidth allowed; (23) Allocate initial bandwidth to all PMUs, i.e., B = {B avg ,B avg ,…,B avg } T .
2. The PMU location and bandwidth allocation planning strategy for ensuring power grid observability according to claim 1, characterized in that: The specific steps of step (4) include: (41) Assume that the power grid has a total of K PMUs, denoted as PMU k , and k=1,2,…,K and With 0≤p k ≤1 means PMU k In D max The probability of completing communication transmission within time is Pr{d k ≤D max }=p k Among them, d k For the actual PMU k The communication delay, D max is the maximum delay allowed, Pr{·} represents the probability of the event occurring; (42) Model the observability uncertainty caused by wireless communication: Define the vector P = {P1, P2, …, P N } Characterize each PMU in D max The probability of successful transmission within time, the elements of this vector are given by: k Installed on bus i, then P i =p k , otherwise, P i = 0; thus, the grid observability vector under statistical delay guarantee is obtained It is expressed as: Where H represents the connection matrix of the power grid, which is determined by the network topology of the power grid. The elements of this matrix H m,n It is defined as: If bus m is connected to bus n, then H m,n =1; otherwise H m,n =0, m, n = 1, 2, ..., N; Λ Q represents the diagonal communication constraint matrix, defined as: Λ Q =diag{Q1,Q2,…,Q N } Q i is a binary random variable with a probability mass function given by: Pr{Q i =1}=P i Pr{Q i =0}=1-P i Assume that the random variable Q i are mutually independent, observability vectors under statistical delay guarantee is a random vector; (43) The effective capacity theory is introduced, which models the cross-layer relationship between link layer behavior and physical channel statistical characteristics, and obtains the PMU under Rayleigh fading conditions. k The effective capacity of (44) Based on the effective capacity theory and queuing theory, we obtain: (45) Assume that PMU k by In order to transmit data stably, the effective capacity should be equal to the actual transmission rate. Right now (46) According to the equation in step (45), use the bisection method to solve θ k ; (47) According to θ obtained in (46) k Calculate p k ; (48) Repeat steps (46) to (47) until θ and p of all K PMUs are found; (49) Calculate p ob , the expression is as follows; (410) Calculate the objective function value f(B,x).
3. The PMU location and bandwidth allocation planning strategy for ensuring power grid observability according to claim 2, characterized in that: Step (43) PMU under Rayleigh fading conditions k The effective capacity can be written as: Among them B k Indicates PMU k The allocated bandwidth, T represents the duration of the PMU data frame, SNR k For PMU k The average transmission signal-to-noise ratio; θ k Indicates PMU k The service quality index, θ k The smaller the size, the higher the service quality requirement.
4. The PMU location and bandwidth allocation planning strategy for ensuring power grid observability according to claim 1, characterized in that: The specific steps of step (11) include: (111) Let ΔE = f'(·) - f(·); (112) If ΔE<0, save the current solution as the new solution and save the current function value as the new function value; (113) If ΔE>0, generate a random number in the range [0,1]. If the random number is less than Save the current solution as a new solution and save the current function value as a new function value.
Citation Information
Patent Citations
Method and apparatus for harmonic state estimation in power system
AU2013201595A1
Risk-considering power grid optimization planning method
CN112036611A
Power distribution network PMU configuration optimization method based on node incidence matrix
CN113591258A
