CN114336782B - Distributed economic dispatching method for power system under aperiodic Dos attack - Google Patents

Distributed economic dispatching method for power system under aperiodic Dos attack Download PDF

Info

Publication number
CN114336782B
CN114336782B CN202210004499.8A CN202210004499A CN114336782B CN 114336782 B CN114336782 B CN 114336782B CN 202210004499 A CN202210004499 A CN 202210004499A CN 114336782 B CN114336782 B CN 114336782B
Authority
CN
China
Prior art keywords
generator set
following
lambda
power
leading
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210004499.8A
Other languages
Chinese (zh)
Other versions
CN114336782A (en
Inventor
翁盛煊
孙振峰
岳东
吴凯
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN202210004499.8A priority Critical patent/CN114336782B/en
Publication of CN114336782A publication Critical patent/CN114336782A/en
Application granted granted Critical
Publication of CN114336782B publication Critical patent/CN114336782B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention relates to a distributed economic dispatching method of an electric power system under aperiodic Dos attack, which comprises the following steps: giving system parameters; setting a communication connection coefficient; assigning a value to the incremental cost of the leading generator set and calculating the incremental cost of the following generator set; updating the incremental cost of each following generator set by using an incremental cost safety consistency algorithm; calculating the output power of the leading generator set and the following generator set; calculating the power of the supply and demand deviation; judging whether the power of the supply and demand deviation meets a given power deviation tolerance value or not; and calculating the optimal output power of the leading generator set and the following generator set. The invention considers the influence of Dos network attack, when the Dos network attack is received, the generator set under attack does not need to be isolated, and the effectiveness of economic dispatch under the information network attack can be ensured by adopting an incremental cost safety consistency algorithm, so that the economic and stable operation of the electric power system under the information network attack is realized.

Description

Distributed economic dispatching method for power system under aperiodic Dos attack
Technical Field
The invention relates to the field of power system economic dispatch, in particular to a power system distributed economic dispatch method under aperiodic Dos attack.
Background
Economic dispatch is a fundamental problem in power systems, and the core of the economic dispatch is to minimize the total cost of power generation of a generator set on the basis of meeting the balance of supply and demand. With the rapid development of society, the topology of a power system is becoming larger and more complex. The main reason for the drawbacks of the centralized control strategy is that when the control center fails, the entire power system will be paralyzed. In contrast, the distributed control strategy does not need a centralized control center, and only needs communication between adjacent generator sets, so that a distributed economic scheduling scheme is generated.
However, there is also a certain disadvantage to the distributed control strategy, and the implementation of the distributed economic dispatch is highly dependent on the information network connecting the generator sets. Due to the openness and vulnerability of the information network, and the lack of a monitoring center for the distributed control strategy to monitor the activities of all the generator sets in the network, the possibility of the information network being attacked is greatly increased. Among the most common types of network attacks are Dos attacks, which are attacks on network protocols or resources of an attacked object by consuming the resources, so that the information network cannot provide normal communication and services, and thus, defending Dos attacks is one of the non-negligible research problems in terms of information network security. Due to the uncertainty of Dos attacks, the time of Dos launch of an attack is random in real life for any two adjacent attacks.
Disclosure of Invention
In order to avoid adverse effects of aperiodic Dos attack on distributed economic dispatch, the invention provides the distributed economic dispatch of the power system under the aperiodic Dos attack, which is suitable for the economic dispatch problem of the power system adopting a secondary cost function, and on the basis of meeting the power supply and demand balance of the power system, the total cost of power generation of the generator set is enabled to be the lowest, the effects of the aperiodic Dos attack are considered, and the economic dispatch of the power system is realized by constructing an incremental cost safety consistency algorithm.
In order to achieve the above purpose, the invention is realized by the following technical scheme:
the invention relates to a distributed economic dispatching method of an electric power system under aperiodic Dos attack, which is used for an electric power system adopting a secondary cost function and having a communication network topology between generator sets, and the specific dispatching method comprises the following steps:
step 1: giving system parameters including the number n of generator sets in the power system and the total power demand P D Parameter alpha i Parameter beta i Parameter gamma i Wherein alpha is i 、β i 、γ i As coefficients of the quadratic cost function, i represents the number of the generator set, i=1, 2, 3..the period T, m represents the number of periods, m=0, 1,2, 3..the positive constant epsilon determines the convergence speed of the generator set, the time of initiation of the nth attack
Figure BDA0003455048320000021
Duration delta of nth challenge n Nth attack recovery time u n Normal number eta, power deviation tolerance value theta, coupling strength c;
step 2: one of the generator sets is selected as a leading generator set and is expressed as a 0 th generator set, and the following generator set sets set a communication connection coefficient a according to the information interaction capability of the following generator set ij J=1, 2,3., n, i not equal to j, the 0 th generator set sets a communication connection coefficient a according to the information interaction capability with the following generator set i0
Step 3: setting the initial time as t 0 Let t 0 =0, and assigning λ to the incremental cost of the leading genset in step 2 0 Calculating increment cost lambda of other ith generating sets i (t 0 ) Incremental cost lambda of ith following generator set i (t 0 ) Is calculated as follows:
λ i (t 0 )=β i +2γ i P Gi (t 0 )
wherein: lambda (lambda) i (t 0 ) Incremental cost for the ith following genset, beta i 、γ i To follow the coefficients of the generator set secondary cost function, P Gi (t 0 ) To follow the output power of the generator set i at the initial moment.
Step 4: in the mT period, updating the increment cost lambda of each following generator set at the time t by using an increment cost safety consistency algorithm i (t)。
The incremental cost safety consistency algorithm of the ith following generator set is as follows:
Figure BDA0003455048320000031
wherein the method comprises the steps of
Figure BDA0003455048320000032
c is the coupling strength; a, a ij Is a communication connection coefficient; lambda (lambda) j (t) for each heelIncremental cost at time t along with generator set j; lambda (lambda) i (t) incremental cost at time t for each following genset i; a, a i0 The 0 th generator set is a communication connection coefficient according to the information interaction capability with the following generator set; lambda (lambda) 0 Assigning a value to the incremental cost of the leading generator set; lambda (lambda) i (t) incremental cost for each following genset at time t,
Figure BDA0003455048320000033
time for the nth attack initiation; delta n Duration for the nth attack; u (u) n Recovery time for the nth attack; η is a positive constant.
Step 5: calculating the output power P of the leading generator set and the following generator set at the time t= (m+1) T 0 (t) and P i (t). Specific:
at time t= (m+1) T, the output power of the generator set is:
following the output power of the generator set:
Figure BDA0003455048320000034
leading the output power of the generator set:
Figure BDA0003455048320000035
wherein: lambda (lambda) i ((m+1) T) is the incremental cost of the follower genset, beta i 、γ i Lambda is a coefficient following the secondary cost function of the generator set 0 Incremental cost assignment for lead genset, gamma 0 、β 0 Expressed as coefficients of the leading genset 0 quadratic cost function.
Step 6: calculating power |delta P (T) | of supply and demand deviation of the leading generator set and the following generator set at a time t= (m+1) T, and specifically, when the power deviation of the generator set is at the time t= (m+1) T, the power deviation is as follows:
Figure BDA0003455048320000036
wherein: Δp represents the deviation of the overall power system power demand from the power supply; p (P) D Is the total power demand; p (P) G0 ((m+1) T) is the output power of the lead type generator set 0; output power P of following type generator set i Gi ((m+1)T)。
Step 7: judging whether the power |delta P (t) | of the supply and demand deviation in the step 6 meets a given power deviation tolerance value theta, if the power |delta P (t) | is less than or equal to theta, turning to the step 8, otherwise, turning to lambda 0 +ΔP((m+1)T)→λ 0 And m+1- & gt m is jumped to the step 4;
step 8: the incremental cost lambda of the leader according to step 7 0 Incremental cost lambda of follower i ((m+1) T), calculating the optimal output power P of the leading generator set and the following generator set G0 * P Gi * Specifically, at time t, the optimal power of the generator set is:
optimum power of leading genset:
Figure BDA0003455048320000041
following the optimal power of the generator set:
Figure BDA0003455048320000042
wherein: lambda (lambda) 0 Assigning a value to the incremental cost of the leading generator set; gamma ray 0 、β 0 Coefficients, lambda, expressed as a quadratic cost function of lead genset 0 i ((m+1) T) is the incremental cost of the following generator set, beta i 、γ i Is a coefficient of the quadratic cost function.
The invention further improves that: in step 2, a communication connection coefficient a is set ij The method of (1) is as follows: if information interaction can be carried out between the ith following generator set and the jth following generator set, setting a ij =1; otherwise, set a ij =0, if information interaction can be performed between the 0 th leading generator set and the i th following generator set, setting a i0 =1; otherwise, set a i0 =0。
The beneficial effects of the invention are as follows: compared with the traditional centralized scheduling method, the distributed scheduling method has the advantages of high efficiency, low communication cost, high fault tolerance, high flexibility and the like; the invention provides a distributed economic dispatch under aperiodic Dos attack, considers the influence of Dos network attack, and can ensure the effectiveness of economic dispatch under information network attack by adopting an incremental cost safety consistency algorithm without isolating an attacked generator set when the network attack is received, thereby realizing the economic and stable operation of an electric power system under the information network attack.
Drawings
FIG. 1 is a topology of a communication network between generator sets according to an embodiment of the present invention.
FIG. 2 is a schematic time diagram of an aperiodic Dos attack in an embodiment of the present invention.
FIG. 3 is a graph of incremental cost changes for each genset in an embodiment of the invention.
Fig. 4 is a graph showing the output power variation of each generator set in the embodiment of the present invention.
Fig. 5 is a graph showing the total output power of the power system according to the embodiment of the present invention.
Fig. 6 is a graph of power bias across all gensets in an embodiment of the invention.
Fig. 7 is a flow chart of the method of the present invention.
Detailed Description
Embodiments of the invention are disclosed in the drawings, and for purposes of explanation, numerous practical details are set forth in the following description. However, it should be understood that these practical details are not to be taken as limiting the invention. That is, in some embodiments of the invention, these practical details are unnecessary.
The invention takes a system formed by 6 generator sets as an example, the topological relation of a communication network is shown in figure 1, and the specific implementation steps are shown in figure 6:
(1) Given systemParameter, total power demand P, number of generator sets n=6 in a given power system D 1800MW, normal number epsilon=0.0008, coefficient eta=0.5, period t=10, power deviation tolerance value θ=10mw, coupling strength c=2, m=4.
(2) Let the cost function of the i-th generator set be:
Figure BDA0003455048320000051
wherein P is Gi For the output of the ith genset, genset 0 represents the leading genset, parameter α i 、β i 、γ i The following table shows:
leading generator set α i β i γ i
0 561 7.92 0.001561
Following generator set i α i β i γ i
1 561 7.92 0.001561
2 310 7.85 0.00194
3 78 7.8 0.00482
4 561 7.92 0.001562
5 78 7.8 0.00482
(3) Communication network topology following generator set in power system: setting a communication connection coefficient a ij If information interaction can be carried out between the ith generating set and the jth generating set, setting a ij =1; otherwise, set a ij =0, where i=1,2 …, n, j=1, 2 …, n, i+.j, according to the communication topology of leading genset 0 and following genset i in the power system; setting a communication connection coefficient a i0 If the leading type generator set and the following generator set i can perform information interaction, a i0 =1, otherwise, set a i0 =0, adjacency matrix { a } ij Sum { a } i0 The following table shows the cases
Figure BDA0003455048320000061
Figure BDA0003455048320000071
(4) Setting the initial time as t 0 Let t 0 =0, and incremental cost λ for leading genset 0 0 Giving an initial value, calculating increment cost lambda of the ith following generator set i (t 0 ):
Incremental costs for lead genset 0 are shown in the following table:
leading generator set Incremental cost of genset 0
0 8.5444
The initial power output power of genset i is shown in the following table:
i power of generator set i
1 200
2 250
3 100
4 200
5 100
The incremental cost of genset i is calculated as follows:
i incremental cost lambda of genset i i (t 0 )
1 8.5444
2 8.8200
3 8.7640
4 8.0762
5 8.7684
(5) The 0 th generator set is set as a leader generator set, and the other 5 generator sets are follower generator sets. Incremental cost consistency update algorithm for the i-th generator set:
Figure BDA0003455048320000081
wherein the method comprises the steps of
Figure BDA0003455048320000082
c is the coupling strength; a, a ij Is a communication connection coefficient; lambda (lambda) j (t) incremental cost at time t for each following genset j; lambda (lambda) i (t) incremental cost at time t for each following genset i; a, a i0 The 0 th generator set is a communication connection coefficient according to the information interaction capability with the following generator set; lambda (lambda) 0 Assigning a value to the incremental cost of the leading generator set; lambda (lambda) i (t) incremental cost for each following genset at time t,
Figure BDA0003455048320000083
time for the nth attack initiation; delta n Duration for the nth attack; u (u) n Recovery time for the nth attack; η is a positive constant.
(6) Calculating the output power P at time t= (m+1) T, m=1, 2, …, leading and following at this time 0 (t) and P i (t) is:
output power of the following generator set:
Figure BDA0003455048320000084
output power of leading type generating set:
Figure BDA0003455048320000085
wherein: lambda (lambda) i ((m+1) T) is the incremental cost of the follower, beta i 、γ i Lambda is a coefficient following the secondary cost function of the generator set 0 Incremental cost assignment for lead genset, gamma 0 、β 0 Expressed as coefficients of the leading genset 0 quadratic cost function.
(7) The power deviation of the generator set is as follows:
Figure BDA0003455048320000086
where Δp represents the deviation of the overall power system power demand from the power supply. P (P) D Is the total power demand; p (P) G0 ((m+1) T) is the output power of the lead type generator set 0; output power P of following type generator set i Gi ((m+1)T)。
(8) Judging whether the |delta P| meets the tolerance error theta of the given supply and demand deviation, if the |delta P| is less than or equal to theta, turning to the step 8, otherwise, increasing the increment cost lambda of the leading type generator set 0 +ΔP((m+1)T)→λ 0 And m+1- & gt m, and then jumping to the step 4.
(9) The power output of each generator set in the system is dynamically adjusted according to the increment cost according to the following formula:
optimum power of leading type generating set:
Figure BDA0003455048320000091
optimum power of the following generator set:
Figure BDA0003455048320000092
wherein: lambda (lambda) 0 To lead the generatorIncremental cost assignment of the group; gamma ray 0 、β 0 Coefficients, lambda, expressed as a quadratic cost function of lead genset 0 i ((m+1) T) is the incremental cost of the follower, beta i 、γ i To follow the coefficients of the generator set quadratic cost function.
In order to verify the effectiveness of the invention, a simulation experiment is performed based on the following assumption that the leading generator set 0 is not attacked by the information network and the incremental cost is kept unchanged in each period T.
Fig. 2 shows a variation of Dos attack on the power system, and it can be seen that the attack time of the power system is irregular, dos=1 when the power system is attacked, and dos=0 when the power system is not attacked.
Fig. 3 shows the incremental cost change of each of the 5 following-type generating sets, and it can be seen that the incremental cost of the generating set under Dos attack in each period T tends to the incremental cost of the leader-type generating set 0, and after the mT period, the incremental cost of the generating set tends to be consistent, so as to meet the requirement of economic dispatch optimization generating cost.
Fig. 4 shows the power change of each of the 5 generator sets, and it can be seen that the power change of the generator set under Dos attack, when the generator set under Dos attack, the output power of the generator set remains unchanged, and after the period of mT, m=1, 2..n, the power of the generator set tends to be stable on the basis of satisfying the supply-demand balance, and meets the power supply requirement of each generator set.
Fig. 5 shows the total output power variation of the generator set, which eventually tends to 1800MW of power required by the electric power system, and meets the power supply and demand balance requirement.
Fig. 6 reflects the power deviation of all the generator sets, which tends to be 0 in each period T.
The invention provides a distributed economic dispatching method of an electric power system under aperiodic Dos attack. Firstly, modeling economic dispatch of a distributed power system, and setting communication network topology between a leading type generator set and a following type generator set; further, taking the situation that the information network is attacked by aperiodic Dos into consideration, constructing a Dos attack model; then, a control strategy aiming at the incremental cost of the leading type generator set is designed to realize power supply and demand balance, and meanwhile, an incremental cost distributed safety consistency algorithm aiming at the follower generator set under the DoS attack is constructed to realize power generation cost optimization.
The foregoing description is only illustrative of the invention and is not to be construed as limiting the invention. Various modifications and variations of the present invention will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, or the like, which is within the spirit and principles of the present invention, should be included in the scope of the claims of the present invention.

Claims (6)

1. The utility model provides a distributed economic dispatch method of electric power system under aperiodic Dos attack for adopt the secondary cost function and have communication network topology's electric power system between the generating set, its characterized in that: the distributed economic dispatching method of the power system comprises the following steps:
step 1: giving system parameters including the number n of generator sets in the power system and the total power demand P D Parameter alpha i Parameter beta i Parameter gamma i Wherein alpha is i 、β i 、γ i As coefficients of the quadratic cost function, i represents the number of the generator set, i=1, 2, 3..the period T, m represents the number of periods, m=0, 1,2, 3..the positive constant epsilon determines the convergence speed of the generator set, the time of initiation of the nth attack
Figure FDA0004240061780000011
Duration delta of nth challenge n Nth attack recovery time u n Normal number eta, power deviation tolerance value theta, coupling strength c;
step 2: one of the generator sets is selected as a leading generator set and is expressed as a 0 th generator set, and the following generator set is used for generating information according to the informationInteractive capability, setting communication connection coefficient a ij J=1, 2,3., n, i not equal to j, the 0 th generator set sets a communication connection coefficient a according to the information interaction capability with the following generator set i0
Step 3: setting the initial time as t 0 Let t 0 =0, and assigning λ to the incremental cost of the leading genset in step 2 0 Calculating the increment cost lambda of other ith following generator sets i (t 0 );
Step 4: in the mT period, updating the increment cost lambda of each following generator set at the time t by using an increment cost safety consistency algorithm i (t);
Step 5: calculating the output power P of the leading generator set and the following generator set at the time t= (m+1) T 0 (t) and P i (t);
Step 6: calculating power |delta P (T) | of supply-demand deviation of a leading generator set and a following generator set at a time t= (m+1) T;
step 7: judging whether the power |delta P (t) | of the supply and demand deviation in the step 6 meets a given power deviation tolerance value theta, if the power |delta P (t) | is less than or equal to theta, turning to the step 8, otherwise, turning to lambda 0 +ΔP((m+1)T)→λ 0 And m+1- & gt m is jumped to the step 4;
step 8: the incremental cost lambda of the leader according to step 7 0 Incremental cost lambda of follower i ((m+1) T), calculating the optimal output power P of the leading generator set and the following generator set G0 * P Gi * Wherein: the incremental cost safety consistency algorithm of the ith following generator set in the step 4 is as follows:
Figure FDA0004240061780000021
Figure FDA0004240061780000022
c is the coupling strength; a, a ij Is a communication connection coefficient; lambda (lambda) i (t) incremental cost at time t for each following genset j; lambda (lambda) i (t) incremental cost at time t for each following genset i; a, a i0 The 0 th leading generator set is according to the communication connection coefficient of the information interaction capability with the following generator set; lambda (lambda) 0 Assigning a value to the incremental cost of the leading generator set; lambda (lambda) i (t) incremental cost for each following genset at time t,
Figure FDA0004240061780000023
time for the nth attack initiation; delta n Duration for the nth attack; u (u) n Recovery time for the nth attack; η is a positive constant.
2. The power system distributed economic dispatch method under aperiodic Dos attack according to claim 1, wherein: in the step 3, the i-th following generator set has increment cost lambda i (t 0 ) Is calculated as follows:
λ i (t 0 )=β i +2γ i P Gi (t 0 )
wherein: lambda (lambda) i (t 0 ) Incremental cost for the ith following genset, beta i 、γ i To follow the coefficients of the generator set secondary cost function, P Gi (t 0 ) To follow the output power of the generator set at the initial moment.
3. The power system distributed economic dispatch method under aperiodic Dos attack according to claim 1, wherein: setting a communication connection coefficient a in the step 2 ij The method of (1) is as follows: if information interaction can be carried out between the ith following generator set and the jth following generator set, setting a ij =1; otherwise, set a ij =0, if information interaction can be performed between the 0 th leading generator set and the i th following generator set, setting a i0 =1; otherwise, set a i0 =0。
4. The power system distributed economic dispatch method under aperiodic Dos attack according to claim 1, wherein: in the step 5, when the time t= (m+1) T, the output power of the generator set is:
following the output power of the generator set:
Figure FDA0004240061780000031
leading the output power of the generator set:
Figure FDA0004240061780000032
wherein: lambda (lambda) i ((m+1) T) is the incremental cost of follower i, beta i 、γ i Lambda is a coefficient following the secondary cost function of the generator set 0 Incremental cost assignment for lead genset, gamma 0 、β 0 Expressed as coefficients of the leading genset 0 quadratic cost function.
5. The power system distributed economic dispatch method under aperiodic Dos attack according to claim 4, wherein: in the step 6, when the time t= (m+1) T, the power deviation of the generator set is:
Figure FDA0004240061780000033
wherein: Δp represents the deviation of the overall power system power demand from the power supply; p (P) D Is the total power demand; p (P) G0 ((m+1) T) is the output power of the lead type generator set 0; output power P of following type generator set i Gi ((m+1)T)。
6. The power system distributed economic dispatch method under aperiodic Dos attack according to claim 1, wherein: in the step 8, at time t, the optimal power of the generator set is:
leaderOptimum power of the motor group:
Figure FDA0004240061780000034
following the optimal power of the generator set:
Figure FDA0004240061780000035
wherein: lambda (lambda) 0 Assigning a value to the incremental cost of the leading generator set 0; gamma ray 0 、β 0 Coefficients, lambda, expressed as a quadratic cost function of lead genset 0 i ((m+1) T) is the incremental cost of following genset i, beta i 、γ i Is a coefficient of the quadratic cost function.
CN202210004499.8A 2022-01-04 2022-01-04 Distributed economic dispatching method for power system under aperiodic Dos attack Active CN114336782B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210004499.8A CN114336782B (en) 2022-01-04 2022-01-04 Distributed economic dispatching method for power system under aperiodic Dos attack

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210004499.8A CN114336782B (en) 2022-01-04 2022-01-04 Distributed economic dispatching method for power system under aperiodic Dos attack

Publications (2)

Publication Number Publication Date
CN114336782A CN114336782A (en) 2022-04-12
CN114336782B true CN114336782B (en) 2023-06-23

Family

ID=81025384

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210004499.8A Active CN114336782B (en) 2022-01-04 2022-01-04 Distributed economic dispatching method for power system under aperiodic Dos attack

Country Status (1)

Country Link
CN (1) CN114336782B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104701844A (en) * 2015-03-27 2015-06-10 国家电网公司 Distributed economic dispatching method of power transmission network
CN105449710A (en) * 2015-12-03 2016-03-30 南京邮电大学 Event trigger consistency algorithm-based economic dispatching method for power system
DE102016112288A1 (en) * 2015-07-06 2017-01-12 CATERPILLAR Inc., Gesellschaft nach dem Recht des Staates Delaware Load distribution for different generator sets
CN107092991A (en) * 2017-05-05 2017-08-25 东南大学 A kind of adaptive economic load dispatching distribution method of intelligent grid
CN111242513A (en) * 2020-02-28 2020-06-05 南京邮电大学 Consistency theory-based distributed economic dispatching method for power system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10566793B2 (en) * 2017-09-29 2020-02-18 Mitsubishi Electric Research Laboratories, Inc. Systems and methods for distributed synchronization of micro-grids with multiple points of interconnection

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104701844A (en) * 2015-03-27 2015-06-10 国家电网公司 Distributed economic dispatching method of power transmission network
DE102016112288A1 (en) * 2015-07-06 2017-01-12 CATERPILLAR Inc., Gesellschaft nach dem Recht des Staates Delaware Load distribution for different generator sets
CN105449710A (en) * 2015-12-03 2016-03-30 南京邮电大学 Event trigger consistency algorithm-based economic dispatching method for power system
CN107092991A (en) * 2017-05-05 2017-08-25 东南大学 A kind of adaptive economic load dispatching distribution method of intelligent grid
CN111242513A (en) * 2020-02-28 2020-06-05 南京邮电大学 Consistency theory-based distributed economic dispatching method for power system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于多智能体系统一致性算法的电力系统分布式经济调度策略;谢俊;陈凯旋;岳东;李亚平;王珂;翁盛煊;黄崇鑫;;电力自动化设备(第02期);全文 *

Also Published As

Publication number Publication date
CN114336782A (en) 2022-04-12

Similar Documents

Publication Publication Date Title
Liang et al. Dynamic economic/emission dispatch including PEVs for peak shaving and valley filling
Zeng et al. A potential game approach to distributed operational optimization for microgrid energy management with renewable energy and demand response
CN111082451B (en) Incremental distribution network multi-objective optimization scheduling model based on scene method
Hardiansyah et al. Solving economic load dispatch problem using particle swarm optimization technique
CN112053035B (en) Power transmission channel and energy storage joint planning method considering economy and flexibility
Li et al. Virtual-action-based coordinated reinforcement learning for distributed economic dispatch
Cheng et al. Adaptive robust method for dynamic economic emission dispatch incorporating renewable energy and energy storage
CN114662319A (en) Construction method of active power distribution network planning model considering data center
Yu et al. Multiagent stochastic dynamic game for smart generation control
CN116739158A (en) Self-adaptive optimized energy storage method based on reinforcement learning
CN117578537A (en) Micro-grid optimal scheduling method based on carbon transaction and demand response
CN107769266A (en) A kind of Multiple Time Scales generate electricity and standby combined optimization method
CN114336782B (en) Distributed economic dispatching method for power system under aperiodic Dos attack
CN110829425B (en) Distributed power system economic operation scheduling method
CN115411776B (en) Thermoelectric collaborative scheduling method and device for residence comprehensive energy system
CN111160808A (en) Distributed event-triggered power system economic dispatching method with uncertain parameters
CN108875190B (en) Distributed scheduling method for smart power grid
Wu et al. Distributed hierarchical consensus algorithm for economic dispatch in smart grid
CN111047071A (en) Power system real-time supply and demand interaction method based on deep migration learning and Stackelberg game
CN116388172A (en) Low-carbon power distribution network double-layer planning method based on network loss sensitivity site selection
CN113269420B (en) Distributed event-driven power economy scheduling method based on communication noise
CN115514016A (en) Method, device and equipment for determining combination of power system unit
CN111242513B (en) Consistency theory-based distributed economic dispatching method for power system
CN113972698B (en) Elastic distributed economic dispatching method for power system under information network attack
CN112396232B (en) Economic dispatching method and system for electric power system with valve point effect

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant