Garbage transportation method, device, electronic device and computer-readable medium

Abstract

Embodiments of the present disclosure disclose a garbage transportation method, apparatus, electronic device, and computer-readable medium. A specific implementation of the method includes: obtaining a set of user information to be transported corresponding to a transport vehicle; generating a transport route; controlling the transport vehicle to move to a position corresponding to the coordinate information of the first transport node in the transport node set; in response to detecting a radio frequency signal, performing identification processing on the radio frequency signal; according to the identification result, determining the garbage weight information of the user information to be transported corresponding to the transport node; controlling the transport vehicle to move to a garbage cleaning station; in response to the set of transport nodes after deleting the first transport node being non-empty and the transport vehicle meeting a first preset condition, controlling the transport vehicle to move to the garbage cleaning station, and in response to detecting that the garbage recycling is completed, using the set of transport nodes after deleting the first transport node as the transport node set, and performing the transport steps again. This implementation reduces the time for garbage traceability of garbage.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the field of computer technologies, and particularly to a garbage transportation method, apparatus, electronic device, and computer-readable medium. Background Art

[0002] With the continuous development of the Internet of Things, how to quickly transport garbage has become an important research topic. Currently, when transporting garbage, the commonly adopted method is as follows: garbage collection and transportation units use electric tricycles to dump the garbage discharged by non-resident waste producers near a closed cleaning station, and then transport the garbage to a garbage treatment plant for standardized treatment.

[0003] However, it is found in practice that when transporting garbage in the above manner, there is often the following technical problem 1: when transporting the garbage to the cleaning station, it is necessary to record data such as the source and weight of the garbage. Incorrect data may be recorded during the garbage transportation, resulting in the reported information not matching the actual information, and it takes a long time to trace the garbage source.

[0004] In the process of adopting technical solutions to solve the above technical problem 1, there is often the following technical problem 2: during the garbage transportation process, it is impossible to determine whether the garbage discharged by the next user will fill the transport vehicle, resulting in the garbage discharged next exceeding the remaining transport space of the transport vehicle, causing the transport vehicle to transport the garbage discharged by the user again, wasting transport resources. For these problems of the above technical problem 2, the conventional solution is generally: when the remaining space of the transport vehicle is insufficient, directly return to the cleaning station and transport the garbage discharged by the next user again. However, the above conventional solution still has the following problem: the garbage discharged by the next user may be less, and the remaining space of the transport vehicle can transport the garbage discharged by the next user, resulting in a waste of transport resources.

[0005] In the process of adopting technical solutions to solve the above technical problem 1, there is often the following technical problem 3: when purifying the garbage, it is not easy to classify the garbage, resulting in the selection of the wrong purification method and causing environmental pollution. For these problems of the above technical problem 3, the conventional solution is generally: the staff sorts the garbage put in. However, the above conventional solution still has the following problem: when the staff sorts the garbage, classification errors are likely to occur, and the efficiency of the staff in sorting the garbage is low, and it takes a long time to sort the garbage, resulting in garbage accumulation.

[0006] The above information disclosed in this background art section is only used to enhance the understanding of the background of the inventive concept, and thus, it may include information that does not form the prior art known to ordinary technicians in this field in this country. Summary of the Invention

[0007] The content part of the present disclosure is used to introduce concepts in a brief form, and these concepts will be described in detail in the following detailed implementation part. The content part of the present disclosure is not intended to identify the key features or essential features of the claimed technical solution, nor is it intended to limit the scope of the claimed technical solution.

[0008] Some embodiments of the present disclosure provide a garbage transportation method, device, electronic device and computer-readable medium to solve one or more of the technical problems mentioned in the above background art part.

[0009] In a first aspect, some embodiments of the present disclosure provide a garbage transportation method, and the method includes: obtaining a set of user information to be transported corresponding to the above transport vehicle, where the user information to be transported in the set of user information to be transported includes coordinate information; generating a transportation route according to each coordinate information included in the set of user information to be transported, where the transportation route includes a plurality of transportation nodes, and the number of transportation nodes included in the transportation route is the same as the number of user information to be transported included in the set of user information to be transported; based on the set of transportation nodes included in the transportation route, perform the following transportation steps: controlling the transport vehicle to move to the position corresponding to the coordinate information of the first transportation node in the set of transportation nodes; in response to detecting a radio frequency signal, performing identification processing on the radio frequency signal to generate an identification result; determining the garbage weight information of the user information to be transported corresponding to the transportation node according to the identification result; in response to the set of transportation nodes after deleting the first transportation node being empty, controlling the transport vehicle to move to the garbage cleaning station; in response to the set of transportation nodes after deleting the first transportation node not being empty and the transport vehicle meeting a first preset condition, controlling the transport vehicle to move to the garbage cleaning station, and in response to detecting that the garbage recycling is completed, taking the set of transportation nodes after deleting the first transportation node as the set of transportation nodes and performing the above transportation steps again.

[0010] Second aspect, some embodiments of the present disclosure provide a garbage transportation device, which includes: an acquisition unit configured to acquire the set of user information to be transported corresponding to the above-mentioned transport vehicle, wherein the user information to be transported in the above-mentioned set of user information to be transported includes coordinate information; a generation unit configured to generate a transportation route according to each coordinate information included in the above-mentioned set of user information to be transported, wherein the above-mentioned transportation route includes a plurality of transportation nodes, and the number of transportation nodes included in the above-mentioned transportation route is the same as the number of user information to be transported included in the above-mentioned set of user information to be transported; an execution unit configured to perform the following transportation steps based on the set of transportation nodes included in the transportation route: control the above-mentioned transport vehicle to move to the position corresponding to the coordinate information of the first transportation node in the above-mentioned set of transportation nodes; in response to detecting a radio frequency signal, perform identification processing on the above-mentioned radio frequency signal to generate an identification result; determine the garbage weight information of the user information to be transported corresponding to the above-mentioned transportation node according to the above-mentioned identification result; in response to the set of transportation nodes after deleting the first transportation node being empty, control the above-mentioned transport vehicle to move to the garbage cleaning station; in response to the set of transportation nodes after deleting the first transportation node not being empty and the above-mentioned transport vehicle meeting the first preset condition, control the above-mentioned transport vehicle to move to the above-mentioned garbage cleaning station, and in response to detecting that the garbage recycling is completed, use the set of transportation nodes after deleting the first transportation node as the set of transportation nodes and perform the above-mentioned transportation steps again.

[0011] Third aspect, some embodiments of the present disclosure provide an electronic device, including: one or more processors; a storage device having stored thereon one or more programs, which when executed by the one or more processors cause the one or more processors to implement the method described in any implementation manner of the above first aspect.

[0012] Fourth aspect, some embodiments of the present disclosure provide a computer-readable medium having stored thereon a computer program, wherein the program when executed by a processor implements the method described in any implementation manner of the above first aspect.

[0013] The above-mentioned various embodiments of the present disclosure have the following beneficial effects: Through the garbage transportation method of some embodiments of the present disclosure, the time for garbage traceability is reduced. Specifically, the reason for the need to spend a long time on garbage traceability is that when transporting garbage to the cleaning station, data such as the source and weight of the garbage need to be recorded. Incorrect data may be recorded during garbage transportation, resulting in inconsistent reported information and actual information, and a long time is required for garbage traceability. Based on this, for the garbage transportation method of some embodiments of the present disclosure, first, obtain the set of user information to be transported corresponding to the above-mentioned transport vehicle. Thus, the users who need to transport garbage can be determined. Second, generate a transportation route according to each coordinate information included in the set of user information to be transported. Thus, the garbage of users can be transported in sequence according to the transportation route. Third, based on the set of transportation nodes included in the transportation route, perform the following transportation steps: First, control the above-mentioned transport vehicle to move to the position corresponding to the coordinate information of the first transportation node in the set of transportation nodes. Thus, the garbage of the first user can be transported. Second, in response to detecting a radio frequency signal, perform identification processing on the radio frequency signal to generate an identification result. Thus, the information sent by the radio frequency signal can be identified. Then, according to the above identification result, determine the garbage weight information of the user information to be transported corresponding to the above-mentioned transportation node. Thus, the identity information of the user and the weight of the garbage put by the user can be determined. After that, in response to the set of transportation nodes after deleting the first transportation node being empty, control the above-mentioned transport vehicle to move to the garbage cleaning station. Thus, the transportation of garbage is completed. Finally, in response to the set of transportation nodes after deleting the first transportation node not being empty and the above-mentioned transport vehicle meeting the first preset condition, control the above-mentioned transport vehicle to move to the above-mentioned garbage cleaning station, and in response to detecting the completion of garbage collection, use the set of transportation nodes after deleting the first transportation node as the set of transportation nodes and perform the above-mentioned transportation steps again. Thus, the garbage can be transported to the cleaning station after the transport vehicle cannot load garbage. Also, because the user identity is determined through radio frequency signals and the garbage is weighed during garbage transportation, the inconsistency between the reported information and the actual information is avoided, thereby reducing the time for garbage traceability. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] In combination with the accompanying drawings and with reference to the following specific embodiments, the above and other features, advantages, and aspects of the various embodiments of the present disclosure will become more apparent. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic, and the elements and elements are not necessarily drawn to scale.

[0015] Figure 1 is a flowchart according to some embodiments of the garbage transportation method of the present disclosure;

[0016] Figure 2 is a schematic structural diagram according to some embodiments of the garbage transportation device of the present disclosure;

[0017] Figure 3 It is a schematic structural diagram of an electronic device suitable for implementing some embodiments of the present disclosure. Specific embodiments

[0018] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although some embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. On the contrary, these embodiments are provided to more thoroughly and completely understand the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not used to limit the protection scope of the present disclosure.

[0019] In addition, it should be noted that for the sake of convenience of description, only parts related to the relevant invention are shown in the drawings. Without conflict, the embodiments in the present disclosure and the features in the embodiments can be combined with each other.

[0020] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or their interdependent relationships.

[0021] It should be noted that the modifications of "one" and "multiple" mentioned in the present disclosure are illustrative rather than restrictive. Those skilled in the art should understand that unless otherwise clearly specified in the context, it should be understood as "one or more".

[0022] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only for illustrative purposes and are not used to limit the scope of these messages or information.

[0023] The present disclosure will be described in detail below with reference to the drawings and in combination with embodiments.

[0024] Figure 1 Flow 100 of some embodiments of the garbage transportation method according to the present disclosure is shown. The garbage transportation method includes the following steps:

[0025] Step 101, obtain the set of user information to be transported corresponding to the transport vehicle.

[0026] In some embodiments, the execution subject (such as a server) of the garbage transportation method may obtain the set of user information to be transported corresponding to the above-mentioned transport vehicle. In practice, the set of user information to be transported may be obtained from the target database through a wired connection or a wireless connection. Among them, the user information to be transported in the set of user information to be transported includes coordinate information. The above-mentioned target database may be a pre-set database for storing the set of user information to be transported. The user information to be transported in the set of user information to be transported may be the user information of the user who throws garbage. The above-mentioned coordinate information may be the coordinates of the user's garbage throwing stored in advance. The above-mentioned transport vehicle may be equipped with a radio frequency signal receiver and a weighing device. The above-mentioned garbage transportation method is applied to a garbage transportation system, and the above-mentioned garbage transportation system further includes a weighbridge and a display terminal.

[0027] Step 102, generate a transportation route according to each coordinate information included in the set of user information to be transported.

[0028] In some embodiments, the above-mentioned execution subject may generate a transportation route according to each coordinate information included in the set of user information to be transported. Among them, the above-mentioned transportation route includes a plurality of transportation nodes, and the number of transportation nodes included in the above-mentioned transportation route is the same as the number of user information to be transported included in the above-mentioned set of user information to be transported. The above-mentioned transportation nodes may represent the coordinate information included in the user information to be transported.

[0029] In practice, the transportation route can be generated through the following steps:

[0030] The first step is to obtain the vehicle position information corresponding to the above-mentioned transport vehicle. Among them, the above-mentioned vehicle position information may be the starting position of the above-mentioned transport vehicle.

[0031] The second step is to select, according to the above-mentioned vehicle position information, the user information to be transported that meets the first preset condition from the above-mentioned set of user information to be transported as the target user information, and determine the coordinate information included in the above-mentioned target user information as the starting point. Among them, the above-mentioned first preset condition may be that the distance between the position represented by the coordinate information included and the position represented by the above-mentioned vehicle position information is the closest.

[0032] The third step is to use the set of user information to be transported after removing the above-mentioned target user information as the first set of user information, and based on the first set of user information, perform the following generation steps:

[0033] The first generation step is to obtain the historical transportation quality information group set of each first user information in the above-mentioned first set of user information. Among them, the historical transportation quality information in the above-mentioned historical transportation quality information group may be the quality of the garbage thrown by the user corresponding to the first user information at a historical time.

[0034] The second generation step: for each first user information in the above first user information set, determine the mean value of each historical transportation quality information included in the historical transportation quality information set corresponding to the above first user information as the quality prediction value.

[0035] The third generation step: determine the user distance between each first user information in the above first user information set and the above target user information to obtain a user distance set.

[0036] The fourth generation step: for each first user information in the first user information set, determine the user information score according to the quality prediction value and user distance corresponding to the above first user information. In practice, the sum of the product of the above quality prediction value and the first weight and the product of the above user distance and the second weight can be determined as the user information score.

[0037] The fifth generation step: select the user information scores that meet the second preset condition from the determined user information scores as the target user scores, and determine the coordinate information included in the first user information corresponding to the above target user scores as the target transportation nodes. Among them, the above second preset condition can be the lowest user information score.

[0038] The sixth generation step: in response to the first user information set corresponding to the deletion of the first user information corresponding to the above target user score being empty, combine the above starting point and the above target transportation node into a transportation route.

[0039] The fourth step: in response to the first user information set corresponding to the deletion of the first user information corresponding to the above target user score not being empty, use the first user information set after deleting the first user information corresponding to the above target user score as the first user information set, determine the above target transportation node as the starting point, and execute the above generation steps again.

[0040] Step 103: Based on the transportation node set included in the transportation route, execute the following transportation steps:

[0041] Step 1031: Control the transport vehicle to move to the position corresponding to the coordinate information of the first transportation node in the transportation node set.

[0042] In some embodiments, the above execution entity can control the transport vehicle to move to the position corresponding to the coordinate information of the first transportation node in the transportation node set.

[0043] Step 1032: In response to detecting a radio frequency signal, perform identification processing on the radio frequency signal to generate an identification result.

[0044] In some embodiments, the above-mentioned execution entity may, in response to detecting a radio frequency signal, perform identification processing on the radio frequency signal to generate an identification result. Among them, the above-mentioned radio frequency signal may be an electromagnetic wave signal sent by a passive radio frequency device. The above-mentioned electromagnetic wave signal may be a signal for transmitting user data. The above-mentioned identification processing may be to identify the user data included in the radio frequency signal through a radio frequency signal receiver installed on the transport vehicle. The above-mentioned identification result may characterize user information.

[0045] Step 1033: According to the identification result, determine the garbage weight information of the user information to be transported corresponding to the transport node.

[0046] In some embodiments, the above-mentioned execution entity may, according to the above-mentioned identification result, determine the garbage weight information of the user information to be transported corresponding to the above-mentioned transport node. In practice, in response to the user corresponding to the above-mentioned user information to be transported putting garbage into the transport vehicle, the garbage weight value is determined through a weighing device installed on the transport vehicle, and the above-mentioned identification result and the above-mentioned garbage weight value are combined into garbage weight information.

[0047] Step 1034: In response to the transport node set after deleting the first transport node being empty, control the transport vehicle to move to the garbage cleaning station.

[0048] In some embodiments, the above-mentioned execution entity may, in response to the transport node set after deleting the first transport node being empty, control the above-mentioned transport vehicle to move to the garbage cleaning station.

[0049] Considering the problems of the above-mentioned conventional solutions, in the face of the above-mentioned technical problem 2: During the process of transporting garbage, it is impossible to determine whether the garbage discharged by the next user will fill the transport vehicle, resulting in the garbage discharged next exceeding the remaining transport space of the transport vehicle, causing the transport vehicle to transport the garbage discharged by the user again, wasting transport resources. Combining the current technical situation, the following solutions can be decided to be adopted.

[0050] Optionally, after step 1034, in response to the transport node set after deleting the first transport node not being empty and the above-mentioned transport vehicle not meeting the first preset condition, perform the following processing steps:

[0051] The first processing step: Obtain the vehicle information corresponding to the above-mentioned transport vehicle.

[0052] In some embodiments, the above-mentioned execution entity may obtain the vehicle information corresponding to the above-mentioned transport vehicle. Among them, the above-mentioned vehicle information may be the configuration information of the above-mentioned transport vehicle. The above-mentioned vehicle information may include but is not limited to: vehicle volume and vehicle maximum load-bearing capacity.

[0053] The second processing step: According to the above-mentioned vehicle information and at least one garbage weight information corresponding to the above-mentioned transport vehicle, determine the remaining bearing mass value of the above-mentioned transport vehicle.

[0054] In some embodiments, the above-mentioned execution entity may determine the remaining load-bearing mass value of the transport vehicle according to the above-mentioned vehicle information and at least one garbage weight information corresponding to the transport vehicle. In practice, the sum of the respective garbage weight values included in the above-mentioned at least one garbage weight information may be determined as the total garbage mass, and the difference between the maximum load-bearing capacity of the vehicle and the total garbage mass may be determined as the remaining load-bearing mass value.

[0055] The third processing step is to determine the remaining load-bearing volume corresponding to the transport vehicle according to the associated imaging device.

[0056] In some embodiments, the above-mentioned execution entity may determine the remaining load-bearing volume corresponding to the transport vehicle according to the associated imaging device. In practice, first, the garbage transport image of the transport vehicle captured by the imaging device may be obtained. Second, the above-mentioned garbage transport image may be input into a pre-trained spatial prediction model to obtain the remaining load-bearing volume.

[0057] The fourth processing step is to perform the following determination steps for each piece of user information to be transported in the above-mentioned set of user information to be transported after removing the user information to be transported corresponding to the first transport node:

[0058] The first determination step is to generate a set of user keyword information of the target user according to the above-mentioned user information to be transported.

[0059] In some embodiments, the above-mentioned execution entity may generate a set of user keyword information of the target user according to the above-mentioned user information to be transported. In practice, the above-mentioned user information to be transported may be subjected to word segmentation processing, and the segmented user information to be transported may be determined as the set of user keyword information.

[0060] The second determination step is to generate a set of user label information corresponding to the above-mentioned target user according to the above-mentioned set of user keyword information.

[0061] In some embodiments, the above-mentioned execution entity may generate a set of user label information corresponding to the above-mentioned target user according to the above-mentioned set of user keyword information. In practice, user labels corresponding to the user keyword information may be selected from a preset label set as user label information to obtain a set of user label information.

[0062] The third determination step is to determine the above-mentioned set of user label information as the user portrait corresponding to the above-mentioned target user.

[0063] In some embodiments, the above-mentioned execution entity may determine the above-mentioned set of user label information as the user portrait corresponding to the above-mentioned target user.

[0064] The fourth determination step is to determine the garbage category information of the above-mentioned target user according to the above-mentioned user portrait.

[0065] In some embodiments, the above-mentioned execution entity may determine the garbage category information of the above-mentioned target user according to the above-mentioned user portrait. Among them, the above-mentioned garbage category information may be the material and type information of the garbage.

[0066] The fifth determination step is to obtain the historical garbage quality value set of the above-mentioned target user. In some embodiments, the above-mentioned execution entity may obtain the historical garbage quality value set of the above-mentioned target user. Among them, the historical garbage quality values in the above-mentioned historical garbage quality value set may be the quality of the garbage put by the target user stored in advance during the historical time period. The above-mentioned historical time period may be a time period set in advance before the current time.

[0067] The sixth determination step is to perform garbage disposal prediction processing on the above-mentioned target user according to the above-mentioned historical garbage quality value set to generate a first prediction result.

[0068] In some embodiments, the above-mentioned execution entity may perform garbage disposal prediction processing on the above-mentioned target user according to the above-mentioned historical garbage quality value set to generate a first prediction result.

[0069] The seventh determination step is to, in response to the above-mentioned prediction result satisfying the second preset condition, perform garbage disposal volume prediction processing on the above-mentioned target user to generate a second prediction result.

[0070] In some embodiments, the above-mentioned execution entity may, in response to the above-mentioned prediction result satisfying the second preset condition, perform garbage disposal volume prediction processing on the above-mentioned target user to generate a second prediction result.

[0071] The eighth determination step is to, in response to the above-mentioned second prediction result satisfying the third preset condition, control the above-mentioned transport vehicle to move to the position corresponding to the coordinate information of the above-mentioned target user.

[0072] The relevant content in the above first processing step - eighth determination step is an inventive point of the present disclosure, which solves the second technical problem mentioned in the background art: "During the process of transporting garbage, it is impossible to determine whether the garbage to be discharged by the next user will fill the transport vehicle, resulting in the garbage discharged next exceeding the remaining transport space of the transport vehicle, causing the transport vehicle to transport the garbage discharged by the user again, wasting transport resources." The factors causing waste of transport resources are often as follows: During the process of transporting garbage, it is impossible to determine whether the garbage to be discharged by the next user will fill the transport vehicle, resulting in the garbage discharged next exceeding the remaining transport space of the transport vehicle, causing the transport vehicle to transport the garbage discharged by the user again, wasting transport resources. If the above factors are solved, the effect of reducing waste of transport resources can be achieved. To achieve this effect, in response to the transport node set corresponding to the deletion of the first transport node not being empty and the above transport vehicle not meeting the first preset condition, the following processing steps are executed: First, obtain the vehicle information corresponding to the above transport vehicle. Thus, the volume and weight of the garbage that the transport vehicle can carry can be determined. Second, according to the above vehicle information and at least one garbage weight information corresponding to the above transport vehicle, determine the remaining bearing mass value of the above transport vehicle. Thus, the weight of the remaining garbage that can be carried can be determined. Then, according to the associated imaging device, determine the remaining bearing volume corresponding to the above transport vehicle. Thus, the volume of the garbage that the transport vehicle can accommodate can be determined. After that, for each piece of transport user information in the above transport user information set after removing the transport user information corresponding to the first transport node, the following determination steps are executed: First, generate a set of user keyword information for the target user according to the above transport user information; generate a set of user label information corresponding to the above target user according to the above set of user keyword information; determine the above set of user label information as the user portrait corresponding to the above target user. Thus, the user portrait of the target user can be determined. Second, according to the above user portrait, determine the garbage category information of the above target user. Thus, the type of garbage put by the target user can be predicted. Third, obtain the set of historical garbage mass values of the above target user; perform garbage placement prediction processing on the above target user according to the above set of historical garbage mass values to generate a first prediction result. Thus, the mass of the garbage put by the target user can be predicted. Fourth, in response to the above prediction result meeting the second preset condition, perform garbage placement volume prediction processing on the above target user to generate a second prediction result; in response to the above second prediction result meeting the third preset condition, control the above transport vehicle to move to the position corresponding to the coordinate information corresponding to the above target user. Thus, by predicting the volume and mass of the garbage put by the user, it is determined that the remaining space of the transport vehicle can carry the garbage put by the user, thereby reducing the number of times the transport vehicle transports garbage and reducing waste of transport resources.

[0073] Optionally, after step 1034, the following steps are further included:

[0074] In the first step, control the above-mentioned transport vehicle to move to the designated area included in the above-mentioned weighbridge.

[0075] In some embodiments, the above-mentioned execution entity can control the above-mentioned transport vehicle to move to the designated area included in the above-mentioned weighbridge. Among them, the above-mentioned designated area can be a pre-divided weighbridge area for weighing the transport vehicle.

[0076] In the second step, receive the first mass value sent by the above-mentioned weighbridge.

[0077] In some embodiments, the above-mentioned execution entity can receive the first mass value sent by the above-mentioned weighbridge. Among them, the above-mentioned first mass value can be the total weight of the transport vehicle and the transported garbage.

[0078] In the third step, control the above-mentioned transport vehicle to perform garbage disposal on the transported garbage.

[0079] In some embodiments, the above-mentioned execution entity can control the above-mentioned transport vehicle to perform garbage disposal on the transported garbage. Among them, the above-mentioned garbage disposal can be to put the transported garbage into a pre-set garbage disposal position.

[0080] In the fourth step, in response to the completion of garbage disposal, control the above-mentioned transport vehicle to move to the above-mentioned designated area again, and obtain the second mass value sent by the above-mentioned weighbridge.

[0081] In some embodiments, the above-mentioned execution entity can, in response to the completion of garbage disposal, control the above-mentioned transport vehicle to move to the above-mentioned designated area again, and obtain the second mass value sent by the above-mentioned weighbridge. Among them, the above-mentioned second mass value can represent the mass of the transport vehicle.

[0082] Optionally, before the fifth step, in response to the above-mentioned first mass value being less than the above-mentioned second mass value, generate transport invalid information, and display the transport invalid information on the above-mentioned display terminal.

[0083] In some embodiments, the above-mentioned execution entity can, in response to the above-mentioned first mass value being less than the above-mentioned second mass value, generate transport invalid information, and display the transport invalid information on the above-mentioned display terminal. Among them, the above-mentioned transport invalid information can represent that this transport process is invalid.

[0084] In the fifth step, determine the garbage mass value according to the above-mentioned first mass value and the above-mentioned second mass value.

[0085] In some embodiments, the above-mentioned execution entity can determine the garbage mass value according to the above-mentioned first mass value and the above-mentioned second mass value. In practice, the difference between the above-mentioned first mass value and the above-mentioned second mass value can be determined as the garbage mass value.

[0086] Step 6, in response to the above waste quality value being the same as the pre-stored waste quality value, obtain at least one piece of user information to be transported included in at least one piece of identification information corresponding to the above waste quality value.

[0087] In some embodiments, the above execution entity may, in response to the above waste quality value being the same as the pre-stored waste quality value, obtain at least one piece of user information to be transported included in at least one piece of identification information corresponding to the above waste quality value. Among them, the above pre-stored waste quality value may be the sum of the waste weight values included in the stored waste weight information.

[0088] Step 7, combine each piece of user information to be transported in the above at least one piece of user information to be transported and the corresponding waste weight information into waste discharge information, and send the above waste discharge information to the above display terminal for display.

[0089] In some embodiments, the above execution entity may combine each piece of user information to be transported in the above at least one piece of user information to be transported and the corresponding waste weight information into waste discharge information, and send the above waste discharge information to the above display terminal for display.

[0090] Step 1035, in response to the set of transportation nodes after deleting the first transportation node not being empty and the transport vehicle satisfying the first preset condition, control the transport vehicle to move to the waste cleaning station, and in response to detecting that the waste recycling is completed, use the set of transportation nodes after deleting the first transportation node as the set of transportation nodes and execute the transportation step again.

[0091] In some embodiments, the above execution entity may, in response to the set of transportation nodes after deleting the first transportation node not being empty and the above transport vehicle satisfying the first preset condition, control the above transport vehicle to move to the above waste cleaning station, and in response to detecting that the waste recycling is completed, use the set of transportation nodes after deleting the first transportation node as the set of transportation nodes and execute the above transportation step again. Among them, the above first preset condition may be that the remaining space of the transport vehicle is less than or equal to the preset remaining space and the remaining mass value is less than or equal to the preset mass value.

[0092] Optionally, after step 1035, in response to the set of transportation nodes after deleting the first transportation node not being empty and the above transport vehicle satisfying the above first preset condition, use the set of transportation nodes after deleting the first transportation node as the set of transportation nodes and execute the above transportation step again.

[0093] In some embodiments, the above execution entity may, in response to the set of transportation nodes after deleting the first transportation node not being empty and the above transport vehicle not satisfying the above first preset condition, use the set of transportation nodes after deleting the first transportation node as the set of transportation nodes and execute the above transportation step again.

[0094] Optionally, after step 1035, control the above-mentioned transport vehicle to transport the carried garbage to a preset area for purifying the carried garbage.

[0095] In some embodiments, the above-mentioned execution subject can control the above-mentioned transport vehicle to transport the carried garbage to a preset area for purifying the carried garbage.

[0096] In practice, the carried garbage can be purified through the following steps:

[0097] First step, in response to monitoring that the above-mentioned transport vehicle transports the carried garbage to the above-mentioned preset area, collect at least one area image of the above-mentioned preset area. In practice, at least one area image of the above-mentioned preset area can be collected by shooting devices installed at different angles in advance. The above-mentioned shooting device can be a device with shooting and video recording functions. For example, the above-mentioned shooting device can be a camera.

[0098] Second step, for each of the at least one area image, perform the following recognition steps:

[0099] First recognition step, perform image enhancement processing on the above-mentioned area image to generate an enhanced area image. Among them, the above-mentioned image enhancement processing can be RGB channel transformation processing.

[0100] Second recognition step, rotate the above-mentioned enhanced area image by at least one preset angle to obtain a set of rotated area images. The above-mentioned preset angle can be the angle of central rotation set in advance. For example, the above-mentioned preset angle can be 60 degrees clockwise.

[0101] Third recognition step, for each rotated area image in the above-mentioned set of rotated area images, perform a first cropping process and a second cropping process on the above-mentioned rotated area image to generate a set of cropped images. Among them, the above-mentioned first cropping process can be random cropping process. The above-mentioned second cropping process can be central cropping process.

[0102] Third recognition step, for each cropped image in each generated set of cropped images, perform normalization processing on the above-mentioned cropped image to generate a normalized image. Among them, the above-mentioned normalization processing can be to convert the size of the image to the same size.

[0103] Fourth recognition step, input the set of normalized images into a pre-trained garbage recognition model to obtain a set of recognition results.

[0104] In practice, the above garbage recognition model can be a custom model. The above custom model can include a first sub-model and a second sub-model. The above first sub-model can include five layers. The first layer is the input layer, which is used to extract the image features of the input standardized image and output a feature map. Here, the above input layer is a ResNet50 residual structure. The second layer is the region generation layer, which is used to input the image feature map and output at least one target candidate region. Here, the above region generation layer is an RPN network structure. The third layer is the screening layer, which includes a softmax classification layer and a regression layer. It is used to screen the candidate region positions of each target candidate region in the feature map among the above at least one target candidate regions. The fourth layer is the pooling layer, which is an ROI layer and is used to perform pooling on the candidate region positions. The fifth layer is the output layer, which includes a regression layer and a softmax layer and is used to determine the category of each candidate region and perform border regression again to obtain the final accurate position of the detection box. The above second sub-model can be a pre-trained convolutional neural network model. The above second sub-model takes the garbage image within the detection box as the input and outputs the recognition result. The above recognition result can represent the category of the above garbage image.

[0105] In the third step, according to the obtained respective recognition result sets, the garbage in the above preset region is classified to generate a first garbage group and a second garbage group. Among them, the above classification process can be to determine whether the garbage can be rapidly degraded through the recognition result.

[0106] In the fourth step, the first garbage group and the second garbage group are respectively subjected to a first purification process and a second purification process. Among them, the above first purification process can be incineration treatment. The above second purification process can be landfill treatment.

[0107] The relevant content in the above first to fourth steps is an inventive point of the present disclosure, which solves the technical problem three mentioned in the background art: "When purifying garbage, it is not easy to classify the garbage, resulting in the selection of the wrong purification method and causing environmental pollution." The factors causing environmental pollution are often as follows: When purifying garbage, it is not easy to classify the garbage, resulting in the selection of the wrong purification method and causing environmental pollution. If the above factors are solved, the effect of avoiding environmental pollution can be achieved. To achieve this effect, first, in response to monitoring that the above transport vehicle transports the garbage carried to the above preset area, at least one area image of the above preset area is collected. Thus, the area image of the garbage placed can be obtained. Second, for each of the at least one area image, the following recognition steps are performed: First, the above area image is subjected to image enhancement processing to generate an enhanced area image. Thus, the features of the image can be enhanced. Second, the above enhanced area image is rotated at at least one preset angle to obtain a set of rotated area images. Thus, the recognition samples can be expanded. Third, for each rotated area image in the above set of rotated area images, the above rotated area image is subjected to a first cropping process and a second cropping process to generate a set of cropped images; for each cropped image in each of the generated sets of cropped images, the above cropped image is subjected to normalization processing to generate a normalized image. Thus, the image can be converted into an image of a unified size. Fourth, the set of normalized images is input into a pre-trained garbage recognition model to obtain a set of recognition results. Thus, the garbage category of the garbage is recognized. Then, according to each of the obtained sets of recognition results, the garbage in the above preset area is classified to generate a first garbage group and a second garbage group. Thus, the garbage can be classified according to the category of the garbage to distinguish the treatment methods of the garbage, so that the corresponding purification method can be selected for each garbage, thereby avoiding environmental pollution. Finally, the above first garbage group and the above second garbage group are respectively subjected to a first purification process and a second purification process. Thus, the purification of the garbage is completed, and environmental pollution is avoided.

[0108] The above-mentioned various embodiments of the present disclosure have the following beneficial effects: Through the garbage transportation method of some embodiments of the present disclosure, the time for garbage traceability is reduced. Specifically, the reason for the long time-consuming garbage traceability is that when transporting garbage to the cleaning station, data such as the source and weight of the garbage need to be recorded. Incorrect data may be recorded during garbage transportation, resulting in inconsistent reported information and actual information, and a long time is required for garbage traceability. Based on this, in the garbage transportation method of some embodiments of the present disclosure, first, obtain the set of user information to be transported corresponding to the above-mentioned transport vehicle. Thus, the users who need to transport garbage can be determined. Second, generate a transportation route according to each coordinate information included in the set of user information to be transported. Thus, the garbage of users can be transported in sequence according to the transportation route. Third, based on the set of transportation nodes included in the transportation route, perform the following transportation steps: First, control the above-mentioned transport vehicle to move to the position corresponding to the coordinate information of the first transportation node in the set of transportation nodes. Thus, the garbage of the first user can be transported. Second, in response to detecting a radio frequency signal, perform identification processing on the radio frequency signal to generate an identification result. Thus, the information sent by the radio frequency signal can be identified. Then, according to the above identification result, determine the garbage weight information of the user information to be transported corresponding to the above-mentioned transportation node. Thus, the identity information of the user and the weight of the garbage put by the user can be determined. After that, in response to the set of transportation nodes after deleting the first transportation node being empty, control the above-mentioned transport vehicle to move to the garbage cleaning station. Thus, the transportation of garbage is completed. Finally, in response to the set of transportation nodes after deleting the first transportation node not being empty and the above-mentioned transport vehicle meeting the first preset condition, control the above-mentioned transport vehicle to move to the above-mentioned garbage cleaning station, and in response to detecting the completion of garbage collection, use the set of transportation nodes after deleting the first transportation node as the set of transportation nodes and perform the above-mentioned transportation steps again. Thus, the garbage can be transported to the cleaning station after the transport vehicle cannot load garbage. Also, because the user identity is determined through the radio frequency signal and the garbage is weighed during garbage transportation, the inconsistency between the reported information and the actual information is avoided, thereby reducing the time for garbage traceability.

[0109] Further referring to Figure 2 , as an implementation of the methods shown in the above figures, the present disclosure provides some embodiments of a garbage transportation device. These device embodiments correspond to Figure 1 the method embodiments shown, and the garbage transportation device can be specifically applied to various electronic devices.

[0110] As Figure 2As shown, the garbage transportation device 200 of some embodiments includes: an acquisition unit 201, a generation unit 202, and an execution unit 203. Among them, the acquisition unit 201 is configured to acquire the set of user information to be transported corresponding to the above-mentioned transport vehicle, wherein the user information to be transported in the above-mentioned set of user information to be transported includes coordinate information; the generation unit 202 is configured to generate a transport route according to each coordinate information included in the above-mentioned set of user information to be transported, wherein the above-mentioned transport route includes a plurality of transport nodes, and the number of transport nodes included in the above-mentioned transport route is the same as the number of user information to be transported included in the above-mentioned set of user information to be transported; the execution unit 203 is configured to perform the following transport steps based on the set of transport nodes included in the transport route: control the above-mentioned transport vehicle to move to the position corresponding to the coordinate information of the first transport node in the above-mentioned set of transport nodes; in response to detecting a radio frequency signal, perform identification processing on the above-mentioned radio frequency signal to generate an identification result; according to the above-mentioned identification result, determine the garbage weight information of the user information to be transported corresponding to the above-mentioned transport node; in response to the set of transport nodes after deleting the first transport node being empty, control the above-mentioned transport vehicle to move to the garbage cleaning station; in response to the set of transport nodes after deleting the first transport node not being empty and the above-mentioned transport vehicle meeting the first preset condition, control the above-mentioned transport vehicle to move to the above-mentioned garbage cleaning station, and in response to detecting that the garbage recycling is completed, use the set of transport nodes after deleting the first transport node as the set of transport nodes, and perform the above-mentioned transport steps again.

[0111] It can be understood that the various units described in the garbage transportation device 200 correspond to the respective steps in the method described with reference to Figure 1 Therefore, the operations, features, and beneficial effects described above for the method also apply to the garbage transportation device 200 and the units included therein, and will not be repeated here.

[0112] Next, with reference to Figure 3 , which shows a schematic structural diagram of an electronic device 300 suitable for implementing some embodiments of the present disclosure. The electronic devices in some embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Tablet Computers), PMPs (Portable Multimedia Players), in-vehicle terminals (such as in-vehicle navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 3 The electronic device shown is only an example and should not impose any limitations on the functions and usage scopes of the embodiments of the present disclosure.

[0113] As Figure 3As shown, the electronic device 300 may include a processing device 301 (such as a central processing unit, a graphics processing unit, etc.), which may perform various appropriate actions and processes according to a program stored in the read-only memory (ROM) 302 or a program loaded from the storage device 308 into the random access memory (RAM) 303. In the RAM 303, various programs and data required for the operation of the electronic device 300 are also stored. The processing device 301, the ROM 302, and the RAM 303 are connected to each other via a bus 304. The input / output (I / O) interface 305 is also connected to the bus 304.

[0114] Generally, the following devices may be connected to the I / O interface 305: an input device 306 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 307 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 308 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 309. The communication device 309 may allow the electronic device 300 to communicate with other devices wirelessly or wiredly to exchange data. Although Figure 3 the electronic device 300 with various devices is shown, it should be understood that it is not required to implement or include all the shown devices. Instead, more or fewer devices may be implemented or included. Figure 3 Each block shown in the figure may represent one device or, as required, multiple devices.

[0115] In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes program codes for performing the methods shown in the flowcharts. In such some embodiments, the computer program may be downloaded and installed from a network via the communication device 309, or installed from the storage device 308, or installed from the ROM 302. When the computer program is executed by the processing device 301, the above functions defined in the methods of some embodiments of the present disclosure are executed.

[0116] It should be noted that the computer-readable media described in some embodiments of the present disclosure may be a computer-readable signal medium, a computer-readable storage medium, or any combination of the two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having 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 or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In some embodiments of the present disclosure, the computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, the computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer-readable signal medium may also be any computer-readable medium other than the computer-readable storage medium, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0117] In some embodiments, the client and the server can communicate using any currently known or future-developed network protocol such as HTTP (HyperText Transfer Protocol), and can be interconnected with digital data communication in any form or medium (e.g., a communication network). Examples of communication networks include local area networks ("LANs"), wide area networks ("WANs"), the Internet (e.g., the Internet), and end-to-end networks (e.g., ad hoc end-to-end networks), as well as any currently known or future-developed network.

[0118] The above computer-readable medium may be included in the above electronic device; or may exist separately without being assembled into the electronic device. The above computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device is caused to: obtain the set of user information to be transported corresponding to the above transport vehicle, wherein the user information to be transported in the above set of user information to be transported includes coordinate information. Generate a transport route according to each coordinate information included in the above set of user information to be transported, wherein the above transport route includes a plurality of transport nodes, and the number of transport nodes included in the above transport route is the same as the number of user information to be transported included in the above set of user information to be transported. Based on the set of transport nodes included in the transport route, perform the following transport steps: control the above transport vehicle to move to the position corresponding to the coordinate information of the first transport node in the above set of transport nodes; in response to detecting a radio frequency signal, perform identification processing on the above radio frequency signal to generate an identification result; determine the garbage weight information of the user information to be transported corresponding to the above transport node according to the above identification result; in response to the set of transport nodes after deleting the first transport node being empty, control the above transport vehicle to move to the garbage cleaning station; in response to the set of transport nodes after deleting the first transport node not being empty and the above transport vehicle satisfying the first preset condition, control the above transport vehicle to move to the above garbage cleaning station, and in response to detecting that the garbage collection is completed, use the set of transport nodes after deleting the first transport node as the set of transport nodes and perform the above transport steps again.

[0119] Computer program code for performing the operations of some embodiments of the present disclosure may be written in one or more programming languages or combinations thereof. The above programming languages include object-oriented programming languages - such as Java, Smalltalk, C++; and also include conventional procedural programming languages - such as the "C" language or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, executed as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network - including a local area network (LAN) or a wide area network (WAN) - or may be connected to an external computer (for example, by using an Internet service provider to connect through the Internet).

[0120] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagram may represent a module, a segment of a program, or a part of code that contains one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than that marked in the accompanying drawings. For example, two consecutive blocks shown may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, as well as combinations of blocks in the block diagram and / or flowchart, can be implemented by a dedicated hardware-based system that performs the specified functions or operations, or can be implemented by a combination of dedicated hardware and computer instructions.

[0121] The units described in some embodiments of the present disclosure can be implemented in software or in hardware. The described units can also be provided in a processor. For example, it can be described as: a processor includes an acquisition unit, a generation unit, and an execution unit. Among them, the names of these units do not constitute a limitation on the unit itself in some cases. For example, the acquisition unit can also be described as "the unit for acquiring the set of user information to be transported corresponding to the above transport vehicle".

[0122] The functions described above can be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that can be used include: Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), Systems on Chip (SOCs), Complex Programmable Logic Devices (CPLDs), and so on.

[0123] The above description is only some preferred embodiments of the present disclosure and an explanation of the applied technical principles. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solutions formed by the specific combination of the above technical features, and should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above inventive concept. For example, technical solutions formed by mutually replacing the above features with (but not limited to) technical features having similar functions disclosed in the embodiments of the present disclosure.

Claims

1. A garbage transportation method, applied to a garbage transportation system, wherein the garbage transportation system comprises a transportation vehicle, and the method comprises: Acquire a user information set to be transported corresponding to the transport vehicle, wherein the user information to be transported in the user information set to be transported includes coordinate information; Generate a transportation route according to each coordinate information included in the user information set to be transported, wherein the transportation route includes a plurality of transportation nodes, and the number of transportation nodes included in the transportation route is the same as the number of user information to be transported included in the user information set to be transported; The step of generating a transport route according to each coordinate information included in the user information set to be transported includes: Obtaining vehicle position information corresponding to the transport vehicle; According to the vehicle position information, user information to be transported that meets a second preset condition is selected from the set of user information to be transported as target user information, and coordinate information included in the target user information is determined as a starting point, wherein the second preset condition is that the distance between the position represented by the coordinate information included in the user information to be transported and the position represented by the vehicle position information is the shortest; The user information set to be transported without the target user information is used as the first user information set, and the following generation steps are performed based on the first user information set: Acquire a historical transport quality information group of each first user information in the first user information set to obtain a historical transport quality information group set; For each first user information in the first user information set, determining the average of each historical transport quality information included in the historical transport quality information set corresponding to the first user information as the quality prediction value; Determine a user distance between each first user information in the first user information set and the target user information to obtain a user distance set; For each first user information in the first user information set, determining a user information score according to a quality prediction value and a user distance corresponding to the first user information; Selecting a user information score that meets a second preset condition from the determined user information scores as a target user score, and determining the coordinate information included in the first user information corresponding to the target user score as a target transportation node; In response to the first user information set from which the first user information corresponding to the target user score is deleted being empty, combining the starting point and the target transportation node into a transportation route; in response to the first user information set from which the first user information corresponding to the target user score is deleted being not empty, using the first user information set from which the first user information corresponding to the target user score is deleted as the first user information set, determining the target transportation node as the starting point, and executing the generating step again; Based on the transport node set included in the transport route, the following transport steps are performed: Control the transport vehicle to move to a position corresponding to the coordinate information corresponding to the first transport node in the transport node set; In response to detecting the radio frequency signal, performing identification processing on the radio frequency signal to generate an identification result; Determine the garbage weight information of the user information to be transported corresponding to the transport node according to the identification result; In response to the transport node set being empty after deleting the first transport node, controlling the transport vehicle to move to a garbage cleaning station; In response to the transport node set after deleting the first transport node being not empty and the transport vehicle satisfying a first preset condition, the transport vehicle is controlled to move to the garbage cleaning station, and in response to detecting that garbage recycling is completed, the transport node set after deleting the first transport node is used as the transport node set, and the transport step is executed again, wherein the first preset condition is that the remaining space of the transport vehicle is less than or equal to the preset remaining space, and the remaining mass value is less than or equal to the preset mass value.

2. The method according to claim 1, wherein: The method further comprises: In response to the transport node set from which the first transport node is deleted being not empty and the transport vehicle not satisfying the first preset condition, the transport node set from which the first transport node is deleted is used as the transport node set, and the transport step is performed again.

3. The method according to claim 1, wherein: The garbage transportation system also includes a floor scale and a display terminal; And, after the transport node set is empty in response to deleting the first transport node, controlling the transport vehicle to move to the garbage cleaning station, the method further includes: Controlling the transport vehicle to move to a designated area included in the weighbridge; receiving a first mass value sent by the weighbridge; Controlling the transport vehicle to dispose of the transported garbage; In response to completion of garbage delivery, controlling the transport vehicle to move to the designated area again, and obtaining a second mass value sent by the scale; Determining a garbage quality value according to the first quality value and the second quality value; In response to the garbage quality value being the same as the pre-stored garbage quality value, obtaining at least one piece of to-be-transported user information included in at least one piece of identification information corresponding to the garbage quality value; Each piece of user information to be transported in the at least one piece of user information to be transported and the corresponding garbage weight information are combined into garbage discharge information, and the garbage discharge information is sent to the display terminal for display.

4. The method according to claim 3, wherein: Before determining the garbage quality value according to the first quality value and the second quality value, the method further includes: In response to the first mass value being less than the second mass value, generating shipping invalidation information, and displaying the shipping invalidation information on the display terminal.

5. The method according to claim 3, wherein: The method further comprises: The transport vehicle is controlled to transport the carried garbage to a preset area so as to purify the carried garbage.

6. A garbage transport device, comprising: An acquisition unit is configured to acquire a user information set to be transported corresponding to the transport vehicle, wherein the user information to be transported in the user information set to be transported includes coordinate information; A generating unit is configured to generate a transport route according to each coordinate information included in the user information set to be transported, wherein the transport route includes a plurality of transport nodes, and the number of transport nodes included in the transport route is the same as the number of user information to be transported included in the user information set to be transported; the generating unit is further configured to: Obtaining vehicle position information corresponding to the transport vehicle; According to the vehicle position information, user information to be transported that meets a second preset condition is selected from the set of user information to be transported as target user information, and coordinate information included in the target user information is determined as a starting point, wherein the second preset condition is that the distance between the position represented by the coordinate information included in the user information to be transported and the position represented by the vehicle position information is the shortest; The user information set to be transported without the target user information is used as the first user information set, and the following generation steps are performed based on the first user information set: Acquire a historical transport quality information group of each first user information in the first user information set to obtain a historical transport quality information group set; For each first user information in the first user information set, determining the average of each historical transport quality information included in the historical transport quality information set corresponding to the first user information as the quality prediction value; Determine a user distance between each first user information in the first user information set and the target user information to obtain a user distance set; For each first user information in the first user information set, determining a user information score according to a quality prediction value and a user distance corresponding to the first user information; Selecting a user information score that meets a second preset condition from the determined user information scores as a target user score, and determining the coordinate information included in the first user information corresponding to the target user score as a target transportation node; In response to the first user information set from which the first user information corresponding to the target user score is deleted being empty, combining the starting point and the target transportation node into a transportation route; in response to the first user information set from which the first user information corresponding to the target user score is deleted being not empty, using the first user information set from which the first user information corresponding to the target user score is deleted as the first user information set, determining the target transportation node as the starting point, and executing the generating step again; The execution unit is configured to perform the following transportation steps based on the transportation node set included in the transportation route: control the transportation vehicle to move to the position corresponding to the coordinate information corresponding to the first transportation node in the transportation node set; in response to detecting a radio frequency signal, identify and process the radio frequency signal to generate an identification result; determine the garbage weight information of the user information to be transported corresponding to the transportation node according to the identification result; in response to the transportation node set after deleting the first transportation node being empty, control the transportation vehicle to move to the garbage cleaning station; in response to the transportation node set after deleting the first transportation node being not empty and the transportation vehicle meets the first preset condition, control the transportation vehicle to move to the garbage cleaning station, and in response to detecting that garbage collection is completed, use the transportation node set after deleting the first transportation node as the transportation node set, and execute the transportation steps again, wherein the first preset condition is that the remaining space of the transportation vehicle is less than or equal to the preset remaining space, and the remaining mass value is less than or equal to the preset mass value.

7. An electronic device comprising: one or more processors; a storage device having one or more programs stored thereon; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 5.

8. A computer readable medium having a computer program stored thereon, wherein: When the program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.

Images