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

Abstract

The embodiment of the invention discloses a garbage transportation method and device, electronic equipment and a computer readable medium. A specific embodiment of the method comprises the steps of obtaining a to-be-transported user information set corresponding to a transport vehicle; generating a transportation route; controlling 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 the detected radio frequency signal, performing identification processing on the radio frequency signal; according to the identification result, determining garbage weight information of the to-be-transported user information corresponding to the transportation node; the transport vehicle is controlled to move to a garbage cleaning station; and in response to the fact that the transport node set with the first transport node deleted is not empty and the transport vehicle meets a first preset condition, the transport vehicle is controlled to move to the garbage cleaning station, and in response to the fact that garbage collection is completed, the transport node set with the first transport node deleted serves as the transport node set, and the transport step is executed again. According to the embodiment, the time for tracing the garbage to the source is shortened.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the field of computer technology, and in particular to a garbage transportation method, device, 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. At present, when transporting garbage, the usual method is: garbage collection and transportation units use electric tricycles to dump the garbage discharged by non-residential waste users at the nearest closed cleaning station, and then transport the garbage to the garbage treatment plant for standardized treatment.

[0003] However, it is found in practice that when the above method is used to transport garbage, the following technical problems often occur: When transporting 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 when transporting the garbage, resulting in the reported information being inconsistent with the actual information, and it takes a long time to trace the source of the garbage.

[0004] In the process of adopting technical solutions to solve the above-mentioned technical problem 1, the following problems often occur: Technical problem 2: In 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 next garbage discharged exceeding the remaining transportation space of the transport vehicle, causing the transport vehicle to transport the garbage discharged by the user again, wasting transportation resources. In response to these problems in the above-mentioned technical problem 2, the conventional solution is generally: when the remaining space of the transport vehicle is insufficient, it directly returns to the cleaning station and transports the garbage discharged by the next user again. However, the above-mentioned 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 transportation resources.

[0005] In the process of adopting technical solutions to solve the above technical problem one, the following problems often occur: Technical problem three: When purifying garbage, it is not easy to classify the garbage, resulting in the selection of the wrong purification method, causing environmental pollution. For these problems in the above technical problem three, the conventional solution is generally: the staff will sort the garbage put in. However, the above conventional solution still has the following problems: when the staff sorts the garbage, it is easy to make classification errors, 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 section is only for enhancement of understanding of the background of the inventive concept and therefore it may contain information that does not form the prior art that is already known in this country to a person of ordinary skill in the art. Summary of the invention

[0007] The content of this disclosure is used to introduce concepts in a brief form, which will be described in detail in the detailed implementation section below. The content of this disclosure is not intended to identify the key features or essential features of the technical solution claimed for protection, nor is it intended to limit the scope of the technical solution claimed for protection.

[0008] Some embodiments of the present disclosure propose garbage transportation methods, devices, electronic devices and computer-readable media to solve one or more of the technical problems mentioned in the above background technology section.

[0009] In a first aspect, some embodiments of the present disclosure provide a method for transporting garbage, the method comprising: obtaining a user information set to be transported corresponding to the above-mentioned transport vehicle, wherein the user information to be transported in the above-mentioned user information set includes coordinate information; generating a transport route according to each coordinate information included in the above-mentioned user information set, wherein the above-mentioned transport route includes multiple 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 user information set; based on the transport node set included in the transport route, executing the following transport steps: controlling the above-mentioned transport vehicle to move to the position corresponding to the first transport node in the above-mentioned transport node set; the position corresponding to the coordinate information of the transport node; in response to detecting the radio frequency signal, identifying and processing the radio frequency signal to generate an identification result; according to the identification result, determining the garbage weight information of the user information to be transported corresponding to the transport node; in response to the transport node set after deleting the first transport node being empty, controlling the transport vehicle to move to the garbage cleaning station; in response to the transport node set after deleting the first transport node being not empty and the transport vehicle meeting the first preset condition, controlling the transport vehicle to move to the garbage cleaning station, and in response to detecting that the garbage collection is completed, using the transport node set after deleting the first transport node as the transport node set, and executing the above transport steps again.

[0010] In a second aspect, some embodiments of the present disclosure provide a garbage transportation device, the device comprising: an acquisition unit, configured to acquire a user information set to be transported corresponding to the above-mentioned transport vehicle, wherein the user information to be transported in the above-mentioned user information set includes coordinate information; a generation unit, configured to generate a transportation route according to each coordinate information included in the above-mentioned user information set to be transported, wherein the above-mentioned transportation route includes multiple 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 user information set to be transported; an execution unit, configured to execute the following transportation steps based on the transportation node set included in the transportation route: control the above-mentioned transport vehicle to move to the above-mentioned transportation node the position corresponding to the coordinate information of the first transport node in the point set; in response to detecting the radio frequency signal, identifying and processing the above radio frequency signal to generate an identification result; according to the above identification result, determining the garbage weight information of the user information to be transported corresponding to the above transport node; in response to the transport node set after deleting the first transport node being empty, controlling the above transport vehicle to move to the garbage cleaning station; in response to the transport node set after deleting the first transport node being not empty, and the above transport vehicle meets the first preset condition, controlling the above transport vehicle to move to the above garbage cleaning station, and in response to detecting that the garbage collection is completed, using the transport node set after deleting the first transport node as the transport node set, and executing the above transport steps again.

[0011] In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any implementation manner of the above-mentioned first aspect.

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

[0013] The above-mentioned 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 tracing the source of garbage is reduced. Specifically, the reason why it takes a long time to trace the source of garbage is that when transporting garbage to the cleaning station, it is necessary to record data such as the source and weight of the garbage. When transporting garbage, wrong data may be recorded, resulting in the reported information not being consistent with the actual information, and it takes a long time to trace the source of garbage. Based on this, the garbage transportation method of some embodiments of the present disclosure, first, obtains the user information set to be transported corresponding to the above-mentioned transport vehicle. Thus, the user who needs to transport garbage can be determined. Second, according to the various coordinate information included in the above-mentioned user information set to be transported, a transportation route is generated. Thus, the user's garbage can be transported in sequence according to the transportation route. Third, based on the transportation node set included in the transportation route, the following transportation steps are performed: First, the above-mentioned transport vehicle is controlled to move to the position corresponding to the coordinate information corresponding to the first transport node in the above-mentioned transport node set. Thus, the garbage of the first user can be transported. Secondly, in response to detecting the radio frequency signal, the above-mentioned radio frequency signal is identified and processed to generate an identification result. Thus, the information sent by the radio frequency signal can be identified. Then, according to the above identification results, the garbage weight information of the user information to be transported corresponding to the above transport node is determined. In this way, the user's identity information and the weight of the garbage placed by the user can be determined. Afterwards, in response to the transport node set after deleting the first transport node being empty, the above transport vehicle is controlled to move to the garbage cleaning station. In this way, the transportation of the garbage is completed. Finally, in response to the transport node set after deleting the first transport node being not empty, and the above transport vehicle meets the first preset condition, the above transport vehicle is controlled to move to the above garbage cleaning station, and in response to detecting that the garbage recycling is completed, the transport node set after deleting the first transport node is used as the transport node set, and the above transportation steps are performed again. In this way, the garbage can be transported to the cleaning station after the transport vehicle cannot load the garbage. Also because the user identity is determined by radio frequency signals and the garbage is weighed when transporting the garbage, the inconsistency between the reported information and the actual information is avoided, thereby reducing the time for tracing the garbage. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that components and elements are not necessarily drawn to scale.

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

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

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

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

[0019] It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings. In the absence of conflict, the embodiments and features in the embodiments of the present disclosure 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 or interdependence of the functions performed by these devices, modules or units.

[0021] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated 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 used 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 accompanying drawings and in conjunction with embodiments.

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

[0025] Step 101, obtaining a set of information about users to be transported corresponding to the transport vehicle.

[0026] In some embodiments, the execution entity of the garbage transportation method (such as a server) can obtain the user information set to be transported corresponding to the above-mentioned transport vehicle. In practice, the above-mentioned user information set to be transported can be obtained from the target database by wired connection or wireless connection. Among them, the user information to be transported in the above-mentioned user information set to be transported includes coordinate information. The above-mentioned target database may be a pre-set database for storing the user information set to be transported. The user information to be transported in the above-mentioned user information set to be transported may be the user information of the user who places the garbage. The above-mentioned coordinate information may be the pre-stored coordinates of the user who places the garbage. 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 also includes a floor scale and a display terminal.

[0027] Step 102: Generate a transportation route according to the coordinate information included in the user information set to be transported.

[0028] In some embodiments, the execution entity may generate a transportation route based on the coordinate information included in the user information set to be transported. 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 transportation node may represent the coordinate information included in the user information to be transported.

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

[0030] The first step is to obtain the vehicle position information corresponding to the transport vehicle, wherein the vehicle position information may be the starting position of the transport vehicle.

[0031] In the second step, based on the vehicle location information, user information to be transported that meets the first preset condition is selected from the user information set to be transported as the target user information, and the coordinate information included in the target user information is determined as the starting point. The first preset condition may be that the distance between the position represented by the coordinate information and the position represented by the vehicle location information is the shortest.

[0032] In the third step, the user information set to be transported without the target user information is used as the first user information set. Based on the first user information set, the following generation steps are performed:

[0033] The first generation step is to obtain 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, wherein the historical transport quality information in the historical transport quality information group may be the quality of garbage placed by the user corresponding to the first user information at a historical time.

[0034] The second generation step is to determine, for each first user information in the first user information set, 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.

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

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

[0037] The fifth generation step is to select a user information score that meets the second preset condition from the determined user information scores as the target user score, and determine the coordinate information included in the first user information corresponding to the target user score as the target transportation node. The second preset condition may be the lowest user information score.

[0038] The sixth generation step is, in response to the first user information set being empty after the first user information corresponding to the target user score is deleted, combining the starting point and the target transportation node into a transportation route.

[0039] In the fourth step, in response to the first user information set from which the first user information corresponding to the above-mentioned target user score is deleted being not empty, the first user information set from which the first user information corresponding to the above-mentioned target user score is deleted is used as the first user information set, the above-mentioned target transportation node is determined as the starting point, and the above-mentioned generation step is executed again.

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

[0041] Step 1031, controlling the transport vehicle to move to a position corresponding to the coordinate information corresponding to the first transport node in the transport node set.

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

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

[0044] In some embodiments, the execution subject may, in response to detecting the radio frequency signal, perform identification processing on the radio frequency signal to generate an identification result. The radio frequency signal may be an electromagnetic wave signal sent by a passive radio frequency device. The electromagnetic wave signal may be a signal for transmitting user data. The identification processing may be performed by identifying the user data included in the radio frequency signal through a radio frequency signal receiver installed on the transport vehicle. The identification result may represent user information.

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

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

[0047] Step 1034, in response to the transport node set being empty after the first transport node is deleted, controlling the transport vehicle to move to the garbage cleaning station.

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

[0049] Considering the problems of the above conventional solutions, facing the above technical problem 2: in the process of transporting garbage, it is impossible to determine whether the garbage discharged by the next user will fill up the transport vehicle, resulting in the next garbage discharged exceeding the remaining transportation space of the transport vehicle, causing the transport vehicle to transport the garbage discharged by the user again, wasting transportation resources. Combined with the current technical status, it can be decided to adopt the following solution.

[0050] Optionally, after step 1034, in response to the transport node set for deleting the first transport node being not empty, and the transport vehicle does not meet the first preset condition, the following processing steps are performed:

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

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

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

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

[0055] The third processing step is to determine the remaining bearing volume corresponding to the above-mentioned transport vehicle based on the associated shooting equipment.

[0056] In some embodiments, the execution subject may determine the remaining carrying volume corresponding to the transport vehicle according to the associated photographing device. In practice, first, a garbage transport image of the transport vehicle taken by the photographing device may be obtained. Second, the garbage transport image may be input into a pre-trained spatial prediction model to obtain the remaining carrying 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 user information set excluding the user information to be transported corresponding to the above-mentioned first transport node:

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

[0059] In some embodiments, the execution subject may generate a user keyword information set of the target user based on the user information to be transported. In practice, the user information to be transported may be segmented, and the segmented user information to be transported may be determined as the user keyword information set.

[0060] The second determination step is to generate a user tag information set corresponding to the target user based on the user keyword information set.

[0061] In some embodiments, the execution subject may generate a user tag information set corresponding to the target user according to the user keyword information set. In practice, a user tag corresponding to the user keyword information may be selected from a preset tag set as user tag information to obtain a user tag information set.

[0062] The third determination step is to determine the user tag information set as the user portrait corresponding to the target user.

[0063] In some embodiments, the execution entity may determine the user tag information set as a user portrait corresponding to the target user.

[0064] The fourth determination step is to determine the junk category information of the target user based on the user portrait.

[0065] In some embodiments, the execution subject may determine the garbage category information of the target user based on the user portrait, wherein the garbage category information may be information on the material and type of the garbage.

[0066] In some embodiments, the execution subject may obtain the historical garbage quality value set of the target user. The historical garbage quality value in the historical garbage quality value set may be the quality of garbage placed by the target user in a pre-stored historical time period. The historical time period may be a time period before the current time that is preset.

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

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

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

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

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

[0072] The relevant contents in the above-mentioned first processing step to the eighth determination step are an inventive point of the present disclosure, which solves the technical problem 2 mentioned in the background technology: "In the process of transporting garbage, it is impossible to determine whether the garbage discharged by the next user will fill up the transport vehicle, resulting in the next garbage discharged exceeding the remaining transportation space of the transport vehicle, causing the transport vehicle to transport the garbage discharged by the user again, wasting transportation resources." The factors that cause the waste of transportation resources are often as follows: In the process of transporting garbage, it is impossible to determine whether the garbage discharged by the next user will fill up the transport vehicle, resulting in the next garbage discharged exceeding the remaining transportation space of the transport vehicle, resulting in the transport vehicle to transport the garbage discharged by the user again, wasting transportation resources. If the above-mentioned factors are solved, the effect of reducing the waste of transportation resources can be achieved. In order to achieve this effect, in response to the transport node set of deleting the first transport node being not empty, and the above-mentioned transport vehicle not meeting the first preset condition, the following processing steps are performed: First, the vehicle information corresponding to the above-mentioned transport vehicle is obtained. Thus, the volume and weight of the garbage that the transport vehicle can carry can be determined. Secondly, according to the above-mentioned vehicle information and at least one garbage weight information corresponding to the above-mentioned transport vehicle, the remaining bearing mass value of the above-mentioned transport vehicle is determined. Thus, the weight of the remaining garbage that can be carried can be determined. Then, according to the associated shooting equipment, the remaining bearing volume corresponding to the above-mentioned transport vehicle is determined. In this way, the volume of garbage that the transport vehicle can accommodate can be determined. Afterwards, for each user information to be transported in the above-mentioned user information set except the user information to be transported corresponding to the above-mentioned first transport node, the following determination steps are performed: first, based on the above-mentioned user information to be transported, a user keyword information set of the target user is generated; based on the above-mentioned user keyword information set, a user tag information set corresponding to the above-mentioned target user is generated; and the above-mentioned user tag information set is determined as the user portrait corresponding to the above-mentioned target user. In this way, the user portrait of the target user can be determined. Second, based on the above-mentioned user portrait, the garbage category information of the above-mentioned target user is determined. In this way, the type of garbage placed by the target user can be predicted. Third, the historical garbage quality value set of the above-mentioned target user is obtained; based on the above-mentioned historical garbage quality value set, the above-mentioned target user is subjected to garbage placement prediction processing to generate a first prediction result. In this way, the quality of garbage placed by the target user can be predicted. Fourth, in response to the prediction result satisfying the second preset condition, the target user is subjected to garbage volume prediction processing to generate a second prediction result; in response to the second prediction result satisfying the third preset condition, the transport vehicle is controlled to move to the position corresponding to the coordinate information corresponding to the target user. Thus, by predicting the volume and mass of the garbage placed by the user, it is determined that the remaining space of the transport vehicle can carry the garbage placed by the user, thereby reducing the number of times the transport vehicle transports garbage and reducing the waste of transportation resources.

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

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

[0075] In some embodiments, the execution entity may control the transport vehicle to move to a designated area included in the scale, wherein the designated area may be a pre-divided scale area for weighing the transport vehicle.

[0076] The second step is to receive the first mass value sent by the above-mentioned weighing scale.

[0077] In some embodiments, the execution entity may receive the first mass value sent by the scale, wherein the first mass value may be the total weight of the transport vehicle and the transported garbage.

[0078] The third step is to control the above-mentioned transport vehicle to dispose of the transported garbage.

[0079] In some embodiments, the execution entity may control the transport vehicle to dispose of the transported garbage, wherein the garbage disposition may be to dispose of the transported garbage to a pre-set garbage disposition location.

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

[0081] In some embodiments, the execution subject may control the transport vehicle to move to the designated area again in response to completion of the garbage delivery, and obtain the second mass value sent by the scale, wherein the second mass value may represent the mass of the transport vehicle.

[0082] Optionally, before the fifth step, in response to the first quality value being less than the second quality value, invalid transportation information is generated, and the invalid transportation information is displayed on the display terminal.

[0083] In some embodiments, the execution subject may generate invalid transport information in response to the first mass value being less than the second mass value, and display the invalid transport information on the display terminal, wherein the invalid transport information may indicate that the transport process is invalid.

[0084] The fifth step is to determine the garbage quality value according to the first quality value and the second quality value.

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

[0086] In a sixth step, in response to the garbage quality value being the same as the pre-stored garbage quality value, obtaining at least one piece of information of a user to be transported included in at least one piece of identification information corresponding to the garbage quality value.

[0087] In some embodiments, the execution subject may obtain at least one user information to be transported included in at least one identification information corresponding to the garbage mass value in response to the garbage mass value being the same as the pre-stored garbage mass value. The pre-stored garbage mass value may be the sum of the garbage weight values ​​included in each stored garbage weight information.

[0088] In the seventh step, 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.

[0089] In some embodiments, the execution entity may combine 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 into garbage discharge information, and send the garbage discharge information to the display terminal for display.

[0090] Step 1035, in response to the transport node set after deleting the first transport node is not empty and the transport vehicle meets the first preset condition, the transport vehicle is controlled to move to the garbage cleaning station, and in response to detecting that the garbage collection 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.

[0091] In some embodiments, the execution subject may control the transport vehicle to move to the garbage cleaning station in response to the transport node set after deleting the first transport node being not empty and the transport vehicle meeting the first preset condition, and in response to detecting that the garbage collection is completed, use the transport node set after deleting the first transport node as the transport node set and execute the transport step again. The 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 transport node set from which the first transport node is deleted being not empty and the transport vehicle satisfies 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.

[0093] In some embodiments, the execution entity may, 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, use the transport node set from which the first transport node is deleted as the transport node set and execute the transport step again.

[0094] Optionally, after step 1035, the transport vehicle is controlled to transport the carried garbage to a preset area so as to purify the carried garbage.

[0095] In some embodiments, the execution entity may control the transport vehicle to transport the carried garbage to a preset area so as to purify the carried garbage.

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

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

[0098] In the second step, for each of the at least one region image, the following recognition steps are performed:

[0099] The first recognition step is to perform image enhancement processing on the region image to generate an enhanced region image, wherein the image enhancement processing may be an RGB channel conversion processing.

[0100] The second recognition step is to rotate the enhanced region image by at least one preset angle to obtain a set of rotated region images. The preset angle may be a preset center rotation angle. For example, the preset angle may be 60 degrees clockwise.

[0101] The third identification step is to perform a first cropping process and a second cropping process on each rotation area image in the rotation area image set to generate a cropped image group. The first cropping process may be a random cropping process. The second cropping process may be a center cropping process.

[0102] The third recognition step is to perform a standardization process on each cropped image in each generated cropped image group to generate a standardized image, wherein the standardization process may be to convert the size of the image into the same size.

[0103] In the fourth recognition step, the standardized image set is input into a pre-trained garbage recognition model to obtain a recognition result set.

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

[0105] The third step is to classify the garbage in the preset area according to the obtained recognition result sets to generate a first garbage group and a second garbage group. The classification process may be to determine whether the garbage can be rapidly degraded according to the recognition result.

[0106] In the fourth step, the first garbage group and the second garbage group are subjected to a first purification treatment and a second purification treatment respectively, wherein the first purification treatment may be an incineration treatment and the second purification treatment may be a landfill treatment.

[0107] The relevant contents in the first step to the fourth step mentioned above serve as an inventive point of the present disclosure, which solves the technical problem three mentioned in the background technology: "When purifying garbage, it is not easy to classify the garbage, resulting in the selection of the wrong purification method, causing environmental pollution." The factors that cause 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, causing environmental pollution. If the above factors are solved, the effect of avoiding environmental pollution can be achieved. In order to achieve this effect, first, in response to monitoring that the above-mentioned transport vehicle transports the carried garbage to the above-mentioned preset area, at least one regional image of the above-mentioned preset area is collected. In this way, the regional image of the dropped garbage can be obtained. Secondly, for each regional image in the above-mentioned at least one regional image, the following recognition steps are performed: First, the above-mentioned regional image is subjected to image enhancement processing to generate an enhanced regional image. In this way, the features of the image can be enhanced. Second, the above-mentioned enhanced regional image is rotated by at least one preset angle to obtain a set of rotated regional images. In this way, the recognition sample can be expanded. Third, for each rotating area image in the rotating area image set, the rotating area image is subjected to a first cropping process and a second cropping process to generate a cropped image group; for each cropped image in each generated cropped image group, the cropped image is subjected to a standardization process to generate a standardized image. Thus, the image can be converted into an image of uniform size. Fourth, the standardized image set is input into a pre-trained garbage recognition model to obtain a recognition result set. Thus, the garbage category of the garbage is identified. Then, according to each recognition result set obtained, the garbage in the 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 garbage treatment method, so that the corresponding purification method can be selected for each garbage, thereby avoiding environmental pollution. Finally, the first garbage group and the second garbage group are subjected to a first purification process and a second purification process respectively. Thus, the purification of the garbage is completed and environmental pollution is avoided.

[0108] The above-mentioned 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 tracing the source of garbage is reduced. Specifically, the reason why it takes a long time to trace the source of garbage is that when transporting garbage to the cleaning station, it is necessary to record data such as the source and weight of the garbage. When transporting garbage, wrong data may be recorded, resulting in the reported information not being consistent with the actual information, and it takes a long time to trace the source of garbage. Based on this, the garbage transportation method of some embodiments of the present disclosure, first, obtains the user information set to be transported corresponding to the above-mentioned transport vehicle. Thus, the user who needs to transport garbage can be determined. Second, according to the various coordinate information included in the above-mentioned user information set to be transported, a transportation route is generated. Thus, the user's garbage can be transported in sequence according to the transportation route. Third, based on the transportation node set included in the transportation route, the following transportation steps are performed: First, the above-mentioned transport vehicle is controlled to move to the position corresponding to the coordinate information corresponding to the first transport node in the above-mentioned transport node set. Thus, the garbage of the first user can be transported. Secondly, in response to detecting the radio frequency signal, the above-mentioned radio frequency signal is identified and processed to generate an identification result. Thus, the information sent by the radio frequency signal can be identified. Then, according to the above identification results, the garbage weight information of the user information to be transported corresponding to the above transport node is determined. In this way, the user's identity information and the weight of the garbage placed by the user can be determined. Afterwards, in response to the transport node set after deleting the first transport node being empty, the above transport vehicle is controlled to move to the garbage cleaning station. In this way, the transportation of the garbage is completed. Finally, in response to the transport node set after deleting the first transport node being not empty, and the above transport vehicle meets the first preset condition, the above transport vehicle is controlled to move to the above garbage cleaning station, and in response to detecting that the garbage recycling is completed, the transport node set after deleting the first transport node is used as the transport node set, and the above transportation steps are performed again. In this way, the garbage can be transported to the cleaning station after the transport vehicle cannot load the garbage. Also because the user identity is determined by radio frequency signals and the garbage is weighed when transporting the garbage, the inconsistency between the reported information and the actual information is avoided, thereby reducing the time for tracing the garbage.

[0109] Further references Figure 2 As an implementation of the methods shown in the above figures, the present disclosure provides some embodiments of a garbage transport device. These device embodiments are similar to Figure 1 Corresponding to the method embodiments shown, the garbage transport device can be specifically applied to various electronic devices.

[0110] like Figure 2As shown, the garbage transport device 200 of some embodiments includes: an acquisition unit 201, a generation unit 202 and an execution unit 203. The acquisition unit 201 is configured to acquire the user information set to be transported corresponding to the above-mentioned transport vehicle, wherein the user information to be transported in the above-mentioned user information set 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 user information set to be transported, wherein the above-mentioned transport route includes multiple 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 user information set to be transported; the execution unit 203 is configured to perform the following transport steps based on the transport node set included in the transport route: control the above-mentioned transport vehicle to move to the first transport node in the above-mentioned transport node set the position corresponding to the corresponding coordinate information; in response to detecting the radio frequency signal, identifying and processing the above radio frequency signal to generate an identification result; according to the above identification result, determining the garbage weight information of the user information to be transported corresponding to the above transportation node; in response to the transportation node set after deleting the first transportation node being empty, controlling the above 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 above transportation vehicle meets the first preset condition, controlling the above transportation vehicle to move to the above garbage cleaning station, and in response to detecting that the garbage collection is completed, using the transportation node set after deleting the first transportation node as the transportation node set, and executing the above transportation steps again.

[0111] It is understood that the units described in the garbage transport device 200 are similar to those described in the reference Figure 1 Therefore, the operations, features and beneficial effects described above for the method are also applicable to the garbage transport device 200 and the units included therein, and will not be described in detail here.

[0112] Reference below Figure 3 , which shows a schematic diagram of the structure 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), vehicle terminals (such as 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 bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0113] like Figure 3As shown, the electronic device 300 may include a processing device 301 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 302 or a program loaded from a storage device 308 into a 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. An input / output (I / O) interface 305 is also connected to the bus 304.

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

[0115] In particular, according to some embodiments of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. 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 a program code for executing the method shown in the flowchart. In some such embodiments, the computer program can be downloaded and installed from the network through 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-mentioned functions defined in the method of some embodiments of the present disclosure are executed.

[0116] It should be noted that the computer-readable medium recorded in some embodiments of the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM 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, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In some embodiments of the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of 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 a computer readable storage medium, which may 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 suitable 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 may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0118] The computer-readable medium may be included in the electronic device; or it may exist independently without being installed in the electronic device. The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: obtains the 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 transport route is generated based on each coordinate information included in the user information set to be transported, wherein the transport route includes multiple 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. Based on the transport node set included in the transport route, the following transport steps are performed: the above-mentioned transport vehicle is controlled to move to the position corresponding to the coordinate information corresponding to the first transport node in the above-mentioned transport node set; in response to detecting the radio frequency signal, the above-mentioned radio frequency signal is identified and processed to generate an identification result; based on the above-mentioned identification result, the garbage weight information of the user information to be transported corresponding to the above-mentioned transport node is determined; in response to the transport node set after deleting the first transport node being empty, the above-mentioned transport vehicle is controlled to move to the garbage cleaning station; in response to the transport node set after deleting the first transport node being not empty and the above-mentioned transport vehicle meets the first preset condition, the above-mentioned transport vehicle is controlled to move to the above-mentioned garbage cleaning station; and in response to detecting that the garbage collection is completed, the transport node set after deleting the first transport node is used as the transport node set, and the above-mentioned transport steps are performed 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 a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

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

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

[0122] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0123] The above descriptions are only some preferred embodiments of the present disclosure and an explanation of the technical principles used. 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 a specific combination of the above-mentioned technical features, but should also cover other technical solutions formed by any combination of the above-mentioned technical features or their equivalent features without departing from the above-mentioned inventive concept. For example, the above-mentioned features are replaced with the technical features with similar functions disclosed in the embodiments of the present disclosure (but not limited to) and the technical solutions formed.

Claims

1. A garbage transportation method, applied to a garbage transportation system, wherein the garbage transportation system comprises a transportation vehicle, wherein the method include: 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; 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 from which the first transport node is deleted 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 from which the first transport node is deleted is used as the transport node set, and the transport step is executed again.

2. The method according to claim 1, in, 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, in, The generating of the 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, selecting the user information to be transported that meets the first preset condition from the user information set to be transported as the target user information, and determining the coordinate information included in the target user information as the starting point; 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, the first user information set from which the first user information corresponding to the target user score is deleted is used as the first user information set, the target transportation node is determined as the starting point, and the generating step is performed again.

4. The method according to claim 1, in, 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.

5. The method according to claim 4, in, 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.

6. The method according to claim 4, in, 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.

7. A garbage transport device, include: 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 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.

8. An electronic device, include: 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 6.

9. A computer readable medium having a computer program stored thereon, in, When the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images