Resource adjustment method, electronic equipment and medium

Abstract

The invention discloses a resource adjustment method, electronic equipment and a medium. The method comprises the following steps: acquiring a resource supplement direction between to-be-processed areas in a target area range; determining a resource lack region from the to-be-processed regions; according to a preset sorting rule, determining a resource supply priority of each resource lacking area; and according to the resource supplement direction and the resource supply priority, performing resource supplement on each resource lack area. According to the technical scheme provided by the embodiment of the invention, the accuracy of resource supplement is improved, the rationality and allocation efficiency of resource allocation are improved, and the resource use experience of a resource user is improved.

Description

Technical Field

[0001] The present application relates to the field of automation technology, and in particular to a resource adjustment method, electronic equipment and medium. Background Art

[0002] With the development of social productivity and the continuous advancement of science and technology, more and more manufacturers and users choose to adopt automation and intelligent technologies to liberate productivity and improve work efficiency.

[0003] Among them, production is inseparable from the reasonable allocation of production materials. Any resource needs to be used as much as possible to avoid wasting production time. The resource scheduling method in the existing technology is not smooth and reasonable, resulting in the inability to supply resources in a timely manner, insufficient supply of resources at the high demand end, and accumulation of resources at the low demand end, resulting in poor efficiency of resource regulation. Summary of the invention

[0004] The present application provides a resource adjustment method, electronic device and medium to improve the efficiency of resource adjustment.

[0005] According to one aspect of the present application, a resource adjustment method is provided, the method comprising:

[0006] Obtain resource replenishment directions between the areas to be processed within the target area;

[0007] Identify resource-deficient areas from among the areas to be processed;

[0008] Determine the resource supply priority for each resource-deficient area according to the preset sorting rules;

[0009] According to the direction of resource replenishment and resource supply priority, resources are supplemented to each resource-deficient area.

[0010] According to another aspect of the present application, a resource adjustment device is provided, the device comprising:

[0011] A resource replenishment direction acquisition module is used to obtain the resource replenishment direction between the areas to be processed within the target area;

[0012] A resource-deficient area determination module, used to determine a resource-deficient area from among the areas to be processed;

[0013] A supply priority determination module is used to determine the resource supply priority of each resource-deficient area according to a preset sorting rule;

[0014] The resource replenishment module is used to replenish resources in various resource-deficient areas according to the resource replenishment direction and resource supply priority.

[0015] According to another aspect of the present application, an electronic device is provided, the electronic device comprising:

[0016] at least one processor; and

[0017] a memory communicatively connected to the at least one processor; wherein,

[0018] The memory stores a computer program that can be executed by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the resource adjustment method described in any embodiment of the present application.

[0019] According to another aspect of the present application, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the resource adjustment method described in any embodiment of the present application when executed.

[0020] According to another aspect of the present application, a computer program product is provided, the computer program product comprising a computer program, and the computer program, when executed by a processor, implements the resource adjustment method according to any embodiment of the present application.

[0021] The technical solution of the embodiment of the present application obtains the resource replenishment direction between each to-be-processed area within the target area; determines the resource-deficient area from among the to-be-processed areas, and first determines the resource replenishment direction and which to-be-processed areas belong to the resource-deficient area within the target area, providing basic conditions and replenishment directions for subsequent resource replenishment; determines the resource supply priority of each resource-deficient area according to a preset sorting rule, and the priority judgment can provide an accurate basis for the resource replenishment process, thereby improving the accuracy of resource replenishment; replenishes resources for each resource-deficient area according to the resource replenishment direction and resource supply priority, providing a practical and feasible automated replenishment solution for resource allocation, solving the problems of poor rationality and low efficiency of manpower adjustment, improving the rationality and efficiency of resource allocation, and improving the resource usage experience of resource users.

[0022] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present application, nor is it intended to limit the scope of the present application. Other features of the present application will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0024] Figure 1 is a flow chart of a resource adjustment method provided according to Embodiment 1 of the present application;

[0025] Figure 2A It is a schematic diagram of the regional topological relationship applicable to the second embodiment of the present application;

[0026] Figure 2B It is a topological relationship diagram applicable to the second embodiment of the present application;

[0027] Figure 2C is another topological relationship diagram applicable to the second embodiment of the present application;

[0028] Figure 2D is a schematic diagram of dynamic adjustment of resource-deficient areas according to the second embodiment of the present application;

[0029] Figure 2E It is a schematic diagram of overcoming the directed cyclic topological relationship applicable to the second embodiment of the present application;

[0030] Figure 3 is a structural diagram of a resource adjustment device provided according to Embodiment 3 of the present application;

[0031] Figure 4 It is a structural diagram of an electronic device that implements the resource adjustment method of an embodiment of the present application. DETAILED DESCRIPTION

[0032] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0033] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0034] Embodiment 1

[0035] Figure 1 A flowchart of a resource adjustment method is provided for the first embodiment of the present application. This embodiment is applicable to the case where resources are allocated to a region that needs to be supplemented with resources. The method can be executed by a resource adjustment device, which can be implemented in the form of hardware and / or software, and can be configured in an electronic device. Figure 1 As shown, the method includes:

[0036] S110, obtaining resource replenishment directions between the areas to be processed within the target area.

[0037] Among them, the target area range can be any area that needs a certain resource as a means of production and needs to adjust the supply of the resource, such as a production plant, park, etc. Correspondingly, the resource can be any kind of item that needs to be regulated in supply, it can be a raw material for production, or it can be a vehicle used to perform work tasks within the target area (such as an automatic driving logistics vehicle), etc. The area to be processed can be a smaller area within the target area for storing the resource. It is understandable that there can be multiple areas to be processed within the target area, and there can be resource replenishment between each area to be processed, and there is also a direction of resource replenishment, that is, transporting resources from a certain area to be processed to another area to be processed. Of course, the direction of resource replenishment can be pre-set, and the embodiment of the present application is not limited to this.

[0038] The embodiments and implementation methods of this application will be illustrated by taking the autonomous driving logistics vehicles in a certain park as an example. For example, the target area range can be the area range of the park, the resources can be these vehicles, and correspondingly, the area to be processed can be the parking lot of these logistics vehicles in the park. Since the logistics vehicles in the park need to frequently travel between the parking lot and the logistics pickup place and the destination, in order to ensure that there are always available logistics vehicles in the parking lot, these vehicles need to be reasonably deployed.

[0039] S120: Determine a resource-deficient area from among the areas to be processed.

[0040] Among them, the resource-deficient area can be a pending area with fewer resources that cannot meet the resource usage requirements. It is understandable that the same resources are stored in different pending areas. Since the resources in different pending areas are used or consumed differently, it is necessary to ensure that the resources in the pending areas are not in a state of scarcity as much as possible. Therefore, it is necessary to first determine which areas are in a state of resource scarcity from each pending area, that is, to determine the resource-deficient area from each pending area.

[0041] Exemplarily, there are many ways to determine resource-deficient areas, such as determining whether a certain area is a resource-deficient area based on the degree of resource consumption in a certain area to be processed (i.e., the amount of resources consumed per unit time), or presetting a resource red line, and if the amount of resources in the area is consumed to less than the resource red line, then the area is determined to be a resource-deficient area. Of course, the embodiments of the present application do not limit the specific method of determining a resource-deficient area.

[0042] S130: Determine the resource supply priority of each resource-deficient area according to a preset sorting rule.

[0043] The sorting rule may be the order of all resource-deficient areas, for example, all resource-deficient areas may be sorted according to their resource-deficient degree, or according to the importance of the resource-deficient areas themselves (whether resources are frequently consumed). The resource supply priority may be the priority of supplementary resources determined according to the sorting result.

[0044] S140. Supplement resources to resource-deficient areas according to resource supplement direction and resource supply priority.

[0045] Among them, the resource replenishment direction represents the supply flow of resources from one pending area to another pending area (resource-deficient area); the resource supply priority represents the demand for resource adjustment between different resource-deficient areas. According to the demand of resource-deficient areas from high to low, and the resource replenishment direction is implicit, resources can be adjusted and supplemented to these resource-deficient areas.

[0046] The technical solution of the embodiment of the present application obtains the resource replenishment direction between each to-be-processed area within the target area; determines the resource-deficient area from among the to-be-processed areas, and first determines the resource replenishment direction and which to-be-processed areas belong to the resource-deficient area within the target area, providing basic conditions and replenishment directions for subsequent resource replenishment; determines the resource supply priority of each resource-deficient area according to a preset sorting rule, and the priority judgment can provide an accurate basis for the resource replenishment process, thereby improving the accuracy of resource replenishment; replenishes resources for each resource-deficient area according to the resource replenishment direction and resource supply priority, providing a practical and feasible automated replenishment solution for resource allocation, solving the problems of poor rationality and low efficiency of manpower adjustment, improving the rationality and efficiency of resource allocation, and improving the resource usage experience of resource users.

[0047] In an optional implementation manner, the acquiring of resource replenishment directions between the to-be-processed areas within the target area in S110 may include:

[0048] S111, obtaining the resource application frequency of each area to be processed, the traversable paths between each area to be processed, and the resource use distance between each area to be processed and the resource user.

[0049] Among them, the resource application frequency can be the frequency at which resources are called or consumed in the area to be processed. Continuing with the previous example, taking the logistics vehicle call in the park as an example, the frequency of use of logistics vehicles in different parking areas is different. In some parking areas, vehicles are often called in and out of the parking area; in some parking areas, the frequency of vehicles being called is low. The passable path can be a path that enables resources to be transported between different areas to be processed. For example, the path between different parking lots in the park is accessible to logistics vehicles. The resource user can be any place that has a demand for the use of resources. For example, the loading and unloading point in the park where transportation tasks need to be carried out, and the logistics vehicle needs to go to the loading and unloading point to load or unload in order to complete the transportation task. The resource usage distance between the area to be processed and the resource user can be the physical distance between the area to be processed and the resource user. For example, the distance between the parking lot and the loading and unloading point of the logistics vehicle in the park.

[0050] S112: Determine the connection relationship between the areas to be processed according to the traversable paths.

[0051] The connection relationship can be the access relationship between the areas to be processed, which area can transport and allocate resources to other areas through the accessible path. The accessible path can represent the access relationship between different areas to be processed, and this access relationship determines who can allocate and replenish resources to whom.

[0052] S113. Determine the direction of resource replenishment based on resource application frequency and resource use distance.

[0053] It is understandable that the resource application frequency to a certain extent represents the importance of the resources in the area to be processed. It is conceivable that since the resources in the area are frequently called, it is easier to lack resources. Similarly, because the resources in the area closer to the resource user are more likely to be used, the resource use distance can also represent the importance of the area to be processed to a certain extent. Therefore, the direction of resource replenishment can be to replenish resources from the area with less importance to the area with greater importance.

[0054] S114. Directly connect the areas to be processed according to the connection relationship and the resource supplementation direction to obtain the regional topological relationship of the areas to be processed.

[0055] According to the connection relationship and resource replenishment direction between the areas to be processed determined in the above steps, on the basis of the connection relationship, the areas to be processed are directed connected according to the resource replenishment direction, so as to obtain the topological relationship of the area. The topological relationship reveals the passable paths and resource replenishment directions between all the areas to be processed within the target area.

[0056] S115. Obtain resource replenishment directions between the regions to be processed from the regional topological relationship.

[0057] It should be noted that the determination of the regional topological relationship in the aforementioned S111-S114 is performed before the execution of each method step of the embodiment of the present application, that is, the regional topological relationship of the target area is determined in advance. Since the areas to be processed within the target area are quite stable, the regional topological relationship is also quite stable and unchanged. When the regional topological relationship is needed, it can be directly called. Then, in S115, when the solution of the embodiment of the present application needs to obtain the resource replenishment direction, the resource replenishment direction can be called from the regional topological relationship.

[0058] In the above implementation, the resource replenishment direction is called in the regional topological relationship of the predetermined target area. The connection relationship is determined in advance according to the communicable paths between the areas to be processed, and the resource replenishment direction is determined based on the resource application frequency and the resource use distance. Finally, the areas to be processed are directed connected according to the connection relationship and the resource replenishment direction to form a regional topological relationship. Reasonably determining the resource replenishment direction between different areas according to actual conditions, and providing an accurate and reasonable basis for the subsequent allocation of resources based on the regional topological relationship, can help improve the rationality and accuracy of resource regulation within the target area, and thus help improve the efficiency of resource regulation.

[0059] In a further optional implementation, the resource replenishment direction is from the root node area to the child node area; in the regional topological relationship, since different areas are connected together in a directed connection manner, there must be a root node area and a child node area, and the resource replenishment direction flows from the root node area to the child node area.

[0060] Then, determining the resource supplement direction according to the resource application frequency and the resource use distance in S113 may include: taking the to-be-processed area with a higher resource application frequency as a sub-node area; in response to the same resource application frequency, taking the to-be-processed area with a shorter resource use distance as a sub-node area.

[0061] Among them, the area to be processed with a higher resource application frequency (even the area with the highest resource application frequency in the target area) should receive more resource supplements, so it is used as a child node area. Correspondingly, other areas that have a connection relationship with this area and whose resource supplement direction can point to this area are all root nodes of this area.

[0062] In one case, the resource application frequencies of multiple areas to be processed are the same, so the resource use distances of these areas from the resource users are checked, and the areas with shorter resource use distances are used as child node areas.

[0063] In the above implementation, sub-nodes are screened based on the two basic conditions of resource application frequency and resource usage distance, which provides a practical and more reasonable basic condition for determining regional topological relationships. It can effectively distinguish root nodes and sub-nodes, which makes it easier to determine the direction of resource replenishment and helps to improve the rationality of resource regulation.

[0064] In an optional implementation, supplementing resources to each resource-deficient area according to the resource supplement direction and the resource supply priority in S140 may include:

[0065] S141. The resource-deficient area with the highest resource supply priority is selected as the first target area.

[0066] In the process of adjusting resource replenishment, the resource-deficient regions may be adjusted one by one in the order of the resource-deficient regions. Resource replenishment is preferably started from the resource-deficient region with the highest resource supply priority. For ease of explanation, the resource-deficient region with the highest resource supply priority is recorded as the first target region.

[0067] S142. Use the root node area of ​​the first target area as the first supply area of ​​the first target area.

[0068] It is understandable that the resource replenishment direction of the root node area of ​​the first target area is toward the first target area, so the resources in its root node area can be transferred to the first supply area. It is understandable that there may be more than one root node area in the first target area, and at this time, a root node area can be selected as the first supply area for resource replenishment to the first target area according to pre-set rules (such as the order in which the root node areas supply resources to the first target area) or according to certain conditions (such as which of these root node areas has the most existing resources).

[0069] S143: The difference between the current resource quantity of the first supply area and the upper limit of the replenishable resources is used as the minimum resource supply quantity of the first supply area.

[0070] The current resource quantity may be the existing resource quantity in the first supply area, and the upper limit of replenishable resources may be a capacity value that can identify that the first target area is no longer a resource-deficient area. It should be noted that the upper limit of replenishable resources is not the maximum resource capacity in the area, and the upper limit of replenishable resources may be less than the maximum resource capacity, but when the area is replenished with resources to the upper limit of replenishable resources, it can be considered that the area is no longer in a resource-deficient situation.

[0071] The difference between the current amount of resources and the upper limit of replenishable resources, that is, the amount of resources that the current amount of resources in the first supply area exceeds the upper limit of replenishable resources, is the minimum amount of resources that the area can provide for the first target area. It is understandable that if the first supply area replenishes too much resources, making the current amount of resources less than the upper limit of replenishable resources, the first supply area becomes a resource-deficient area. It is understandable that in addition to supplying resources to the first target area, the first supply area also needs to have other uses at the same time, such as other resource users calling on its resources. Therefore, at this stage, the amount of resources that the first supply area can supply to the outside can only be the part of the current amount of resources that exceeds the upper limit of replenishable resources.

[0072] Continuing with the previous example, taking the logistics vehicles in the park as an example, suppose that there are currently 10 vehicles parked in the first supply area (assuming that a maximum of 12 vehicles can be parked), the upper limit of the resources that can be replenished in this area is 7 vehicles. That is to say, if there are less than 7 vehicles in the first supply area, it is very likely to cause a "vehicle shortage phenomenon". In order to prevent the area from being "short of vehicles", the minimum amount of resources that the area can supply to the first target area is 10-7=3 vehicles.

[0073] S144: In response to the resource shortage amount of the first target area being less than or equal to the minimum resource supply amount, controlling the first supply area to supplement resources to the first target area according to the resource shortage amount.

[0074] The resource shortage amount may be how much resources the first target area needs to replenish. For example, the resource shortage amount may be obtained by subtracting the current resource amount of the first target area from the replenishable resource upper limit of the first target area. In other words, the resource amount of the first target area needs to be replenished to the replenishable resource upper limit before the first target area can be said to be out of the resource shortage state, that is, no longer among the resource shortage areas.

[0075] Correspondingly, if it is judged at this time that the resource shortage amount of the first target area is less than or equal to the minimum resource supply amount of the first supply area, it means that, under the premise of not causing the first supply area to fall into a state of resource shortage, the resources that can be provided by the first supply area can enable the first target area to escape from the state of resource shortage. Then, the first supply area can supplement resources to the first target area according to the resource shortage amount of the first target area.

[0076] Continuing with the previous example, assuming that the current resource quantity of the first target area is 4 vehicles, and the upper limit of its replenishable resources is 6 vehicles, it means that the current resource shortage of the first target area is 6-4=2 vehicles. The minimum resource supply of the first supply area is 3 vehicles, so 2 vehicles can be transferred from the first supply area to the first target area, so that the number of vehicles in the first target area reaches its upper limit of replenishable resources, so that it does not belong to the resource-deficient area, and the resource replenishment of the first target area is completed.

[0077] In the above implementation, the minimum value of resources that the first supply area can provide to the first target area is determined, and the minimum resource supply amount and the resource shortage in the first target area are compared and then supplemented. This can ensure that resources are provided to the outside without affecting the resource balance of the first supply area itself, thereby improving the rationality of resource regulation.

[0078] In a further optional implementation manner, after controlling the first supply region to replenish resources to the first target region according to the resource shortage amount in response to the resource shortage amount of the first target region being less than or equal to the minimum resource supply amount in S144, the method may further include:

[0079] A1. Use the current resource quantity as the maximum resource supply quantity of the first supply area.

[0080] It is understandable that the minimum resource supply that the first supply area can provide in the above implementation is to ensure that the resource status of the first supply area itself is not affected. However, if all resources in the first supply area can be provided to the outside without considering whether the first supply area becomes a resource-deficient area, the maximum resource supply of the first supply area can be its current resource amount.

[0081] A2. In response to the resource shortage amount of the first target area being greater than the minimum resource supply amount and the resource shortage amount of the first target area being less than or equal to the maximum resource supply amount, controlling the first supply area to supplement resources to the first target area according to the resource shortage amount.

[0082] After the above implementation, further judgment is required. If the resource shortage amount of the first target area is greater than the minimum resource supply amount of the first supply area, it means that even if the first supply area supplies all the minimum resource supply amount to the first target area, it still cannot solve the problem of resource shortage in the first target area. At this time, if it is judged that the resource shortage amount is less than or equal to the maximum resource supply amount, resources are supplemented from the first supply area to the first target area according to the resource shortage amount. In other words, it is necessary to give priority to ensuring that the more important first target area does not fall into the problem of resource shortage, and to provide resources to the first target area as much as possible without considering whether the first supply area will become resource-deficient.

[0083] In the above implementation mode, when the minimum resource supply cannot solve the resource shortage problem of the first target area, all resources that can be provided in the first supply area are used to provide resources for the first target area to solve its resource shortage problem. All resources in the first supply area are used as much as possible to give priority to the areas that need additional resources the most. This can minimize the normal operation of important areas to be processed within the target area and improve the rationality of resource regulation.

[0084] In a further optional implementation, before controlling the first supply area to replenish resources to the first target area according to the resource shortage amount in A2, the method may include:

[0085] B1. According to the resource replenishment direction, determine the second supply area for resource replenishment to the first supply area.

[0086] It is understandable that after the first supply area has provided resources to the first target area, it may change to a resource-deficient area, and then resources need to be supplemented to the first supply area. At this time, according to the resource supplement direction in the regional topological relationship mentioned in the above embodiment, it is determined which area to be processed can provide resources to the first supply area as the second supply area.

[0087] B2. In response to the difference between the upper limit of replenishable resources in the first supply area and the current resource amount in the first supply area, the sum of the resource shortage amount in the first target area is used as the theoretical replenishment amount for the first supply area.

[0088] The difference between the upper limit of the replenishable resources in the first supply area and the current amount of resources in the first supply area can actually be understood as the amount of resources that the first supply area lacks, and the sum of the lack of resources in the first area can be understood as the amount of resources that the first target area and the first supply area lack as a whole. It can be understood that when the first supply area replenishes resources to the first target area, the second supply area must not only consider the lack of resources in the first supply area when replenishing resources to the first supply area, but also consider the amount of resources lost by the first supply area due to replenishing resources to the first target area. Combining these two parts of resource amounts gives the amount of resources that can theoretically be provided to the first supply area, which is the theoretical replenishment amount.

[0089] B3. When the sum of the theoretical replenishment amount and the current resource amount is greater than the maximum resource capacity of the first supply area, the resources of the first supply area are replenished to the maximum resource capacity.

[0090] It should be noted that before the first supply area replenishes resources to the first target area according to the amount of resource shortage (that is, the amount of resources that need to be replenished to the first target area has not left the first supply area), the theoretical replenishment amount of resources is transported to the first supply area. There may be a situation where the first supply area cannot carry so many resources, that is, the sum of the theoretical replenishment amount and the current resource amount of the first supply area exceeds the maximum resource capacity of the first supply area. At this time, there is no need to replenish resources to the first supply area according to the theoretical replenishment amount, and the resources of the first supply area can be directly replenished to the maximum resource capacity of the first supply area.

[0091] In the above implementation, before the first supply area delivers resources to the first target area, taking into account the capacity constraint caused by the maximum resource capacity of the first supply area, resources are allocated from the second supply area to the first supply area. This can ensure the flow of resources as much as possible while preventing the area from being unable to store or bear too many resources, thereby improving the liquidity of resources and ensuring the rationality of resource regulation.

[0092] In another optional implementation, the method may further include: in response to the existence of a resource supply direction from the first target area to the first supply area, after the first supply area replenishes resources to the first target area, prohibiting the first target area from replenishing resources to the first supply area.

[0093] Based on the aforementioned embodiments and implementation methods, it can be understood that the resource replenishment direction between the various areas to be processed is not necessarily unidirectional, but may also be bidirectional. For the bidirectional flow of resources, generally, it is not desirable that the resources in both areas are transported to each other multiple times due to the fact that both areas are in a state of resource shortage or are in a state of resource shortage one after another, which wastes the time and efficiency of resource use. Therefore, when there is a bidirectional resource supply direction between the first target area and the first supply area, after the first supply area has replenished resources to the first target area, the first target area is prohibited from replenishing resources to the first supply area in return.

[0094] It is understandable that there is a two-way resource replenishment direction between the two regions, which is equivalent to a replenishment logic loop. In order to avoid constant mutual supply between the two parties, it is necessary to release the loop after one party is replenished to avoid the party being replenished from supplying the other party in turn, which can ensure the stability and rationality of resource replenishment in each region.

[0095] In an optional implementation manner, determining the resource-deficient area from the areas to be processed in S120 may include:

[0096] C1. Obtain the current resource amount and upper limit of replenishable resources of each area to be processed.

[0097] The current resource quantity and the upper limit of replenishable resources have been explained above and will not be repeated here.

[0098] C2. In response to the current resource amount being less than the upper limit of replenishable resources, the area to be processed is regarded as a resource-deficient area.

[0099] When the current resource amount of the area to be processed is less than the upper limit of its replenishable resources, it is determined that the area is in a resource-deficient state, and the area to be processed is defined as a resource-deficient area.

[0100] C3. In response to the resource replenishment being completed in the resource-deficient area, if any of the pending areas is transformed into a resource-deficient area, the resource supply priority of each resource-deficient area is re-determined according to the sorting rules.

[0101] It is understandable that in the process of resource replenishment, some areas provide resources to other areas, but cause a lack of resources in their own areas. At this time, the area is equivalent to being transformed into a resource-deficient area. Then, according to the sorting rules mentioned in the above implementation, the resource supply priorities of all current resource-deficient areas are re-sorted. In order to determine which areas need to be replenished with resources in turn according to the updated resource supply priorities.

[0102] In the above implementation, a method for determining resource-deficient areas is provided, as well as a method for re-identifying resource-deficient areas and resource supply priorities for other areas after resources are supplemented in certain areas. This allows the resource shortage status to be updated in real time while resources are being supplemented, and the resource supply priority to be updated so that higher priority areas can be given priority at any time when resources are supplemented, thereby improving the flow of resources and the rationality and efficiency of resource regulation.

[0103] Embodiment 2

[0104] Figure 2A A schematic diagram of a regional topological relationship provided in Example 2 of this application. The implementation method of this application is a preferred implementation method provided on the basis of the aforementioned embodiments and implementation methods. The implementation method of this application will be described by taking the logistics vehicle mobilization of each parking lot in the park as an example, as follows.

[0105] like Figure 2A As shown, first, construct regional topological relationships.

[0106] Based on the regular operation data of vehicles in the park, all vehicle (resource) parking areas (including ordinary parking areas and rechargeable parking areas, etc.) in the park or within a specific operation range are extracted, the distance and route between each area are calculated, the frequency of use of vehicles in each area is collected, and the regional topological relationship between areas is constructed. The resource supply relationship between areas is determined based on the distance, route, and frequency of use. The topological construction rules are as follows:

[0107] 1. The area with the highest frequency of use (task execution) and close to the resource usage location should be used as a child node of the topology map (there can be multiple child nodes).

[0108] 2. Areas with low task execution frequency and far away from the actual use point should be used as the root node of the topology map (there can be multiple root nodes).

[0109] 3. The area with high usage frequency between the child node and the root node can adjust its position in the topology map based on comprehensive indicators such as distance and path. The closer to the child node, the higher the resource supply priority.

[0110] like Figure 2A As shown in the figure, it is assumed that there are active area O and areas A, B and C, among which areas B and C are closest to the task point and have the highest usage frequency. The source area O is the resource recycling point. When the vehicle completes the task, it will automatically return to the source area O. Area A is located between the source area O and areas B and C. It is a relay node from the source area O to areas B and C, as shown in Figure 2A The figure shows the regional topological relationship based on usage frequency, distance and route. The arrows in the figure indicate the direction of resource replenishment. The relationship is described as follows (the supply relationship can be adjusted according to actual usage):

[0111] Source area: resource recovery area, resource distribution area.

[0112] A region: The candidate region is the source region.

[0113] Region B: The candidate regions are Region C and Region A, and resources are requested from Region C first.

[0114] Region C: The candidate regions are Region B and Region A, and resources are requested from Region B first.

[0115] Among them, the source area can automatically replenish resources to A, and other areas contain 3 values, the maximum resource capacity U, the upper limit of replenishable resources T, and the current resource amount S.

[0116] Second, obtain and prioritize resource-deficient areas.

[0117] Based on the above regional topological relationship, the resource-deficient regions in each region are determined. Figure 2B In the regional topological relationship, S of regions B and C is less than T, so regions B and C are both resource-deficient regions, and they can only reach a balanced state (that is, the state of S=T) by obtaining supplementary resources from other candidate regions.

[0118] After obtaining all resource-deficient areas, if there are multiple resource-deficient areas, you need to sort the resource-deficient areas, and then adjust each resource-deficient area according to the resource replenishment priority. The sorting rules are as follows (the priority becomes lower):

[0119] 1. Resource-deficient areas that have been adjusted (replenished with resources) cannot be adjusted again.

[0120] 2. The leaf node (no successor node) area is adjusted first.

[0121] 3. Sub-node areas are adjusted first.

[0122] 4. Adjust the node area with fewer paths first: Figure 2B As shown, area C has two paths (A to C, A to B and then to C), and area B has only one path (A to B).

[0123] 5. Adjust the node area with short path first: Figure 2B In the example, the shortest path length in area C is 1 (from A to C), and the shortest path length in area B is also 1 (from A to B).

[0124] for Figure 2B , the resource-deficient regions are sorted as <region C, region B>, so the adjustment calculation for region C will be performed first, and then how to adjust region B will be calculated.

[0125] Third, a two-stage adjustment plan.

[0126] After all the initial resource-deficient regions in the regional topological relationship are obtained and sorted, it is necessary to adjust the calculation according to the order of the resource-deficient regions.

[0127] Each resource-deficient region will be adjusted in two stages. After all candidate regions are calculated in the first stage to supplement resources to the resource-deficient region, if the resource demand of the resource-deficient region is still not met, the adjustment calculation will be entered in the second stage.

[0128] Phase 1: Resource suppliers (candidate areas) provide smaller resources to resource-deficient areas (without disrupting the resource balance of the candidate areas).

[0129] The second stage: resource suppliers (candidate areas) provide more resources to resource-deficient areas (which may disrupt resource balance).

[0130] Of course, it can also be expanded to N-stage adjustment: the regional capacity is divided into multiple stepped capacity thresholds, and the upper limit of replenishable resources in each stage is reduced stage by stage, which is convenient for flexible resource call and avoids the problem of large supply of resources in some areas and no supply in other areas.

[0131] by Figure 2B For example, if the resource-deficient regions are sorted as <region C, region B>, then region C and region B are calculated in turn. The process is as follows:

[0132] 1. Calculate and adjust area C, and the candidate areas are <area B, area A>

[0133] Phase 1:

[0134] The demand of area C is 6-2=4, and the smaller supply of area B is 5-6=-1<0, that is, area B has no vehicles to supply to area C at this stage. At this time, the smaller supply of area A is 9-6=3, that is, area A can supply 3 vehicles to area C at this stage, recorded as A→C:3, which does not reach the demand of area C of 4, so the second stage adjustment is carried out.

[0135] Phase 2:

[0136] Since area A added 3 vehicles to area C in the first stage, the demand of area C is 4-3=1 at this time, and the maximum supply of area B is 5 vehicles (that is, the current resource amount of area B). That is, area B can supply 5 vehicles to area C in this stage, which is greater than the demand of area C. To meet the demand, only 1 vehicle needs to be added. The adjustment of area C is completed, and the current adjustment is recorded as B→C:1.

[0137] At this time, the adjustment result is:

[0138] A→C:3

[0139] B→C:1

[0140] 2. Calculate and adjust area B, and the candidate area is <area A>

[0141] Phase 1:

[0142] The demand of region B is 6-5=1. Since region B supplied 1 vehicle to region A during the adjustment of region C, the current demand of region B is 1+1=2, and the minimum supply of region A is 9-6-3=0, which means that region A has no resources to supply to region B at this stage.

[0143] Phase 2:

[0144] The demand of area B is 2, and the maximum supply of area A is 9-3=6. That is, at this stage, area A can supply 6 vehicles to area B, which is greater than the demand of area B. The adjustment of area B is completed, and the current adjustment is recorded as A→B:2.

[0145] The adjustment result at this time is:

[0146] A→B:2

[0147] After the above complete resource adjustment, the resource shortage problem of area B and area C is solved (area A is regarded as the source area here, and whether A is transformed into a resource-deficient area is not discussed). The resource scheduling result can be obtained:

[0148] A→C:3

[0149] B→C:1

[0150] A→B:2

[0151] In a complete adjustment process, the adjusted region cannot exceed the upper limit of regional resources. Figure 2C In the second stage adjustment of area B, the maximum resource capacity of area B is 6 vehicles. In this case, the current resource volume of area B is S=5 (the resources supplied by area B to area C have not yet reached area C), the theoretical demand is 2, and the resource volume plus the demand volume 5+2=7 is greater than the area capacity 6. Therefore, the actual demand volume of area B is 1. The final calculated resource scheduling result is:

[0152] A→C:3

[0153] B→C:1

[0154] A→B:1

[0155] Fourth, dynamic adjustment of resources in each region.

[0156] From the above two-stage adjustment steps, we can know that when adjusting and calculating the resource-deficient areas, new resource-deficient areas will appear. Dynamic adjustment is to add the newly appeared resource-deficient areas to the adjustment queue, reorder the resource-deficient areas in the new adjustment queue, and continue to perform the two-stage adjustment in sequence.

[0157] like Figure 2D For example, Figure 2D In the initial stage on the far left, only region C is a resource-deficient region. At this time, the resource demand of region C is 8-2=6.

[0158] After adjusting area C, area B can supply 6 vehicles to area C, and the resource scheduling result is:

[0159] B→C:6

[0160] However, since area B supplies 6 vehicles to area C, the resource volume of area B is S = 6-6 = 0, and the demand volume is 6-0 = 6>0, so area B becomes the new resource-deficient area. Add area B to the resource-deficient area queue, re-sort the resource-deficient areas, and get the queue to be adjusted. Adjust region B. According to the constraints, region B can only accommodate 2 units of resources. Therefore, region A supplies 2 units of resources to region B. The resource scheduling result is:

[0161] A→B:2

[0162] So, for Figure 2D , the complete resource scheduling result is:

[0163] A→B:2

[0164] B→C:6

[0165] Fifth, overcome the directed cyclic topological relationship (de-looping).

[0166] In a directed acyclic topology, the full two-phase adjustment works well. However, in a ring topology, it will cause the resources in the ring nodes to be called in a loop. To avoid this problem, the second-phase adjustment needs to be used on demand. In the second-phase adjustment, if the resource transfer does not affect the current node, the second-phase adjustment can be used, otherwise the second-phase adjustment is abandoned.

[0167] like Figure 2E As shown, in the initial stage, there is only region B in the adjustment queue, and the candidate regions of region B are<C,A> , adjust area B, and the resource scheduling result of the first stage is:

[0168] C→B:1

[0169] When performing the second-stage adjustment, it is determined whether candidate region C forms a loop with resource-deficient region B. If so, the second-stage adjustment of region C is abandoned, and region B is adjusted to obtain the resource scheduling result:

[0170] A→B:1

[0171] In summary, the result of this resource adjustment is:

[0172] A→B:1

[0173] C→B:1

[0174] It can be seen from the two-stage adjustment scheme that it can not only balance the resources among multiple candidate areas, but also solve the problem of resource circulation in the ring topology.

[0175] To sum up, the technical solution of the embodiment of the present application can automatically analyze how to supplement resources according to the specific situation, reduce labor costs, and prevent various problems caused by lack of human experience. By automatically adjusting the resources between areas, the utilization rate of resources is improved, and the rationality and efficiency of resource adjustment are improved.

[0176] Embodiment 3

[0177] Figure 3 A schematic diagram of the structure of a resource adjustment device provided in Example 3 of the present application.

[0178] like Figure 3 As shown, the device 300 includes:

[0179] A resource replenishment direction acquisition module 310, which acquires the resource replenishment direction between the areas to be processed within the target area;

[0180] A resource-deficient region determination module 320, configured to determine a resource-deficient region from among the regions to be processed;

[0181] The supply priority determination module 330 is used to determine the resource supply priority of each resource-deficient area according to a preset sorting rule;

[0182] The resource supplement module 340 is used to supplement resources to each resource-deficient area according to the resource supplement direction and resource supply priority.

[0183] The technical solution of the embodiment of the present application obtains the resource replenishment direction between each to-be-processed area within the target area; determines the resource-deficient area from among the to-be-processed areas, and first determines the resource replenishment direction and which to-be-processed areas belong to the resource-deficient area within the target area, providing basic conditions and replenishment directions for subsequent resource replenishment; determines the resource supply priority of each resource-deficient area according to a preset sorting rule, and the priority judgment can provide an accurate basis for the resource replenishment process, thereby improving the accuracy of resource replenishment; replenishes resources for each resource-deficient area according to the resource replenishment direction and resource supply priority, providing a practical and feasible automated replenishment solution for resource allocation, solving the problems of poor rationality and low efficiency of manpower adjustment, improving the rationality and efficiency of resource allocation, and improving the resource usage experience of resource users.

[0184] In an optional implementation, the resource supplement direction acquisition module 310 may include:

[0185] A regional data acquisition unit, used to acquire the resource application frequency of each area to be processed and the passable paths between each area to be processed, and the resource use distance between each area to be processed and the resource user;

[0186] A connection relationship determination unit, used to determine the connection relationship between the areas to be processed according to the traversable paths;

[0187] A replenishment direction determination unit, used to determine the resource replenishment direction according to the resource application frequency and the resource use distance;

[0188] A topological relationship determination unit is used to connect the areas to be processed in a directed manner according to the connection relationship and the resource supplement direction to obtain the regional topological relationship of the areas to be processed;

[0189] The supplement direction acquisition unit is used to obtain the resource supplement direction between the areas to be processed from the area topological relationship.

[0190] In an optional implementation manner, the resource supplement direction is directed from the root node area to the child node area; the supplement direction determining unit may include:

[0191] The sub-node determines a first sub-unit, which is used to take the area to be processed with a higher resource application frequency as the sub-node area;

[0192] The subnode determines a second subunit, which is used to, in response to the same resource application frequency, use a to-be-processed area with a shorter resource usage distance as a subnode area.

[0193] In an optional implementation, the resource supplement module 340 may include:

[0194] A target area determination unit, configured to take a resource-deficient area with the highest resource supply priority as a first target area;

[0195] A first supply area determination unit, configured to use a root node area of ​​a first target area as a first supply area of ​​the first target area;

[0196] A minimum resource supply amount determination unit, configured to use the difference between the current resource amount of the first supply area and the upper limit of the replenishable resources as the minimum resource supply amount of the first supply area;

[0197] The first resource replenishment unit is used to control the first supply area to replenish resources to the first target area according to the resource shortage amount in response to the resource shortage amount of the first target area being less than or equal to the minimum resource supply amount.

[0198] In an optional implementation, the resource supplement module 340 may further include:

[0199] a maximum resource supply amount determination unit, configured to use the current resource amount as the maximum resource supply amount of the first supply area;

[0200] The second resource replenishment unit is used to control the first supply area to replenish resources to the first target area according to the resource shortage amount in response to the resource shortage amount of the first target area being greater than the minimum resource supply amount and the resource shortage amount of the first target area being less than or equal to the maximum resource supply amount.

[0201] In an optional implementation, the resource supplement module 340 may further include:

[0202] A second supply area determination unit, configured to determine, according to a resource replenishment direction, a second supply area for replenishing resources for the first supply area;

[0203] a theoretical replenishment amount determination unit, configured to respond to the sum of a difference between an upper limit of replenishable resources in the first supply area and a current resource amount in the first supply area and a resource deficiency amount in the first target area as a theoretical replenishment amount for the first supply area;

[0204] The first supply area replenishment unit is used to replenish the resources of the first supply area to the maximum resource capacity in response to the sum of the theoretical replenishment amount and the current resource amount being greater than the maximum resource capacity of the first supply area.

[0205] In an optional implementation, the device 300 may further include:

[0206] The resource replenishment prohibiting module is used to prohibit the first target area from replenishing resources to the first supply area after the first supply area replenishes resources to the first target area in response to the existence of a resource supply direction from the first target area to the first supply area.

[0207] In an optional implementation, the source-deficient region determining module 320 may include:

[0208] A region information acquisition unit, used to acquire the current resource amount and the upper limit of replenishable resources of each region to be processed;

[0209] a resource-deficient region determination unit, configured to, in response to the current resource amount being less than the upper limit of replenishable resources, determine the region to be processed as a resource-deficient region;

[0210] The supply priority determination unit is used to respond to the resource shortage area when the resource replenishment is completed in the resource shortage area and there is any area to be processed that is transformed into a resource shortage area, and re-determine the resource supply priority of each resource shortage area according to the sorting rule.

[0211] The resource adjustment device provided in the embodiments of the present application can execute the resource adjustment method provided in any embodiment of the present application, and has the corresponding functional modules and beneficial effects for executing each resource adjustment method.

[0212] Embodiment 4

[0213] Figure 4 A schematic diagram of an electronic device 10 that can be used to implement an embodiment of the present application is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present application described and / or required herein.

[0214] like Figure 4 As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0215] A number of components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0216] The processor 11 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 11 performs the various methods and processes described above, such as a resource adjustment method.

[0217] In some embodiments, the resource adjustment method may be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the resource adjustment method described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the resource adjustment method in any other appropriate manner (e.g., by means of firmware).

[0218] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0219] The computer programs for implementing the methods of the present application may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer programs are executed by the processor, the functions / operations specified in the flow charts and / or block diagrams are implemented. The computer programs may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0220] In the context of the present application, a computer readable storage medium may be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, device or equipment. A computer readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer readable storage medium may be a machine readable signal medium. A more specific example of a machine readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0221] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).

[0222] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0223] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.

[0224] The present application also discloses a computer program product, which includes a computer program, and when the computer program is executed by a processor, implements the resource adjustment method provided in any embodiment of the present application. The program product and the resource adjustment method disclosed in each embodiment of the present application belong to the same inventive concept, so it is not described here.

[0225] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this application can be executed in parallel, sequentially or in different orders, as long as the expected results of the technical solution of this application can be achieved, and this document is not limited here.

[0226] The above specific implementations do not constitute a limitation on the protection scope of this application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of this application should be included in the protection scope of this application.

Claims

1. A resource adjustment method, characterized in that: The method comprises: Obtain resource replenishment directions between the areas to be processed within the target area; Determine a resource-deficient area from among the areas to be processed; Determine the resource supply priority of each resource-deficient area according to a preset sorting rule; According to the resource replenishment direction and the resource supply priority, resources are replenished for each of the resource-deficient areas.

2. The method according to claim 1, characterized in that The method of obtaining the resource replenishment direction between the areas to be processed within the target area includes: Obtaining resource application frequencies of the areas to be processed, navigable paths between the areas to be processed, and resource usage distances between the areas to be processed and resource users; Determining the connection relationship between the areas to be processed according to the traversable path; Determining the resource replenishment direction according to the resource application frequency and resource use distance; According to the connection relationship and the resource supplement direction, the regions to be processed are connected in a directed manner to obtain a regional topological relationship of the regions to be processed; The resource supplement direction between the regions to be processed is obtained from the regional topological relationship.

3. The method according to claim 2, characterized in that The resource supplement direction is from the root node area to the sub-node area; The determining the resource supplement direction according to the resource application frequency and the resource use distance includes: The area to be processed with a relatively high resource application frequency is used as a sub-node area; In response to the resource application frequencies being the same, the to-be-processed area with a shorter resource usage distance is used as a child node area.

4. The method according to claim 3, characterized in that The method of supplementing resources to each resource-deficient area according to the resource supplement direction and the resource supply priority includes: Taking the resource-deficient area with the highest resource supply priority as the first target area; Using the root node area of ​​the first target area as the first supply area of ​​the first target area; The difference between the current resource quantity of the first supply area and the upper limit of the replenishable resources is used as the minimum resource supply quantity of the first supply area; In response to the resource shortage amount of the first target area being less than or equal to the minimum resource supply amount, the first supply area is controlled to supplement resources to the first target area according to the resource shortage amount.

5. The method according to claim 4, characterized in that After, in response to the resource shortage amount of the first target area being less than or equal to the minimum resource supply amount, controlling the first supply area to replenish resources to the first target area according to the resource shortage amount, the method further includes: Taking the current resource quantity as the maximum resource supply quantity of the first supply area; In response to the resource shortage amount of the first target area being greater than the minimum resource supply amount and the resource shortage amount of the first target area being less than or equal to the maximum resource supply amount, the first supply area is controlled to supplement resources to the first target area according to the resource shortage amount.

6. The method according to claim 4, characterized in that Before controlling the first supply area to replenish resources to the first target area according to the resource shortage amount, the method includes: According to the resource replenishment direction, determining a second supply area for replenishing resources for the first supply area; In response to the difference between the upper limit of the replenishable resources of the first supply area and the current resource amount of the first supply area, and the sum of the resource shortage amount of the first target area, as the theoretical replenishment amount of the first supply area; In response to the sum of the theoretical replenishment amount and the current resource amount being greater than the maximum resource capacity of the first supply area, the resources of the first supply area are replenished to the maximum resource capacity.

7. The method according to claim 5, characterized in that The method further comprises: In response to the existence of a resource supply direction from the first target area to the first supply area, after the first supply area replenishes resources to the first target area, the first target area is prohibited from replenishing resources to the first supply area.

8. The method according to claim 1, characterized in that The step of determining a resource-deficient area from among the areas to be processed includes: Obtaining the current resource amount and the upper limit of replenishable resources of each of the to-be-processed areas; In response to the current resource amount being less than the upper limit of replenishable resources, treating the area to be processed as a resource-deficient area; In response to the resource replenishment being completed for the resource-deficient area, if any area to be processed is transformed into a resource-deficient area, the resource supply priority of each resource-deficient area is re-determined according to the sorting rule.

9. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can perform the method according to any one of claims 1 to 8.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the method according to any one of claims 1 to 8 when executed.

Images