Energy scheduling method, system and device of power distribution area and storage medium

Abstract

The invention discloses an energy scheduling method, system and equipment of a power distribution area and a storage medium, which are applied to the technical field of energy scheduling of the power distribution area, and are characterized in that tasks and activities of the power distribution area are acquired, modeling is carried out according to the tasks and the activities to obtain a directed graph, and then topological sorting is carried out on nodes in the directed graph to obtain an initial execution sequence; obtaining a key path according to the initial execution sequence, adjusting initial priorities of nodes belonging to the key path in the initial execution sequence to obtain final priorities of all the nodes, and normalizing the final priorities of all the nodes to obtain an adjusted priority preemption queue; according to the method, the key task can be quickly determined, and the control strategy of the EMS in the dynamic control of the power distribution area is simplified.

Description

Technical Field

[0001] The present invention relates to the technical field of energy scheduling in a distribution substation area, and in particular to an energy scheduling method, system, device and storage medium for a distribution substation area. Background Art

[0002] With the widespread application of distributed energy in substations, traditional substation intelligent fusion terminals only have a single data collection function, making it difficult to optimize and control the diverse and flexible resources in the region.

[0003] Embedded Energy Management Systems (EMS) integrate the functions of data gateways, microgrid controllers, and energy management servers, supporting multiple communication protocols and compatibility with a wide range of devices. However, existing embedded EMSs are complex in terms of control strategy configuration and adjustment. For example, control strategy configuration is complex, requiring customized development and resulting in high implementation costs; control strategy adjustments are inflexible under abnormal conditions or extreme weather; and the system architecture is complex, making it difficult to adapt to the rapid deployment of large-scale microgrids. Therefore, addressing the complexity of dynamic control in existing embedded EMSs is a pressing issue for energy management at the distribution substation level. Summary of the Invention

[0004] In order to solve the above technical problems, embodiments of the present invention provide an energy scheduling method, system, device and storage medium for a distribution substation to solve the problem of complex control strategies in the dynamic control of distribution substations in existing embedded EMS.

[0005] A first aspect of an embodiment of the present invention provides an energy scheduling method for a distribution station area, including:

[0006] Obtaining tasks and activities of the distribution station area, modeling based on the tasks and activities, and obtaining a directed graph, wherein the directed graph includes a number of nodes and edges;

[0007] Perform topological sorting on each node in the directed graph to obtain the initial execution order, and obtain the critical path based on the initial execution order;

[0008] Based on the initial execution order, the initial priorities of the nodes in the critical path are adjusted to obtain an initial priority preemption queue, wherein the initial priority preemption queue includes the final priority of each node;

[0009] The final priority of each node is normalized to obtain an adjusted priority preemption queue, so that the distribution substation executes tasks according to the adjusted priority preemption queue.

[0010] In a possible implementation of the first aspect, performing topological sorting on each node in the directed graph to obtain an initial execution order includes:

[0011] Calculate the in-degree of each node in the directed graph;

[0012] The node with in-degree 0 is regarded as the source node. After putting the source node into the queue, the outgoing edge of the source node is deleted, and the in-degree of the successor node of the source node is updated to obtain the updated in-degree. If the updated in-degree is 0, the successor node is put into the queue. If the updated in-degree is not 0, the other source nodes of the successor node are put into the queue until all nodes are put into the queue to obtain the initial execution order.

[0013] In a possible implementation of the first aspect, obtaining a critical path according to the initial execution order includes:

[0014] Determine the node with out-degree 0 in the directed graph as the sink node;

[0015] Starting from the source node, calculate the first start time of each node in the first direction of the initial execution order;

[0016] Taking the sink node as the starting point, the second start time of each node is calculated sequentially according to the second direction of the initial execution order;

[0017] The critical path is constructed based on the nodes whose second start time is the same as the first start time.

[0018] In a possible implementation of the first aspect, adjusting the initial priorities of nodes in a critical path based on the initial execution order to obtain an initial priority preemption queue includes:

[0019] Based on the initial execution order, the initial priority of each node is obtained;

[0020] The initial priorities of nodes in the critical path are increased to a preset value, while the initial priorities of nodes not in the critical path remain unchanged, and the final priorities of all nodes are obtained;

[0021] According to the final priorities of all nodes, the initial priority preemptive queue is obtained.

[0022] In order to solve the same technical problem, a second aspect of an embodiment of the present invention provides an energy scheduling system for a distribution station area, including:

[0023] An acquisition module is used to acquire tasks and activities of the distribution station area, model them according to the tasks and activities, and obtain a directed graph, wherein the directed graph includes a number of nodes and edges;

[0024] The sorting module is used to topologically sort the nodes in the directed graph to obtain the initial execution order, and obtain the critical path based on the initial execution order;

[0025] an adjustment module, configured to adjust the initial priorities of the nodes in the critical path based on the initial execution order to obtain an initial priority preemption queue, wherein the initial priority preemption queue includes the final priority of each node;

[0026] The normalization module is used to normalize the final priority of each node to obtain an adjusted priority preemption queue so that the distribution station area can execute tasks according to the adjusted priority preemption queue.

[0027] In a possible implementation of the second aspect, the sorting module includes an in-degree calculation unit and an update unit, wherein:

[0028] In-degree calculation unit, used to calculate the in-degree of each node in the directed graph;

[0029] The update unit is used to take the node with in-degree 0 as the source node, put the source node into the queue, delete the outgoing edge of the source node, and update the in-degree of the successor node of the source node to obtain the updated in-degree. If the updated in-degree is 0, the successor node is put into the queue. If the updated in-degree is not 0, the other source nodes of the successor node are put into the queue, until all nodes are put into the queue to obtain the initial execution order.

[0030] In a possible implementation of the second aspect, the sorting module includes a determining unit, a first start time calculating unit, a second start time calculating unit, and a critical path constructing unit, wherein:

[0031] A determination unit, used to determine a node with an out-degree of 0 in a directed graph as a sink node;

[0032] A first start time calculation unit, configured to calculate the first start time of each node in sequence according to the first direction of the initial execution order, starting from the source node;

[0033] a second start time calculation unit, configured to calculate the second start time of each node in sequence according to the second direction of the initial execution order, starting from the sink node;

[0034] The critical path construction unit is used to construct a critical path according to the nodes with the same second start time and first start time.

[0035] In a possible implementation manner of the second aspect, the adjustment module includes an initial priority determination unit, a final priority determination unit, and an initial priority preemption queue determination unit, wherein:

[0036] an initial priority determination unit, configured to obtain an initial priority of each node based on an initial execution order;

[0037] A final priority determination unit is used to increase the initial priorities of nodes in the critical path to a preset value, and keep the initial priorities of nodes not in the critical path unchanged, so as to obtain the final priorities of all nodes;

[0038] The initial priority preemptive queue determining unit is used to obtain the initial priority preemptive queue according to the final priorities of all nodes.

[0039] The technical solution of the present invention has the following advantages:

[0040] The energy scheduling method for a distribution substation provided by an embodiment of the present invention obtains the tasks and activities of the distribution substation, models them according to the tasks and activities, obtains a directed graph, then topologically sorts the nodes in the directed graph to obtain an initial execution order, and obtains a critical path based on the initial execution order. The initial priorities of the nodes in the critical path in the initial execution order are then adjusted to obtain the final priority of each node, and the final priorities of each node are normalized to obtain an adjusted priority preemption queue, so that the distribution substation executes tasks according to the adjusted priority preemption queue. This method allows for rapid determination of critical tasks and redundant tasks, simplifying the control strategy of the EMS in the dynamic control of the distribution substation. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the specific embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0042] Figure 1 Flowchart of the energy scheduling method for a distribution station area according to an embodiment of the present invention;

[0043] Figure 2 Schematic diagram of a directed graph of an energy scheduling method for a distribution station area according to an embodiment of the present invention;

[0044] Figure 3 This is a system block diagram of an energy dispatching system for a distribution station area according to an embodiment of the present invention;

[0045] Reference numerals: 300, energy dispatching system of distribution station area; 301, acquisition module; 302, sorting module; 303, adjustment module; 304, normalization module. DETAILED DESCRIPTION

[0046] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. All other embodiments obtained by ordinary technicians in this field based on the embodiments of the present invention without making any creative efforts shall fall within the scope of protection of the present invention.

[0047] In the description of the present invention, it should be noted that the terms “first”, “second” and “third” are only used for descriptive purposes and should not be understood as indicating or implying relative importance.

[0048] The energy scheduling method for the distribution area provided by the embodiment of the present invention is as follows: Figure 1 FIG. 1 is a flow chart of an energy scheduling method for a distribution station area, including steps S101 to S104. The specific steps are as follows:

[0049] S101: Obtain tasks and activities of a distribution substation area, perform modeling based on the tasks and activities, and obtain a directed graph, wherein the directed graph includes a plurality of nodes and edges.

[0050] In this embodiment, tasks and activities in the energy management of the distribution substation are identified, tasks are defined as nodes, activities are defined as edges, each task corresponds to a node, and activity corresponds to an edge, and an AOE network diagram is constructed to obtain a directed graph.

[0051] It's important to note that tasks can be understood as critical states or decision points in the energy management process for distribution substations, representing discrete events that the system must respond to or evaluate. Examples include voltage over-limit detection, energy storage SOC reaching a threshold, sudden PV output changes, and completed load switching. Activities can be understood as the control actions or energy flows required to transition between states during distribution substation energy management, such as PV derating, energy storage charge and discharge instructions, DC / AC inversion, and voltage conversion.

[0052] A directed graph can also refer to a weighted directed acyclic graph (AOE). An AOE network is a weighted directed acyclic graph consisting of multiple event-driven processes (and some additional parameters). By combining these two, an AOE network can formally describe the complete "event-action-result" chain in a distribution network, providing a mathematical foundation for optimal control.

[0053] like Figure 2The figure shows a schematic diagram of the AOE network, which contains 6 nodes and 6 edges, namely node 1 to node 6, and the edges include action 1-2, action 1-3, action 2-4, action 4-5, and action 5-6. Each node represents a task, and each edge represents an activity. The direction of the edge represents the progressive and migration relationship between the events represented by the node, which is determined by the activity represented by the edge. When the task corresponding to a node in the AOE network occurs, the corresponding activity will be executed according to the rules defined in the node. When the activity is completed, it will enter the next node and then determine whether the task has occurred according to the node definition rules.

[0054] S102: topologically sorting each node in the directed graph to obtain an initial execution order, and obtaining a critical path based on the initial execution order.

[0055] In this embodiment, to determine the critical path in a directed graph, the nodes in the directed graph are first topologically sorted, and an initial execution order is determined based on the calculated dependencies. By performing topological sorting and determining the execution order of the nodes, circular dependencies are prevented when calculating the dependencies.

[0056] Then, based on the initial execution sequence, the critical path is obtained and the most time-consuming path (critical path) is identified to ensure the shortest total construction period.

[0057] In one embodiment, topological sorting is performed on each node in the directed graph to obtain an initial execution order, including:

[0058] Calculate the in-degree of each node in the directed graph;

[0059] The node with in-degree 0 is regarded as the source node. After putting the source node into the queue, the outgoing edge of the source node is deleted, and the in-degree of the successor node of the source node is updated to obtain the updated in-degree. If the updated in-degree is 0, the successor node is put into the queue. If the updated in-degree is not 0, the other source nodes of the successor node are put into the queue until all nodes are put into the queue to obtain the initial execution order.

[0060] In this embodiment, the in-degree of each node is calculated. The in-degree refers to the number of edges pointing to the node. An in-degree of 0 indicates that no edges point to the node, and the node is the source node. An out-degree greater than or equal to 1 indicates that at least one edge originates from the node and points to another node.

[0061] Specifically, all nodes with an in-degree of 0 are added to the queue. For example, if the in-degree of node A is 0, node A is removed and added to the queue. Then all out-edges of node A, that is, edges pointing to other nodes, are deleted, and the in-degree of the successor node is updated. At this time, the in-degree of node B changes from 1 to 0. Node B is then added to the queue for sorting, and all out-edges of node B are deleted. The in-degrees of nodes C and D are both changed to 0. Then node C is added to the queue and the out-edges of node C are deleted. The in-degree of node E changes from 2 to 1, and there is still one node D→node E that has not been processed. Then node D is removed, the out-edges of node D are deleted, the in-degree of node E becomes 0, and node E is added to the queue. This is repeated until all nodes are sorted and the initial execution order is obtained.

[0062] It should be noted that nodes A to D are example nodes used to illustrate how to perform topological sorting on the nodes in the directed graph to obtain an initial execution order.

[0063] In one embodiment, obtaining a critical path according to the initial execution order includes:

[0064] Determine the node with out-degree 0 in the directed graph as the sink node;

[0065] Starting from the source node, calculate the first start time of each node in the first direction of the initial execution order;

[0066] Taking the sink node as the starting point, the second start time of each node is calculated sequentially according to the second direction of the initial execution order;

[0067] The critical path is constructed based on the nodes whose second start time is the same as the first start time.

[0068] In this embodiment, all nodes with in-degree 0 (source nodes) and out-degree 0 (sink nodes) in the directed graph are found. Starting from the source node, the first start time of each node is calculated sequentially in the first direction of the initial execution order. Then, starting from the sink node, the second start time of each node is calculated sequentially in the second direction of the initial execution order. Nodes with the same second start time are found, and these nodes are used to form the critical path.

[0069] It should be noted that the first direction order refers to the positive order according to the initial execution order, that is, if the initial execution order is node A-node E, then starting from node A, the first start time of node A, node B, node C, node D and node E are calculated in sequence. The first start time refers to the earliest start time.

[0070] The second direction order refers to the reverse order of the initial execution order. That is, if the initial execution order is node A-node E, starting from node E, the first start time of node E, node D, node C, node B and node A are calculated in sequence. The first start time refers to the latest start time.

[0071] S103: Based on the initial execution order, the initial priorities of the nodes in the critical path are adjusted to obtain an initial priority preemption queue, wherein the initial priority preemption queue includes the final priority of each node.

[0072] In this embodiment, the priority of the critical path nodes (the nodes with the greatest impact on the total execution time) in the AOE network is dynamically adjusted to ensure that they are executed first. Specifically, based on the initial execution order, the initial priority of all nodes is set to 1. Then, based on the constructed critical path, the initial priority of the nodes in the critical path is increased to generate an initial priority preemptive queue. It can be understood that in the initial priority preemptive queue, high-priority tasks can be queued for execution.

[0073] In one embodiment, the initial priorities of nodes in the critical path are adjusted based on the initial execution order to obtain an initial priority preemption queue, including:

[0074] Based on the initial execution order, the initial priority of each node is obtained;

[0075] The initial priorities of nodes in the critical path are increased to a preset value, while the initial priorities of nodes not in the critical path remain unchanged, and the final priorities of all nodes are obtained;

[0076] According to the final priorities of all nodes, the initial priority preemptive queue is obtained.

[0077] In this embodiment, based on the initial execution order, the initial priority of all nodes is set to 1, and then the initial priority of the nodes belonging to the critical path is increased to a preset value, and the initial priority of the nodes not belonging to the critical path remains unchanged, thereby determining the final priority of all nodes, and generating an initial priority preemption queue based on the final priority of all nodes.

[0078] It should be noted that the preset value is 10% of the initial priority.

[0079] S104: normalizing the final priority of each node to obtain an adjusted priority preemption queue, so that the distribution substation executes tasks according to the adjusted priority preemption queue.

[0080] In this embodiment, because increasing the initial priority of nodes in the critical path will increase the overall system priority and undermine scheduling fairness, the final priority of each node in the initial priority preemption queue is normalized to ensure that the sum of the priorities before and after the adjustment remains unchanged, resulting in an adjusted priority preemption queue. This method ensures that critical nodes (nodes that directly affect the total execution time of the current AOE network) receive the highest priority execution, while also supporting the ability to dynamically adjust the critical path after changes in critical nodes.

[0081] It should be noted that the normalization formula is:

[0082]

[0083] Where, is the final priority of a node after normalization, x is the final priority of a node, X is the sum of the final priorities of all nodes, and y is the sum of the initial priorities of all nodes.

[0084] After obtaining the adjusted priority preemption queue, the embedded energy management system's policy configuration module in the distribution substation generates a control policy based on the adjusted priority preemption queue and sends it to the monitoring module. The embedded energy management system also includes a data acquisition module and a monitoring module. The data acquisition module collects data in real time and transmits it to the policy configuration module via the data communication module. The policy configuration module also provides graphical policy design and file configuration implementation (see Table 1).

[0085] Table 1 Graphical modeling strategy design and file configuration implementation

[0086]

[0087] The monitoring module monitors the system operation status of the distribution station area in real time and transmits feedback information to the strategy configuration module to achieve closed-loop control.

[0088] It should be noted that the data acquisition module collects real-time data from distributed energy resources at the substation side and supports four remote control modes: telemetry, telesignaling, teleadjustment, and remote control. Telemetry refers to remote measurement of real-time analog data from equipment, telesignaling refers to remote monitoring of the device's switching status, remote adjustment refers to remote modification of device parameters, and remote control refers to remote execution of control commands.

[0089] The data communication module supports Modbus, DL / T 645, and IEC 104 protocols, enabling efficient data transmission. It also supports protocol forwarding, enabling multi-level EMS cascade control or access to other data platforms.

[0090] The present invention models tasks and activities to create a directed graph. This then performs critical path analysis based on the directed graph and the priorities of each node, allowing for rapid identification of critical and redundant tasks and simplifying the policy configuration process. In unusual circumstances or extreme weather, control strategies can be quickly adjusted simply by modifying the policy configuration file. This approach eliminates the need for a dedicated development team, maximizing the economic efficiency of microgrid operation and making it suitable for rapid deployment of large-scale microgrids. It demonstrates excellent versatility and scalability.

[0091] The energy dispatching system for the distribution area provided by the embodiment of the present invention is as follows: Figure 3 As shown, Figure 3 The system block diagram of the energy dispatching system 300 for the distribution substation area includes:

[0092] An acquisition module 301 is used to acquire tasks and activities of a distribution station area, and to model the tasks and activities to obtain a directed graph, wherein the directed graph includes a plurality of nodes and edges;

[0093] The sorting module 302 is used to perform topological sorting on each node in the directed graph to obtain an initial execution order, and obtain a critical path based on the initial execution order;

[0094] An adjustment module 303 is configured to adjust the initial priorities of the nodes in the critical path based on the initial execution order to obtain an initial priority preemption queue, wherein the initial priority preemption queue includes the final priority of each node;

[0095] The normalization module 304 is used to normalize the final priority of each node to obtain an adjusted priority preemption queue, so that the distribution substation executes tasks according to the adjusted priority preemption queue.

[0096] In one embodiment, the sorting module 302 includes an in-degree calculation unit and an update unit, wherein:

[0097] In-degree calculation unit, used to calculate the in-degree of each node in the directed graph;

[0098] The update unit is used to take the node with in-degree 0 as the source node, put the source node into the queue, delete the outgoing edge of the source node, and update the in-degree of the successor node of the source node to obtain the updated in-degree. If the updated in-degree is 0, the successor node is put into the queue. If the updated in-degree is not 0, the other source nodes of the successor node are put into the queue, until all nodes are put into the queue to obtain the initial execution order.

[0099] In one embodiment, the sorting module 302 includes an in-degree calculation unit and an update unit, wherein:

[0100] The in-degree calculation unit is used to calculate the in-degree of each node in the directed graph;

[0101] The update unit is used to take the node with an in-degree of 0 as the source node, put the source node into the queue, delete the outgoing edge of the source node, and update the in-degree of the successor node of the source node to obtain the updated in-degree. If the updated in-degree is 0, the successor node is put into the queue. If the updated in-degree is not 0, other source nodes of the successor node are put into the queue, until all nodes are put into the queue to obtain the initial execution order.

[0102] In one embodiment, the sorting module 302 includes a determination unit, a first start time calculation unit, a second start time calculation unit, and a critical path construction unit, wherein:

[0103] A determination unit, used to determine a node with an out-degree of 0 in a directed graph as a sink node;

[0104] A first start time calculation unit, configured to calculate the first start time of each node in sequence according to the first direction of the initial execution order, starting from the source node;

[0105] a second start time calculation unit, configured to calculate the second start time of each node in sequence according to the second direction of the initial execution order, starting from the sink node;

[0106] The critical path construction unit is used to construct a critical path according to the nodes with the same second start time and first start time.

[0107] In one embodiment, the adjustment module 303 includes an initial priority determination unit, a final priority determination unit, and an initial priority preemption queue determination unit, wherein:

[0108] an initial priority determination unit, configured to obtain an initial priority of each node based on an initial execution order;

[0109] A final priority determination unit is used to increase the initial priorities of nodes in the critical path to a preset value, and keep the initial priorities of nodes not in the critical path unchanged, so as to obtain the final priorities of all nodes;

[0110] The initial priority preemptive queue determining unit is used to obtain the initial priority preemptive queue according to the final priorities of all nodes.

[0111] In one embodiment of the present application, a computer device is provided, which includes a memory and a processor, wherein a computer program is stored in the memory, and the above steps are implemented when the processor executes the computer program; the computer device provided in this embodiment has an implementation principle and technical effects similar to those of the above method embodiment, and will not be repeated here.

[0112] In one embodiment of the present application, a computer-readable storage medium is provided, on which a computer program is stored, and the above steps are implemented when the computer program is executed by a processor; the computer-readable storage medium provided in this embodiment has an implementation principle and technical effects similar to those of the above method embodiment, and will not be repeated here.

[0113] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0114] The specific embodiments described above further illustrate the objectives, technical solutions, and beneficial effects of the present invention. It should be understood that the above descriptions are merely specific embodiments of the present invention and are not intended to limit the scope of protection of the present invention. In particular, it should be noted that any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included within the scope of protection of the present invention for those skilled in the art.

Claims

1. A method for energy scheduling in a distribution area, characterized in that: include: Obtaining tasks and activities of the distribution substation area, and modeling according to the tasks and activities to obtain a directed graph, wherein the directed graph includes a plurality of nodes and edges; Performing topological sorting on each node in the directed graph to obtain an initial execution order, and obtaining a critical path based on the initial execution order; Adjusting the initial priorities of the nodes in the critical path based on the initial execution order to obtain an initial priority preemption queue, wherein the initial priority preemption queue includes the final priority of each node; The final priorities of the nodes are normalized to obtain an adjusted priority preemption queue, so that the distribution substation executes the task according to the adjusted priority preemption queue.

2. The energy scheduling method for a distribution station area according to claim 1, characterized in that: The topological sorting of the nodes in the directed graph to obtain an initial execution order includes: Calculating the in-degree of each node in the directed graph; The node with the in-degree of 0 is taken as the source node. After the source node is placed in the queue, the outgoing edge of the source node is deleted, and the in-degree of the successor node of the source node is updated to obtain the updated in-degree. If the updated in-degree is 0, the successor node is placed in the queue. If the updated in-degree is not 0, the other source nodes of the successor node are placed in the queue, until all nodes are placed in the queue to obtain the initial execution order.

3. The energy scheduling method for a distribution station area according to claim 1, characterized in that: Obtaining a critical path according to the initial execution order includes: Determine the node with an out-degree of 0 in the directed graph as a sink node; Taking the source node as the starting point, sequentially calculating the first start time of each of the nodes according to the first direction of the initial execution order; Taking the sink node as a starting point, sequentially calculating the second start time of each of the nodes according to the second direction of the initial execution order; A critical path is constructed based on the nodes whose second start time is the same as the first start time.

4. The energy scheduling method for a distribution station area according to claim 1, characterized in that: The step of adjusting the initial priorities of the nodes in the critical path based on the initial execution order to obtain an initial priority preemption queue includes: Based on the initial execution order, obtaining the initial priority of each node; Raising the initial priorities of the nodes in the critical path to a preset value, and keeping the initial priorities of the nodes not in the critical path unchanged, to obtain the final priorities of all the nodes; An initial priority preemption queue is obtained according to the final priorities of all the nodes.

5. An energy dispatching system for a distribution station area, characterized in that: include: An acquisition module is used to acquire tasks and activities of the distribution station area, and to model the tasks and activities to obtain a directed graph, wherein the directed graph includes a plurality of nodes and edges; A sorting module, configured to perform topological sorting on each node in the directed graph to obtain an initial execution order, and obtain a critical path based on the initial execution order; an adjustment module, configured to adjust the initial priorities of the nodes in the critical path based on the initial execution order to obtain an initial priority preemption queue, wherein the initial priority preemption queue includes the final priority of each node; The normalization module is used to normalize the final priority of each node to obtain an adjusted priority preemption queue, so that the distribution substation performs the task according to the adjusted priority preemption queue.

6. The energy dispatching system for a distribution station area according to claim 5, characterized in that: The sorting module includes an in-degree calculation unit and an update unit, wherein: The in-degree calculation unit is used to calculate the in-degree of each node in the directed graph; The update unit is used to take the node with an in-degree of 0 as the source node, put the source node into the queue, delete the outgoing edge of the source node, and update the in-degree of the successor node of the source node to obtain the updated in-degree. If the updated in-degree is 0, the successor node is put into the queue. If the updated in-degree is not 0, other source nodes of the successor node are put into the queue, until all nodes are put into the queue to obtain the initial execution order.

7. The energy dispatching system for a distribution station area according to claim 5, characterized in that: The sequencing module includes a determination unit, a first start time calculation unit, a second start time calculation unit and a critical path construction unit, wherein: The determining unit is configured to determine that the node with an out-degree of 0 in the directed graph is a sink node; The first start time calculation unit is configured to calculate the first start time of each of the nodes in sequence according to the first direction of the initial execution order, starting from the source node; The second start time calculation unit is configured to calculate the second start time of each of the nodes in sequence according to the second direction of the initial execution order, starting from the sink node; The critical path construction unit is configured to construct a critical path according to nodes having the same second start time as the first start time.

8. The energy dispatching system for a distribution station area according to claim 5, characterized in that: The adjustment module includes an initial priority determination unit, a final priority determination unit and an initial priority preemption queue determination unit, wherein: The initial priority determination unit is configured to obtain the initial priority of each node based on the initial execution order; The final priority determination unit is configured to increase the initial priorities of the nodes in the critical path to a preset value, keep the initial priorities of the nodes not in the critical path unchanged, and obtain the final priorities of all the nodes; The initial priority preemptive queue determining unit is configured to obtain an initial priority preemptive queue according to the final priorities of all the nodes.

9. A computer device, characterized in that: include: memory for storing computer programs; A processor, configured to implement the energy scheduling method for a distribution station area according to any one of claims 1 to 4 when executing the computer program.

10. A storage medium, characterized in that: The storage medium stores a computer program, which, when executed by a processor, implements the steps of the energy scheduling method for a distribution station area according to any one of claims 1 to 4.

Images