[0079] The preferred embodiments of the present invention will be described below with reference to the drawings. Those skilled in the art should understand that these embodiments are only used to explain the technical principles of the present invention and are not intended to limit the protection scope of the present invention. For example, although the various steps of the method of the present invention are described in a specific order in this application, these orders are not limitative, and those skilled in the art can follow a different order without departing from the basic principles of the present invention. Perform the steps described.
[0080] Reference figure 1 , figure 1 It is a flowchart of the combined task assignment method of the present invention. Such as figure 1 As shown, the combined task assignment method of the present invention includes the following steps: S110, receiving a service request; S120, acquiring the execution location and specific content of the service request; S130, predicting the service time of the service request according to the execution location and specific content of the service request S140: Calculate the best task item set according to the service time and execution location of the service request; S150, match the service personnel for the service request according to the best task item set.
[0081] In the above steps S110-S150, when matching service personnel for service requests, it is no longer a single task to directly assign the service request to the service personnel, but after receiving the service request, an optimal task item is calculated Set, and then assign the task corresponding to the service request and the task in the best task item set together. Specifically, taking the power-on service request as an example, after the user sends the power-on service request, if only the power-on service is assigned to a service person to perform, since a power-on service usually lasts 1-2 hours, the service The personnel need to wait for 1-2 hours when performing the power-on service. This period of time is the idle time for the service personnel, that is, the service personnel are idle within 1-2 hours of waiting. It can be seen that if only the service personnel are assigned the task of power-on service, then the free time of the service personnel cannot be effectively used, and the systematic efficiency of the power-on service is reduced. In order to make full use of the free time of service personnel and improve service efficiency, the present invention matches service personnel for service requests according to the best task item set. That is to say, the service personnel can use the idle time during the execution of the task to perform the tasks in the best task item set, thereby effectively using the idle time of the service personnel and optimizing the service efficiency.
[0082] The steps S110-S150 are respectively described in detail below. In this embodiment, the service request is a power-on request (for ease of description, the service requests are collectively referred to as a power-on request).
[0083] First, step S110 is performed, after receiving the power-on request, the power-on request is cached according to the preset cache time. Among them, the cache time can be 1 minute, 5 minutes, 10 minutes, etc., and those skilled in the art can customize the cache time according to specific usage scenarios. The purpose is to calculate the maximum value within the cache time of the power-on request. The best task item set, and the tasks of the power-on task and the calculated best task item set are dispatched. For example, the car owner can send a power-on request to the cloud server through the user terminal (such as a mobile phone). After the cloud server receives the power-on request, it temporarily stores the power-on request in the cache system (such as 5 minutes), and within these 5 minutes , The cloud platform calculates the best set of task items through analysis, and dispatches the power-on tasks and the tasks of the calculated best set of task items.
[0084] In step S120, the power-on request includes basic information of the vehicle (such as the current SOC of the vehicle), the execution position of the task, and so on. Therefore, the execution location and specific content of the service request can be directly obtained from the information contained in the power-on request.
[0085] After obtaining the execution location of the power-on request, step S130 is executed, that is, according to the execution location and specific content of the power-on request (because the service request is a power-on request, the specific content in the request is to power on the electric vehicle) , Predict the service time of the power-on request. Specifically, predicting the power-up time required for the power-up request can be based on the current SOC of the vehicle, that is, the time required to fully charge the power battery according to the remaining power of the power battery of the vehicle. In addition, the prediction process can also be combined with other information of the vehicle, such as the owner's information, etc., for example, according to the owner's request record, the service time of the owner's power-on request is 1 hour each time. How to predict the power-up time required by the power-on request will not be described in detail here.
[0086] In step S140, the optimal task item set is calculated according to the service time and execution location of the power-on request. Specifically, since the service personnel use the idle time during the power-on service process to perform other tasks, the time for the service personnel to perform other tasks theoretically cannot exceed the service time required by the power-on request. A preferred implementation of this step is: first obtain the set of executable tasks within the first preset distance from the execution position; then predict the service time of each task in the set of executable tasks; finally, the service time and availability based on the service request Execute the service time of each task in the task set and calculate the best task item set.
[0087] For example, suppose the first preset distance is 100 meters, that is, to retrieve whether there is an executable task (including task content, execution location, etc.) within 100 meters of the execution position of the power-on request, such as upgrading the software of the user's vehicle System, upgrade charging pile software system, charging pile maintenance, etc. These executable tasks can be understood as: when the service personnel perform the power-on service, they can use the free time (refer to the explanation of the free time above) to perform the tasks. Those skilled in the art can customize the length of the first preset distance according to actual application scenarios, and these do not depart from the protection scope of the present invention. Since the service personnel use the idle time during the power-on service process to perform other tasks, the time for the service personnel to perform other tasks theoretically does not exceed the service time required for the power-on request. Therefore, it is necessary to predict the service time of each task in the executable task set. In this way, it can be ensured that the total service time of the tasks in the best task item set finally obtained does not exceed the service time of the power-on service, thereby achieving the purpose of rational use of the free time of the service personnel during the power-on process. It should be noted that in the process of operation, it is inevitable that the time cannot be strictly controlled. Therefore, the total service time of performing the best task item set may exceed the service matter of the power-on service. The protection scope of the present invention is not The above situation is not excluded.
[0088] As a preferred embodiment of the present invention, before calculating the optimal task item set, the additional value of each task in the executable task set can also be obtained, and then based on the service time of the service request and the value of each task in the executable task set. Service time and task added value, calculate the best task item set. Among them, the task added value is a value assigned to each task in advance. For example, assume that the idle time is 50 minutes, and that the set of executable tasks includes: upgrading the software system of the user's vehicle (indicated by T1), upgrading the software system of the charging pile (indicated by T2), and maintaining the charging pile (indicated by T3) ). The additional value of tasks assigned to T1 is 1, the additional value of tasks assigned to T2 is 2, and the additional value of tasks assigned to T3 is 4. The service time of T1 is predicted to be 10 minutes, the service time of T2 is predicted to be 5 minutes, and the service time of T3 is predicted to be 5 minutes. The greedy principle can be used to obtain the best set of task items: maximize the total added value of the task on the premise that the predicted total time of the executable task does not exceed 50 minutes. The above-mentioned tasks T1, T2, and T3 are expected to take 20 minutes to complete, which does not exceed 50 minutes. Therefore, the tasks T1, T2, and T3 are all placed in the best task item set. If the executable task item set contains multiple T1, T2, and T3, the number of tasks in the best service item set is calculated according to the above-mentioned greedy principle.
[0089] It should be noted that the added value of the above tasks can be manually allocated or dynamically adjusted according to the load of the power-on resources. For example, in the case of a large number of charging facilities failures in the power-on service network, the task of restoring the service capacity of the charging facilities The added value is doubled to encourage service personnel to carry out maintenance work to eliminate subsequent hidden dangers.
[0090] In step S150, the service personnel are matched with the power-on request according to the best task item set. In this step, the service personnel have identification information, which is used to display the content of tasks that the service personnel can perform, that is, a label is attached to each service personnel in advance. Specifically, the default service personnel have the "power-on" label, that is, the basic skills of providing power-up services for electric vehicles as service personnel. In addition, for service personnel with other service capabilities, remarks by means of labels, for example, a service personnel’s label is "maintenance", "software upgrade", "hardware replacement", it means that the service personnel can also provide power-on services Upgrade the software system of the user's vehicle, upgrade the charging pile software system, and replace the charging pile hardware. In this way, when matching service personnel for power-on requests, the appropriate service personnel can be selected based on the best set of task items. Regarding the specific implementation form of the service staff's label, no detailed description will be given here. Refer below figure 2 Step S150 will be described in detail.
[0091] Such as figure 2 As shown, the specific steps of step S150 are: first, step S51 is executed, and within the cache time, it is retrieved whether there are service personnel who can perform the best set of task items alone within the second preset distance from the execution position of the power-on request. If yes, proceed to step S52 to directly match the retrieved service personnel for the power-on request. If not, go to step S53 to determine whether the retrieval time exceeds the cache time. If yes, proceed to step S54 to match the service personnel in the default manner. If not, go to step S55 and continue to search whether there are multiple service personnel who can perform the best set of task items together.
[0092] If yes, go to step S56, and assign the tasks in the best task item set to multiple service personnel for execution. Specifically, when the tasks in the task item set cannot be completed by one service personnel alone, at this time, multiple service personnel can cooperate to complete the tasks. For example, after the power-on service task is assigned to service personnel A, service personnel A can only complete part of the task or part of a task in the best task item set, and at this time, the power-on work (or not performed) Service personnel B of power-on work) can complete another part of the task in the best task item set or another part of one task. At this time, two service personnel A and B can be assigned to jointly complete the task in the best task item set. In some cases, three, four or more service personnel can also cooperate to complete the tasks in the best task set.
[0093] If multiple service personnel who can jointly perform the best set of task items are not retrieved, step S57 is entered to determine whether the retrieval time exceeds the cache time. If yes, proceed to step S58 to match the service personnel in the default manner. If not, proceed to step S59, expand the second preset distance to the third preset distance, and start execution again from step S51. For example, suppose that the second preset distance is 1 km, and the third preset distance is 2 km. Also, first search within 1 km of the execution location of the power-on request. If no suitable service personnel are retrieved and the retrieval time does not exceed the cache time of the service request, then continue to search within 2 km of the execution location of the power-on request. That is, if the appropriate service personnel are retrieved within the cache time, or the retrieval time exceeds the cache time, the service personnel will be matched by default.
[0094] The above-mentioned buffer time is also the preset buffer time (the buffer time can be customized according to specific application scenarios). The time spent in the process of matching service personnel usually does not exceed the cache time of the service request. Once the cache time of the service request is exceeded, the service personnel are matched in the default manner. The default method can be to directly match the service personnel who can complete the power-on service, and no longer consider the task of the best service item set; it can also be other traditional task assignment methods, that is, perform task assignment according to the existing power-on request processing method , I will not elaborate on it here.
[0095] As a preferred embodiment of the present invention, if the matched service personnel can individually perform the best task item set, then the tasks in the best task item set will be sorted, and the service personnel will execute the tasks in the best task item set in turn according to the sorting. task. If multiple service personnel are matched to jointly perform the best task item set, the tasks of the best task item set are split and assigned to the corresponding service personnel. If a single or multiple service personnel who can perform the best set of task items are not matched, the service request is matched with the service personnel in the default manner.
[0096] In summary, the combined task dispatching method of the present invention reasonably utilizes the service personnel and the service capabilities of the service personnel, so that the service personnel use the free time in the service process to perform other related services. On the one hand, the present invention solves the problem that in the case of a shortage of service personnel for power-on services, in order to save operating costs, combined with the entire power-on system, the free time of the service personnel during the power-up process is used to dispatch the service personnel to execute the current charging pile or the same The feedback tasks of other charging piles in the pile group improve the efficiency of the power-on system as a whole and save operating costs. On the other hand, the present invention also realizes the one-to-many service and the integrated service in the power-on service, that is, the different needs of multiple users can be met at the same time when the power-on service is once. For example, during the process of powering up a user's vehicle, the service personnel can also perform regular inspections of the user's vehicle, upgrade the firmware of the components in the vehicle, etc., and can also perform maintenance on nearby charging piles. The present invention comprehensively considers the service personnel and the resources and service capabilities mastered by the service personnel, dispatches the service personnel as a whole, makes full use of the free time of the service personnel, improves the systematic efficiency of the power-on service, and saves operating costs.
[0097] The invention also provides a combined task dispatching system. Reference image 3 , image 3 It is a schematic diagram of the structure of the combined task dispatching system of the present invention. Such as image 3 As shown, the dispatch system mainly includes a buffer unit, a prediction unit, and a scheduling dispatch unit. Preferably, in this embodiment, the combined task dispatching system further includes a data storage unit, which is used to store task information (such as task content, task execution location) and service staff information (such as service staff’s location, service status, service staff Posted identification information, etc.). Specifically, the service request sent by the user terminal is cached in the cache unit, and the prediction unit accesses the cache unit to predict the service time of the service request according to the execution location and specific content of the service request. The dispatching unit can access the database storage unit, and calculate the best task item set according to the service time and execution location of the service request; and match the service personnel for the service request according to the best task item set, that is, send the final task to the matching service personnel. Preferably, the prediction unit may also access the data storage unit, retrieve executable tasks around the execution location of the service request, and predict the service time of each executable task. The data storage unit is also used to record each service request.
[0098] For the specific implementation of the combined task dispatching system of the present invention, reference may be made to the description of the combined task dispatching method above, which will not be repeated here.
[0099] So far, the technical solutions of the present invention have been described in conjunction with the preferred embodiments shown in the drawings. However, those skilled in the art will readily understand that the protection scope of the present invention is obviously not limited to these specific embodiments. Without departing from the principle of the present invention, those skilled in the art can make equivalent changes or substitutions to the relevant technical features, and the technical solutions after these changes or substitutions will fall within the protection scope of the present invention.
