Working path planning method and device for roadside parking administrator, medium and equipment

Abstract

The embodiment of the invention provides a working path planning method and device for a roadside parking administrator, a medium and equipment. The method comprises the steps of determining a parking space position corresponding to a newly generated to-do list in response to a generation event of the to-do list; determining a target administrator according to the current workload of each administrator and the distance between each administrator and the parking space position of the newly generated to-do list; in to-be-processed parking spaces related to existing to-do items of the newly distributed to-do items of the target administrator, according to the priority level corresponding to the item type of the existing to-do items on each to-be-processed parking space, the distance between the target administrator and each to-be-processed parking space and the distance between every two to-be-processed parking spaces, the to-be-processed parking spaces are distributed according to the priority level corresponding to the item type of the existing to-do items on each to-be-processed parking space. Determining a processing sequence of the to-be-processed parking spaces; and according to the processing sequence, generating a corresponding working path for navigation. According to the technical scheme provided by the embodiment of the invention, the processing efficiency of the roadside parking to-do list can be improved, and the maximum utilization of human resources is realized.

Description

Technical Field

[0001] The present application relates to the technical field of roadside parking management, and in particular to a method, device, medium and equipment for planning a work path for a roadside parking manager. Background Art

[0002] With the acceleration of urbanization and the continuous growth of the number of motor vehicles, the problem of urban roadside parking management has become increasingly prominent. Effective roadside parking management is crucial to ensuring the smooth flow of urban roads, traffic safety and the rational use of parking resources. At present, roadside parking management is mainly carried out manually, that is, each road section is equipped with an administrator who is responsible for vehicle registration, vehicle dispatch, parking ticket printing and parking fee collection for all parking spaces in the road section. When there are to-do items to be processed, the background system will push messages to the administrator's PDA device, and the administrator will process them one by one according to the pushed messages. However, when multiple to-do items appear on the road section at the same time, it is difficult for the administrator to intuitively judge the processing order of each to-do item, resulting in low overall processing efficiency. In addition, in the above method, the administrator of each road section is fixed, and it only handles the affairs of the road section, which easily leads to the inability to flexibly allocate human resources according to the actual workload and the inability to maximize the utilization of human resources. Therefore, how to improve the processing efficiency of roadside parking to-do items and maximize the utilization of human resources has become a technical problem that needs to be solved urgently. Summary of the invention

[0003] The embodiments of the present application provide a work path planning method, device, medium and equipment for a roadside parking manager, which can improve the processing efficiency of roadside parking to-do items at least to a certain extent and maximize the utilization of human resources.

[0004] Other features and advantages of the present application will become apparent from the following detailed description, or may be learned in part by the practice of the present application.

[0005] According to one aspect of an embodiment of the present application, a working path planning method for a roadside parking administrator is provided, comprising:

[0006] In response to a to-do item generation event, determining a parking space location corresponding to the newly generated to-do item;

[0007] Determine a target administrator for processing the newly generated to-do items according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do items;

[0008] After the newly generated to-do items are distributed to the target administrator, the processing order of each of the to-be-processed parking spaces related to the existing to-do items of the target administrator is determined according to the priority level corresponding to the item type of the existing to-do items on each of the to-be-processed parking spaces, the distance between the target administrator and each of the to-be-processed parking spaces, and the distance between each of the to-be-processed parking spaces;

[0009] According to the processing sequence, a corresponding work path is generated to navigate the target administrator according to the work path.

[0010] According to one aspect of an embodiment of the present application, a working path planning device for a roadside parking administrator is provided, comprising:

[0011] A location determination module, for determining the parking space location corresponding to the newly generated to-do item in response to the to-do item generation event;

[0012] A personnel determination module, used to determine a target administrator for processing a newly generated to-do item according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do item;

[0013] An order determination module is used to determine the processing order of each of the to-be-processed parking spaces related to the existing to-do items of the target administrator after the newly generated to-do items are dispatched to the target administrator, according to the priority level corresponding to the item type of the existing to-do items on each of the to-be-processed parking spaces, the distance between the target administrator and each of the to-be-processed parking spaces, and the distance between each of the to-be-processed parking spaces;

[0014] The processing module is used to generate a corresponding work path according to the processing sequence, so as to navigate the target administrator according to the work path.

[0015] According to one aspect of an embodiment of the present application, a computer-readable medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the work path planning method for a roadside parking administrator as described in the above embodiment is implemented.

[0016] According to one aspect of an embodiment of the present application, an electronic device is provided, comprising: one or more processors; a storage device for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the work path planning method for roadside parking managers as described in the above embodiments.

[0017] According to one aspect of an embodiment of the present application, a computer program product or a computer program is provided, the computer program product or the computer program including computer instructions, the computer instructions being stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the working path planning method for a roadside parking administrator provided in the above embodiment.

[0018] In the technical solutions provided in some embodiments of the present application, by responding to the generation event of the to-do list, the parking space location corresponding to the newly generated to-do list is determined, and the target administrator for processing the newly generated to-do list is determined according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do list. In this way, it is possible to avoid excessive or insufficient workload of a single administrator, thereby maximizing the utilization of human resources. Then, in the to-be-processed parking spaces related to the existing to-do lists of the target administrator, the processing order of each to-be-processed parking space is determined according to the priority level corresponding to the item type of the existing to-do list on each to-be-processed parking space, the distance between the target administrator and the parking space location of each to-be-processed parking space, and the distance between the to-be-processed parking spaces, and then the corresponding work path is generated according to the processing order to navigate the target administrator according to the work path. In this way, the processing order of each to-do list can be reasonably planned, and the administrator only needs to process the to-do list according to the corresponding work path, thereby improving the processing efficiency of the to-do list.

[0019] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The drawings herein are incorporated into the specification and constitute a part of the specification, showing embodiments consistent with the present application, and together with the specification, are used to explain the principles of the present application. Obviously, the drawings described below are only some embodiments of the present application, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. In the drawings:

[0021] Figure 1 A schematic diagram showing a flow chart of a method for planning a working path for a roadside parking administrator according to an embodiment of the present application is shown;

[0022] Figure 2 A block diagram of a working path planning device for a roadside parking administrator according to an embodiment of the present application is shown;

[0023] Figure 3 A schematic diagram of the structure of a computer system suitable for implementing an electronic device of an embodiment of the present application is shown. DETAILED DESCRIPTION

[0024] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this application will be more comprehensive and complete and fully convey the concept of the example embodiments to those skilled in the art.

[0025] In addition, described feature, structure or characteristic can be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present application. However, those skilled in the art will appreciate that the technical scheme of the present application can be put into practice without one or more of the specific details, or other methods, components, devices, steps, etc. can be adopted. In other cases, known methods, devices, realizations or operations are not shown or described in detail to avoid blurring the various aspects of the application.

[0026] The block diagrams shown in the accompanying drawings are merely functional entities and do not necessarily correspond to physically independent entities. That is, these functional entities may be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0027] The flowcharts shown in the accompanying drawings are only exemplary and do not necessarily include all the contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps can be decomposed, and some operations / steps can be combined or partially combined, so the actual execution order may change according to actual conditions.

[0028] Figure 1 A flowchart of a method for planning a work path for a roadside parking administrator according to an embodiment of the present application is shown.

[0029] In one embodiment, the work path planning method for the roadside parking administrator can be applied to a server, which may be a physical server or a cloud server. The server can communicate with the mobile terminal of each administrator (such as a PDA (Personal Digital Assistant)) to manage and issue to-do items.

[0030] It should be noted that the working path planning method for roadside parking administrators provided in the embodiment of the present application is generally executed by a server, and accordingly, the working path planning device for roadside parking administrators is generally set in the server. However, in other embodiments of the present application, the terminal device may also have similar functions as the server, so as to execute the working path planning method for roadside parking administrators provided in the embodiment of the present application, and the terminal device may include but is not limited to one or more of a smart phone, a tablet computer, a portable computer, and a desktop computer.

[0031] The implementation details of the technical solution of the embodiment of the present application are described in detail below:

[0032] like Figure 1 As shown, the working path planning method of the roadside parking administrator includes at least steps S110 to S140, which are described in detail as follows:

[0033] In step S110 , in response to a to-do item generation event, a parking space location corresponding to the newly generated to-do item is determined.

[0034] The to-do items may be various tasks that need to be handled by the administrator during the roadside parking management process. These tasks are usually directly related to the use and management of parking spaces. The to-do items may include multiple types of items. In one example, the to-do items may include but are not limited to items to be registered, tickets to be printed, departure confirmation, patrol orders, reshoots, and key concerns.

[0035] Among them, "Pending registration" can mean when a new vehicle enters the parking space, and the administrator is required to register and record the vehicle information and entry time; "Pending ticketing" can mean when the vehicle is about to leave the parking space, and the administrator is required to print a parking receipt, record and collect the parking fee; "Pending departure confirmation" can mean that after the vehicle leaves the parking space, the administrator is required to confirm the departure of the vehicle and update the parking space status; "Pending patrol order" can mean that the administrator needs to patrol regularly to check the usage of the parking space to ensure the accuracy of the parking space information; "Pending re-photography" can mean that for vehicle information that cannot be automatically recorded, the administrator needs to manually re-photograph the vehicle to complete the record; "Key attention" can mean that some parking spaces require special attention due to special reasons, such as VIP parking spaces or faulty parking spaces.

[0036] In this embodiment, the server can monitor the parking status of each parking space. For example, the server can obtain the current image of each parking space through a camera to identify whether there is a vehicle parked there. Alternatively, the server can communicate with a number of sensors, each sensor being set corresponding to a parking space, and the sensor can detect whether there is a vehicle parked there.

[0037] When it is determined that there is a vehicle parked in a certain parking space, the server can determine the vehicle status of the parked vehicle in real time, such as whether there is corresponding license plate information, whether it has been registered, whether it has been ticketed, whether it has reached the inspection time, etc. If a certain item has not been processed, a to-do item corresponding to the parking space can be generated. For example, when it is determined that the vehicle in the parking space does not have corresponding license plate information, a to-do item to be registered will be generated for the parking space; for vehicles with license plate information, it will be determined whether the vehicle has printed a parking ticket. If not, a to-do item to be ticketed will be generated for the parking space, and so on.

[0038] It should be understood that since there is a certain correlation between to-do items and parking spaces, the server can determine the corresponding parking space location based on the newly generated to-do items, so that the subsequent administrator can clearly know which parking space has unprocessed to-do items, and then process the to-do items after arriving at the parking space location.

[0039] In one example, the parking space location can be represented in the form of longitude and latitude coordinates, for example, the parking space location of the parking space can be represented by the longitude and latitude coordinates of the center point of the parking space. Those skilled in the art can predetermine the longitude and latitude coordinates of the center point corresponding to each parking space, and store them in correspondence with the corresponding parking space identification for subsequent processing.

[0040] In one embodiment, the working path planning method of the roadside parking administrator further includes:

[0041] Determine the actual route of the target section according to the starting point coordinates and the end point coordinates of the target section;

[0042] The actual route length of the target section is divided according to the preset number of parking spaces, and the parking space position of each parking space on the target section is determined.

[0043] In this embodiment, the target road section may be a road section that needs parking space planning. The manager may specify the starting point coordinates and the end point coordinates of the target road section on the map. The server may call the map API interface to obtain the actual situation of the target road section and generate the actual route of the target road section. Then, the server may evenly distribute the actual route of the target road section according to the pre-set number of parking spaces according to the length of the actual route of the target road section to obtain the parking space position of each parking space on the target road section.

[0044] It should be noted that the preset number of parking spaces can be pre-set by technical personnel in this field based on prior experience, and target road sections of different lengths correspond to different preset numbers of parking spaces to meet the basic size of each parking space and not affect others or traffic. This application does not make any special limitations on this.

[0045] Please continue to refer to Figure 1In step S120, the target administrator for processing the newly generated to-do items is determined according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do items.

[0046] In this embodiment, when the server distributes the to-do items, it needs to consider the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do items, so as to determine which administrator will handle the newly generated to-do items. It should be noted that when considering the current workload of each administrator, in addition to considering the number of to-do items that the administrator already has, it is also necessary to consider the urgency of each to-do item, that is, which to-do items need to be processed immediately and which to-do items can be processed later. The two are considered comprehensively to ensure the accuracy of the administrator's current workload.

[0047] It should be understood that the administrator with less current workload and closer to the parking space location of the newly generated to-do item is more likely to receive the newly generated to-do item. After determining the target administrator for processing the newly generated to-do item, the server can dispatch the newly generated to-do item to the target administrator for processing.

[0048] In one embodiment, determining a target administrator for processing a newly generated to-do item according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do item includes:

[0049] From the administrators within the predetermined range of the parking space location of the newly generated to-do items, the number of to-do items previously held by each administrator and the item type of each to-do item are obtained;

[0050] The administrators are arranged in ascending order according to the number, and the administrator who ranks before the predetermined proportion and has the least to-do items of the predetermined type is determined as the target administrator.

[0051] In this embodiment, after determining the parking space location corresponding to the newly generated to-do item, the server can query the administrators within its predetermined range with the parking space location as the center. Then, the number of to-do items that each administrator already has and the item type of each to-do item are obtained. Each administrator is sorted in order from small to large according to the number of existing to-do items, and the administrators ranked before a predetermined proportion (such as 20%) are selected. Then, the number of to-do items of the predetermined type in the hands of each administrator is determined, and the administrator with the least number of to-do items of the predetermined type is determined as the target administrator, that is, the optimal administrator.

[0052] It should be noted that the to-do items of the scheduled type may be to-do items of a relatively high urgency, for example, the scheduled type may be to-do items to be registered, to-do items to be issued tickets, and so on.

[0053] Therefore, by comprehensively considering the current workload of the administrator and the distance between each administrator and the parking space location of the newly generated to-do item, the target administrator is determined, and the rationality of the determined target administrator can be guaranteed.

[0054] In one embodiment, after determining the administrators within the predetermined range of the parking space location of the newly generated to-do item, the server may first select the top X% of administrators closest to the parking space location to perform subsequent target administrator determination, thereby reducing the amount of calculation of the server and improving the efficiency of target administrator determination. The specific value of X may be determined by those skilled in the art based on prior experience and is not particularly limited thereto.

[0055] Please continue to refer to Figure 1 In step S130, after the newly generated to-do items are distributed to the target administrator, the processing order of each to-do parking space related to the existing to-do items of the target administrator is determined according to the priority level corresponding to the item type of the existing to-do items on each to-do parking space, the distance between the target administrator and each to-do parking space, and the distance between each of the to-do parking spaces.

[0056] In this embodiment, technical personnel in this field can determine the corresponding priority level for each item type based on prior experience. The higher the priority level, the more urgent the to-do item is and the more urgent it needs to be processed as soon as possible. The lower the priority level, the more urgent the to-do item can be processed later.

[0057] In one example, the priority levels can be divided into urgent, high, medium and low, and the corresponding urgency levels are in descending order. Those skilled in the art can determine the corresponding priority level for each type of matter, for example, the priority level corresponding to pending registration, pending ticketing and pending departure confirmation is urgent, the priority level corresponding to patrol orders is high, the priority level corresponding to pending reshoots is medium, the priority level corresponding to special attention is low, and so on.

[0058] It should be understood that when determining the processing order of each parking space to be processed, in addition to considering the priority level corresponding to the item type of each existing to-do item on the parking space to be processed, it is also necessary to consider the distance between the target administrator and each parking space to be processed, as well as the distance between the next parking space to be processed and the previous parking space to be processed whose processing order has been determined.

[0059] Therefore, after the newly generated to-do items are dispatched to the target administrator, the server can determine the parking spaces to be processed (i.e., the parking spaces with to-do items) related to the existing to-do items of the target administrator (including the newly generated to-do items), and determine the processing order of each parking space to be processed according to the priority level corresponding to the item type of the existing to-do items on each parking space to be processed, the distance between the target administrator and each parking space to be processed, and the distance between each parking space to be processed. After determining the processing order of each parking space to be processed, the administrator only needs to go to each parking space to be processed one by one according to the processing order to process the to-do items, without the need for independent judgment, thereby improving the processing efficiency of the to-do items.

[0060] In one embodiment, among the to-be-processed parking spaces related to the existing to-do items of the target administrator, the processing order of each to-be-processed parking space is determined according to the priority level corresponding to the item type of the existing to-do items on each to-be-processed parking space, the distance between the target administrator and each to-be-processed parking space, and the distance between each of the to-be-processed parking spaces, including:

[0061] Among the to-be-processed parking spaces related to the existing to-do items of the target administrator, determining the first order score of each to-be-processed parking space according to the priority level corresponding to the item type of the existing to-do items on each to-be-processed parking space and the distance between the target administrator and each to-be-processed parking space;

[0062] Determining an initial parking space from the parking spaces to be processed according to the first sequence scores of the parking spaces to be processed;

[0063] Among the parking spaces to be processed other than the initial parking space, the processing order of each parking space to be processed is determined one by one according to the second sequence score of each parking space to be processed, wherein the second sequence score is determined according to the priority level corresponding to the item type of the existing to-do items on each parking space to be processed and the distance between each parking space to be processed and the parking space to be processed whose processing order was determined last time.

[0064] In this embodiment, when determining the processing order of each parking space to be processed, the server may first comprehensively consider the priority level corresponding to the item type of the existing to-do items on each parking space to be processed and the distance between the target administrator and each parking space to be processed, thereby determining the first order score of each parking space to be processed, and the first order score may be used to characterize the degree to which each parking space to be processed must be the first to arrive and process. It should be understood that the closer the target administrator is to the parking space to be processed, the higher the priority level of the existing to-do items on the parking space to be processed, the higher the first order score corresponding to the parking space to be processed, and the higher the first order score corresponding to the parking space to be processed, the more likely it is that the target administrator will arrive at the parking space first and process the to-do items.

[0065] Therefore, after determining the first order scores corresponding to the parking spaces to be processed, the server may select one of the parking spaces to be processed as the initial parking space, and the parking space position of the initial parking space is the starting position of the subsequent working path.

[0066] In one example, the server may determine the to-be-processed parking space with the highest first sequence score as the initial parking space. If two or more to-be-processed parking spaces have the same first sequence score, the to-be-processed parking space closest to the target administrator may be determined as the initial parking space.

[0067] Next, after determining the initial parking space, the server can determine the processing order of each parking space to be processed one by one from the remaining parking spaces to be processed according to the second order scores corresponding to the remaining parking spaces to be processed. It should be noted that the second order scores are determined according to the priority level corresponding to the item type of the existing to-do items on each parking space to be processed and the distance between each parking space to be processed and the parking space to be processed whose processing order was determined last time.

[0068] Specifically, after determining the initial parking space, the server can determine the second sequence scores corresponding to the remaining parking spaces to be processed based on the priority levels corresponding to the types of existing to-do items in the remaining parking spaces to be processed, and the distances between each to-be-processed parking space and the initial parking space. The server can determine the second to-be-processed parking space to be processed based on the second sequence score. The determination method can refer to the aforementioned method for determining the initial parking space, which will not be repeated here.

[0069] Next, the server recalculates the second order score of each parking space to be processed that has not yet determined the processing order according to the priority level corresponding to the existing event type on the parking space to be processed that has not yet determined the processing order, and the distance between each parking space to be processed and the second parking space to be processed, and determines the third parking space to be processed based on this. By repeating the above steps, after multiple rounds of calculations, the server can determine the processing order of each parking space to be processed one by one.

[0070] In this way, by calculating the first sequence score or the second sequence score corresponding to each parking space to be processed and then determining the processing sequence of each parking space to be processed, the rationality of the determined processing sequence can be ensured and the processing efficiency of the to-do items can be improved.

[0071] In one embodiment, when determining the first sequence score or the second sequence score, the roadside parking administrator's work path planning method includes:

[0072] Determine the priority score corresponding to each of the parking spaces to be processed according to the priority level corresponding to the item type of the existing to-do items on each of the parking spaces to be processed;

[0073] Determine the distance score corresponding to each of the parking spaces to be processed according to the distance between each of the parking spaces to be processed and the target administrator or the parking space to be processed whose processing order was determined last time, wherein the distance score is positively correlated with the distance;

[0074] The priority score corresponding to each of the parking spaces to be processed is subtracted from the distance score to obtain the first order score or the second order score corresponding to each of the parking spaces to be processed.

[0075] In this embodiment, those skilled in the art can determine the corresponding priority score for each priority level of the to-do items in advance based on prior experience. For example, if the priority level is urgent, the corresponding priority score is 100, if the priority level is high, the corresponding priority score is 80, if the priority level is medium, the corresponding priority score is 60, if the priority level is low, the corresponding priority score is 40, etc. It should be noted that the above values ​​are only illustrative examples, and those skilled in the art can determine the priority score corresponding to each priority level according to actual needs, or calculate the priority score in other ways, and this application does not make any special restrictions on this.

[0076] In this way, the server can query and determine the corresponding priority score according to the priority level corresponding to the item type of each existing to-do item on the to-be-processed parking space, and use it as the priority score of the to-be-processed parking space. It should be noted that if there are multiple existing to-do items on a certain to-be-processed parking space, the average of the multiple priority scores or the highest priority score can be taken as the priority score corresponding to the to-be-processed parking space.

[0077] Next, the server can determine the distance score corresponding to each parking space to be processed according to the distance between each parking space to be processed and the target administrator or the parking space to be processed that has been determined in the previous processing order. The distance score is positively correlated with the distance, that is, the greater the distance, the higher the corresponding distance score, and vice versa, the smaller the distance, the lower the corresponding distance score. For example, if the distance between the two is 10m, the corresponding distance score is 10, if the distance between the two is 50m, the corresponding distance score is 50, and so on.

[0078] Finally, for each parking space to be processed, the server can subtract the distance score from its corresponding priority score to obtain the first order score or the second order score corresponding to the parking space to be processed. In this way, through the above determination process, the urgency of the pending tasks on the parking space to be processed and the distance between the parking spaces to be processed can be comprehensively considered, ensuring the rationality of the determined first order score and the second order score.

[0079] It should be noted that in the actual application process, the server may also consider other factors, such as weather conditions, traffic conditions, and emergency demand lights of parking space users, to adjust the processing order of the determined parking spaces to be processed, so as to further ensure the rationality of the determined processing order.

[0080] Please continue to refer to Figure 1 In step S140, a corresponding work path is generated according to the processing sequence to navigate the target administrator according to the work path.

[0081] In this embodiment, after determining the processing order of each parking space to be processed by the target administrator, the server can generate a corresponding work path according to the processing order, and the work path can be used to indicate the order and action path of the target administrator when processing each existing to-do item. Specifically, the server can use the shortest path algorithm according to the parking space location of each parking space to be processed, and calculate the action path of the target administrator to each parking space to be processed in turn, and then obtain a complete work path. In particular, since the administrator basically walks or rides to handle the to-do items, the work path can be planned in a walking and cycling navigation mode.

[0082] After determining the work path of the target administrator, the server can send it to the mobile terminal of the target administrator and display it in the mobile terminal during the work process of the target administrator to navigate the target administrator and guide the target administrator to handle the to-do items according to the optimal path.

[0083] Therefore, in Figure 1 In the illustrated embodiment, by responding to the generation event of the to-do items, the parking space position corresponding to the newly generated to-do items is determined, and the target administrator for processing the newly generated to-do items is determined according to the current workload of each administrator and the distance between each administrator and the parking space position of the newly generated to-do items. In this way, it is possible to avoid excessive or insufficient workload of a single administrator, thereby maximizing the utilization of human resources. Then, among the to-be-processed parking spaces related to the existing to-do items of the target administrator, the processing order of each to-be-processed parking space is determined according to the priority level corresponding to the item type of the existing to-do items on each to-be-processed parking space, the distance between the target administrator and the parking space position of each to-be-processed parking space, and the distance between the to-be-processed parking spaces, and then the corresponding work path is generated according to the processing order to navigate the target administrator according to the work path. In this way, the processing order of each to-do item can be reasonably planned, and the administrator only needs to process the to-do items according to the corresponding work path, thereby improving the processing efficiency of the to-do items.

[0084] In some embodiments of the present application, the working path planning method of the roadside parking administrator further includes:

[0085] If any to-do item has not been processed after exceeding the preset time, the priority level of the to-do item is increased;

[0086] According to the increased priority level, the processing order of each parking space to be processed by the administrator is re-determined to update the work path.

[0087] In this embodiment, the server can monitor the processing status of each to-do item in real time. If a to-do item has not been processed after exceeding a preset time, the server can increase the priority of the to-do item. Then, based on the to-do item with increased priority, the server recalculates the processing order of all the to-do parking spaces of the corresponding administrator, and then updates the work path of the administrator to avoid the impact caused by a to-do item timing out and not being processed.

[0088] It should be noted that the preset duration can be predetermined by a person skilled in the art based on prior experience. In one example, a person skilled in the art can only set a preset duration, and if all to-do items have not been processed after the preset duration, their corresponding priority level will be increased. In other examples, a person skilled in the art can also set a preset duration for each item type, and the higher the priority level of the item type, the shorter the preset duration corresponding to it, and the lower the priority level of the item type, the longer the preset duration corresponding to it, so that the rationality of the preset duration setting can be guaranteed.

[0089] In some embodiments of the present application, the working path planning method of the roadside parking administrator further includes:

[0090] When navigating the target administrator, different color markings are used in the display interface of the mobile terminal of the target administrator to indicate the priority level corresponding to each to-do item.

[0091] In this embodiment, the server can use different color labels to display the priority levels of the to-do items owned by each administrator when navigating the target administrator. For example, if the priority level is urgent, the corresponding color label is red, if the priority level is high, the corresponding color label is orange, if the priority level is medium, the corresponding color label is yellow, if the priority level is low, the corresponding color label is blue, and so on.

[0092] In one example, during the navigation process for the target administrator, the display interface of the target administrator's mobile terminal can display the work path, and each parking space to be processed can be displayed in the work path in the form of a node. Then, each node can extend at least one card, and a card can correspond to a to-do item. The type of the to-do item can be written on the card, and the color of the card corresponds to the priority level of the to-do item type. In this way, it is convenient for the administrator to intuitively understand the number of to-do items for each parking space to be processed and the urgency of each to-do item, so as to quickly process them.

[0093] Based on the aforementioned embodiment, the target administrator can process the to-do items on hand one by one according to the generated work path. If an emergency occurs during the processing, such as adding new to-do items, adjusting the priority of to-do items, etc., the server can also update the work path of the target administrator in real time according to the aforementioned embodiment to navigate the target administrator, thereby improving the processing efficiency of each to-do item.

[0094] The following describes an apparatus embodiment of the present application, which can be used to execute the working path planning method for roadside parking administrators in the above-mentioned embodiments of the present application. For details not disclosed in the apparatus embodiment of the present application, please refer to the embodiment of the working path planning method for roadside parking administrators in the above-mentioned embodiments of the present application.

[0095] Figure 2 A block diagram of a working path planning device for a roadside parking administrator according to an embodiment of the present application is shown.

[0096] Reference Figure 2 As shown, according to an embodiment of the present application, a working path planning device for a roadside parking administrator includes:

[0097] A location determination module, for determining the parking space location corresponding to the newly generated to-do item in response to the to-do item generation event;

[0098] A personnel determination module, used to determine a target administrator for processing a newly generated to-do item according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do item;

[0099] An order determination module is used to determine the processing order of each of the to-be-processed parking spaces related to the existing to-do items of the target administrator after the newly generated to-do items are dispatched to the target administrator, according to the priority level corresponding to the item type of the existing to-do items on each of the to-be-processed parking spaces, the distance between the target administrator and each of the to-be-processed parking spaces, and the distance between each of the to-be-processed parking spaces;

[0100] The processing module is used to generate a corresponding work path according to the processing sequence, so as to navigate the target administrator according to the work path.

[0101] In some embodiments of the present application, among the to-be-processed parking spaces related to the existing to-do items of the target administrator, the processing order of each to-be-processed parking space is determined according to the priority level corresponding to the item type of the existing to-do items on each to-be-processed parking space, the distance between the target administrator and each to-be-processed parking space, and the distance between each of the to-be-processed parking spaces, including:

[0102] Among the to-be-processed parking spaces related to the existing to-do items of the target administrator, determining the first order score of each to-be-processed parking space according to the priority level corresponding to the item type of the existing to-do items on each to-be-processed parking space and the distance between the target administrator and each to-be-processed parking space;

[0103] Determining an initial parking space from the parking spaces to be processed according to the first sequence scores of the parking spaces to be processed;

[0104] Among the parking spaces to be processed other than the initial parking space, the processing order of each parking space to be processed is determined one by one according to the second sequence score of each parking space to be processed, wherein the second sequence score is determined according to the priority level corresponding to the item type of the existing to-do items on each parking space to be processed and the distance between each parking space to be processed and the parking space to be processed whose processing order was determined last time.

[0105] In some embodiments of the present application, when determining the first sequence score or the second sequence score, it includes:

[0106] Determine the priority score corresponding to each of the parking spaces to be processed according to the priority level corresponding to the item type of the existing to-do items on each of the parking spaces to be processed;

[0107] Determine the distance score corresponding to each of the parking spaces to be processed according to the distance between each of the parking spaces to be processed and the target administrator or the parking space to be processed whose processing order was determined last time, wherein the distance score is positively correlated with the distance;

[0108] The priority score corresponding to each of the parking spaces to be processed is subtracted from the distance score to obtain the first order score or the second order score corresponding to each of the parking spaces to be processed.

[0109] In some embodiments of the present application, determining a target administrator for processing a newly generated to-do item according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do item includes:

[0110] From the administrators within the predetermined range of the parking space location of the newly generated to-do items, the number of to-do items previously held by each administrator and the item type of each to-do item are obtained;

[0111] The administrators are arranged in order of the number from small to large, and the administrator who ranks before the predetermined proportion and has the least number of to-do items of the predetermined type is determined as the target administrator.

[0112] In some embodiments of the present application, the processing module is further used to:

[0113] When navigating the target administrator, different color markings are used in the display interface of the mobile terminal of the target administrator to indicate the priority level corresponding to each to-do item.

[0114] In some embodiments of the present application, the processing module is further used to:

[0115] If any to-do item has not been processed after exceeding the preset time, the priority level of the to-do item is increased;

[0116] According to the increased priority level, the processing order of each parking space to be processed by the administrator is re-determined to update the work path.

[0117] In some embodiments of the present application, the processing module is further used to:

[0118] Determine the actual route of the target section according to the starting point coordinates and the end point coordinates of the target section;

[0119] The actual route length of the target section is divided according to the preset number of parking spaces, and the parking space position of each parking space on the target section is determined.

[0120] Figure 3 A schematic diagram of the structure of a computer system suitable for implementing an electronic device of an embodiment of the present application is shown.

[0121] It should be noted that Figure 3 The computer system of the electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0122] like Figure 3As shown, the computer system includes a central processing unit (CPU) 301, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 302 or the program loaded from the storage part 308 to the random access memory (RAM) 303, such as executing the method described in the above embodiment. In RAM 303, various programs and data required for system operation are also stored. CPU 301, ROM 302 and RAM 303 are connected to each other through bus 304. Input / output (I / O) interface 305 is also connected to bus 304.

[0123] The following components are connected to the I / O interface 305: an input section 306 including a keyboard, a mouse, etc.; an output section 307 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker; a storage section 308 including a hard disk, etc.; and a communication section 309 including a network interface card such as a LAN (Local Area Network) card, a modem, etc. The communication section 309 performs communication processing via a network such as the Internet. A drive 310 is also connected to the I / O interface 305 as needed. A removable medium 311, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 310 as needed so that a computer program read therefrom is installed into the storage section 308 as needed.

[0124] In particular, according to an embodiment of the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a computer program for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication section 309, and / or installed from a removable medium 311. When the computer program is executed by a central processing unit (CPU) 301, various functions defined in the system of the present application are executed.

[0125] It should be noted that the computer-readable medium shown in the embodiment of the present application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a 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 above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by an instruction execution system, device or device or used in combination with it. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, wherein a computer-readable computer program is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate, or transmit programs for use by or in conjunction with an instruction execution system, apparatus, or device. The computer program contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0126] The flowchart and block diagram in the accompanying drawings illustrate the possible architecture, functions and operations of the system, method and computer program product according to various embodiments of the present application. Wherein, each box in the flowchart or block diagram can represent a module, a program segment, or a part of the code, and the above-mentioned module, program segment, or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flowchart, and the combination of boxes in the block diagram or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0127] The units involved in the embodiments described in this application may be implemented by software or hardware, and the units described may also be set in a processor. The names of these units do not, in some cases, constitute limitations on the units themselves.

[0128] As another aspect, the present application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiment; or may exist independently without being assembled into the electronic device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by an electronic device, the electronic device implements the method described in the above embodiment.

[0129] It should be noted that, although several modules or units of the equipment for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into being embodied by multiple modules or units.

[0130] Through the description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the implementation methods of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the implementation methods of the present application.

[0131] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the embodiments disclosed herein. The present application is intended to cover any variations, uses or adaptations of the present application, which follow the general principles of the present application and include common knowledge or customary technical means in the art that are not disclosed in the present application.

[0132] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.

Claims

1. A working path planning method for a roadside parking manager, characterized in that: include: In response to a to-do item generation event, determining a parking space location corresponding to the newly generated to-do item; Determine a target administrator for processing the newly generated to-do items according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do items; After the newly generated to-do items are distributed to the target administrator, the processing order of each of the to-be-processed parking spaces related to the existing to-do items of the target administrator is determined according to the priority level corresponding to the item type of the existing to-do items on each of the to-be-processed parking spaces, the distance between the target administrator and each of the to-be-processed parking spaces, and the distance between each of the to-be-processed parking spaces; According to the processing sequence, a corresponding work path is generated to navigate the target administrator according to the work path.

2. The method according to claim 1, characterized in that Among the parking spaces to be processed that are related to the existing to-do items of the target administrator, the processing order of each parking space to be processed is determined according to the priority level corresponding to the item type of the existing to-do items on each parking space to be processed, the distance between the target administrator and each parking space to be processed, and the distance between each of the parking spaces to be processed, including: Among the to-be-processed parking spaces related to the existing to-do items of the target administrator, determining the first order score of each to-be-processed parking space according to the priority level corresponding to the item type of the existing to-do items on each to-be-processed parking space and the distance between the target administrator and each to-be-processed parking space; Determining an initial parking space from the parking spaces to be processed according to the first sequence scores of the parking spaces to be processed; Among the parking spaces to be processed other than the initial parking space, the processing order of each parking space to be processed is determined one by one according to the second sequence score of each parking space to be processed, wherein the second sequence score is determined according to the priority level corresponding to the item type of the existing to-do items on each parking space to be processed and the distance between each parking space to be processed and the parking space to be processed whose processing order was determined last time.

3. The method according to claim 2, characterized in that When determining the first sequence score or the second sequence score, it includes: Determine the priority score corresponding to each of the parking spaces to be processed according to the priority level corresponding to the item type of the existing to-do items on each of the parking spaces to be processed; Determine the distance score corresponding to each of the parking spaces to be processed according to the distance between each of the parking spaces to be processed and the target administrator or the parking space to be processed whose processing order was determined last time, wherein the distance score is positively correlated with the distance; The priority score corresponding to each of the parking spaces to be processed is subtracted from the distance score to obtain the first order score or the second order score corresponding to each of the parking spaces to be processed.

4. The method according to claim 1, characterized in that: Determining a target administrator for processing the newly generated to-do items according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do items includes: From the administrators within the predetermined range of the parking space location of the newly generated to-do items, the number of to-do items previously held by each administrator and the item type of each to-do item are obtained; The administrators are arranged in order of the number from small to large, and the administrator who ranks before the predetermined proportion and has the least number of to-do items of the predetermined type is determined as the target administrator.

5. The method according to any one of claims 1 to 4, characterized in that The method further comprises: When navigating the target administrator, different color markings are used in the display interface of the mobile terminal of the target administrator to indicate the priority level corresponding to each to-do item.

6. The method according to any one of claims 1 to 4, characterized in that The method further comprises: If any to-do item has not been processed after exceeding the preset time, the priority level of the to-do item is increased; According to the increased priority level, the processing order of each parking space to be processed by the administrator is re-determined to update the work path.

7. The method according to claim 1, characterized in that The method further comprises: Determine the actual route of the target section according to the starting point coordinates and the end point coordinates of the target section; The actual route length of the target section is divided according to the preset number of parking spaces, and the parking space position of each parking space on the target section is determined.

8. A working path planning device for a roadside parking administrator, characterized in that: include: A location determination module, for determining the parking space location corresponding to the newly generated to-do item in response to the to-do item generation event; A personnel determination module, used to determine a target administrator for processing a newly generated to-do item according to the current workload of each administrator and the distance between each administrator and the parking space location of the newly generated to-do item; An order determination module is used to determine the processing order of each of the to-be-processed parking spaces related to the existing to-do items of the target administrator after the newly generated to-do items are dispatched to the target administrator, according to the priority level corresponding to the item type of the existing to-do items on each of the to-be-processed parking spaces, the distance between the target administrator and each of the to-be-processed parking spaces, and the distance between each of the to-be-processed parking spaces; The processing module is used to generate a corresponding work path according to the processing sequence, so as to navigate the target administrator according to the work path.

9. A computer readable medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, a working path planning method for a roadside parking administrator according to any one of claims 1 to 7 is implemented.

10. An electronic device, characterized in that: include: one or more processors; A storage device for storing one or more programs, which, when executed by the one or more processors, enables the one or more processors to implement the work path planning method for roadside parking administrators as described in any one of claims 1 to 7.

Images