Electric power complementation scheduling calculation method and system for photovoltaic energy system

Abstract

The invention provides a photovoltaic energy system power complementation scheduling calculation method and system. First photovoltaic energy transmission data, target current scheduling data of a target current interaction event and at least one target current interaction event directory of the target current interaction event are acquired. And performing important data analysis processing on the first photovoltaic energy transmission data to obtain first current scheduling data of the current interaction event. At least one first current interaction event directory of current interaction events is obtained. According to the matching degree between the first current scheduling data and the target current scheduling data and the projection condition of the at least one first current interaction event catalog and the at least one target current interaction event catalog, obtaining a power complementation scheduling calculation mode. According to the method, the electric power complementary scheduling calculation mode can be accurately determined, so that the complementary scheduling result can be accurately determined.

Description

Technical Field

[0001] The present application relates to the technical field of electric power complementary scheduling calculation and processing, and in particular, to a method and system for calculating electric power complementary scheduling of a photovoltaic energy system. Background Art

[0002] Electricity is provided by many power plants and supplied to a large number of users through transmission, transformation, distribution and power supply networks. It is a complex system in which the production, supply and sales processes are completed and balanced at the same time in an instant. Therefore, its dispatching task is different from general industrial production dispatching. The dispatching of the power system must keep the balance between power generation and load at all times, and requires every department under the dispatching jurisdiction to strictly complete the dispatching task according to quality and quantity.

[0003] At present, the demand for electricity is increasing, and it is very difficult to carry out the task of complementary power dispatching. In the existing technology, there is a big difference between complementary power dispatching and the actual operation process. Therefore, a technical solution is urgently needed to improve the above problems. Summary of the invention

[0004] In view of this, the present application provides a photovoltaic energy system power complementary scheduling calculation method and system.

[0005] In a first aspect, a photovoltaic energy system power complementary scheduling calculation method is provided, the method comprising: Acquire first photovoltaic energy transmission data, target current scheduling data of a target current interaction event, and at least one target current interaction event catalog of the target current interaction event, wherein the first photovoltaic energy transmission data includes a current interaction event that needs to be processed; perform important data parsing processing on the first photovoltaic energy transmission data to obtain first current scheduling data of the current interaction event that needs to be processed; Obtain at least one first current interaction event catalog of the current interaction event that needs to be processed; obtain the power complementary scheduling calculation method of the current interaction event that needs to be processed and the target current interaction event through the matching degree between the first current scheduling data and the target current scheduling data, and the projection of the at least one first current interaction event catalog and the at least one target current interaction event catalog.

[0006] In the present application, the electric power complementary scheduling calculation method of obtaining the current interaction event to be processed and the target current interaction event by the matching degree between the first current scheduling data and the target current scheduling data, and the projection of the at least one first current interaction event catalog and the at least one target current interaction event catalog, includes: On the premise that the degree of match between the first current scheduling data and the target current scheduling data is greater than a first matching degree threshold, all directories are selected through at least one first current interaction event directory and at least one target current interaction event directory to obtain the power complementary scheduling calculation method of the current interaction event to be processed and the target current interaction event.

[0007] In the present application, under the premise that the at least one first current interaction event catalog includes the first current interaction attribute of the current interaction event to be processed, and the at least one target current interaction event catalog includes the target current interaction attribute of the target current interaction event, the electric power complementary scheduling calculation method of obtaining the current interaction event to be processed and the target current interaction event through the at least one first current interaction event catalog and the at least one target current interaction event catalog includes: On the premise that the first current interaction attribute matches the target current interaction attribute, it is determined that the power complementary scheduling calculation method includes that the current interaction event that needs to be processed is the same as the target current interaction event; on the premise that the first current interaction attribute does not match the target current interaction attribute, it is determined that the power complementary scheduling calculation method includes that the current interaction event that needs to be processed is different from the target current interaction event.

[0008] In the present application, the at least one first current interaction event directory includes the first current interaction attribute of the current interaction event that needs to be processed and at least one first complete directory of the current interaction event that needs to be processed, and the at least one target current interaction event directory includes the target current interaction attribute of the target current interaction event and at least one target complete directory of the target current interaction event; the power complementary scheduling calculation method of the current interaction event that needs to be processed and the target current interaction event is obtained through the at least one first current interaction event directory and the at least one target current interaction event directory, including: on the premise that the first current interaction attribute matches the target current interaction attribute, the power complementary scheduling calculation method of the current interaction event that needs to be processed and the target current interaction event is obtained through the at least one first complete directory and the at least one target complete directory.

[0009] In the present application, the at least one target current interaction event directory includes at least one target full directory of the target current interaction event; the obtaining of at least one current interaction event directory of the current interaction event to be processed after the matching degree between the first current scheduling data and the target current scheduling data is greater than a first matching degree threshold comprises: performing full directory selection processing on the first photovoltaic energy transmission data to obtain at least one first full directory of the current interaction event to be processed, under the premise that the first current interaction attribute of the current interaction event to be processed is not parsed; The method of obtaining a power complementary scheduling calculation method for the current interaction event to be processed and the target current interaction event through the at least one first current interaction event directory and the at least one target current interaction event directory includes: obtaining a power complementary scheduling calculation method for the current interaction event to be processed and the target current interaction event through the at least one first full directory and the at least one target full directory.

[0010] In the present application, the method of obtaining the electric power complementary scheduling calculation method of the current interaction event to be processed and the target current interaction event through the at least one first full directory and the at least one target full directory includes: Determine whether there is a projection relationship between the at least one first entire directory and the at least one target entire directory, and obtain a first projection situation; On the premise that the first projection situation includes that the at least one first entire catalog and the at least one target entire catalog match, determining that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event; On the premise that the first projection situation includes that the at least one first entire catalog and the at least one target entire catalog do not match, determining that the electric power complementary scheduling calculation method includes that the current interaction event that needs to be processed is different from the target current interaction event.

[0011] In the present application, the at least one first entire directory and the at least one target entire directory both include scheduling calculation results; before determining whether there is a projection relationship between the at least one first entire directory and the at least one target entire directory and obtaining the first projection situation, the method further includes: obtaining a second matching degree threshold, the second matching degree threshold being greater than the first matching degree threshold; The determining whether there is a projection relationship between the at least one first entire directory and the at least one target entire directory to obtain a first projection situation includes: determining that the first projection situation includes that the at least one first entire directory and the at least one target entire directory have a projection relationship, on the premise that the matching degree between the first current scheduling data and the target current scheduling data is greater than the second matching degree threshold, and the at least one first entire directory and the at least one target entire directory meet the first projection relationship condition or the second projection relationship condition; Under the premise that the matching degree between the first current scheduling data and the target current scheduling data is greater than the second matching degree threshold, and the at least one first entire directory and the at least one target entire directory do not satisfy the first projection relationship existence condition and the second projection relationship existence condition, determining that the first projection situation includes that the at least one first entire directory and the at least one target entire directory do not have a projection relationship; The first projection relationship condition includes: there is no all directory representing the same all directory and the scheduling calculation result is greater than the scheduling calculation result threshold value in the at least one first all directory and the at least one target all directory; The second projection relationship condition includes: the second all directory in the at least one first all directory is the same as the third all directory in the at least one target all directory, the second all directory and the third all directory represent the same all directory, and the scheduling calculation result of the second all directory and the scheduling calculation result of the third all directory are both greater than the scheduling calculation result threshold.

[0012] In the present application, under the premise that the matching degree between the first current scheduling data and the target current scheduling data is not greater than the second matching degree threshold, the method further includes: On the premise that there are no all directories representing the same all directories between the at least one first all directory and the at least one target all directory and the scheduling calculation result is greater than the scheduling calculation result threshold, determining that the first projection situation includes that there is no projection relationship between the at least one first all directory and the at least one target all directory; Determine whether there is a projection relationship between the fourth all directory in the at least one first all directory and the fifth all directory in the at least one target all directory, and obtain a second projection situation, the scheduling calculation result of the fourth all directory and the scheduling calculation result of the fifth all directory are both greater than the scheduling calculation result threshold, and the fourth all directory and the fifth all directory represent the same all directory; On the premise that the second projection situation includes that the fourth entire directory matches the fifth entire directory, determining that the first projection situation includes that the at least one first entire directory has a projection relationship with the at least one target entire directory; On the premise that the second projection situation includes that the fourth entire directory and the fifth entire directory do not match, it is determined that the first projection situation includes that the at least one first entire directory and the at least one target entire directory do not have a projection relationship.

[0013] In the present application, the step of determining whether a fourth directory in the at least one first directory and a fifth directory in the at least one target directory have a projection relationship to obtain a second projection situation includes: On the premise that the fourth entire catalog and the fifth entire catalog are the same, it is determined that the second projection situation includes that there is a projection relationship between the fourth entire catalog and the fifth entire catalog; on the premise that the fourth entire catalog and the fifth entire catalog are not the same, it is determined that the second projection situation includes that there is no projection relationship between the fourth entire catalog and the fifth entire catalog.

[0014] In the present application, the step of determining whether a fourth directory in the at least one first directory and a fifth directory in the at least one target directory have a projection relationship to obtain a second projection situation includes: On the premise that the fourth entire directory and the fifth entire directory represent the first load balancing description content and the second load balancing description content respectively, the load balancing description content of obtaining the first load balancing description content and the second load balancing description content has a projection relationship; On the premise that the first load balancing description content and the second load balancing description content do not match through the existence of a projection relationship between the load balancing description content, it is determined that the second projection situation includes that there is no projection relationship between the fourth entire directory and the fifth entire directory; on the premise that the first load balancing description content and the second load balancing description content match through the existence of a projection relationship between the load balancing description content, it is determined that the second projection situation includes that there is a projection relationship between the fourth entire directory and the fifth entire directory.

[0015] In the present application, the power complementary scheduling calculation method for the current interaction event to be processed and the target current interaction event is obtained by the matching degree between the first current scheduling data and the target current scheduling data, and the projection of the at least one first current interaction event directory and the at least one target current interaction event directory, including: on the premise that the at least one first current interaction event directory and the at least one target current interaction event directory match, the power complementary scheduling calculation method for the current interaction event to be processed and the target current interaction event is obtained by the matching degree between the first current scheduling data and the target current scheduling data.

[0016] In a second aspect, a photovoltaic energy system electric power complementary scheduling calculation system is provided, comprising a processor and a memory communicating with each other, wherein the processor is used to retrieve a computer program from the memory and implement the above method by running the computer program.

[0017] A photovoltaic energy system power complementary scheduling calculation method and system provided in an embodiment of the present application obtains first photovoltaic energy transmission data, target current scheduling data of a target current interaction event, and at least one target current interaction event directory of a target current interaction event. The first photovoltaic energy transmission data is subjected to important data parsing processing to obtain first current scheduling data of a current interaction event that needs to be processed. At least one first current interaction event directory of a current interaction event that needs to be processed is obtained. Through the matching degree between the first current scheduling data and the target current scheduling data, and the projection of at least one first current interaction event directory and at least one target current interaction event directory, a power complementary scheduling calculation method for the current interaction event that needs to be processed and the target current interaction event is obtained. The power complementary scheduling calculation method can be accurately determined, so that the complementary scheduling result can be accurately determined. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other relevant drawings can be obtained based on these drawings without paying creative work.

[0019] Figure 1 A flowchart of a photovoltaic energy system power complementary scheduling calculation method provided in an embodiment of the present application.

[0020] Figure 2 A block diagram of a photovoltaic energy system power complementary scheduling calculation device provided in an embodiment of the present application.

[0021] Figure 3 An architectural diagram of a photovoltaic energy system power complementary scheduling computing system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0022] In order to better understand the above technical scheme, the technical scheme of the present application is described in detail below through the accompanying drawings and specific embodiments. It should be understood that the embodiments of the present application and the specific features in the embodiments are detailed descriptions of the technical scheme of the present application, rather than limitations on the technical scheme of the present application. In the absence of conflict, the embodiments of the present application and the technical features in the embodiments can be combined with each other.

[0023] See also Figure 1 , shows a photovoltaic energy system power complementary scheduling calculation method, the method may include the following steps 101-104 described in the technical solution.

[0024] 101. Acquire first photovoltaic energy transmission data, target current scheduling data of a target current interaction event, and at least one target current interaction event directory of the target current interaction event, wherein the first photovoltaic energy transmission data includes a current interaction event that needs to be processed.

[0025] In this embodiment, the current interaction event to be processed and the target current interaction event may be any current interaction event.

[0026] In this embodiment, the target current scheduling data of the target current interaction event is accompanied by the attribute directory of the target current interaction event, that is, by comparing the current scheduling data of any current interaction event with the target current scheduling data, it can be determined whether the current interaction event is the same as the target current interaction event. Further, the target current scheduling data includes a key description of the attribute directory of the attached target current interaction event.

[0027] In an independent implementation embodiment, the target current scheduling data is accompanied by significant key information of the target current interaction event.

[0028] In a possible implementation example, the target current scheduling data is accompanied by all key information of the target current interaction event, wherein all key information includes all current interaction attribute description information of the target current interaction event.

[0029] In another possible implementation, the target current scheduling data is accompanied by both significant key information of the target current interaction event and all key information of the target current interaction event.

[0030] In this embodiment, the current interaction event catalog includes at least one of the following: current interaction event type, load balancing description content, current interaction event catalog, and current interaction attribute.

[0031] In this embodiment, at least one target current interaction event directory is a current interaction event directory of a target current interaction event. At least one target current interaction event directory may be a target current interaction event directory, and at least one target current interaction event directory may also be at least one target current interaction event directory. For example, at least one target current interaction event directory includes a load balancing description content of a target current interaction event. For another example, at least one target current interaction event directory includes a load balancing description content of a target current interaction event and a current interaction attribute of a target current interaction event.

[0032] In an implementation of obtaining at least one target current interaction event directory of a target current interaction event, at least one target current interaction event directory of a target current interaction event is recorded to a data processing system. The data processing system can select at least one target current interaction event directory of a target current interaction event to obtain at least one target current interaction event directory of a target current interaction event.

[0033] In another implementation manner of obtaining at least one target current interaction event directory of target current interaction events, a data processing system collects at least one target current interaction event directory of target current interaction events.

[0034] In yet another implementation of acquiring at least one target current interaction event directory of target current interaction events, a data processing system loads at least one target current interaction event directory of target current interaction events.

[0035] It should be understood that, in this embodiment, the step of obtaining the first photovoltaic energy transmission data, the step of obtaining the target current scheduling data of the target current interaction event, and the step of obtaining at least one target current interaction event directory can be performed separately or simultaneously. For example, the data processing system may first obtain the first photovoltaic energy transmission data, then obtain the target current scheduling data of the target current interaction event, and finally obtain at least one target current interaction event directory. For another example, the data processing system may first obtain the target current scheduling data of the target current interaction event, then obtain the first photovoltaic energy transmission data, and finally obtain at least one target current interaction event directory. For another example, the data processing system may first obtain at least one target current interaction event directory, then obtain the first photovoltaic energy transmission data, and finally obtain the target current scheduling data of the target current interaction event. For another example, the data processing system obtains the target current scheduling data of the target current interaction event and at least one target current interaction event directory in the process of obtaining the first photovoltaic energy transmission data, or obtains the first photovoltaic energy transmission data and at least one target current interaction event directory in the process of obtaining the target current scheduling data of the target current interaction event, or obtains the first photovoltaic energy transmission data and the target current scheduling data in the process of obtaining at least one target current interaction event directory.

[0036] 102. Perform important data analysis on the first photovoltaic energy transmission data to obtain first current scheduling data of the current interaction event that needs to be processed.

[0037] In this embodiment, the first current scheduling data is accompanied by an attribute directory of the current interaction event that needs to be processed, that is, by comparing the current scheduling data of any current interaction event with the first current scheduling data, it can be determined whether the current interaction event is the same as the current interaction event that needs to be processed. Further, the first current scheduling data includes a key description of the attribute directory of the current interaction event that needs to be processed.

[0038] In an independent implementation embodiment, the first current scheduling data is accompanied by significant key information of the current interaction event that needs to be processed.

[0039] In a possible implementation example, the first current scheduling data is accompanied by all key information of the current interaction event that needs to be processed, wherein all key information includes all current interaction attribute description information of the current interaction event that needs to be processed.

[0040] In another possible implementation, the first current scheduling data is accompanied by both significant key information of the current interaction event that needs to be processed and all key information of the current interaction event that needs to be processed.

[0041] In this embodiment, the important data analysis process is used to select the current scheduling data of the current interaction event in the photovoltaic energy transmission data. In an independent implementation embodiment, the data processing system implements the important data analysis process of the photovoltaic energy transmission data by performing feature extraction operation on the photovoltaic energy transmission data.

[0042] 103. Obtain at least one first current interaction event directory of a target current interaction event.

[0043] In this embodiment, at least one first current interaction event directory is a current interaction event directory of current interaction events that need to be processed. At least one first current interaction event directory can be a first current interaction event directory, and at least one first current interaction event directory can also be at least one first current interaction event directory. For example, at least one first current interaction event directory includes current interaction event types of current interaction events that need to be processed. For another example, at least one first current interaction event directory includes current interaction event types of current interaction events that need to be processed and current interaction attributes of current interaction events that need to be processed.

[0044] In an implementation of obtaining at least one first current interaction event directory of current interaction events that need to be processed, at least one first current interaction event directory of current interaction events that need to be processed is recorded in a data processing system. The data processing system can select at least one first current interaction event directory of current interaction events that need to be processed to obtain at least one first current interaction event directory of current interaction events that need to be processed.

[0045] In another implementation manner of obtaining at least one first current interaction event directory of current interaction events that need to be processed, a data processing system collects at least one first current interaction event directory of current interaction events that need to be processed.

[0046] In yet another implementation of acquiring at least one first current interaction event directory of current interaction events that need to be processed, a data processing system collects at least one first current interaction event directory of current interaction events that need to be processed.

[0047] 104. The electric power complementary scheduling calculation method of the current interaction event to be processed and the target current interaction event is obtained through the matching degree between the first current scheduling data and the target current scheduling data, and the projection of the at least one first current interaction event catalog and the at least one target current interaction event catalog.

[0048] In this embodiment, the projection conditions of at least one first current interaction event directory and at least one target current interaction event directory include that at least one first current interaction event directory and at least one target current interaction event directory have a projection relationship, or at least one first current interaction event directory and at least one target current interaction event directory do not have a projection relationship. The electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event, and the electric power complementary scheduling calculation method may include that the current interaction event to be processed is different from the target current interaction event.

[0049] In an independent implementation embodiment, the data processing system determines whether there is a point of connection between the first current scheduling data and the target current scheduling data according to the matching degree between the first current scheduling data and the target current scheduling data.

[0050] On the premise that it is determined that there is a point of connection between the first current scheduling data and the target current scheduling data, and the projection situation includes that at least one first current interaction event catalog and at least one target current interaction event catalog match, it is determined that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event. Otherwise, it is determined that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is different from the target current interaction event.

[0051] In a possible implementation, the data processing system determines whether there is a point of connection between the first current scheduling data and the target current scheduling data according to the matching degree between the first current scheduling data and the target current scheduling data.

[0052] On the premise that it is determined that there is a point of connection between the first current scheduling data and the target current scheduling data, it is determined that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event. On the premise that it is determined that the projection situation includes at least one first current interaction event directory and at least one target current interaction event directory match, it is determined that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event. On the premise that it is determined that there is a point of connection between the first current scheduling data and the target current scheduling data, and the projection situation includes at least one first current interaction event directory and at least one target current interaction event directory match, it is determined that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event. On the premise that it is determined that there is no point of connection between the first current scheduling data and the target current scheduling data, and the projection situation includes at least one first current interaction event directory and at least one target current interaction event directory do not match, it is determined that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event.

[0053] In this embodiment, the data processing system determines the power complementary scheduling calculation method of the target current interaction event and the current interaction event to be processed through the matching degree between the first current scheduling data and the target current scheduling data, and the projection of at least one first current interaction event directory and at least one target current interaction event directory, thereby improving the reliability of the power complementary scheduling calculation method.

[0054] In a separate implementation example, the data processing system may perform the following when executing step 104 .

[0055] 1. On the premise that the degree of match between the above-mentioned first current scheduling data and the above-mentioned target current scheduling data is greater than the first matching degree threshold, the power complementary scheduling calculation method of the above-mentioned current interaction event to be processed and the above-mentioned target current interaction event is obtained through the above-mentioned at least one first current interaction event catalog and the above-mentioned at least one target current interaction event catalog.

[0056] In this embodiment, the first matching degree threshold is a positive integer. The matching degree between the target current scheduling data and the first current scheduling data is greater than the first matching degree threshold, indicating that the current interaction event to be processed and the target current interaction event are more likely to be the same information. Therefore, it can be further determined whether the current interaction event to be processed and the target current interaction event are the same information through at least one first current interaction event directory and at least one target current interaction event directory.

[0057] In an independently implemented embodiment, the data processing system determines whether a current interaction event to be processed is the same as a target current interaction event by determining whether there is a projection relationship between at least one first current interaction event directory and at least one target current interaction event directory, thereby obtaining a power complementary scheduling calculation method for the current interaction event to be processed and the target current interaction event.

[0058] In a possible implementation, the data processing system determines the existence of a projection relationship between at least one first current interaction event directory and at least one target current interaction event directory. On the premise that the existence of the projection relationship is greater than the existence of the projection relationship threshold, it is determined that the current interaction event to be processed is the same as the target current interaction event. On the premise that the existence of the projection relationship is not greater than the existence of the projection relationship threshold, it is determined that the current interaction event to be processed is not the same as the target current interaction event.

[0059] Further, the data processing system determines that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is different from the target current interaction event, under the premise that the matching degree between the first current scheduling data and the target current scheduling data is not greater than the first matching degree threshold. That is, under the premise that the matching degree between the first current scheduling data and the target current scheduling data is determined to be not greater than the first matching degree threshold, the at least one first current interaction event catalog and the at least one target current interaction event catalog are not further compared.

[0060] In this embodiment, the data processing system, on the premise that it determines that the degree of match between the first current scheduling data and the target current scheduling data is greater than the first matching degree threshold, further determines the power complementary scheduling calculation method through at least one first current interaction event directory and at least one target current interaction event directory, thereby improving the reliability of the power complementary scheduling calculation method.

[0061] In a separate implementation embodiment, at least one first current interaction event catalog includes first current interaction attributes of current interaction events that need to be processed, and at least one target current interaction event catalog includes target current interaction attributes of target current interaction events.

[0062] On the premise that the data processing system obtains the first current interaction attributes by optimizing the current interaction attributes of the first photovoltaic energy transmission data, the data processing system obtains the target current interaction attributes of the target current interaction event, and then compares the current interaction attributes of the current interaction event to be processed with the current interaction attributes of the target current interaction event to further determine the power complementary scheduling calculation method between the current interaction event to be processed and the target current interaction event.

[0063] Therefore, the data processing system executes one of the following steps in the process of executing the step of "obtaining the electric power complementary scheduling calculation method of the above-mentioned current interaction event to be processed and the above-mentioned target current interaction event through the above-mentioned at least one first current interaction event catalog and the above-mentioned at least one target current interaction event catalog".

[0064] 2. On the premise that the first current interaction attribute matches the target current interaction attribute, determine that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event.

[0065] 3. Under the premise that the first current interaction attribute does not match the target current interaction attribute, determining that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is different from the target current interaction event.

[0066] In a separately implemented embodiment, at least one first current interaction event directory includes a first current interaction attribute of a current interaction event that needs to be processed and at least one first entire directory of current interaction events that need to be processed, and at least one target current interaction event directory includes a target current interaction attribute of the target current interaction event and at least one target entire directory of the target current interaction event.

[0067] In this embodiment, the entire catalog of current interaction events includes the catalog of current interaction events except the current interaction attributes. Further, the entire catalog includes at least one of the following: load balancing description content, current interaction event type, and current interaction event catalog. The first entire catalog is the entire catalog of current interaction events that need to be processed, and the target entire catalog is the entire catalog of target current interaction events.

[0068] Furthermore, the data processing system obtains at least one first complete directory of the current interaction event that needs to be processed by performing a complete directory selection process on the first photovoltaic energy transmission data. In this embodiment, the complete directory selection process is used to select all directories in the photovoltaic energy transmission data.

[0069] In this embodiment, the data processing system performs the following steps while executing the step of "obtaining the power complementary scheduling calculation method of the current interaction event that needs to be processed and the target current interaction event through the at least one first current interaction event catalog and the at least one target current interaction event catalog".

[0070] 4. On the premise that the above-mentioned first current interaction attribute matches the above-mentioned target current interaction attribute, the power complementary scheduling calculation method of the above-mentioned current interaction event to be processed and the above-mentioned target current interaction event is obtained through the above-mentioned at least one first full directory and the above-mentioned at least one target full directory.

[0071] In an independently implemented embodiment, the data processing system determines whether a current interaction event to be processed is the same as a target current interaction event by determining whether there is a projection relationship between at least one first entire directory and at least one target entire directory, thereby obtaining a power complementary scheduling calculation method for the current interaction event to be processed and the target current interaction event.

[0072] In a possible implementation, the data processing system determines the degree of existence of a projection relationship between at least one first entire directory and at least one target entire directory. Under the premise that the degree of existence of a projection relationship is greater than a threshold value of the degree of existence of a projection relationship, it is determined that the current interaction event to be processed is the same as the target current interaction event. Under the premise that the degree of existence of a projection relationship is not greater than the threshold value of the degree of existence of a projection relationship, it is determined that the current interaction event to be processed is different from the target current interaction event.

[0073] In this embodiment, the data processing system, on the premise of determining that the first current interaction attribute matches the target current interaction attribute, further determines the power complementary scheduling calculation method through at least one first full directory and at least one target full directory, thereby improving the reliability of the power complementary scheduling calculation method.

[0074] Furthermore, the data processing system performs a full catalog selection process on the first photovoltaic energy transmission data to obtain at least one first full catalog, under the premise of determining that the first current interaction attribute matches the target current interaction attribute. After obtaining at least one first full catalog, the data processing system obtains a power complementary scheduling calculation method for the current interaction event to be processed and the above-mentioned target current interaction event through at least one first full catalog and at least one target full catalog. The data processing system does not perform the step of performing a full catalog selection process on the first photovoltaic energy transmission data, under the premise of determining that the first current interaction attribute does not match the target current interaction attribute.

[0075] In a separately implemented embodiment, at least one target current interaction event directory includes at least one target full directory of target current interaction events. After determining that the matching degree between the first current scheduling data and the target current scheduling data is greater than a first matching degree threshold, the data processing system obtains at least one current interaction event directory of the current interaction event to be processed by performing the following steps.

[0076] 5. Under the premise that the first current interaction attribute of the current interaction event to be processed is not parsed, all directory selection processing is performed on the first photovoltaic energy transmission data to obtain at least one first all directory of the current interaction event to be processed.

[0077] If the first current interaction attribute of the current interaction event to be processed is not obtained by performing directory optimization processing on the first photovoltaic energy transmission data, it is impossible to determine whether the current interaction event to be processed and the target current interaction event are the same information by comparing the current interaction attributes of the current interaction event to be processed with the current interaction attributes of the target current interaction event.

[0078] Therefore, under this premise, the data processing system performs all-directory selection processing on the first photovoltaic energy transmission data to obtain at least one first complete directory of current interaction events that need to be processed, so as to determine whether the current interaction events that need to be processed and the target current interaction events are the same information by comparing the complete directory of current interaction events that need to be processed with the complete directory of target current interaction events, thereby improving the reliability of the power complementary scheduling calculation method.

[0079] After executing step 5, the data processing system executes the following steps in the process of executing the step of "obtaining the power complementary scheduling calculation method of the above-mentioned current interaction events that need to be processed and the above-mentioned target current interaction events through the above-mentioned at least one first current interaction event directory and the above-mentioned at least one target current interaction event directory".

[0080] 6. Obtain a power complementary scheduling calculation method for a current interaction event to be processed and a target current interaction event through at least one first full catalog and at least one target full catalog.

[0081] In this embodiment, the data processing system further determines that the current interaction event to be processed is the same as the target current interaction event through the entire directory of current interaction events to be processed and the entire directory of target current interaction events, under the premise that there is a connection point between the current scheduling data of the current interaction event to be processed and the current scheduling data of the target current interaction event, and the first current interaction attribute has not been parsed, thereby improving the reliability of the power complementary scheduling calculation method.

[0082] In a separately implemented embodiment, the data processing system performs the following steps while executing the step of "obtaining a power complementary scheduling calculation method for current interaction events that need to be processed and target current interaction events through at least one first full directory and at least one target full directory".

[0083] 7. Determine whether there is a projection relationship between the at least one first complete directory and the at least one target complete directory, and obtain a first projection situation.

[0084] In this embodiment, the first projection situation includes that at least one first entire directory and at least one target entire directory have a projection relationship, or at least one first entire directory and at least one target entire directory do not have a projection relationship.

[0085] In an independently implemented embodiment, a data processing system obtains at least one related all-directory tuple through at least one first all-directory and at least one target all-directory, wherein each related all-directory tuple includes a first all-directory and a target all-directory, and the first all-directory in the related all-directory tuple and the target all-directory in the related all-directory tuple represent the same all-directory.

[0086] For example, at least one first complete directory includes the load balancing description content of the current interaction event that needs to be processed and the current interaction event type of the current interaction event that needs to be processed, and at least one target complete directory includes the load balancing description content of the target current interaction event and the current interaction event directory of the target current interaction event. At this time, the related complete directory tuple includes the load balancing description content of the target current interaction event and the load balancing description content of the current interaction event that needs to be processed.

[0087] The data processing system determines that the first projection situation includes at least one first all directory and at least one target all directory having a projection relationship, provided that the two all directories in each of the related all directory tuples are the same. Otherwise, the data processing system determines that the first projection situation includes at least one first all directory and at least one target all directory having no projection relationship.

[0088] For example, there are related all-directory tuples x and related all-directory tuples y in at least one first all-directory and at least one target all-directory, wherein the related all-directory tuple x includes the load balancing description content of the target current interaction event and the load balancing description content of the current interaction event that needs to be processed, and the related all-directory tuple y includes the current interaction event type of the target current interaction event and the current interaction event type of the current interaction event that needs to be processed.

[0089] If the load balancing description content of the target current interaction event is the same as the load balancing description content of the current interaction event that needs to be processed, and the current interaction event type of the target current interaction event is the same as the current interaction event type of the current interaction event that needs to be processed, then the first projection situation includes a projection relationship between at least one first entire directory and at least one target entire directory.

[0090] If the load balancing description content of the target current interaction event is different from the load balancing description content of the current interaction event to be processed, then the first projection situation includes that at least one first entire directory and at least one target entire directory do not have a projection relationship. If the current interaction event type of the target current interaction event is different from the current interaction event type of the current interaction event to be processed, then the first projection situation includes that at least one first entire directory and at least one target entire directory do not have a projection relationship.

[0091] After obtaining the first projection situation, the data processing system determines the power complementary scheduling calculation method by executing one of the following steps.

[0092] 8. On the premise that the first projection situation includes that the at least one first complete catalog and the at least one target complete catalog match, determine that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event.

[0093] In this embodiment, the first projection situation includes that at least one first entire directory has a projection relationship with at least one target entire directory, indicating that the entire directory of the current interaction event to be processed has a projection relationship with the entire directory of the target current interaction event. Therefore, the data processing system determines that the current interaction event to be processed is the same as the target current interaction event.

[0094] 9. Under the premise that the first projection situation includes that the at least one first complete directory and the at least one target complete directory do not match, determine that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is different from the target current interaction event.

[0095] In this embodiment, the first projection situation includes that at least one first entire directory and at least one target entire directory do not have a projection relationship, indicating that the entire directory of the current interaction event to be processed does not have a projection relationship with the entire directory of the target current interaction event. Therefore, the data processing system determines that the current interaction event to be processed is different from the target current interaction event.

[0096] In a separately implemented embodiment, at least one first all directory and at least one target all directory both include scheduling calculation results. For example, at least one first all directory includes load balancing description content of current interaction events that need to be processed and current interaction event types of current interaction events that need to be processed. At least one first all directory includes a scheduling calculation result set, and the load balancing description content of the current interaction event that needs to be processed has scheduling calculation results, and the current interaction event types of the current interaction event that needs to be processed also have scheduling calculation results.

[0097] At least one target full directory includes a load balancing description content of a target current interaction event and a current interaction event directory of the target current interaction event. At least one target full directory includes a scheduling calculation result set, the load balancing description content of the target current interaction event has a scheduling calculation result, and the current interaction event directory of the target current interaction event also has a scheduling calculation result.

[0098] In this embodiment, the data processing system may further perform the following steps before performing step 7.

[0099] 10. Obtain a second matching degree threshold, where the second matching degree threshold is greater than the first matching degree threshold.

[0100] In an implementation manner of obtaining the second matching degree threshold, the data processing system collects the second matching degree threshold.

[0101] In another implementation of obtaining the second matching degree threshold, the data processing system collects the second matching degree threshold.

[0102] After executing step 10, the data processing system executes one of the following steps during the execution of step 7.

[0103] 11. On the premise that the degree of match between the first current scheduling data and the target current scheduling data is greater than the second matching degree threshold, and the at least one first complete directory and the at least one target complete directory satisfy the first projection relationship condition or the second projection relationship condition, determine that the first projection situation includes the existence of a projection relationship between the at least one first complete directory and the at least one target complete directory.

[0104] 12. Under the premise that the degree of match between the first current scheduling data and the target current scheduling data is greater than the second matching degree threshold, and the at least one first complete directory and the at least one target complete directory do not satisfy the first projection relationship condition and the second projection relationship condition, it is determined that the first projection situation includes that the at least one first complete directory and the at least one target complete directory do not have a projection relationship.

[0105] If two all directories representing the same all directory in at least one first all directory and at least one target all directory are considered to be related all directory tuples, the related all directory tuples whose scheduling calculation results of the two covered all directories are both greater than the scheduling calculation result threshold are taken as the related all directory tuples with optimized scheduling calculation results, wherein the scheduling calculation result threshold is a positive integer.

[0106] For example, at least one first complete directory includes the load balancing description content of the current interaction event that needs to be processed and the current interaction event type of the current interaction event that needs to be processed, and at least one target complete directory includes the load balancing description content of the target current interaction event and the current interaction event directory of the target current interaction event. At this time, the load balancing description content of the current interaction event that needs to be processed and the load balancing description content of the target current interaction event both represent the complete directory of the load balancing description content, that is, the associated complete directory tuple includes the load balancing description content of the current interaction event that needs to be processed and the load balancing description content of the target current interaction event.

[0107] If the scheduling calculation result of the load balance description content of the current interaction event that needs to be processed is greater than the scheduling calculation result threshold, and the scheduling calculation result of the load balance description content of the target current interaction event is greater than the scheduling calculation result threshold, then the load balance description content of the current interaction event that needs to be processed and the load balance description content of the target current interaction event are all directory tuples that are related to the optimized scheduling calculation results.

[0108] In this embodiment, the first projection relationship condition includes: there is no all-directory that represents the same all-directory and the scheduling calculation result is greater than the scheduling calculation result threshold in at least one first all-directory and at least one target all-directory. That is, the first projection relationship condition includes: there is no all-directory tuple that is related to the optimization scheduling calculation result in at least one first all-directory and at least one target all-directory. For example, at least one first all-directory includes the load balancing description content of the current interaction event that needs to be processed and the current interaction event type of the current interaction event that needs to be processed, and at least one target all-directory includes the current interaction event directory of the target current interaction event. At this time, there is no all-directory tuple that is related to the at least one first all-directory and at least one target all-directory, then there is no all-directory tuple that is related to the optimization scheduling calculation result in at least one first all-directory and at least one target all-directory. At this time, at least one first all-directory and at least one target all-directory meet the first projection relationship condition. For another example, at least one first all-directory includes the load balancing description content of the current interaction event that needs to be processed and the current interaction event type of the current interaction event that needs to be processed, and at least one target all-directory includes the load balancing description content of the target current interaction event and the current interaction event directory of the target current interaction event. At this time, the load balancing description content of the current interaction event that needs to be processed and the load balancing description content of the target current interaction event both represent the entire directory of load balancing description content, that is, all related directory tuples include the load balancing description content of the current interaction event that needs to be processed and the load balancing description content of the target current interaction event.

[0109] If the scheduling calculation result of the load balance description content of the current interaction event to be processed is greater than the scheduling calculation result threshold, and the scheduling calculation result of the load balance description content of the target current interaction event is less than the scheduling calculation result threshold, then there is no all-directory tuple in which the optimized scheduling calculation result is related in at least one all-directory and at least one target all-directory. Therefore, at least one first all-directory and at least one target all-directory meet the first projection relationship condition.

[0110] In this embodiment, the second projection relationship condition includes: the second all directory in at least one first all directory is the same as the third all directory in at least one target all directory, the second all directory and the third all directory represent the same all directory, and the scheduling calculation result of the second all directory and the scheduling calculation result of the third all directory are both greater than the scheduling calculation result threshold.

[0111] In the second projection relationship condition, the second all-directory belongs to at least one first all-directory, the third all-directory belongs to at least one target all-directory, and the second all-directory is the same as the third all-directory, that is, the second all-directory and the third all-directory are the above-mentioned all-directory binary tuples that are in contact. The scheduling calculation result of the second all-directory and the scheduling calculation result of the third all-directory are both greater than the scheduling calculation result threshold, that is, the second all-directory and the second and third all-directories are all-directory binary tuples that are in contact with the above-mentioned optimized scheduling calculation results.

[0112] It should be understood that the second all directories and the third all directories are only examples, and it is not necessary to understand that there is only one directory pair in which the optimization scheduling calculation result is connected in at least one first all directory and at least one target all directory. In practical applications, the two directories in the all directory tuple in which any one of the optimization scheduling calculation results in at least one first all directory and at least one target all directory are connected should be the same. For example, at least one first all directory includes the load balancing description content of the current interaction event that needs to be processed and the current interaction event type of the current interaction event that needs to be processed, and at least one target all directory includes the load balancing description content of the target current interaction event and the current interaction event type of the target current interaction event. At this time, the load balancing description content of the current interaction event that needs to be processed and the load balancing description content of the target current interaction event both represent the entire directory of load balancing description contents, and the current interaction event type of the current interaction event that needs to be processed and the current interaction event type of the target current interaction event both represent the entire directory of current interaction event types, that is, the connected all-directory tuples include the connected all-directory tuple x and the connected all-directory tuple y, wherein the connected all-directory tuple x includes the load balancing description content of the current interaction event that needs to be processed and the load balancing description content of the target current interaction event, and the connected all-directory tuple y includes the current interaction event type of the current interaction event that needs to be processed and the current interaction event type of the target current interaction event.

[0113] If the scheduling calculation result of the load balancing description content of the current interaction event that needs to be processed, the scheduling calculation result of the current interaction event type of the current interaction event that needs to be processed, the scheduling calculation result of the load balancing description content of the target current interaction event and the scheduling calculation result of the current interaction event type of the target current interaction event are all greater than the scheduling calculation result threshold, then all the related directory tuples x and all the related directory tuples y are all the related directory tuples of the optimized scheduling calculation results.

[0114] On the premise that the two directories in the connected all-directory binary tuple x are the same, and the two directories in the connected all-directory binary tuple y are the same, it is determined that at least one first all-directory and at least one target all-directory satisfy the second projection relationship condition, otherwise, it is determined that at least one first all-directory and at least one target all-directory do not satisfy the second projection relationship condition. Among them, the two directories in the connected all-directory binary tuple x are the same, which means that the load balancing description content of the first current interaction event and the load balancing description content of the second current interaction event are the same, and the two directories in the connected all-directory binary tuple y are the same, which means that the current interaction event type of the first current interaction event and the current interaction event type of the second current interaction event are the same.

[0115] In this embodiment, the scheduling calculation result threshold is used to determine whether the scheduling calculation results of all directories are good or bad. Specifically, if the scheduling calculation results of all directories are greater than the scheduling calculation result threshold, it means that the scheduling calculation results of all directories are good; if the scheduling calculation results of all directories are not greater than the scheduling calculation result threshold, it means that the scheduling calculation results of all directories are bad.

[0116] Under the premise that the scheduling calculation results of all directories are good, using all directories to update current interaction events can improve the update reliability. Under the premise that the scheduling calculation results of all directories are bad, using all directories to update current interaction events may cause anomalies. Therefore, it can be determined whether there is a projection relationship between at least one first all directory and at least one target all directory through all directories whose scheduling calculation results are greater than the scheduling calculation result threshold in at least one first all directory and all directories whose scheduling calculation results are greater than the scheduling calculation result threshold in at least one target all directory.

[0117] If there is no all-directory tuple with which the optimization scheduling calculation result is related in at least one first all-directory and at least one target all-directory, it may be abnormal to determine whether there is a projection relationship between at least one first all-directory and at least one target all-directory. Since there is no projection relationship between at least one first all-directory and at least one target all-directory, the current interaction event to be processed and the target current interaction event will be updated to different current interaction events, and the matching degree between the first current scheduling data and the target current scheduling data is greater than the second matching degree threshold, and the possibility of the current interaction event to be processed and the target current interaction event being the same is greater than that of the target current interaction event. Therefore, under the premise that there is no all-directory tuple with which the optimization scheduling calculation result is related in at least one first all-directory and at least one target all-directory, it is determined that there is a projection relationship between at least one first all-directory and at least one target all-directory. In this way, the data processing system determines that the first projection situation includes the existence of a projection relationship between at least one first all-directory and at least one target all-directory, under the premise that at least one first all-directory and at least one target all-directory meet the first projection relationship condition, so as to weaken the possibility of abnormality of the first projection situation, and further weaken the possibility of abnormality of the current interaction event to be processed.

[0118] If there is a two-tuple of all directories in which the optimized scheduling calculation results are connected in at least one first all directory and at least one target all directory, then the two-tuple of all directories in which the optimized scheduling calculation results are connected can be used to determine whether there is a projection relationship between at least one all directory and at least one target all directory. In an independently implemented embodiment, the two all directories in the two-tuple of all directories in which the optimized scheduling calculation results are connected are the same, indicating that the all directories in at least one first all directory and the all directories in at least one target all directory do not conflict, and then it can be determined that there is a projection relationship between all directories in at least one first all directory and all directories in at least one target all directory. In this way, the data processing system determines that the first projection situation includes the existence of a projection relationship between at least one first all directory and at least one target all directory, on the premise that at least one first all directory and at least one target all directory meet the second projection relationship condition, which can improve the reliability of the first projection situation, and then improve the abnormal possibility of the current interaction event that needs to be processed.

[0119] On the contrary, on the premise that it is determined that at least one first complete directory and at least one target complete directory do not satisfy the first projection relationship condition, and at least one first complete directory and at least one target complete directory do not satisfy the second projection relationship condition, it is determined that the first projection situation includes that there is no projection relationship between at least one first complete directory and at least one target complete directory.

[0120] In a separate implementation embodiment, the data processing system further executes the following contents under the premise that the matching degree between the first current scheduling data and the target current scheduling data is not greater than a second matching degree threshold.

[0121] 13. Under the premise that there is no all directory representing the same all directory between the at least one first all directory and the at least one target all directory, and the scheduling calculation result is greater than the scheduling calculation result threshold, determining that the first projection situation includes that there is no projection relationship between the at least one first all directory and the at least one target all directory; In this embodiment, there is no all-directory representing the same all-directory and the scheduling calculation result is greater than the scheduling calculation result threshold in at least one first all-directory and at least one target all-directory, that is, there is no all-directory in which the optimized scheduling calculation result is connected in at least one first all-directory and at least one target all-directory. At this time, it may be abnormal to determine whether there is a projection relationship between at least one first all-directory and at least one target all-directory. Since there is a projection relationship between at least one first all-directory and at least one target all-directory, the current interaction event to be processed and the target current interaction event will be updated to the same current interaction event, and the matching degree between the first current scheduling data and the target current scheduling data is not greater than the second matching degree threshold, indicating that the possibility of the current interaction event to be processed and the target current interaction event being the same is smaller than the possibility of the matching degree between the first current scheduling data and the target current scheduling data being greater than the second matching degree threshold. Therefore, under the premise that there is no all-directory tuple in which the optimized scheduling calculation result is connected in at least one first all-directory and at least one target all-directory, it is determined that there is no projection relationship between at least one first all-directory and at least one target all-directory. In this way, the possibility of abnormality of the current interaction event to be processed can be weakened.

[0122] If there are all directories in at least one first all directory and at least one target all directory that are related to the optimization scheduling calculation results, then step 14 is executed.

[0123] 14. Determine whether there is a projection relationship between the fourth all directory in the at least one first all directory and the fifth all directory in the at least one target all directory, and obtain a second projection situation. The scheduling calculation result of the fourth all directory and the scheduling calculation result of the fifth all directory are both greater than the scheduling calculation result threshold, and the fourth all directory and the fifth all directory represent the same all directory.

[0124] In this embodiment, the fourth all-directory belongs to at least one first all-directory, the fifth all-directory belongs to at least one target all-directory, and the fourth all-directory is the same as the fifth all-directory, that is, the fourth all-directory and the fifth all-directory are the above-mentioned all-directory binary groups that are in contact. The scheduling calculation result of the fourth all-directory and the scheduling calculation result of the fifth all-directory are both greater than the scheduling calculation result threshold, that is, the fourth all-directory and the fifth all-directory are all-directory binary groups that are in contact with the above-mentioned optimized scheduling calculation results. According to the above, if at least one first all-directory and at least one target all-directory have all-directory binary groups that are in contact with the optimized scheduling calculation results, then the all-directory binary groups that are in contact with the optimized scheduling calculation results can be used to determine whether at least one all-directory and at least one target all-directory have a projection relationship. Therefore, the data processing system can determine whether at least one all-directory and at least one target all-directory have a projection relationship through the second projection situation. Specifically, after obtaining the second projection situation, the data processing system determines whether at least one all-directory and at least one target all-directory have a projection relationship by executing step 15 or step 16.

[0125] 15. On the premise that the second projection situation includes that the fourth entire directory matches the fifth entire directory, determine that the first projection situation includes that the at least one first entire directory has a projection relationship with the at least one target entire directory.

[0126] 16. On the premise that the second projection situation includes that the fourth entire directory and the fifth entire directory do not match, determine that the first projection situation includes that the at least one first entire directory and the at least one target entire directory do not have a projection relationship.

[0127] It should be understood that the fourth all-directory and the fifth all-directory are only examples, and it is not necessary to understand that there is only one all-directory tuple in which the optimization scheduling calculation result is related in at least one first all-directory and at least one target all-directory. In practical applications, if there is at least one all-directory tuple in which the optimization scheduling calculation result is related in at least one first all-directory and at least one target all-directory, the data processing system can respectively determine the second projection situation of each all-directory tuple in which the optimization scheduling calculation result is related. On the premise that all second projection situations include the matching of two all-directories in all-directories in which the optimization scheduling calculation result is related, it is determined that the first projection situation includes at least one first all-directory and at least one target all-directory have a projection relationship, otherwise, it is determined that the first projection situation includes at least one first all-directory and at least one target all-directory do not have a projection relationship. For example, at least one first all-directory includes the load balancing description content of the current interaction event to be processed and the current interaction event type of the current interaction event to be processed, and at least one target all-directory includes the load balancing description content of the target current interaction event and the current interaction event type of the target current interaction event. At this time, the load balancing description content of the current interaction event that needs to be processed and the load balancing description content of the target current interaction event both represent the entire directory of load balancing description contents, and the current interaction event type of the current interaction event that needs to be processed and the current interaction event type of the target current interaction event both represent the entire directory of current interaction event types, that is, the connected all-directory tuples include the connected all-directory tuple x and the connected all-directory tuple y, wherein the connected all-directory tuple x includes the load balancing description content of the current interaction event that needs to be processed and the load balancing description content of the target current interaction event, and the connected all-directory tuple y includes the current interaction event type of the current interaction event that needs to be processed and the current interaction event type of the target current interaction event.

[0128] If the scheduling calculation result of the load balancing description content of the current interaction event that needs to be processed, the scheduling calculation result of the current interaction event type of the current interaction event that needs to be processed, the scheduling calculation result of the load balancing description content of the target current interaction event and the scheduling calculation result of the current interaction event type of the target current interaction event are all greater than the scheduling calculation result threshold, then all the related directory tuples x and all the related directory tuples y are all the related directory tuples of the optimized scheduling calculation results.

[0129] The data processing system obtains the second projection situation X of all directory tuples x that are related to the optimized scheduling calculation results by determining whether there is a projection relationship between the load balance description content of the current interaction event that needs to be processed and the load balance description content of the target current interaction event. The data processing system obtains the second projection situation Y of all directory tuples y that are related to the optimized scheduling calculation results by determining whether there is a projection relationship between the current interaction event type of the current interaction event that needs to be processed and the current interaction event type of the target current interaction event.

[0130] On the premise that the second projection situation X includes that the load balancing description content of the current interaction event that needs to be processed has a projection relationship with the load balancing description content of the target current interaction event, and the second projection situation Y includes that the current interaction event type of the current interaction event that needs to be processed matches the current interaction event type of the target current interaction event, it is determined that the first projection situation includes that at least one first entire directory and at least one target entire directory have a projection relationship; otherwise, it is determined that the first projection situation includes that at least one first entire directory and at least one target entire directory do not have a projection relationship.

[0131] In a separate implementation embodiment, the data processing system performs one of the following steps during the execution of step 14 .

[0132] 17. On the premise that the fourth complete catalog is the same as the fifth complete catalog, determining the second projection situation includes that there is a projection relationship between the fourth complete catalog and the fifth complete catalog.

[0133] 18. On the premise that the fourth entire catalogue and the fifth entire catalogue are different, determining the second projection situation includes that there is no projection relationship between the fourth entire catalogue and the fifth entire catalogue.

[0134] In step 17 and step 18, the data processing system determines whether the fourth all-directory and the fifth all-directory are in a projection relationship by determining whether the fourth all-directory and the fifth all-directory are the same. That is, the data processing system determines whether the two all-directories in the directory pair with a connection in the optimization scheduling calculation results are in a projection relationship by determining whether the two all-directories in the directory pair with a connection in the optimization scheduling calculation results are the same.

[0135] In a separate implementation example, the data processing system performs one of the following steps during the execution of step 14 .

[0136] 19. On the premise that the fourth entire directory and the fifth entire directory respectively represent the first load balancing description content and the second load balancing description content, there is a projection relationship between the load balancing description contents of the first load balancing description content and the second load balancing description content.

[0137] It is known in the prior art that the collection conditions when collecting photovoltaic energy transmission data may interfere with the accuracy of the photovoltaic energy transmission data, and at least one first complete directory is obtained by performing complete directory selection processing on the first photovoltaic energy transmission data, that is, the load balance description content of the first current interaction event is obtained by performing complete directory selection processing on the first photovoltaic energy transmission data. Then, under the premise that the collection conditions when collecting the first photovoltaic energy transmission data are poor, the load balance description content in the first photovoltaic energy transmission data may be unreliable, thereby resulting in low reliability of the fourth complete directory obtained by performing complete directory selection processing on the first photovoltaic energy transmission data, thereby resulting in abnormal judgment on whether the fourth complete directory and the fifth complete directory match.

[0138] In this embodiment, the load balancing description contents of the first load balancing description content and the second load balancing description content have a projection relationship for correcting the abnormal judgment on whether the fourth entire directory and the fifth entire directory match due to poor collection conditions.

[0139] In an implementation method of obtaining a projection relationship between load balancing description contents, the load balancing description contents collected by the data processing system have a projection relationship.

[0140] In another implementation manner of obtaining the load balancing description content having a projection relationship, a data processing system loads the load balancing description content having a projection relationship.

[0141] After obtaining the load balancing description content and determining whether there is a projection relationship, the data processing system may determine whether there is a projection relationship between the fourth entire directory and the fifth entire directory by executing one of the following steps.

[0142] 20. On the premise that it is determined that the first load balancing description content all directories and the second load balancing description content all directories do not match each other through the projection relationship between the load balancing description content, it is determined that the second projection situation includes that the fourth all directories and the fifth all directories do not have a projection relationship.

[0143] 21. On the premise that the load balancing description content has a projection relationship and determines that all directories of the first load balancing description content match all directories of the second load balancing description content, determine that the second projection situation includes that the fourth all directories have a projection relationship with the fifth all directories.

[0144] Under the premise that both the fourth all directory and the fifth all directory represent load balancing description contents, the data processing system determines whether there is a projection relationship between the fourth all directory and the fifth all directory through the projection relationship between the load balancing description contents to obtain a second projection situation, thereby improving the reliability of the second projection situation.

[0145] In a separate implementation example, the data processing system performs the following steps during the execution of step 104 .

[0146] 22. On the premise that at least one of the above-mentioned first current interaction event catalogues matches at least one of the above-mentioned target current interaction event catalogues, the power complementary scheduling calculation method of the above-mentioned current interaction event to be processed and the above-mentioned target current interaction event is obtained through the matching degree between the above-mentioned first current scheduling data and the above-mentioned target current scheduling data.

[0147] In step 22, the data processing system first determines whether there is a projection relationship between at least one first current interaction event directory and at least one target current interaction event directory. On the premise that at least one first current interaction event directory matches at least one target current interaction event directory, it is determined whether the current scheduling data of the current interaction event to be processed and the current scheduling data of the target current interaction event are the same, and then the power complementary scheduling calculation method is obtained. Specifically, the power complementary scheduling calculation method of the current interaction event to be processed and the target current interaction event is obtained through the matching degree between the first current scheduling data and the target current scheduling data.

[0148] In an independently implemented embodiment, the data processing system determines that the power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event, under the premise that the degree of match between the first current scheduling data and the target current scheduling data is greater than the first matching degree threshold; the data processing system determines that the power complementary scheduling calculation method includes that the current interaction event to be processed is different from the target current interaction event, under the premise that the degree of match between the first current scheduling data and the target current scheduling data is not greater than the first matching degree threshold.

[0149] In this embodiment, the data processing system, on the premise of determining that at least one first current interaction event directory and at least one target current interaction event directory match, further determines the power complementary scheduling calculation method based on the matching degree between the first current scheduling data and the target current scheduling data, thereby improving the reliability of the power complementary scheduling calculation method.

[0150] Under the above premise, please refer to Figure 2 , a photovoltaic energy system electric power complementary scheduling calculation device 200 is provided, which is applied to an e-commerce data processing system, and the device includes: The content acquisition module 210 is used to acquire first photovoltaic energy transmission data, target current scheduling data of a target current interaction event, and at least one target current interaction event directory of the target current interaction event, wherein the first photovoltaic energy transmission data includes a current interaction event that needs to be processed; perform important data parsing processing on the first photovoltaic energy transmission data to obtain first current scheduling data of the current interaction event that needs to be processed; The calculation method determination module 220 is used to obtain at least one first current interaction event catalog of the current interaction event that needs to be processed; through the matching degree between the first current scheduling data and the target current scheduling data, and the projection of the at least one first current interaction event catalog and the at least one target current interaction event catalog, the power complementary scheduling calculation method of the current interaction event that needs to be processed and the target current interaction event is obtained.

[0151] Under the above premise, please refer to Figure 3 , shows a photovoltaic energy system electric power complementary scheduling calculation system 300, including a processor 310 and a memory 320 that communicate with each other, and the processor 310 is used to read and execute a computer program from the memory 320 to implement the above method.

[0152] Under the above premise, a computer-readable storage medium is also provided, on which a computer program stored implements the above method when running.

[0153] In summary, based on the above scheme, the first photovoltaic energy transmission data, the target current scheduling data of the target current interaction event, and at least one target current interaction event directory of the target current interaction event are obtained. The first photovoltaic energy transmission data is subjected to important data parsing processing to obtain the first current scheduling data of the current interaction event that needs to be processed. At least one first current interaction event directory of the current interaction event that needs to be processed is obtained. Through the matching degree between the first current scheduling data and the target current scheduling data, and the projection of at least one first current interaction event directory and at least one target current interaction event directory, the electric power complementary scheduling calculation method of the current interaction event that needs to be processed and the target current interaction event is obtained. The electric power complementary scheduling calculation method can be accurately determined, so that the complementary scheduling result can be accurately determined.

[0154] It should be understood that the system and its modules shown above can be implemented in various ways. For example, in some embodiments, the system and its modules can be implemented by hardware, software, or a combination of software and hardware. Among them, the hardware part can be implemented using dedicated logic; the software part can be stored in a memory and executed by an appropriate instruction execution system, such as a microprocessor or a dedicated design hardware. Those skilled in the art will understand that the above methods and systems can be implemented using computer executable instructions and / or included in a processor control code, such as a carrier medium such as a disk, CD or DVD-ROM, a programmable memory such as a read-only memory (firmware), or a data carrier such as an optical or electronic signal carrier. Such code is provided on the carrier medium such as a disk, CD or DVD-ROM, a programmable memory such as a read-only memory (firmware), or a data carrier such as an optical or electronic signal carrier. The system and its modules of the present application can not only be implemented by hardware circuits such as ultra-large-scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., but can also be implemented by software such as executed by various types of processors, and can also be implemented by a combination of the above hardware circuits and software (e.g., firmware).

[0155] It should be noted that different embodiments may produce different beneficial effects. In different embodiments, the beneficial effects that may be produced may be any one or a combination of the above, or may be any other beneficial effects that may be obtained.

[0156] The basic concepts have been described above. Obviously, for those skilled in the art, the above detailed disclosure is only for example and does not constitute a limitation of the present application. Although not explicitly stated herein, those skilled in the art may make various modifications, improvements and amendments to the present application. Such modifications, improvements and amendments are suggested in the present application, so such modifications, improvements and amendments still belong to the spirit and scope of the exemplary embodiments of the present application.

[0157] At the same time, the present application uses specific words to describe the embodiments of the present application. For example, "one embodiment", "an embodiment", and / or "some embodiments" refer to a certain feature, structure or characteristic related to at least one embodiment of the present application. Therefore, it should be emphasized and noted that "one embodiment" or "an embodiment" or "an alternative embodiment" mentioned twice or more in different positions in this specification does not necessarily refer to the same embodiment. In addition, some features, structures or characteristics in one or more embodiments of the present application can be appropriately combined.

[0158] In addition, it will be appreciated by those skilled in the art that various aspects of the present application may be illustrated and described by a number of patentable categories or situations, including any new and useful process, machine, product or combination of substances, or any new and useful improvements thereto. Accordingly, various aspects of the present application may be performed entirely by hardware, entirely by software (including firmware, resident software, microcode, etc.), or by a combination of hardware and software. The above hardware or software may all be referred to as "data blocks", "modules", "engines", "units", "components" or "systems". In addition, various aspects of the present application may be represented as a computer product located in one or more computer-readable media, which includes computer-readable program code.

[0159] A computer storage medium may include a propagated data signal containing computer program code, for example, in baseband or as part of a carrier wave. The propagated signal may be in a variety of forms, including electromagnetic, optical, etc., or a suitable combination. A computer storage medium may be any computer-readable medium other than a computer-readable storage medium, which can be connected to an instruction execution system, device or apparatus to communicate, propagate or transmit the program for use. The program code on the computer storage medium may be transmitted via any suitable medium, including radio, cable, fiber optic cable, RF, or similar media, or any combination of the above media.

[0160] The computer program codes required for the operation of each part of the present application can be written in any one or more programming languages, including object-oriented programming languages ​​such as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C++, C#, VB.NET, Python, etc., conventional procedural programming languages ​​such as C language, Visual Basic, Fortran 2003, Perl, COBOL 2002, PHP, ABAP, dynamic programming languages ​​such as Python, Ruby and Groovy, or other programming languages, etc. The program code can be run entirely on the user's computer, or run on the user's computer as an independent software package, or run partially on the user's computer and partially on a remote computer, or run entirely on a remote computer or server. In the latter case, the remote computer can be connected to the user's computer through any network form, such as a local area network (LAN) or a wide area network (WAN), or connected to an external computer (e.g., via the Internet), or in a cloud computing environment, or used as a service such as software as a service (SaaS).

[0161] In addition, unless explicitly stated in the claims, the order of the processing elements and sequences described in this application, the use of alphanumeric characters, or the use of other names are not intended to limit the order of the processes and methods of this application. Although the above disclosure discusses some invention embodiments that are currently considered useful through various examples, it should be understood that such details are only for illustrative purposes, and the attached claims are not limited to the disclosed embodiments. On the contrary, the claims are intended to cover all modifications and equivalent combinations that meet the essence and scope of the embodiments of this application. For example, although the system components described above can be implemented by hardware devices, they can also be implemented only by software solutions, such as installing the described system on an existing server or mobile device.

[0162] Similarly, it should be noted that in order to simplify the description of the disclosure of this application and thus help understand one or more embodiments of the invention, in the above description of the embodiments of this application, multiple features are sometimes combined into one embodiment, figure or description thereof. However, this disclosure method does not mean that the features required by the object of this application are more than the features mentioned in the claims. In fact, the features of the embodiments are less than all the features of the single embodiment disclosed above.

[0163] In some embodiments, numbers describing the number of components and attributes are used. It should be understood that such numbers used for the description of the embodiments are modified by the modifiers "about", "approximately" or "substantially" in some examples. Unless otherwise specified, "about", "approximately" or "substantially" indicate that the numbers allow adaptive changes. Accordingly, in some embodiments, the numerical parameters used in the specification and claims are approximate values, which can be changed according to the required characteristics of individual embodiments. In some embodiments, the numerical parameters should take into account the specified significant digits and adopt the general method of retaining the digits. Although the numerical domains and parameters used to confirm the breadth of the range in some embodiments of the present application are approximate values, in specific embodiments, the setting of such numerical values ​​is as accurate as possible within the feasible range.

[0164] Each patent, patent application, patent application disclosure, and other materials, such as articles, books, instructions, publications, documents, etc., cited in this application are hereby incorporated into this application in their entirety as a target. Application history documents that are inconsistent with or conflicting with the content of this application are excluded, as are documents that limit the broadest scope of the claims of this application (currently or later attached to this application). It should be noted that if the descriptions, definitions, and / or use of terms in the attached materials of this application are inconsistent with or conflicting with the content described in this application, the descriptions, definitions, and / or use of terms in this application shall prevail.

[0165] Finally, it should be understood that the embodiments described in this application are only used to illustrate the principles of the embodiments of the present application. Other variations may also fall within the scope of the present application. Therefore, as an example and not a limitation, the alternative configurations of the embodiments of the present application may be considered to be the same as the teachings of the present application. Accordingly, the embodiments of the present application are not limited to the embodiments explicitly introduced and described in the present application.

[0166] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included within the scope of the claims of the present application.

Claims

1. A photovoltaic energy system power complementary dispatch calculation method, characterized in that: The method comprises: Acquire first photovoltaic energy transmission data, target current scheduling data of a target current interaction event, and at least one target current interaction event catalog of the target current interaction event, wherein the first photovoltaic energy transmission data includes a current interaction event that needs to be processed; perform important data parsing processing on the first photovoltaic energy transmission data to obtain first current scheduling data of the current interaction event that needs to be processed; Obtain at least one first current interaction event catalog of the current interaction event that needs to be processed; obtain the power complementary scheduling calculation method of the current interaction event that needs to be processed and the target current interaction event through the matching degree between the first current scheduling data and the target current scheduling data, and the projection of the at least one first current interaction event catalog and the at least one target current interaction event catalog.

2. The method according to claim 1, characterized in that: The method of calculating the electric power complementary scheduling of the current interaction event to be processed and the target current interaction event is obtained by the matching degree between the first current scheduling data and the target current scheduling data, and the projection of the at least one first current interaction event catalog and the at least one target current interaction event catalog, including: On the premise that the degree of match between the first current scheduling data and the target current scheduling data is greater than a first matching degree threshold, all directories are selected through at least one first current interaction event directory and at least one target current interaction event directory to obtain the power complementary scheduling calculation method of the current interaction event to be processed and the target current interaction event.

3. The method according to claim 2, characterized in that On the premise that the at least one first current interaction event catalog includes the first current interaction attribute of the current interaction event to be processed, and the at least one target current interaction event catalog includes the target current interaction attribute of the target current interaction event, the electric power complementary scheduling calculation method of obtaining the current interaction event to be processed and the target current interaction event through the at least one first current interaction event catalog and the at least one target current interaction event catalog includes: On the premise that the first current interaction attribute matches the target current interaction attribute, it is determined that the power complementary scheduling calculation method includes that the current interaction event that needs to be processed is the same as the target current interaction event; on the premise that the first current interaction attribute does not match the target current interaction attribute, it is determined that the power complementary scheduling calculation method includes that the current interaction event that needs to be processed is different from the target current interaction event.

4. The method according to claim 2, characterized in that: The at least one first current interaction event directory includes the first current interaction attribute of the current interaction event that needs to be processed and at least one first complete directory of the current interaction event that needs to be processed, and the at least one target current interaction event directory includes the target current interaction attribute of the target current interaction event and at least one target complete directory of the target current interaction event; The method for calculating the electric power complementary scheduling between the current interaction event to be processed and the target current interaction event is obtained by using the at least one first current interaction event directory and the at least one target current interaction event directory, including: on the premise that the first current interaction attribute matches the target current interaction attribute, the method for calculating the electric power complementary scheduling between the current interaction event to be processed and the target current interaction event is obtained by using the at least one first full directory and the at least one target full directory.

5. The method according to claim 2, characterized in that: The at least one target current interaction event directory includes at least one target full directory of the target current interaction event; the obtaining of at least one current interaction event directory of the current interaction event that needs to be processed after the matching degree between the first current scheduling data and the target current scheduling data is greater than a first matching degree threshold comprises: performing full directory selection processing on the first photovoltaic energy transmission data to obtain at least one first full directory of the current interaction event that needs to be processed, under the premise that the first current interaction attribute of the current interaction event that needs to be processed is not parsed; The method of obtaining a power complementary scheduling calculation method for the current interaction event to be processed and the target current interaction event through the at least one first current interaction event directory and the at least one target current interaction event directory includes: obtaining a power complementary scheduling calculation method for the current interaction event to be processed and the target current interaction event through the at least one first full directory and the at least one target full directory.

6. The method according to claim 4 or 5, characterized in that: The method of obtaining the electric power complementary scheduling calculation method of the current interaction event to be processed and the target current interaction event through the at least one first full catalog and the at least one target full catalog includes: Determine whether there is a projection relationship between the at least one first entire directory and the at least one target entire directory, and obtain a first projection situation; On the premise that the first projection situation includes that the at least one first entire catalog and the at least one target entire catalog match, determining that the electric power complementary scheduling calculation method includes that the current interaction event to be processed is the same as the target current interaction event; On the premise that the first projection situation includes that the at least one first entire catalog and the at least one target entire catalog do not match, determining that the electric power complementary scheduling calculation method includes that the current interaction event that needs to be processed is different from the target current interaction event.

7. The method according to claim 6, characterized in that The at least one first entire directory and the at least one target entire directory both include scheduling calculation results; before determining whether there is a projection relationship between the at least one first entire directory and the at least one target entire directory and obtaining the first projection situation, the method further includes: obtaining a second matching degree threshold, the second matching degree threshold being greater than the first matching degree threshold; The determining whether there is a projection relationship between the at least one first entire directory and the at least one target entire directory to obtain a first projection situation includes: determining that the first projection situation includes that the at least one first entire directory and the at least one target entire directory have a projection relationship, on the premise that the matching degree between the first current scheduling data and the target current scheduling data is greater than the second matching degree threshold, and the at least one first entire directory and the at least one target entire directory meet the first projection relationship condition or the second projection relationship condition; Under the premise that the matching degree between the first current scheduling data and the target current scheduling data is greater than the second matching degree threshold, and the at least one first entire directory and the at least one target entire directory do not satisfy the first projection relationship existence condition and the second projection relationship existence condition, determining that the first projection situation includes that the at least one first entire directory and the at least one target entire directory do not have a projection relationship; The first projection relationship condition includes: there is no all directory representing the same all directory and the scheduling calculation result is greater than the scheduling calculation result threshold value in the at least one first all directory and the at least one target all directory; The second projection relationship condition includes: the second all directory in the at least one first all directory is the same as the third all directory in the at least one target all directory, the second all directory and the third all directory represent the same all directory, and the scheduling calculation result of the second all directory and the scheduling calculation result of the third all directory are both greater than the scheduling calculation result threshold.

8. The method according to claim 7, characterized in that On the premise that the matching degree between the first current scheduling data and the target current scheduling data is not greater than the second matching degree threshold, the method further includes: On the premise that there are no all directories representing the same all directories between the at least one first all directory and the at least one target all directory and the scheduling calculation result is greater than the scheduling calculation result threshold, determining that the first projection situation includes that there is no projection relationship between the at least one first all directory and the at least one target all directory; Determine whether there is a projection relationship between the fourth all directory in the at least one first all directory and the fifth all directory in the at least one target all directory, and obtain a second projection situation, the scheduling calculation result of the fourth all directory and the scheduling calculation result of the fifth all directory are both greater than the scheduling calculation result threshold, and the fourth all directory and the fifth all directory represent the same all directory; On the premise that the second projection situation includes that the fourth entire directory matches the fifth entire directory, determining that the first projection situation includes that the at least one first entire directory has a projection relationship with the at least one target entire directory; On the premise that the second projection situation includes that the fourth entire directory and the fifth entire directory do not match, determining that the first projection situation includes that the at least one first entire directory and the at least one target entire directory do not have a projection relationship; The step of determining whether a fourth directory in the at least one first directory and a fifth directory in the at least one target directory have a projection relationship to obtain a second projection situation includes: On the premise that the fourth entire catalog and the fifth entire catalog are the same, determining that the second projection situation includes that the fourth entire catalog and the fifth entire catalog have a projection relationship; on the premise that the fourth entire catalog and the fifth entire catalog are not the same, determining that the second projection situation includes that the fourth entire catalog and the fifth entire catalog do not have a projection relationship; The step of determining whether a fourth directory in the at least one first directory and a fifth directory in the at least one target directory have a projection relationship to obtain a second projection situation includes: On the premise that the fourth entire directory and the fifth entire directory represent the first load balancing description content and the second load balancing description content respectively, the load balancing description content of obtaining the first load balancing description content and the second load balancing description content has a projection relationship; On the premise that the first load balancing description content and the second load balancing description content do not match through the existence of a projection relationship between the load balancing description content, it is determined that the second projection situation includes that there is no projection relationship between the fourth entire directory and the fifth entire directory; on the premise that the first load balancing description content and the second load balancing description content match through the existence of a projection relationship between the load balancing description content, it is determined that the second projection situation includes that there is a projection relationship between the fourth entire directory and the fifth entire directory.

9. The method according to claim 1, characterized in that: The method for calculating the electric power complementary scheduling of the current interaction event to be processed and the target current interaction event is obtained by the matching degree between the first current scheduling data and the target current scheduling data, and the projection of the at least one first current interaction event catalog and the at least one target current interaction event catalog, including: on the premise that the at least one first current interaction event catalog and the at least one target current interaction event catalog match, the method for calculating the electric power complementary scheduling of the current interaction event to be processed and the target current interaction event is obtained by the matching degree between the first current scheduling data and the target current scheduling data.

10. A photovoltaic energy system power complementary dispatching calculation system, characterized in that: It comprises a processor and a memory communicating with each other, the processor is used to call a computer program from the memory, and implement the method according to any one of claims 1 to 9 by running the computer program.

Images