Charging pile charging power dynamic distribution method, system and device and storage medium

CN118928123APending Publication Date: 2024-11-12SHAANXI GREEN ENERGY ELECTRONIC TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411007228.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-25
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

The power distribution algorithms of existing high-power charging piles are usually targeted at specific power matrix topology for specific models, resulting in increased development cycles and costs during product iteration and module scheduling, and the module utilization is not high, especially inefficiency under different power topology. .

Method used

A dynamic charging power allocation method is proposed, by determining charging priority according to the order of inserting guns and user rights, obtaining charging information, pre-allocating the charging module, using polling allocation strategy and path relationship table, adapting to the power matrix of all group charging devices Topology, realizes dynamic allocation of charging modules.

Benefits of technology

It improves the utilization rate of the charging module, meets the needs of multiple customer scenarios, improves charging efficiency, and ensures the accuracy and safety of the distribution results through verification.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118928123A_ABST
    Figure CN118928123A_ABST
Patent Text Reader

Abstract

The invention relates to the field of electric vehicle charging, in particular to a charging pile charging power dynamic distribution method, system and device and a storage medium. Comprising the following steps: S1, determining a charging priority according to a gun insertion sequence and a user permission; s2, obtaining charging information, and obtaining the number of expected charging modules according to the charging information; s3, according to the charging priority and the expected charging module number, overall module pre-distribution of the charging pile is achieved; according to the method, the path relation table of the charging modules can be generated according to the position relation of the charging modules on the machine type power topology and the position relation of the charging modules around the charging modules, and the generated path relation table can be theoretically adapted to the power matrix topology of all group charging equipment, so that the dynamic distribution of the charging power modules of any machine type is met. A priority rule mechanism is set, different scene requirements of various clients can be met, distribution is carried out according to the charging priority, and the charging efficiency can be improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of electric vehicle charging, and in particular to a method, system, device and storage medium for dynamically allocating charging power of a charging pile. Background Art

[0002] With the rapid development of my country's new energy vehicle industry, the charging industry, as its infrastructure, has also developed rapidly. In order to quickly meet the energy needs of electric vehicles and reduce the charging time, the power of charging piles is getting higher and higher, especially the group charging equipment is increasing day by day.

[0003] However, the power allocation of existing high-power charging piles is basically targeted at specific power matrix topologies of specific models, and a charging power module scheduling algorithm is developed to perform module scheduling to meet the charging power distribution when multiple guns are charging. Therefore, when the product is iterated and new products are launched, the charging power module scheduling algorithm has to be optimized according to the changes in the power matrix topology, which greatly increases the development cycle and development costs. Moreover, if the module scheduling algorithm is not smart enough, due to the limitations of the power topology, it will lead to low module utilization under certain working conditions. Therefore, there is an urgent need for an allocation algorithm to improve module utilization. Summary of the invention

[0004] In response to the problems mentioned in the prior art, the present invention proposes a method, system, device and storage medium for dynamically allocating charging power of a charging pile, with the aim of being compatible with all group charging models, satisfying the dynamic allocation and scheduling of charging power modules on different power matrix topologies, and maximizing the utilization rate.

[0005] The present invention provides a method for dynamically allocating charging power of a charging pile, comprising the following steps:

[0006] S1: Determine charging priority based on the order of plugging in and user permissions;

[0007] S2: Obtain charging information, and obtain the expected number of charging modules according to the charging information;

[0008] S3: pre-allocate the overall modules of the charging pile according to the charging priority and the expected number of charging modules;

[0009] S4: Allocate charging modules according to the dynamic power allocation strategy;

[0010] S5: Repeat step S4 until the overall module allocation of the charging pile is completed.

[0011] Preferably, the user rights include SVIP, VVIP, VIP and ordinary users.

[0012] Preferably, the specific process in step S2 is: according to the current and voltage required for charging, the power required for charging is obtained; according to the maximum power of a single module of the charging pile and the power required for charging, the expected number of charging modules is obtained.

[0013] Preferably, the specific process in step S3 is: pre-allocating the overall modules of the charging pile according to the overall module number of the charging pile, the charging priority and the expected number of charging modules according to the principle of each round of allocation.

[0014] Preferably, before performing step S4, a path relationship table of the charging modules is generated according to the position of the charging modules in the power topology of the model and the position relationship of the surrounding charging modules.

[0015] Preferably, the specific process of step S4 is: calculating the number of methods for reallocating 1 module by PDU, the number of methods for reallocating 2 modules by PDU, the number of gaps from the number of pre-allocated modules, the number of modules that can be allocated at the first level, and the number of PDUs whose number of methods for reallocating 1 module is not equal to 0, and selecting a suitable PDU according to the above data;

[0016] After the PDU is determined, the number of PDUs used as the first level of the optional module, the reuse rate of other PDU optional modules, and the number of routes that the PDU can travel in the next step are calculated according to the path relationship table, and the charging module is allocated to the PDU according to the above data;

[0017] The above process is repeated until the entire module of the charging pile is allocated.

[0018] Preferably, after step S5, the allocation result needs to be verified to determine whether the charging module is connected to multiple PDUs and whether the charging modules allocated to the PDUs are connected.

[0019] A charging pile charging power dynamic distribution system, comprising:

[0020] The priority unit determines the charging priority according to the order of plugging in and the user's authority;

[0021] An acquisition unit acquires charging information and obtains the expected number of charging modules according to the charging information;

[0022] A pre-allocation unit realizes the overall module pre-allocation of the charging pile according to the charging priority and the expected number of charging modules;

[0023] The allocation unit allocates the charging modules according to the dynamic power allocation strategy;

[0024] The execution unit repeats step S4 until the overall module allocation of the charging pile is completed.

[0025] A charging pile charging power dynamic allocation system comprises a processor and a memory, wherein the processor implements the above-mentioned charging pile charging power dynamic allocation method when executing a computer program stored in the memory.

[0026] A computer-readable storage medium is used to store a computer program, wherein when the computer program is executed by a processor, the method for dynamically allocating charging power of a charging pile as described above is implemented.

[0027] Compared with the prior art, the present invention has achieved the following technical effects:

[0028] The present invention can generate a path relationship table of charging modules according to the position of the charging modules on the power topology of the model and the position relationship of the surrounding charging modules. The generated path relationship table can theoretically adapt to the power matrix topology of all group charging devices, thereby meeting the dynamic allocation of charging power modules of any model. The priority rule mechanism set by the present invention can meet the different scenario requirements of various customers, and can improve the charging efficiency by allocating according to the charging priority.

[0029] The present invention adopts a polling allocation method, and in each polling cycle, a suitable PDU will be selected first, and then a suitable module will be selected for the PDU, which greatly improves the module utilization rate. After all modules are allocated, the present invention will verify the allocation results, thereby controlling the accuracy of the allocation results and ensuring safety. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 It is the principle diagram of the process of the present invention;

[0031] Figure 2 This is a schematic diagram of the pre-allocation process of the present invention.

[0032] Figure 3 A schematic diagram of a PDU is selected for the present invention;

[0033] Figure 4 A schematic diagram of the charging module allocated for the present invention;

[0034] Figure 5 It is a schematic diagram of the verification of the present invention;

[0035] Figure 6 This is a topological diagram of a charging pile system according to an embodiment of the present invention;

[0036] Figure 7 A charging module path relationship table of the present invention;

[0037] Figure 8 It is the overall flow chart of the present invention. DETAILED DESCRIPTION

[0038] The present invention will be further described in detail with reference to the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present invention, rather than to limit the present invention. It should also be noted that, for ease of description, only the parts related to the present invention, rather than all structures, are shown in the accompanying drawings.

[0039] In the description of the present invention, unless otherwise clearly specified and limited, the terms "connected", "connected", and "fixed" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two elements or the interaction relationship between two elements. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0040] In the description of this embodiment, the terms "upper", "lower", "right", etc., directions or positional relationships are based on the directions or positional relationships shown in the drawings, and are only for the convenience of description and simplification of operation, rather than indicating or implying that the device or element referred to must have a specific direction, be constructed and operated in a specific direction, and therefore cannot be understood as limiting the present invention. In addition, the terms "first" and "second" are only used to distinguish in the description and have no special meaning.

[0041] like Figure 1 and Figure 8 As shown, the present invention provides a method for dynamically allocating charging power of a charging pile, comprising the following steps:

[0042] S1: Determine charging priority based on the order of plugging in and user permissions;

[0043] S2: Obtain charging information, and obtain the expected number of charging modules according to the charging information;

[0044] S3: pre-allocate the overall modules of the charging pile according to the charging priority and the expected number of charging modules;

[0045] S4: Allocate charging modules according to the dynamic power allocation strategy;

[0046] S5: Repeat step S4 until the overall module allocation of the charging pile is completed.

[0047] The present invention will be further explained below with reference to the accompanying drawings and specific embodiments:

[0048] The user rights in the embodiment include SVIP, VVIP, VIP and ordinary users, wherein the specific relationship is shown in the following Table 1:

[0049] Table 1

[0050]

[0051]

[0052] All VIP permissions in the table are reflected in the allocation rules of the remaining modules under the premise that each PDU ensures one module. Data type definition: Priority 2 bytes represent: 0b0000 0011 1111 1111

[0053]

[0054] In the embodiment, it is assumed that the power topology of a certain group charging device model is as follows Figure 7 As shown, the path relationship table is generated according to the power topology of this model as shown in Figure 7 As shown; at a certain moment, charging guns 1#, 5#, 8#, 10#, and 11# all have charging demands at the same time.

[0055] According to the required current, voltage and other data of each charging gun corresponding to the electric vehicle, the current expected number of charging modules is calculated as follows: 1# required number 5, 5# required number 1, 8# required number 5, 10# required number 7, 11# required number 2.

[0056] The order of gun insertion is 5#, 8#, 1#, 11#, and 10#; and 1# is for SVIP users and 10# is for VIP users.

[0057] The calculation process of the allocation algorithm is as follows:

[0058] The order of priority and the number of pre-allocated modules for each PDU in the initialization phase are shown in Table 2:

[0059] Table 2

[0060] Gun number sequence Expected number of modules Number of pre-allocated modules Assign module number 1# 5 5 P1 10# 7 4 P10 5# 1 1 P5 8# 5 4 P8 11# 2 2 P11

[0061] In the above table, 1# is an SVIP user, 10# is a VIP user, and the remaining 5#, 8#, and 11# are ordinary users, arranged in the order of gun insertion. The specific pre-allocation is to allocate 1 module to each gun in each round. For example: in the first round, 1# is allocated 1 module, 10# is allocated 1 module, 5# is allocated 1 module, 8# is allocated 1 module, and 11# is allocated 1 module; in the second round, 1# is allocated 1 module, 10# is allocated 1 module, 5# is skipped (to meet the expected module), 8# is allocated 1 module, and 11# is allocated 1 module; in the third round..., until the total number of 16 modules is allocated.

[0062] Confirm the PDU part. Since 1# is SVIP and does not meet the allocation requirements, select 1#PDU.

[0063] Depend on Figure 7From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 1#PDU are as follows:

[0064] Module Number assighNums ReuseNums FrtFlrPduNums P16 1 1 1 P2 1 1 1 P9 0 2 2

[0065] In the above table, assighNums represents the number of routes that the PDU can travel next, ReuseNums represents the reuse rate of other PDU optional modules, and FrtFlrPduNums represents the number of PDUs used as the first level by the optional module.

[0066] Take P16 as an example, according to Figure 7 It can be seen that the module paths that P16 can take to the next step are P15, P1, and P8. Among them, P1 and P8 have been selected and cannot move forward. Only P15 can move forward, so the assistNums of P16 is 1; according to Figure 7 It can be seen that the route module numbers that P16 can travel are P1, P8, and P15. Excluding P1 itself, among the remaining P8 and P15, P8 has been selected, and P15 has not been selected, so the ReuseNums of P16 is 1; according to Figure 7 As can be seen from Table 2, the selected P1, P10, P5, P8, and P11 define the zeroth level, among which the P1 module path is P16, P2, and P9; the P10 module path is P9, P11, and P2; the P5 module path is P4, P6, and P13; the P8 module path is P7, P9, and P16; the P11 module path is P10, P12, and P3; then the above module paths of P1, P10, P5, P8, and P11 are all at the first level, among which P1 and P8 contain P16. Excluding P1 itself, P8 can be selected, so the FrtFlrPduNums of P16 is 1.

[0067] According to Figure 4 Since both P16 and P2 meet the conditions, Figure 7 It can be seen that the module paths of P1 are P16, P2, and P9, among which P16 is closest to P1, so P16 is selected for 1#PDU.

[0068] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 1#PDU is:

[0069] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 1# 5 5 P1, P16

[0070] If the allocation is not completed, continue to the PDU confirmation part; in the PDU confirmation part, if 1# is SVIP and the allocation requirements are not met, select 1# PDU.

[0071] Depend on Figure 7From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 1#PDU are as follows:

[0072] Module Number assighNums ReuseNums FrtFlrPduNums P2 1 1 1 P9 0 2 2 P15 2 0 0

[0073] The module path of P16 is P1, P8, and P15. Since P1 and P8 have been selected, P15 is selected as an optional module. In the embodiment, the steps of calculating data in each round are the same. Therefore, according to the following example, Figure 4 Therefore, P15 is selected for 1#PDU.

[0074] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 1#PDU is:

[0075] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 1# 5 5 P1, P16, P15

[0076] If the allocation is not completed, continue to the PDU confirmation part; in the PDU confirmation part, if 1# is SVIP and the allocation requirements are not met, select 1# PDU.

[0077] Depend on Figure 7 From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 1#PDU are as follows:

[0078] Module Number assighNums ReuseNums FrtFlrPduNums P2 1 1 1 P9 0 2 2 P14 2 0 0 P7 1 1 1

[0079] The module path of P15 is P14, P16, and P7. Since P16 has been selected, P14 and P7 are selected as optional modules. In the embodiment, the steps of calculating data in each round are the same. Therefore, according to the following example, Figure 4 Therefore, P14 is selected for 1#PDU.

[0080] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 1#PDU is:

[0081] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 1# 5 5 P1, P16, P15, P14

[0082] If the allocation is not completed, continue to the PDU confirmation part; in the PDU confirmation part, if 1# is SVIP and the allocation requirements are not met, select 1# PDU.

[0083] Depend on Figure 7 From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 1#PDU are as follows:

[0084] Module Number assighNums ReuseNums FrtFlrPduNums P2 1 1 1 P9 0 2 2 P7 1 1 1 P13 1 0 0 P6 1 0 0

[0085] The module path of P14 is P13, P15, and P6. Since P15 has been selected, P15 and P6 are selected as optional modules. In the embodiment, the steps of calculating data in each round are the same. Therefore, according to the following example, Figure 4Therefore, P13 is selected for 1#PDU.

[0086] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 1#PDU is:

[0087] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 1# 5 5 P1, P16, P15, P14, P13

[0088] The allocation is not completed, continue to enter the PDU confirmation part; confirm the PDU part, the SVIP user has met the allocation requirements.

[0089] Therefore, according to Figure 3 The optional PDUs and their corresponding calculation data in the flowchart shown are:

[0090]

[0091] In the above table, GapNums represents the number of gaps from the number of pre-allocated modules, Route1Nums represents the number of methods for re-allocating one module by PDU, Route2Nums represents the number of methods for re-allocating two modules by PDU, and CanUseFrtFlrNums represents the number of modules that can be allocated at the first level.

[0092] Taking 10# as an example, it can be seen that 10# is VIP, and the number of pre-allocated modules of 10# is 4. P10 has been allocated to 10#, so the GapNums of 10# is 3; Figure 7 As shown, since the module paths of module P10 assigned to 10# are P9, P11, and P2, and since P11 has been selected, only P9 and P2 are left as optional modules, so the Route1Nums of 10# is 2.

[0093] Figure 7 As shown, the module path of P9 is P8, P10, and P1. These three modules have been selected, so the Route2Nms passing through P9 is 0, and the module path after P2 is P1, P3, and P10. Among these three modules, only P3 is left unselected, so the Route2Nms passing through P2 is 1. Therefore, 10#Route2Nms is 1; because P9 and P2 are the first-level modules of 10#, CanUseFrtFlrNums is 2.

[0094] According to Figure 3 The process is allocated, so 10#PDU is selected.

[0095] Depend on Figure 7 From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 10#PDU are as follows:

[0096] Module Number assighNums ReuseNums FrtFlrPduNums P9 0 1 1 P2 1 0 0

[0097] The module path of P10 is P9, P11, and P2. Since P11 has been selected, P9 and P2 are selected as optional modules. In the embodiment, the steps of calculating data in each round are the same. Therefore, according to the following example, Figure 4 Therefore, P2 is selected for 10#PDU.

[0098] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 10#PDU is:

[0099] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 10# 7 4 P10, P2

[0100] The allocation is not completed, continue to enter the PDU confirmation part; in the PDU confirmation part, the SVIP user has met the allocation requirements, so according to Figure 3 The optional PDUs and their corresponding calculation data in the flowchart shown are:

[0101]

[0102] Each round of calculation in the embodiment is the same, according to Figure 3 The process is allocated, so 8#PDU is selected.

[0103] Depend on Figure 7 From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 8#PDU are as follows:

[0104] Module Number assighNums ReuseNums FrtFlrPduNums P7 1 0 0 P9 0 1 1

[0105] The module path of P8 is P7, P9, and P16. Since P16 has been selected, P7 and P9 are selected as optional modules. In the embodiment, the steps of calculating data in each round are the same. Therefore, according to the following example, Figure 4 Therefore, P7 is selected for 8#PDU.

[0106] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 8#PDU is:

[0107] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 8# 5 4 P8, P7

[0108] The allocation is not completed, continue to enter the PDU confirmation part; in the PDU confirmation part, the SVIP user has met the allocation requirements, so according to Figure 3 The optional PDUs and their corresponding calculation data in the flowchart shown are:

[0109]

[0110]

[0111] Each round of calculation in the embodiment is the same, according to Figure 3 The process is allocated, so 8#PDU is selected.

[0112] Depend on Figure 7 From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 8#PDU are as follows:

[0113] Module Number assighNums ReuseNums FrtFlrPduNums P9 0 1 1 P6 0 0 0

[0114] The module path of P7 is P6, P7, and P15. Since P7 and P15 have been selected, select P6 as the optional module.

[0115] In the embodiment, each round of data calculation steps is the same, so according to Figure 4 Therefore, P6 is selected for 8#PDU.

[0116] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 8#PDU is:

[0117] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 8# 5 4 P8, P7, P6

[0118] The allocation is not completed, continue to enter the PDU confirmation part; in the PDU confirmation part, the SVIP user has met the allocation requirements, so according to Figure 3 The optional PDUs and their corresponding calculation data in the flowchart shown are:

[0119]

[0120] Each round of calculation in the embodiment is the same, according to Figure 3 The process is allocated, so 8#PDU is selected.

[0121] Module Number assighNums ReuseNums FrtFlrPduNums P9 0 0 0

[0122] The module path of P6 is P5, P7, and P14. Since P5, P7, and P14 have all been selected, the remaining P9 is selected as an optional module. In the embodiment, the steps for calculating data in each round are the same. Therefore, according to the following example, Figure 4 Therefore, P9 is selected for 8#PDU.

[0123] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 8#PDU is:

[0124] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 8# 5 4 P8, P7, P6, P9

[0125] The allocation is not completed, continue to enter the PDU confirmation part; in the PDU confirmation part, the SVIP user has met the allocation requirements, so according to Figure 3 The optional PDUs and their corresponding calculation data in the flowchart shown are:

[0126]

[0127] Each round of calculation in the embodiment is the same, according to Figure 3 The process is allocated, so 10#PDU is selected.

[0128] Depend on Figure 7 From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 10#PDU are as follows:

[0129] Module Number assighNums ReuseNums FrtFlrPduNums P3 1 0 0

[0130] The module path of P2 is P1, P3, and P10. Since P1 and P10 have been selected, P3 is selected as an optional module. In the embodiment, the steps of calculating data in each round are the same. Therefore, according to the following example, Figure 4 Therefore, P3 is selected for 10#PDU.

[0131] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 10#PDU is:

[0132] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 10# 7 4 P10, P2, P3

[0133] The allocation is not completed, continue to enter the PDU confirmation part; in the PDU confirmation part, the SVIP user has met the allocation requirements, so according to Figure 3 The optional PDUs and their corresponding calculation data in the flowchart shown are:

[0134]

[0135]

[0136] Each round of calculation in the embodiment is the same, according to Figure 3 The process is allocated, so 11#PDU is selected.

[0137] Depend on Figure 7 From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 11#PDU are as follows:

[0138] Module Number assighNums ReuseNums FrtFlrPduNums P12 1 0 0

[0139] The module path of P11 is P10, P12, and P3. Since P10 and P3 have been selected, P12 is selected as an optional module. In the embodiment, the steps of calculating data in each round are the same. Therefore, according to the following example, Figure 4 Therefore, P12 is selected for PDU #11.

[0140] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 11#PDU is:

[0141] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 11# 2 2 P11, P12

[0142] The allocation is not completed, continue to enter the PDU confirmation part; in the PDU confirmation part, the SVIP user has met the allocation requirements, so according to Figure 3 The optional PDUs and their corresponding calculation data in the flowchart shown are:

[0143]

[0144] Each round of calculation in the embodiment is the same, according to Figure 3 The process is allocated, so 10#PDU is selected.

[0145] Depend on Figure 7 From the charging module path relationship table, we can see that the optional modules and corresponding calculation data of 8#PDU are as follows:

[0146] Module Number assighNums ReuseNums FrtFlrPduNums P4 0 0 0

[0147] Select P12 for PDU #11.

[0148] At this time, other PDU allocation modules remain unchanged, and the number of pre-allocated modules for 10#PDU is:

[0149] Assign gun number Number of modules required Number of pre-allocated modules Assign module number 10# 7 4 P10, P2, P3, P4

[0150] The final allocation results are as follows:

[0151]

[0152]

[0153] The above results are checked to determine whether one module is allocated to multiple PDUs and whether the modules allocated to each PDU can be connected. If the check result is correct, the correct result is output to the application layer. Otherwise, the allocation fails and an error is output to the application layer.

[0154] Based on the same inventive concept, an embodiment of the present invention also provides a charging pile charging power dynamic allocation system. Since the principle of solving the problem by this charging pile charging power dynamic allocation system is similar to that of the aforementioned charging pile charging power dynamic allocation method, the implementation of this charging pile charging power dynamic allocation system can refer to the implementation of a charging pile charging power dynamic allocation method, and the repeated parts will not be repeated.

[0155] In a specific implementation, a charging pile charging power dynamic allocation system provided by an embodiment of the present invention specifically includes:

[0156] The priority unit determines the charging priority according to the order of plugging in and the user's authority;

[0157] An acquisition unit acquires charging information and obtains the expected number of charging modules according to the charging information;

[0158] A pre-allocation unit realizes the overall module pre-allocation of the charging pile according to the charging priority and the expected number of charging modules;

[0159] The allocation unit allocates the charging modules according to the dynamic power allocation strategy;

[0160] The execution unit repeats step S4 until the overall module allocation of the charging pile is completed.

[0161] Correspondingly, an embodiment of the present invention further provides a charging pile charging power dynamic allocation device, comprising a processor and a memory, wherein when the processor executes a computer program stored in the memory, a charging pile charging power dynamic allocation method as provided in an embodiment of the present invention is implemented.

[0162] For more specific processes of the above method, please refer to the corresponding contents disclosed in the aforementioned embodiments, which will not be repeated here.

[0163] Correspondingly, an embodiment of the present invention further provides a computer-readable storage medium for storing a computer program, wherein when the computer program is executed by a processor, the method for dynamically allocating charging power of a charging pile as provided in an embodiment of the present invention is implemented.

[0164] In this specification, each embodiment is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the systems, devices, and storage media disclosed in the embodiments, since they correspond to the methods disclosed in the embodiments, the description is relatively simple, and the relevant parts can be referred to the method part.

[0165] Professionals may further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in the above description according to function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0166] The steps of the method or algorithm described in conjunction with the embodiments disclosed herein may be implemented directly using hardware, a software module executed by a processor, or a combination of the two. The software module may be placed in a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

[0167] Finally, it should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0168] The above is a detailed introduction to a charging pile charging power dynamic allocation method, system, device and storage medium provided by the present invention. Specific examples are used in this article to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea; at the same time, for general technical personnel in this field, according to the idea of ​​the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

Claims

1. A method for dynamically allocating charging power of a charging pile, characterized in that: The following steps are involved: S1: Determine charging priority based on the order of plugging in and user permissions; S2: Obtain charging information, and obtain the expected number of charging modules according to the charging information; S3: pre-allocate the overall modules of the charging pile according to the charging priority and the expected number of charging modules; S4: Allocate charging modules according to the dynamic power allocation strategy; S5: Repeat step S4 until the overall module allocation of the charging pile is completed.

2. According to claim 1, a charging pile charging power dynamic allocation method is characterized in that: The user rights include SVIP, VVIP, VIP and ordinary users.

3. According to claim 1, a charging pile charging power dynamic allocation method is characterized in that: The specific process in step S2 is: according to the current and voltage required for charging, the power required for charging is obtained; according to the maximum power of a single module of the charging pile and the power required for charging, the expected number of charging modules is obtained.

4. According to claim 1, a charging pile charging power dynamic allocation method is characterized in that: The specific process in step S3 is: according to the total module number of the charging pile, the charging priority and the expected number of charging modules, the total module pre-allocation of the charging pile is implemented according to the principle of each round of allocation.

5. A method for dynamically allocating charging power of a charging pile according to claim 1, characterized in that: Before performing step S4, a path relationship table of the charging modules is generated according to the position of the charging modules in the power topology of the model and the position relationship of the surrounding charging modules.

6. According to claim 1, a charging pile charging power dynamic allocation method is characterized in that: The specific process of step S4 is: calculating the number of methods for reallocating one module by PDU, the number of methods for reallocating two modules by PDU, the number of gaps from the number of pre-allocated modules, the number of modules that can be allocated at the first level, and the number of PDUs whose number of methods for reallocating one module is not equal to 0, and selecting a suitable PDU according to the above data; After the PDU is determined, the number of PDUs used as the first level of the optional module, the reuse rate of other PDU optional modules, and the number of routes that the PDU can travel in the next step are calculated according to the path relationship table, and the charging module is allocated to the PDU according to the above data; The above process is repeated until the entire module of the charging pile is allocated.

7. A charging pile charging power dynamic allocation method according to claim 1, characterized in that: After step S5, the allocation result needs to be verified to determine whether the charging module is connected to multiple PDUs and whether the charging modules allocated to the PDUs are connected.

8. A charging pile charging power dynamic distribution system, characterized in that: include: The priority unit determines the charging priority according to the order of plugging in and the user's authority; An acquisition unit acquires charging information and obtains the expected number of charging modules according to the charging information; A pre-allocation unit realizes the overall module pre-allocation of the charging pile according to the charging priority and the expected number of charging modules; The allocation unit allocates the charging modules according to the dynamic power allocation strategy; The execution unit repeats step S4 until the overall module allocation of the charging pile is completed.

9. A charging pile charging power dynamic distribution system, characterized in that: The method comprises a processor and a memory, wherein the processor implements the method for dynamically allocating charging power of a charging pile as claimed in any one of claims 1 to 7 when executing a computer program stored in the memory.

10. A computer-readable storage medium, characterized in that: Used to store a computer program, wherein when the computer program is executed by a processor, the method for dynamically allocating charging power of a charging pile as described in any one of claims 1 to 7 is implemented.