Garbage cleaning vehicle path optimization method, device, equipment and storage medium

By determining the initial garbage collection path and adjusting the target path according to real-time requests in the garbage cleaning vehicle path optimization method, the problem of inability to respond to real-time garbage cleaning requests in a timely manner in the prior art is solved, reducing resource waste and improving garbage collection efficiency.

CN114330864BActive Publication Date: 2024-12-06CHINA UNITED NETWORK COMM GRP CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111603661.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-24
Publication Date
2024-12-06
Estimated Expiration
2041-12-24

AI Technical Summary

Technical Problem

The existing technology cannot dynamically adjust the garbage collection path according to real-time garbage cleaning requests, resulting in the inability to collect garbage in time or waste of resources.

Method used

By determining the initial garbage collection path and adjusting the target garbage collection path according to the target garbage cleaning vehicle and the initial path when receiving a new request, we will optimize the garbage collection path, ensure timely response to new requests and reduce resource waste.

Benefits of technology

It realizes a timely response to newly received garbage cleaning requests, reduces resource waste caused by temporary dispatch vehicles, and improves garbage collection efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114330864B_ABST
    Figure CN114330864B_ABST
Patent Text Reader

Abstract

This application provides a method, apparatus, device, and storage medium for optimizing the route of garbage collection vehicles. The method includes: determining an initial garbage collection route; sending the initial garbage collection route to the corresponding garbage collection vehicle; if a garbage collection request is received, determining a target garbage collection vehicle based on the initial garbage collection route, and determining a target garbage collection route based on the target garbage collection vehicle and the corresponding initial garbage collection route, wherein the target garbage collection vehicle is the garbage collection vehicle that collects garbage from the garbage collection point corresponding to the garbage collection request; sending the target garbage collection route to the target garbage collection vehicle to control the target garbage collection vehicle to continue traveling along the target garbage collection route and collecting garbage from the garbage collection points along the target garbage collection route. The method of this application can respond to garbage collection requests in a timely manner, collect garbage promptly, and optimize garbage collection routes, thereby reducing resource waste.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of intelligent transportation technology, and in particular to a method, device, equipment and storage medium for optimizing the path of a garbage collection vehicle. Background Art

[0002] When collecting garbage, urban garbage collection operating companies can carry out route planning to achieve the goals of minimizing the mileage of garbage collection vehicles, ensuring that garbage collection vehicles arrive at a certain time, and using the least number of garbage collection vehicles.

[0003] The path planning in the prior art is all planned for the existing garbage collection requests before the vehicle departs. In actual situations, the urban garbage operation company will receive garbage collection requests from time to time. Therefore, after the vehicle departs, it may receive new garbage collection requests. The garbage collection points that issue these requests may not be in the garbage collection path planned before the vehicle departs, or may be garbage collection points that the vehicle has already cleaned. For these new garbage collection requests, the urban garbage operation company can only add them to the next garbage collection path planning, or temporarily send a garbage collection vehicle to collect the garbage at the garbage collection point.

[0004] Therefore, the path planning in the prior art either fails to collect garbage in time or temporarily dispatches vehicles, resulting in waste of resources. It is also impossible to dynamically adjust the garbage collection path according to real-time garbage collection requests to reduce waste of resources while collecting garbage in time. Summary of the invention

[0005] The present application provides a method, device, equipment and storage medium for optimizing the path of a garbage collection vehicle, so as to solve the problem in the prior art that the garbage collection path cannot be dynamically adjusted according to real-time garbage collection requests, thereby reducing the waste of resources while timely cleaning the garbage.

[0006] According to a first aspect of the present application, a method for optimizing a garbage collection vehicle path is provided, comprising:

[0007] determining an initial garbage collection path corresponding to at least one garbage collection vehicle;

[0008] Sending the initial garbage collection path to a corresponding garbage collection vehicle to control the garbage collection vehicle to travel along the corresponding initial garbage collection path and collect garbage at a garbage collection point in the initial garbage collection path;

[0009] If a garbage collection request is received, a target garbage collection vehicle is determined according to the initial garbage collection path, and a target garbage collection path is determined according to the target garbage collection vehicle and the corresponding initial garbage collection path, wherein the target garbage collection vehicle is a garbage collection vehicle that collects garbage at the garbage collection point corresponding to the garbage collection request;

[0010] The target garbage collection path is sent to a target garbage removal vehicle to control the target garbage removal vehicle to continue traveling along the target garbage collection path and collect garbage at garbage collection points in the target garbage collection path.

[0011] According to a second aspect of the present application, a garbage cleaning vehicle path optimization device is provided, comprising:

[0012] a path determination module, for determining an initial garbage collection path corresponding to at least one garbage collection vehicle;

[0013] A sending module, used for sending the initial garbage collection path to a corresponding garbage collection vehicle, so as to control the garbage collection vehicle to travel along the corresponding initial garbage collection path and collect garbage at a garbage collection point in the initial garbage collection path;

[0014] A vehicle determination module, configured to determine a target garbage collection vehicle according to the initial garbage collection path if a garbage collection request sent by a new garbage collection point is received, wherein the target garbage collection vehicle is a garbage collection vehicle that collects garbage at the garbage collection point corresponding to the garbage collection request;

[0015] A path optimization module, used to determine a target garbage collection path according to the target garbage collection vehicle and the corresponding initial garbage collection path;

[0016] The sending module is also used to send the target garbage collection path to the target garbage collection vehicle to control the target garbage collection vehicle to continue traveling along the target garbage collection path and collect garbage at the garbage collection point in the target garbage collection path.

[0017] According to a third aspect of the present application, there is provided an electronic device, comprising: a memory, a processor and a transceiver;

[0018] The memory, the processor and the transceiver circuit are interconnected;

[0019] The memory stores computer-executable instructions;

[0020] The transceiver is used for sending and receiving data;

[0021] The processor executes the computer-executable instructions stored in the memory to implement the method as described in the first aspect.

[0022] According to a fourth aspect of the present application, a non-transitory computer-readable storage medium storing computer-executable instructions is provided, wherein the computer-executable instructions are used to implement the method as described in the first aspect when executed by a processor.

[0023] According to the garbage collection vehicle path optimization method, device, equipment and storage medium of the present application, after the initial garbage collection path of each garbage collection vehicle is determined, if a garbage collection request is received again, the target garbage collection vehicle is determined according to the initial garbage collection path, and the target garbage collection path is determined according to the target garbage collection vehicle and the corresponding initial garbage collection path. The target garbage collection vehicle is a garbage collection vehicle that collects garbage at the garbage collection point corresponding to the garbage collection request. The initial garbage collection path can be dynamically adjusted according to the real-time garbage collection request, so that the selected target garbage collection vehicle on the initial garbage collection path changes the initial garbage collection path to the target garbage collection path including the garbage collection point corresponding to the garbage collection request, so that the garbage at the garbage collection point corresponding to the newly received garbage collection request can be collected in time by optimizing the garbage collection path, effectively reducing the waste of resources caused by temporary dispatch of vehicles. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0025] Figure 1 An application scenario diagram of the garbage cleaning vehicle path optimization method provided in an embodiment of the present application;

[0026] Figure 2 Another application scenario diagram of the garbage cleaning vehicle path optimization method provided in the embodiment of the present application;

[0027] Figure 3 A schematic diagram of a process flow of a method for optimizing a garbage cleaning vehicle path according to a first embodiment of the application;

[0028] Figure 4 A schematic diagram of a flow chart of a method for optimizing a garbage cleaning vehicle path according to a second embodiment of the present application;

[0029] Figure 5 A schematic diagram of a process flow of a method for optimizing a garbage cleaning vehicle path according to a third embodiment of the present application;

[0030] Figure 6 A schematic diagram of a flow chart of a method for optimizing a garbage collection vehicle path according to a fourth embodiment of the present application;

[0031] Figure 7A schematic diagram of the structure of a garbage cleaning vehicle path optimization device provided in the seventh embodiment of the present application;

[0032] Figure 8 A block diagram of an electronic device provided for the eighth embodiment of the present application.

[0033] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0034] First, the prior art involved in this application is described and analyzed in detail.

[0035] In the prior art, the path planning for urban garbage collection is to plan the path of the garbage collection vehicle according to the existing garbage collection request before the vehicle sets off. The garbage collection vehicle operates according to the planned path, and at the same time, certain constraints are set, such as the total operating time of the garbage collection vehicle. The estimated conditions are calculated according to the cleaning plan path information. When the estimated conditions meet the constraints, the operation continues, and when the estimated conditions do not meet the constraints, the operation stops. Alternatively, the path planning is directly carried out for fixed garbage collection points, with the goal of minimizing the time to pass through all garbage collection points, minimizing the total distance, and minimizing the number of vehicles used, and optimizing the path planning algorithm.

[0036] However, in reality, urban waste operating companies will receive garbage collection requests from time to time. These garbage collection requests may be received after the route planning is completed and the garbage collection truck sets out, or they may be issued again from a garbage collection point that has already been cleaned by the garbage collection truck. For these garbage collection requests that were not considered during route planning, they can generally only be responded to in the next route planning, by adding the garbage collection point to the route, or by temporarily dispatching a new garbage collection truck to the garbage collection point to clean up the garbage in response to the garbage collection request from the garbage collection point.

[0037] Therefore, for garbage collection requests received after the vehicle sets out, if the garbage collection vehicle is dispatched to collect the garbage during the next route planning, it will not be conducive to timely collection of the garbage in the garbage collection point, resulting in residents being unable to put out new garbage or the garbage being stored for too long; if a new garbage collection vehicle is dispatched to collect the garbage, it will cause a waste of resources when the number of garbage collection requests is small.

[0038] Therefore, in the face of the problems in the prior art, in order to collect the garbage at the garbage collection point corresponding to the newly received garbage cleaning request in a timely manner, the inventors found that under certain circumstances, for example, the garbage collection vehicle that has been performing garbage collection on the initial garbage collection path is just very close to the garbage collection point corresponding to the newly received garbage cleaning request and / or the time it takes to travel to the garbage collection point corresponding to the newly received garbage cleaning request is short. Therefore, the target garbage collection path can be determined by optimizing the initial garbage collection path, and the target garbage collection vehicle that has been performing garbage collection on the initial garbage collection path can collect the garbage at the garbage collection point corresponding to the newly received garbage cleaning request in a timely manner along the target garbage collection path. Not only can the garbage collection request be responded to in a timely manner, and the garbage at the garbage collection point corresponding to the newly received garbage cleaning request can be collected in a timely manner, but also the waste of resources caused by the temporary dispatch of vehicles can be effectively reduced.

[0039] The terms used in this application are explained below.

[0040] Garbage collection point: refers to the place for collecting garbage set up by the city in accordance with regulations, which can collect garbage thrown by residents in the city and store it temporarily waiting for cleaning.

[0041] The network architecture and application scenarios of the garbage cleaning vehicle path optimization method provided in the embodiment of the present application are introduced below. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements.

[0042] like Figure 1 As shown, a network architecture corresponding to an application scenario provided in an embodiment of the present application includes: an electronic device 11, at least two garbage collection point devices 12, and at least one garbage cleaning vehicle 13.

[0043] The electronic device 11 is communicatively connected to at least one garbage collection vehicle 13 and is communicatively connected to at least two garbage collection point devices 12 .

[0044] The garbage collection point device 12 is set in the garbage collection point, and can send a garbage cleaning request to the electronic device 11 when the garbage storage amount in the garbage collection point exceeds a predetermined value or the garbage storage time exceeds a predetermined time. The garbage cleaning request includes the location information of the corresponding garbage collection point.

[0045] The electronic device 11 determines an initial garbage collection path corresponding to at least one garbage collection vehicle. The initial garbage collection path is an optimal path determined according to the initial garbage collection request with the goal of minimizing vehicle mileage, arriving at a certain time, and using the least number of vehicles. The initial garbage collection path may be planned by the electronic device 11 according to the initial garbage collection request, or may be pre-stored in the electronic device 11.

[0046] The electronic device 11 sends the initial garbage collection path to the corresponding garbage collection vehicle 13, so as to control the garbage collection vehicle 13 to travel along the corresponding initial garbage collection path and collect garbage at the garbage collection point in the initial garbage collection path. Alternatively, the initial garbage collection path is pre-set in the garbage collection vehicle, so as to travel along the initial garbage collection path and collect garbage at the garbage collection point in the initial garbage collection path.

[0047] If the electronic device 11 receives a garbage collection request sent by the garbage collection point device 12, the target garbage collection vehicle is determined according to the initial garbage collection path, and the target garbage collection path is determined according to the target garbage collection vehicle and the corresponding initial garbage collection path. The target garbage collection vehicle is a garbage collection vehicle that collects garbage at the garbage collection point corresponding to the garbage collection request. The electronic device 11 sends the target garbage collection path to the target garbage collection vehicle to control the target garbage collection vehicle to continue to travel along the target garbage collection path and collect garbage at the garbage collection point in the target garbage collection path.

[0048] like Figure 2 As shown, a network architecture corresponding to another application scenario provided in an embodiment of the present application includes: an electronic device 11 and at least one garbage collection vehicle 13.

[0049] The client of the garbage collection vehicle path optimization application software in the electronic device 11 or the electronic device 11 accesses the website of the garbage collection vehicle path optimization method. The user triggers the garbage collection vehicle path optimization request through the operation interface of the client or the webpage corresponding to the website. The garbage collection vehicle path optimization request includes: the initial garbage collection path, the garbage collection request and the location information of the corresponding garbage collection point.

[0050] The garbage collection vehicle 13 travels along the initial garbage collection path and collects the garbage in the garbage collection point.

[0051] After receiving the garbage collection vehicle path optimization request triggered by the user, the electronic device 11 determines the target garbage collection vehicle according to the initial garbage collection path, and determines the target garbage collection path according to the target garbage collection vehicle and the corresponding initial garbage collection path. The target garbage collection vehicle is a garbage collection vehicle that collects garbage at the garbage collection point corresponding to the garbage collection request. At the same time, the target garbage collection vehicle and the target garbage collection path are displayed in real time in the client operation interface or web page of the garbage collection vehicle path optimization application software, so that the user can view the target garbage collection vehicle and the target garbage collection path in real time, and can choose whether to send the target garbage collection path to the target garbage collection vehicle through the electronic device through the "Confirm" component.

[0052] The technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems are described in detail below with specific embodiments. The implementation methods described in the following embodiments do not represent all implementation methods consistent with the present application. On the contrary, they are only examples of devices and methods consistent with some aspects of the present application as detailed in the attached claims.

[0053] Embodiment 1

[0054] Figure 3 FIG. 1 is a flow chart of a method for optimizing a garbage cleaning vehicle path according to the first embodiment of the present application. Figure 3 As shown, the execution subject of the present application is a garbage collection vehicle path optimization device, and the garbage collection vehicle path optimization device is located in an electronic device. The garbage collection vehicle path optimization method provided in this embodiment includes the following steps.

[0055] Step 301, determining an initial garbage collection path corresponding to at least one garbage collection vehicle.

[0056] The initial garbage collection path may be a garbage collection path corresponding to the garbage collection vehicle in the optimal path determined by the electronic device 11 according to the initial garbage collection request, with the goal of minimizing vehicle mileage, vehicles arriving at a certain time, and using the least number of vehicles. The optimal path can collect garbage from all garbage collection points in the initial garbage collection request, and minimize all transportation costs in the path. All transportation costs in the path include the operating cost of collecting garbage from all garbage collection points in the path, the distance cost to all garbage collection points, the use cost of garbage collection vehicles, the time cost of collecting all garbage, etc.

[0057] The garbage cleaning request is sent by the garbage collection point device to the electronic device after the amount of garbage stored in the garbage collection point exceeds a predetermined value or the storage time exceeds a certain period of time. The garbage cleaning request may include the location information of the corresponding garbage collection point.

[0058] The initial garbage cleaning request may be a garbage cleaning request sent by all garbage collection point devices and received by the electronic device within a predetermined time period, for example, from 0:00 to 4:00 every day.

[0059] In this embodiment, the distance refers to road mileage.

[0060] Step 302, sending the initial garbage collection path to the corresponding garbage collection vehicle to control the garbage collection vehicle to travel along the corresponding initial garbage collection path and collect garbage at the garbage collection point in the initial garbage collection path.

[0061] A communication module may be provided on the garbage collection vehicle to communicate with the electronic device. Different garbage collection vehicles may have different paths in the initial garbage collection path, and the electronic device communicates with the communication module to send the initial garbage collection path to the corresponding garbage collection vehicle to control the garbage collection vehicle to travel along the corresponding initial garbage collection path.

[0062] Step 303: If a garbage collection request is received, a target garbage collection vehicle is determined based on the initial garbage collection path, and a target garbage collection path is determined based on the target garbage collection vehicle and the corresponding initial garbage collection path. The target garbage collection vehicle is a garbage collection vehicle that collects garbage at the garbage collection point corresponding to the garbage collection request.

[0063] The garbage cleaning request is a request received when the garbage cleaning vehicle travels along the corresponding initial garbage collection path. It may be received before the garbage cleaning vehicle reaches the first garbage collection point, or after the garbage cleaning vehicle has cleaned up the garbage at a part of the garbage collection points in the initial garbage collection path, or after the garbage cleaning vehicle has collected all the garbage at the garbage collection points in the initial garbage collection path. For example, it may be all garbage cleaning requests received by the electronic device within a second predetermined time period after the predetermined time period. The garbage cleaning request may be issued by the garbage collection point device. The garbage cleaning request may include: the garbage collection point corresponding to the garbage cleaning request and its location information.

[0064] In this embodiment, for the convenience of description, the garbage collection point corresponding to the garbage cleaning request is referred to as the new garbage collection point, and the garbage collection point in the initial garbage cleaning request is referred to as the initial garbage collection point. The new garbage collection point may not be the initial garbage collection point, or it may be the initial garbage collection point. The new garbage collection point that is not the initial garbage collection point may be: within the predetermined time period, the garbage storage volume does not exceed the predetermined value, and the garbage storage time does not exceed the predetermined time. However, after the garbage cleaning vehicle sets out, the garbage storage volume exceeds the predetermined value or the storage time exceeds the predetermined time. The new garbage collection point that is the initial garbage collection point may be: after the garbage cleaning vehicle collects the garbage in the garbage cleaning point, new garbage is put in, and the new garbage storage volume exceeds the predetermined value. The initial garbage collection point.

[0065] Depending on the number of new garbage collection points, the target garbage cleaning vehicle can be any one or more of all garbage cleaning vehicles. Specifically, if the number of new garbage collection points is one, the target garbage cleaning vehicle can be the one with the shortest distance from the new garbage collection point, or one of the garbage cleaning vehicles whose distance from the new garbage collection point is less than a predetermined distance value. If the number of new garbage collection points is multiple, the target garbage cleaning vehicles can be multiple, and the method for determining one target garbage cleaning vehicle can be used to determine multiple target garbage cleaning vehicles in sequence. The target garbage cleaning vehicle that collects garbage from the same new garbage collection point may also be the same. The electronic device can communicate with the garbage cleaning vehicle to determine the location of the garbage cleaning vehicle, or a GPS positioning device can be set on the garbage cleaning vehicle in advance to obtain the location of the garbage cleaning vehicle, and then determine the distance between the garbage cleaning vehicle and the new garbage collection point.

[0066] The electronic device can determine the target garbage collection path based on the target garbage collection vehicle and the corresponding initial garbage collection path. Specifically, if the number of new garbage collection points is one, and the target garbage collection vehicle is the one with the shortest distance from the new garbage collection point, the electronic device can determine the cleaned garbage collection points and uncleaned garbage collection points in the initial garbage collection path corresponding to the target garbage collection vehicle by communicating with the target garbage collection vehicle, and use the shortest path search algorithm to obtain the target garbage collection path with the goal of minimizing the distance between all uncleaned garbage collection points and new garbage collection points.

[0067] In addition to the above implementations, other methods may be used to determine the target garbage collection vehicle for collecting garbage at a new garbage collection point and optimize the target garbage collection path, which is not limited in this embodiment.

[0068] Step 304, sending the target garbage collection path to the target garbage collection vehicle to control the target garbage collection vehicle to continue traveling along the target garbage collection path and collect garbage at the garbage collection points in the target garbage collection path.

[0069] After receiving the target garbage collection path, the target garbage collection vehicle abandons the initial garbage collection path and continues to drive along the target garbage collection path to ensure that the target garbage collection vehicle can go to the new garbage collection point and collect garbage.

[0070] In this embodiment, the garbage collection vehicle path optimization method determines an initial garbage collection path corresponding to at least one garbage collection vehicle, and sends the initial garbage collection path to the corresponding garbage collection vehicle to control the garbage collection vehicle to travel along the corresponding initial garbage collection path and collect garbage at the garbage collection point in the initial garbage collection path. If a garbage collection request is received, a target garbage collection vehicle is determined according to the initial garbage collection path, and a target garbage collection path is determined according to the target garbage collection vehicle and the corresponding initial garbage collection path. The target garbage collection vehicle is a garbage collection vehicle that collects garbage at the garbage collection point corresponding to the garbage collection request. The target garbage collection path is sent to the target garbage collection vehicle to control the target garbage collection vehicle to continue to travel along the target garbage collection path and collect garbage at the garbage collection point in the target garbage collection path. After receiving the garbage collection request, the target garbage collection vehicle and the target garbage collection path that collect garbage at the garbage collection point corresponding to the garbage collection request are determined, and the target garbage collection path is sent to the target garbage collection vehicle, so that the initial garbage collection path can be adjusted in real time according to the garbage collection request, and the garbage at the garbage collection point corresponding to the newly received garbage collection request can be collected in time by optimizing the garbage collection path, effectively reducing the waste of resources caused by temporary dispatch of vehicles.

[0071] Embodiment 2

[0072] Figure 4 FIG. 1 is a flow chart of a method for optimizing a garbage cleaning vehicle path according to a second embodiment of the present application. Figure 4 As shown, the garbage collection vehicle path optimization method provided in this embodiment is based on the first embodiment. In step 303, the garbage collection request includes the location information of the new garbage collection point; and the target garbage collection vehicle is determined according to the initial garbage collection path in step 303. In this embodiment, the target garbage collection vehicle is determined according to the initial garbage collection path in step 303 is refined into steps 401 to 403.

[0073] Step 401 , determining candidate garbage collection paths and candidate distances after adding a garbage collection point corresponding to a garbage cleaning request to the initial garbage collection path according to the location information of the garbage collection point and the initial garbage collection path.

[0074] The electronic device can determine the cleaned garbage collection points and uncleaned garbage collection points in the initial garbage collection path corresponding to the garbage collection vehicle by communicating with the garbage collection vehicle. The electronic device can replan the paths of the uncleaned garbage collection points and the garbage collection points corresponding to the garbage collection request to obtain the candidate garbage collection paths and candidate distances corresponding to each garbage collection vehicle. When each garbage collection vehicle travels along the corresponding candidate garbage collection path, it can collect garbage from the uncleaned garbage collection points and also collect garbage from the garbage collection points corresponding to the garbage collection request.

[0075] Step 402, calculating the candidate time when the garbage collection vehicle travels on the corresponding candidate garbage collection path.

[0076] In this embodiment, the distance traveled by the garbage collection vehicle can be calculated according to the order of all garbage collection points passed in the initial garbage collection path and the location information of the garbage collection points that have been cleaned, and the average speed of the garbage collection vehicle can be obtained by dividing the distance traveled by the travel time. The candidate time can be obtained by dividing the candidate distance by the average speed.

[0077] Step 403, determining a target garbage collection vehicle corresponding to the garbage collection point corresponding to the garbage collection request according to the candidate distance and the candidate time.

[0078] In this embodiment, the garbage collection vehicle corresponding to the candidate garbage collection path with the shortest candidate distance or the shortest candidate time is selected as the target garbage collection vehicle.

[0079] Alternatively, in this embodiment, weights are set for the candidate distances and candidate times respectively, the candidate distances and candidate times are weightedly summed, and the garbage collection vehicle with the smallest weighted sum result is selected as the target garbage collection vehicle.

[0080] In this embodiment, when the target garbage collection vehicle is determined according to the initial garbage collection path, the target garbage collection vehicle is a garbage collection vehicle that collects garbage at the garbage collection point corresponding to the garbage collection request, and the candidate garbage collection paths and candidate distances after adding the garbage collection point corresponding to the garbage collection request to the initial garbage collection path are determined according to the location information of the garbage collection point and the initial garbage collection path; the candidate time when the garbage collection vehicle is traveling on the corresponding candidate garbage collection path is calculated; the target garbage collection vehicle corresponding to the garbage collection point corresponding to the garbage collection request is determined according to the candidate distance and the candidate time; because the initial garbage collection paths of all garbage collection vehicles are re-planned as candidate garbage collection paths, a path with the shortest distance and / or the shortest time can be selected among the candidate garbage collection paths according to the candidate distance and the candidate time, which can further save resources and reduce the vehicle's driving distance or garbage cleaning time while timely cleaning up the garbage in the garbage collection point.

[0081] As an optional implementation, step 402 further includes steps 4021 and 4022.

[0082] Step 4021, calculating the adjusted increase time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path.

[0083] The increase time of the candidate garbage collection path can be obtained by dividing the increase distance by the average speed, and the increase time is the time required for the garbage collection vehicle to travel the increase distance. In this embodiment, the candidate garbage collection path can be compared with the initial garbage collection path to determine whether the number of traffic lights in the candidate garbage collection path has increased. If it is determined that the number of traffic lights has increased, the adjusted increase time is set according to the number of traffic lights that have increased. The adjusted increase time can be the product of the number of traffic lights and the preset waiting time. For example, if it is determined that the number of traffic lights has increased by 2 and the preset waiting time is 30 seconds, the adjusted increase time can be 60 seconds.

[0084] Step 4022, adjusting the candidate time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path according to the adjusted increased time.

[0085] In this embodiment, the adjusted added time may be added to the candidate time to obtain the adjusted candidate time when the garbage collection vehicle travels on the corresponding candidate garbage collection path.

[0086] In the present embodiment, the adjusted increased time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path is calculated, and the candidate time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path is adjusted according to the adjusted increased time. Since the adjusted increased time is calculated and the candidate time is adjusted according to the adjusted increased time, a more accurate candidate time can be obtained, and furthermore, a target garbage collection vehicle that can save more resources can be determined based on the more accurate candidate time.

[0087] Embodiment 3

[0088] Figure 5 FIG. 1 is a flow chart of a method for optimizing a garbage cleaning vehicle path according to a third embodiment of the present application. Figure 5 As shown, the garbage collection vehicle path optimization method provided in this embodiment refines step 4021 on the basis of embodiment 2. In this embodiment, step 4021 is refined into steps 501 to 504.

[0089] Step 501, obtaining traffic light information on a driving path associated with a new garbage collection point in a candidate garbage collection path.

[0090] In this embodiment, the positions of the traffic lights that the garbage collection vehicle will pass by along the candidate garbage collection route, the states of the traffic lights, and the changing patterns of the traffic lights are determined in sequence in the map.

[0091] Step 502, determining the state of each traffic light when the garbage collection vehicle drives to the traffic light.

[0092] In this embodiment, the next traffic light that the garbage collection vehicle passes and the distance to the next traffic light of the vehicle can be determined in the candidate garbage collection path according to the real-time position of the garbage collection vehicle. The speed limit range of the road section where the garbage collection vehicle travels to the next traffic light is obtained. The time when the garbage collection vehicle travels to the next traffic light is obtained by dividing the distance between the garbage collection vehicle and the next traffic light by the highest value of the speed limit range or the average speed of all vehicles on the road section. According to the time when the garbage collection vehicle travels to the next traffic light and the change pattern of the traffic light, the state of the traffic light when the garbage collection vehicle travels to the next traffic light is determined, and the state of the traffic light includes: red light, yellow light and green light.

[0093] Step 503, determining the increased waiting time of the garbage truck when the garbage collection vehicle is traveling according to the state of the traffic light.

[0094] In this embodiment, if it is determined that the state of the traffic light is green when the garbage collection vehicle drives to the next traffic light, it is not necessary to wait for the traffic light. If it is determined that the traffic light is red or yellow when the garbage collection vehicle drives to the next traffic light, it is necessary to wait for the traffic light. The time required to wait for the traffic light is determined according to the changing rules of the traffic light, and the time required to wait for the traffic light is included in the garbage truck waiting time. It is determined in sequence whether it is necessary to wait for the traffic light when passing through all the traffic lights. If it is determined that it is necessary to wait for the traffic light, the time required to wait for the traffic light is included in the increased garbage truck waiting time.

[0095] Step 504, obtaining an adjusted increase time according to the increased garbage truck waiting time.

[0096] In this embodiment, the increased waiting time for the garbage truck is used as the adjusted increased time, or the product of the increased waiting time for the garbage truck and a predetermined correction coefficient is used as the adjusted increased time.

[0097] In this embodiment, by acquiring traffic light information in the candidate garbage collection path, the status of the traffic lights when the garbage collection vehicle travels to each traffic light is determined, the increased waiting time of the garbage truck when the garbage collection vehicle travels is determined according to the status of the traffic lights, and the adjusted increased time is obtained according to the increased waiting time of the garbage truck; since the increased waiting time of the garbage truck is calculated by determining whether to wait for the traffic light, and the increased waiting time of the garbage truck is used as the adjusted increased time, a more accurate adjusted increased time is determined, so that a more accurate candidate time can be obtained, and the target garbage collection vehicle is determined according to the more accurate candidate time.

[0098] As an optional implementation, in a specific area such as a factory area or a suburb, the traffic lights include: a controllable traffic light and an uncontrollable traffic light. After step 502, steps 5021 to 5023 may be included.

[0099] Step 5021, if it is determined that the state of the traffic light is yellow or red when the garbage truck drives to the next traffic light, it is determined whether the traffic light is a controllable traffic light or an uncontrollable traffic light.

[0100] Step 5022: If it is determined that the traffic light is a controllable traffic light, the changing rule of the traffic light is controlled so that when the garbage collection vehicle drives to the traffic light, the state of the traffic light is green.

[0101] In this embodiment, the controllable traffic light can communicate with the electronic device and can receive the control signal of the electronic device to change the change rule, such as extending the green light time, shortening the red light time, extending the yellow light time, or changing the change frequency of the red light, green light, and yellow light. After determining the next traffic light that the garbage collection vehicle will pass and the time to drive to the next traffic light, it can be checked in the preset controllable traffic light list whether the traffic light is a controllable traffic light when the garbage collection vehicle drives to it. The preset controllable traffic light list can be adjusted according to the situation of a specific area.

[0102] In the present embodiment, if it is determined that the state of the traffic light is yellow or red when the garbage collection vehicle drives to the next traffic light, then the traffic light is judged to be a controllable traffic light or an uncontrollable traffic light; if it is determined that the traffic light is a controllable traffic light, the changing pattern of the traffic light is controlled so that when the garbage collection vehicle drives to the traffic light, the state of the traffic light is green; because the state of the traffic light is green when the garbage collection vehicle is controlled to drive to the traffic light in a specific area, the increased waiting time of the garbage truck is reduced, and further, the candidate time is reduced, so that a target garbage collection vehicle with a more optimized path can be determined, thereby further saving resources.

[0103] Embodiment 4

[0104] Figure 6 FIG. 4 is a flow chart of a method for optimizing a garbage cleaning vehicle path according to a fourth embodiment of the present application. Figure 6 As shown, the garbage collection vehicle path optimization method provided in this embodiment refines step 403 on the basis of the second embodiment. In this embodiment, step 403 is refined into steps 601 to 602.

[0105] Step 601, determining a candidate garbage collection vehicle corresponding to the garbage collection point according to the candidate distance and the candidate time.

[0106] Specifically, the candidate distances and candidate times may be sorted from short to long, and a candidate garbage collection path having both a candidate distance in the top 50% and a candidate time in the top 50% may be selected, and the garbage collection vehicle corresponding to the candidate garbage collection path may be used as a candidate garbage collection vehicle.

[0107] Step 602, selecting a target garbage collection vehicle from candidate garbage collection vehicles.

[0108] In this embodiment, any candidate garbage collection vehicle can be selected as the target garbage collection vehicle. Alternatively, for any candidate garbage collection vehicle, the candidate distance and candidate time of the corresponding candidate garbage collection path are weighted, the candidate distance and candidate time are weighted summed, and the candidate garbage collection vehicle with the smallest weighted sum is selected as the target garbage collection vehicle.

[0109] As an optional implementation, step 601 may be further refined to include steps 6011 to 6013.

[0110] Step 6011, compare the candidate distance with a preset distance threshold, and compare the candidate time with a preset time threshold.

[0111] Step 6012, if it is determined that the candidate distance is less than the preset distance threshold and the candidate time is less than the preset time threshold, the corresponding garbage collection vehicle is determined as a candidate garbage collection vehicle;

[0112] Step 6013: If it is determined that the candidate distance is greater than or equal to the preset distance threshold and / or the candidate time is greater than or equal to the preset time threshold, the corresponding garbage collection vehicle is not determined as a candidate garbage collection vehicle.

[0113] Specifically, a preset distance threshold may be set according to the energy value that the garbage collection vehicle can carry, for example, the preset distance is set to the distance that the vehicle can travel with 90% of the energy value that the vehicle can carry. A preset time threshold may be set according to the time allowed for vehicle operation. A preset time threshold may be set according to real-time traffic conditions, for example, a larger preset time threshold may be set when the real-time traffic condition is relatively congested, and a smaller preset time threshold may be set when the real-time traffic condition is relatively smooth.

[0114] The candidate distance is compared with a preset distance threshold, and the candidate time is compared with a preset time threshold. If it is determined that the candidate distance is less than the preset distance threshold and the candidate time is less than the preset time threshold, the corresponding garbage collection vehicle is determined as a candidate garbage collection vehicle to ensure that the energy carried by the garbage collection vehicle is sufficient to go to the new collection point to collect garbage, and the operation time does not exceed the specified time.

[0115] If it is determined that the candidate distance is greater than or equal to the preset distance threshold and / or the candidate time is greater than or equal to the preset time threshold, the corresponding garbage removal vehicle is not determined as a candidate garbage removal vehicle.

[0116] As an optional implementation, step 602 may be further refined to include step 6021 to step 6022.

[0117] Step 6021, calculate the matching score according to the increased distance and increased time corresponding to the candidate garbage collection vehicle.

[0118] Specifically, the matching score may be set to 1 / increased distance + 1 / increased time. Alternatively, a distance matching score may be set for the increased distance, so that the shorter the increased distance is, the higher the distance matching score is; a time matching score may be set for the increased time, so that the shorter the increased time is, the higher the time matching score is; and the matching score of the candidate garbage collection vehicle may be equal to the sum of the distance matching score of the corresponding candidate path increased distance and the time matching score of the corresponding candidate path increased time.

[0119] Step 6022, determining the candidate garbage collection vehicle with the largest matching score as the target garbage collection vehicle.

[0120] In this embodiment, the matching score is calculated based on the increased distance and increased time corresponding to the candidate garbage cleaning vehicles, and the candidate garbage cleaning vehicle with the largest matching score is determined as the target garbage cleaning vehicle. Since the increased distance and increased time are comprehensively considered, the target garbage cleaning vehicle with a more optimized path can be more accurately determined.

[0121] Embodiment 5

[0122] Based on any one of the above embodiments, the garbage collection request includes garbage attribute information. The garbage collection vehicle path optimization method provided in this embodiment refines step 401. In this embodiment, step 401 is refined to include: determining the candidate garbage collection paths and candidate distances after adding the garbage collection point corresponding to the garbage collection request to the initial garbage collection path based on the location information of the garbage collection point, the garbage attribute information, the garbage collection attribute information allowed to be collected by the garbage collection vehicle, and the initial garbage collection path.

[0123] In this embodiment, the garbage attribute information may include any one or more of the garbage type, garbage volume, and garbage weight. The garbage collection vehicle is allowed to collect garbage attribute information may be any one or more of the garbage type, garbage volume, and garbage weight corresponding to the garbage attribute information.

[0124] When using the method in any of the above embodiments to determine candidate garbage collection paths, for any garbage collection request, all garbage collection vehicles can be screened according to the attributes of the garbage that the garbage collection vehicles are allowed to collect, and the garbage collection vehicles whose garbage attribute information that the garbage collection vehicles are allowed to collect matches the garbage attribute information in the garbage collection request are used as candidate garbage collection vehicles. Then, according to the location information of the garbage collection point corresponding to the garbage collection request, the garbage collection point is added to the initial garbage collection path corresponding to the garbage collection vehicle, and the shortest path search algorithm is used to re-plan the garbage collection path to determine the candidate garbage collection path.

[0125] Garbage attribute information matching can be: the type of garbage that the garbage collection vehicle is allowed to collect is the same as the type of garbage in the garbage collection request, the volume of garbage that the garbage collection vehicle is allowed to collect is greater than or equal to the volume of garbage in the garbage collection request, and the weight of garbage that the garbage collection vehicle is allowed to collect is greater than or equal to the weight of garbage in the garbage collection request.

[0126] As an optional implementation, the candidate garbage collection paths after adding new garbage collection points to the initial garbage collection path are determined based on the location information of the garbage collection point, the garbage attribute information, the garbage collection attribute information allowed by the garbage collection vehicle, and the initial garbage collection path, and are refined into steps 701 to 702.

[0127] Step 701: Determine, based on the garbage attribute information, an initial garbage collection path that matches the attribute information of the garbage collection vehicle that is allowed to collect the garbage.

[0128] In this embodiment, the initial garbage collection path can be planned according to the garbage attribute information in the initial garbage cleaning request. The corresponding garbage collection points with the same garbage attribute in the initial garbage cleaning request can be cleaned in the same initial garbage collection path using the same garbage cleaning vehicle. The garbage attribute information that the garbage cleaning vehicle is allowed to clean can change according to the garbage collection points that have been cleaned while traveling along the initial garbage collection path. For example, the weight of garbage that the garbage cleaning vehicle is allowed to clean can decrease as the number of garbage collection points that have been cleaned increases. A garbage cleaning vehicle that matches the garbage attribute information in the garbage cleaning request can be searched among all garbage cleaning vehicles as a candidate garbage cleaning vehicle, and the initial garbage collection path corresponding to the matching garbage cleaning vehicle is used as the matching initial garbage collection path.

[0129] Step 702 : determining candidate garbage collection paths after adding new garbage collection points to the matched initial garbage collection path according to the location information of the garbage collection points and the matched initial garbage collection path.

[0130] Specifically, according to the location information of the garbage collection point corresponding to the garbage cleaning request, the garbage collection point is added to the matching initial garbage collection path, and the paths of the garbage collection point and the uncleaned garbage collection points in the initial garbage collection path are replanned to obtain candidate garbage collection paths.

[0131] In this embodiment, the candidate garbage collection paths and candidate distances after adding the garbage collection point corresponding to the garbage collection request to the initial garbage collection path are determined according to the location information of the garbage collection point, the garbage attribute information, the garbage attribute information allowed to be cleared by the garbage collection vehicle, and the initial garbage collection path. Since the garbage collection vehicles whose garbage attribute information allowed to be cleared matches the garbage attribute in the garbage collection request are screened out as candidate garbage, the garbage attribute information allowed to be cleared by the target garbage collection vehicle determined from the candidate garbage collection vehicles matches the garbage attribute information in the garbage collection request, which can make full use of the load capacity and space of the garbage collection vehicle and further save resources.

[0132] As an optional implementation, the garbage attribute information includes: garbage type, garbage weight and garbage volume. Step 701 may be refined to include steps 801 to 803.

[0133] Step 801, obtaining the types of garbage that the garbage collection vehicle is allowed to collect, and the weight and volume of the remaining garbage after collecting the garbage on the initial garbage collection path.

[0134] Specifically, the garbage collection vehicle may be preset with one or more types of garbage that are allowed to be collected. The garbage weight and garbage volume of all garbage collection points in the initial garbage collection request may be summed up to obtain the used weight and used volume of the garbage collection vehicle. The remaining garbage weight is obtained by subtracting the used weight from the load weight of the garbage collection vehicle, and the remaining garbage volume is obtained by subtracting the used volume from the load volume of the garbage collection vehicle.

[0135] Step 802: If it is determined that the garbage type included in the garbage removal request is within the garbage type allowed to be collected by the garbage removal vehicle, and the remaining garbage weight is greater than the garbage weight, and the remaining garbage volume is greater than the garbage volume, then the garbage removal vehicle is determined to be a matching garbage removal vehicle.

[0136] Step 803: determine the initial garbage collection path corresponding to the matching garbage collection vehicle as the matching initial garbage collection path.

[0137] In this embodiment, a matching initial garbage collection path is determined to ensure that the garbage collection vehicle can collect the garbage at the new garbage collection point, avoiding the problem of overweight, overvolume or wrong type of garbage collected due to the garbage collection vehicle changing the path to collect new garbage. While the garbage is collected in a timely manner, a garbage collection vehicle with remaining garbage weight and remaining garbage volume is used to collect new garbage, so that the path of the garbage collection vehicle is further optimized.

[0138] Based on any of the above embodiments, the weight of the garbage is detected by a pressure sensor located in the garbage collection point, the pressure sensor is located at the bottom of the garbage collection container in the garbage collection point, and the volume of the garbage is measured by an optical sensor located in the garbage collection point, the optical sensor is located on the garbage collection container in the garbage collection point. Exemplarily, it can be the upper part of the inner wall of the garbage collection container to measure the volume of the garbage.

[0139] Embodiment 7

[0140] Figure 7 This is a schematic diagram of the structure of a garbage cleaning vehicle path optimization device provided in the seventh embodiment of the present application. The garbage cleaning vehicle path optimization device provided in this embodiment is located in an electronic device. The garbage cleaning vehicle path optimization device 70 includes: a path determination module 71, a sending module 72, a vehicle determination module 73, and a path optimization module 74.

[0141] The path determination module 71 is used to determine an initial garbage collection path corresponding to at least one garbage collection vehicle.

[0142] The sending module 72 is used to send the initial garbage collection path to the corresponding garbage collection vehicle to control the garbage collection vehicle to travel along the corresponding initial garbage collection path and collect garbage at the garbage collection point in the initial garbage collection path.

[0143] The vehicle determination module 73 is used to determine a target garbage collection vehicle according to an initial garbage collection path if a garbage collection request is received, wherein the target garbage collection vehicle is a garbage collection vehicle that collects garbage at a garbage collection point corresponding to the garbage collection request.

[0144] The path optimization module 74 is used to determine the target garbage collection path according to the target garbage collection vehicle and the corresponding initial garbage collection path.

[0145] The sending module 72 is also used to send the target garbage collection path to the target garbage collection vehicle to control the target garbage collection vehicle to continue traveling along the target garbage collection path and collect garbage at the garbage collection points in the target garbage collection path.

[0146] Optionally, in the garbage collection vehicle path optimization device provided in this embodiment, the vehicle determination module 73 is also used to determine, based on the location information of the garbage collection point and the initial garbage collection path, each candidate garbage collection path and candidate distance after adding the garbage collection point corresponding to the garbage collection request to the initial garbage collection path, calculate the candidate time when the garbage collection vehicle is traveling on the corresponding candidate garbage collection path, and determine the target garbage collection vehicle corresponding to the garbage collection point corresponding to the garbage collection request based on the candidate distance and the candidate time.

[0147] Optionally, in the garbage collection vehicle path optimization device provided in this embodiment, the garbage collection request includes location information of the new garbage collection point, and the vehicle determination module 73 is specifically used to calculate the adjusted increased time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path, and adjust the candidate time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path according to the adjusted increased time.

[0148] Optionally, in the garbage collection vehicle path optimization device provided in this embodiment, the vehicle determination module 73 is specifically used to obtain traffic light information in the candidate garbage collection path, determine the status of the traffic lights when the garbage collection vehicle travels to each traffic light, determine the increased waiting time of the garbage truck when the garbage collection vehicle travels according to the status of the traffic lights, and obtain the adjusted increased time according to the increased waiting time of the garbage truck.

[0149] Optionally, in the garbage collection vehicle path optimization device provided in this embodiment, the vehicle determination module 73 is specifically used to determine the candidate garbage collection vehicles corresponding to the garbage collection point corresponding to the garbage collection request based on the candidate distances and candidate times, and to filter out the target garbage collection vehicle from the candidate garbage collection vehicles.

[0150] Optionally, in the garbage collection vehicle path optimization device provided in the present embodiment, the vehicle determination module 73 is specifically used to compare the candidate distance with a preset distance threshold, and to compare the candidate time with a preset time threshold. If it is determined that the candidate distance is less than the preset distance threshold and the candidate time is less than the preset time threshold, the corresponding garbage collection vehicle is determined as a candidate garbage collection vehicle. If it is determined that the candidate distance is greater than or equal to the preset distance threshold and / or the candidate time is greater than or equal to the preset time threshold, the corresponding garbage collection vehicle is not determined as a candidate garbage collection vehicle.

[0151] Optionally, in the garbage collection vehicle path optimization device provided in this embodiment, the vehicle determination module 73 is specifically used to calculate the matching score according to the increased distance and increased time corresponding to the candidate garbage collection vehicles, and determine the candidate garbage collection vehicle with the largest matching score as the target garbage collection vehicle.

[0152] Optionally, in the garbage cleaning vehicle path optimization device provided in this embodiment, the garbage cleaning request includes garbage attribute information, and the vehicle determination module 73 is specifically used to calculate the matching score according to the increased distance and increased time corresponding to the candidate garbage cleaning vehicles, and determine the candidate garbage cleaning vehicle with the largest matching score as the target garbage cleaning vehicle.

[0153] Optionally, in the garbage collection vehicle path optimization device provided in this embodiment, the vehicle determination module 73 is specifically used to determine, based on the garbage attribute information, an initial garbage collection path that matches the attribute information of the garbage collection vehicle allowed to be collected, and to determine, based on the location information of the garbage collection point and the matching initial garbage collection path, each candidate garbage collection path after adding the garbage collection point corresponding to the garbage collection request to the matching initial garbage collection path.

[0154] Optionally, in the garbage cleaning vehicle path optimization device provided in this embodiment, the garbage attribute information includes: garbage type, garbage weight and garbage volume. The vehicle determination module 73 is specifically used to obtain the garbage types that the garbage cleaning vehicle is allowed to collect, and the remaining garbage weight and remaining garbage volume after collecting the garbage on the initial garbage collection path. If it is determined that the garbage types included in the garbage cleaning request are within the garbage types allowed to be collected by the garbage cleaning vehicle, and the remaining garbage weight is greater than the garbage weight, and the remaining garbage volume is greater than the garbage volume, then the garbage cleaning vehicle is determined to be a matching garbage cleaning vehicle, and the initial garbage collection path corresponding to the matching garbage cleaning vehicle is determined to be the matching initial garbage collection path.

[0155] The garbage collection vehicle path optimization device provided in this embodiment can execute the garbage collection vehicle path optimization method provided in embodiments 1 to 6. The specific implementation method and principle are similar and will not be described one by one.

[0156] Embodiment 8

[0157] Figure 8 A block diagram of an electronic device provided in the eighth embodiment of the present application, such as Figure 8 As shown, the electronic device 80 provided in this embodiment includes a memory 81 , a processor 82 and a transceiver 83 .

[0158] The memory 81, the processor 82 and the transceiver 83 are interconnected.

[0159] The memory 71 stores computer executable instructions;

[0160] The transceiver 83 is used for sending and receiving data;

[0161] The processor 82 executes the computer-executable instructions stored in the memory 81 to implement the garbage collection vehicle path optimization method provided in any one of the embodiments.

[0162] The relevant instructions can be understood by referring to the relevant descriptions and effects corresponding to the steps of the garbage cleaning vehicle path optimization method provided in any embodiment, and no further details will be given here.

[0163] The electronic device 80 may further include other components, which are not limited in this embodiment.

[0164] An embodiment of the present invention further provides a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the abnormal entity recognition method provided in any one of the embodiments.

[0165] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the present application is not limited by the described order of actions, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily required by the present application.

[0166] It should be further noted that, although the various steps in the flowchart are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flowchart may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these sub-steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.

[0167] It should be understood that the above-mentioned device embodiments are only illustrative, and the device of the present application can also be implemented in other ways. For example, the division of units / modules in the above-mentioned embodiments is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units, modules or components can be combined, or can be integrated into another system, or some features can be ignored or not executed.

[0168] In addition, unless otherwise specified, each functional unit / module in each embodiment of the present application may be integrated into one unit / module, each unit / module may exist physically separately, or two or more units / modules may be integrated together. The above-mentioned integrated unit / module may be implemented in the form of hardware or in the form of a software program module.

[0169] If the integrated unit / module is implemented in the form of hardware, the hardware can be a digital circuit, an analog circuit, etc. The physical implementation of the hardware structure includes but is not limited to transistors, memristors, etc. Unless otherwise specified, the artificial intelligence processor can be any appropriate hardware processor, such as CPU, GPU, FPGA, DSP, and ASIC, etc. Unless otherwise specified, the storage unit can be any appropriate magnetic storage medium or magneto-optical storage medium, such as resistive random access memory RRAM (Resistive Random Access Memory), dynamic random access memory DRAM (Dynamic Random Access Memory), static random access memory SRAM (Static Random-Access Memory), enhanced dynamic random access memory EDRAM (Enhanced Dynamic Random Access Memory), high-bandwidth memory HBM (High-Bandwidth Memory), hybrid memory cube HMC (Hybrid Memory Cube), etc.

[0170] If the integrated unit / module is implemented in the form of a software program module and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art or all or part of the technical solution, can be embodied in the form of a software product, which is stored in a memory and includes several instructions for a computer device (which can be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the various embodiments of the present application. The aforementioned memory includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, disk or optical disk and other media that can store program codes.

[0171] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention disclosed herein. The present application is intended to cover any modification, use or adaptation of the present application, which follows the general principles of the present application and includes common knowledge or customary techniques in the art that are not disclosed in the present application. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present application are indicated by the following claims.

[0172] 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 method for optimizing the path of a garbage collection vehicle, characterized in that: include: determining an initial garbage collection path corresponding to at least one garbage collection vehicle; Sending the initial garbage collection path to a corresponding garbage collection vehicle to control the garbage collection vehicle to travel along the corresponding initial garbage collection path and collect garbage at a garbage collection point in the initial garbage collection path; If a garbage collection request is received, a target garbage collection vehicle is determined according to the initial garbage collection path, and a target garbage collection path is determined according to the target garbage collection vehicle and the corresponding initial garbage collection path, wherein the target garbage collection vehicle is a garbage collection vehicle that collects garbage at the garbage collection point corresponding to the garbage collection request; Sending the target garbage collection path to a target garbage collection vehicle to control the target garbage collection vehicle to continue traveling along the target garbage collection path and collect garbage at a garbage collection point in the target garbage collection path; The garbage cleaning request includes location information of a garbage collection point corresponding to the garbage cleaning request; The step of determining a target garbage collection vehicle according to the initial garbage collection path comprises: Determine, according to the location information of the garbage collection point and the initial garbage collection path, candidate garbage collection paths and candidate distances after adding the garbage collection point corresponding to the garbage cleaning request to the initial garbage collection path; Calculating candidate times for garbage collection vehicles to travel along corresponding candidate garbage collection paths; Determine, according to the candidate distance and the candidate time, a target garbage collection vehicle corresponding to the garbage collection point corresponding to the garbage collection request; After calculating the candidate time when the garbage collection vehicle travels on the corresponding candidate garbage collection path, the method further includes: calculating an adjusted increase time of a garbage collection vehicle when traveling on a corresponding candidate garbage collection path; adjusting the candidate time when the garbage collection vehicle travels on the corresponding candidate garbage collection path according to the adjusted increased time; Among them, the adjusted increased time represents the increased waiting time of the garbage collection vehicle compared with the initial garbage collection path, obtained according to the increased number of traffic lights and the current traffic light status; adjusting the candidate time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path according to the adjusted increased time includes: adding the adjusted increased time to the candidate time to obtain the adjusted candidate time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path.

2. The method according to claim 1, characterized in that Calculating the adjusted increase time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path, including: Obtaining traffic light information in the candidate garbage collection path; Determine the state of traffic lights when the garbage collection vehicle approaches each traffic light; Determining the increased waiting time of the garbage truck when the garbage collection vehicle is traveling according to the state of the traffic light; The adjusted increased time is obtained according to the increased garbage truck waiting time.

3. The method according to claim 1, characterized in that The step of determining the target garbage collection vehicle corresponding to the garbage collection point corresponding to the garbage collection request according to the candidate distance and the candidate time includes: Determining, according to the candidate distance and the candidate time, a candidate garbage collection vehicle corresponding to the garbage collection point corresponding to the garbage collection request; The target garbage removal vehicle is selected from the candidate garbage removal vehicles.

4. The method according to claim 3, characterized in that: The step of determining, according to the candidate distance and the candidate time, a candidate garbage collection vehicle corresponding to the garbage collection point corresponding to the garbage collection request comprises: Comparing the candidate distance with a preset distance threshold, and comparing the candidate time with a preset time threshold; If it is determined that the candidate distance is less than the preset distance threshold and the candidate time is less than the preset time threshold, the corresponding garbage collection vehicle is determined as a candidate garbage collection vehicle; If it is determined that the candidate distance is greater than or equal to the preset distance threshold and / or the candidate time is greater than or equal to the preset time threshold, the corresponding garbage removal vehicle is not determined as a candidate garbage removal vehicle.

5. The method according to claim 4, characterized in that The step of selecting the target garbage removal vehicle from the candidate garbage removal vehicles comprises: Calculating a matching score according to the increased distance and increased time corresponding to the candidate garbage collection vehicle; Determine the candidate garbage collection vehicle with the largest matching score as the target garbage collection vehicle; Among them, the increased distance represents the increased distance traveled by the candidate garbage collection vehicle on the candidate garbage collection path compared to the initial garbage collection path; the increased time represents the time required for the garbage collection vehicle to travel the increased distance; the shorter the increased distance, the higher the distance matching score; the shorter the increased time, the higher the time matching score; the matching score is equal to the sum of the distance matching score and the time matching score.

6. The method according to claim 1, characterized in that The garbage cleaning request includes garbage attribute information; The determining, according to the location information of the garbage collection point and the initial garbage collection path, each candidate garbage collection path and candidate distance after adding the garbage collection point corresponding to the garbage cleaning request to the initial garbage collection path includes: According to the location information of the garbage collection point, the garbage attribute information, the garbage collection attribute information allowed by the garbage collection vehicle and the initial garbage collection path, the candidate garbage collection paths and candidate distances after adding the garbage collection point corresponding to the garbage collection request to the initial garbage collection path are determined.

7. The method according to claim 6, characterized in that The determining, according to the location information of the garbage collection point, the garbage attribute information, the garbage collection attribute information allowed by the garbage collection vehicle, and the initial garbage collection path, each candidate garbage collection path after adding the garbage collection point corresponding to the garbage collection request to the initial garbage collection path comprises: Determine, based on the garbage attribute information, an initial garbage collection path that matches the garbage collection attribute information allowed by the garbage collection vehicle; According to the location information of the garbage collection point and the matched initial garbage collection path, candidate garbage collection paths are determined after adding the garbage collection point corresponding to the garbage cleaning request to the matched initial garbage collection path.

8. The method according to claim 7, characterized in that The garbage attribute information includes: garbage type, garbage weight and garbage volume; The step of determining, based on the garbage attribute information, an initial garbage collection path that matches the attribute information of the garbage collection vehicle that is allowed to collect the garbage includes: Obtain the types of garbage that the garbage collection vehicle is allowed to collect, and the weight and volume of the remaining garbage after collecting the garbage on the initial garbage collection route; If it is determined that the type of garbage included in the garbage removal request is within the type of garbage that the garbage removal vehicle is allowed to collect, and the weight of the remaining garbage is greater than the weight of the garbage, and the volume of the remaining garbage is greater than the volume of the garbage, then the garbage removal vehicle is determined to be a matching garbage removal vehicle; The initial garbage collection path corresponding to the matching garbage collection vehicle is determined as the matching initial garbage collection path.

9. The method according to claim 8, characterized in that The garbage weight is detected by a pressure sensor located in the garbage collection point, and the pressure sensor is located at the bottom of the garbage collection container in the garbage collection point. The garbage volume is measured by an optical sensor located in the garbage collection point, and the optical sensor is located on the garbage collection container in the garbage collection point.

10. A garbage cleaning vehicle path optimization device, characterized in that: include: a path determination module, for determining an initial garbage collection path corresponding to at least one garbage collection vehicle; A sending module, used for sending the initial garbage collection path to a corresponding garbage collection vehicle, so as to control the garbage collection vehicle to travel along the corresponding initial garbage collection path and collect garbage at a garbage collection point in the initial garbage collection path; A vehicle determination module, configured to determine a target garbage collection vehicle according to the initial garbage collection path if a garbage collection request is received, wherein the target garbage collection vehicle is a garbage collection vehicle that collects garbage at a garbage collection point corresponding to the garbage collection request; A path optimization module, used to determine a target garbage collection path according to the target garbage collection vehicle and the corresponding initial garbage collection path; The sending module is further used to send the target garbage collection path to the target garbage collection vehicle, so as to control the target garbage collection vehicle to continue to travel along the target garbage collection path and collect garbage at the garbage collection point in the target garbage collection path; The vehicle determination module is further used to determine, according to the location information of the garbage collection point and the initial garbage collection path, each candidate garbage collection path and candidate distance after adding the garbage collection point corresponding to the garbage cleaning request to the initial garbage collection path; Calculating candidate times for garbage collection vehicles to travel along corresponding candidate garbage collection paths; Determine, according to the candidate distance and the candidate time, a target garbage collection vehicle corresponding to the garbage collection point corresponding to the garbage collection request; The vehicle determination module is further used to calculate the adjusted increase time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path; adjusting the candidate time when the garbage collection vehicle travels on the corresponding candidate garbage collection path according to the adjusted increased time; Among them, the adjusted increased time represents the increased waiting time of the garbage collection vehicle compared with the initial garbage collection path, obtained according to the increased number of traffic lights and the current traffic light status; adjusting the candidate time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path according to the adjusted increased time includes: adding the adjusted increased time to the candidate time to obtain the adjusted candidate time of the garbage collection vehicle when traveling on the corresponding candidate garbage collection path.

11. An electronic device, comprising: Memory, processor and transceiver; The memory, the processor and the transceiver circuit are interconnected; The memory stores computer-executable instructions; The transceiver is used for sending and receiving data; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 9.

12. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 9 when executed by a processor.