Garbage collection full-scene data monitoring system

Abstract

The invention relates to the technical field of garbage collection and transportation full scenes, and particularly discloses a garbage collection and transportation full scene data monitoring system which comprises a full scene data acquisition module, a dynamic collection and transportation queue generation module, a collection and transportation vehicle distribution module, a transfer station distribution feedback module and a database. Garbage collection full scene data is collected in real time through sensor groups of garbage cans, garbage collection vehicles and transfer stations, traffic road condition information is fused to construct a data network, regional demands are predicted based on historical data, a dynamic priority queue is generated in combination with a garbage amount exceeding threshold proportion, and a path is optimized through capacity matching and real-time road conditions, so that the real-time garbage collection is realized. And the congestion compensation duration is calculated, it is ensured that classified garbage is precisely matched with vehicle partitions, the transfer station capacity is dynamically calculated, and overload tasks are automatically distributed to adjacent stations. According to the method, the problems of data islands, static scheduling and mixed loading of a traditional system are solved, the resource efficiency and environmental protection benefits are remarkably improved, and the clearance efficiency and the service quality are improved.

Description

Technical Field

[0001] The present invention relates to the technical field of full-scenario garbage collection and transportation, and more specifically, to a full-scenario data monitoring system for garbage collection and transportation. Background Art

[0002] Traditional garbage collection and transportation management mainly relies on manual scheduling and fixed-cycle inspections. There are problems such as fragmented data collection, inability to obtain full-scenario data in real time, and inability to dynamically respond to traffic congestion or a sharp increase in the amount of garbage, resulting in low resource utilization, response delays, and frequent mixed loading and transportation. Therefore, in order to ensure the garbage collection and transportation process, full-scenario data monitoring of garbage collection and transportation is required.

[0003] For example, the patent with the Chinese patent publication number CN111223029B discloses an intelligent environmental sanitation management system and method, including obtaining the garbage position data in the trash can; when the garbage position data is not less than a preset threshold, obtaining the position information of the three garbage collection and transportation vehicles closest to the trash can; obtaining the movement trajectories of the three garbage collection and transportation vehicles to master the collection and transportation progress and the number of trash cans collected by the garbage collection and transportation vehicles; calculating the return time and space of the three garbage collection and transportation vehicles respectively according to the position information, collection and transportation progress, and the number of trash cans collected, and sending the garbage position data and the instruction indicating garbage collection to the garbage collection and transportation vehicle with sufficient space and the shortest return time; sending a warning to the garbage collection and transportation vehicle that does not collect garbage in a timely manner and obtaining the information returned by the garbage collection and transportation vehicle. The present invention enables the garbage collection and transportation vehicle to collect and transport the garbage at the garbage collection position; in this way, the garbage collection and transportation vehicle can be timely allocated for garbage collection and transportation, and manual monitoring can be avoided, realizing centralized supervision, centralized scheduling, and reasonable allocation.

[0004] For example, the patent with the Chinese patent publication number CN111931986A discloses a garbage collection and transportation vehicle route optimization method and an urban garbage collection and transportation ecosystem, including: Step 1: Real-time monitoring of the bin capacities of each garbage collection point to obtain the real-time bin capacity information of each garbage collection point, and real-time monitoring of the operating states of each garbage collection and transportation vehicle to obtain the operating state information of each garbage collection and transportation vehicle; the operating state information includes the vehicle position information, driving time information, and vehicle driving speed information of the garbage collection and transportation vehicle; Step 2: Data processing of the real-time bin capacity information of each garbage collection point and the operating state information of each garbage collection and transportation vehicle, and based on the data after data processing, using a genetic algorithm to obtain a collection and transportation scheduling task, where the collection and transportation scheduling task includes the collection and transportation routes and the amount of garbage collected by each garbage collection and transportation vehicle; Step 3: Each garbage collection and transportation vehicle completes the collection and transportation work according to the collection and transportation scheduling task.

[0005] The following problems also exist in the above prior art: 1. The scheduling logic is single, only selecting vehicles based on "the nearest distance" and "the shortest return time", without considering the urgency of regional waste collection or the differences in waste types, and without generating a dynamic task queue, which may lead to delays in processing high-priority areas.

[0006] 2. Only the return time of the vehicle is calculated, and the congestion information of the real-time road conditions is not incorporated. The path planning is vulnerable to sudden traffic events, reducing the rationality of the allocation of waste collection vehicles.

[0007] 3. Only the capacity of the waste collection point and the operating status of the collection vehicle (position, driving time, speed) are monitored, and the processing capacity of the transfer station (remaining capacity, processing rate) is not incorporated. It is impossible to comprehensively evaluate the load of the transfer station or dynamically adjust the task allocation, which may lead to overloading or processing delays of the transfer station. Summary of the Invention

[0008] In view of this, to solve the problems raised in the above background technology, a full-scenario data monitoring system for waste collection is proposed.

[0009] The object of the present invention can be achieved through the following technical solutions: The present invention provides a full-scenario data monitoring system for waste collection, including: a full-scenario data acquisition module, which collects waste storage data, waste collection vehicle data, and transfer station processing data in real time through a sensor group deployed on trash cans, waste collection vehicles, and transfer stations, and obtains real-time road condition data from the traffic management platform.

[0010] A dynamic waste collection queue generation module, which evaluates the waste collection priority scores of each region based on historical waste collection data and waste storage data, and generates a dynamic waste collection queue accordingly.

[0011] A waste collection vehicle allocation module, which allocates corresponding waste collection vehicles to the dynamic waste collection queue in combination with waste storage data, waste collection vehicle data, and real-time road condition data.

[0012] A transfer station allocation feedback module, which determines whether the transfer station meets the waste processing requirements of the waste collection vehicle based on the transfer station waste processing rules according to the transfer station processing data, dynamically allocates a transfer station for the waste collection vehicle according to the output result, and feeds it back to the waste collection vehicle terminal.

[0013] Compared with the prior art, the embodiments of the present invention have at least the following advantages or beneficial effects: (1) By deploying sensors on trash cans, waste collection vehicles, transfer stations and traffic platform interfaces, the present invention collects waste storage volume, vehicle status, transfer station processing capacity and road condition data in real time, integrates multi-source data such as waste volume, vehicle position, and road conditions, forms a full-chain data closed loop, and solves the problem of data fragmentation in each link of the traditional system.

[0014] (2) The present invention calculates the regional waste collection priority score based on historical waste collection data such as the daily average production and collection cycle, and the real-time proportion of waste volume exceeding the threshold, generates a dynamic task queue, dynamically divides emergency tasks by coupling the overdue days and the proportion of waste volume exceeding the threshold, avoids resource waste caused by fixed cycles, generates a queue in descending order of the score, preferentially processes high-demand areas, and improves the waste collection efficiency and service quality.

[0015] (3) The present invention combines the remaining capacity of the vehicle, the classified storage partition, the real-time location, and the road congestion level, screens the suitable vehicle and calculates the required arrival time, ensures that the total remaining capacity of the vehicle and the classified partition capacity meet the task requirements, avoids mixed loading and transportation, integrates the real-time road conditions and vehicle speed, generates the shortest travel time path, reduces the empty driving rate, and reduces fuel consumption and carbon emissions.

[0016] (4) The present invention dynamically calculates the garbage capacity that can be accommodated in the transfer station in real time, dynamically allocates tasks to the first and second transfer stations, dynamically matches the capacity with the processing rate, prevents the transfer station equipment from being overloaded or idle, improves the resource utilization rate, and when the capacity of the first transfer station is insufficient, automatically allocates the excess tasks to the adjacent idle transfer stations to ensure the continuity of waste collection. Brief Description of the Drawings

[0017] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained based on these drawings.

[0018] Figure 1 It is a schematic diagram of the connection of the system modules of the present invention.

[0019] Figure 2 It is a schematic diagram of the set of executable task vehicles corresponding to the area in the dynamic waste collection queue of the present invention.

[0020] Figure 3 It is a schematic diagram of the hardware structure of the computer provided by the second embodiment of the present invention.

[0021] Brief Description of the Drawings: 1. Dynamic waste collection queue; 2. Area; 3. Set of executable task vehicles; 4. Waste collection vehicle. Detailed Embodiments

[0022] Next, in combination with the accompanying drawings in the embodiments of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0023] Embodiment 1

[0024] Please refer to Figure 1 As shown, the present invention provides a full-scenario data monitoring system for garbage collection and transportation, including: a full-scenario data collection module, a dynamic collection and transportation queue generation module, a collection and transportation vehicle allocation module, and a transfer station allocation feedback module.

[0025] It should be noted that the present invention also includes a database for storing the compensation driving time required for each road congestion level and storing the set of garbage collection and transportation urgency corresponding to each collection and transportation priority score.

[0026] The dynamic collection and transportation queue generation module, the collection and transportation vehicle allocation module, and the transfer station allocation feedback module are all connected to the full-scenario data collection module. The dynamic collection and transportation queue generation module is connected to the collection and transportation vehicle allocation module, the collection and transportation vehicle allocation module is connected to the transfer station allocation feedback module, and both the dynamic collection and transportation queue generation module and the collection and transportation vehicle allocation module are connected to the database.

[0027] The full-scenario data collection module, through a sensor group deployed on trash cans, collection and transportation vehicles, and transfer stations, collects garbage storage data, collection and transportation vehicle data, and transfer station processing data in real time, and obtains real-time road condition data from the traffic management platform.

[0028] In a specific embodiment of the present invention, the specific implementation process of collecting data in real time through the sensor group includes: installing a weight sensor and an image acquisition device in the trash can to obtain the total amount of garbage in each area and the amount of each classified garbage in real time.

[0029] It should be noted that the total amount of garbage in each trash can is collected through the weight sensor, the color of the trash can in each area is collected through the image acquisition device, the total amount of garbage in each trash can in each area is accumulated to obtain the total amount of garbage in each area, the total amount of garbage in the trash cans of the same color is accumulated to obtain the total amount of garbage corresponding to each trash can of the same color, and combined with the type of garbage storage corresponding to the color of each trash can, the amount of each classified garbage in each area can be obtained.

[0030] A GPS locator, a speed monitor, and a weight sensor are configured in the collection and transportation vehicle to collect the location, average vehicle speed, remaining total storage capacity, and remaining capacity of each classified storage area of the collection and transportation vehicle in real time.

[0031] It should be noted that weight sensors are respectively installed in each classified storage area of the garbage collection vehicle to collect the actual storage amount of garbage in each classified storage area. The difference between the preset storage amount and the actual storage amount of garbage in each classified storage area is used as the remaining capacity, and the total remaining storage capacity of the garbage collection vehicle is obtained by accumulating the remaining capacities of each classified storage area.

[0032] Image recognition devices and garbage treatment devices are deployed at the transfer station to obtain the remaining storage capacity of garbage and the unit time treatment rate at the transfer station in real time.

[0033] It should be noted that the specific implementation method of obtaining the remaining storage capacity of garbage at the transfer station through the image recognition device is as follows: The camera in the image recognition device takes real-time images of the garbage storage area, and the AI algorithm in the image recognition device is used to identify the garbage stacking height and distribution. Then, the real-time images and the garbage stacking height and distribution are imported into 3D modeling software, and according to 3D modeling technology, the remaining storage capacity of garbage is dynamically estimated. The unit time treatment rate can be directly obtained from the garbage treatment device.

[0034] In the embodiment of the present invention, by deploying sensors of trash cans, garbage collection vehicles, transfer stations and traffic platform interfaces, the garbage storage amount, vehicle status, transfer station processing capacity and road condition data are collected in real time, and multi-source data such as the garbage amount, vehicle position and road conditions are integrated to form a full-chain data closed-loop, solving the problem of data fragmentation in each link of the traditional system.

[0035] The dynamic waste collection queue generation module evaluates the waste collection priority scores of each area based on historical waste collection data and garbage storage data, and generates a dynamic waste collection queue accordingly.

[0036] In a specific embodiment of the present invention, the specific implementation process of evaluating the waste collection priority scores of each area includes: extracting the average daily waste generation amount and the average waste collection interval days of each area from the historical waste collection data.

[0037] Obtain the actual interval days between the current waste collection and the previous waste collection in each area, and calculate the ratio of the difference between the actual interval days and the average waste collection interval days to the average waste collection interval days to obtain the proportion of overdue waste collection interval days.

[0038] Calculate the ratio of the difference between the average daily waste generation amount in the historical waste collection data and the average daily waste generation amount threshold to the average daily waste generation amount threshold to obtain the proportion of the average daily waste generation amount exceeding the threshold.

[0039] Coupled calculation is performed based on the proportion of overdue waste collection interval days and the proportion of the average daily waste generation amount exceeding the threshold to obtain the urgency of waste collection in each area.

[0040] It should be noted that the specific implementation process of performing coupling calculations to obtain the waste removal priority scores for each region is as follows: The ratio of the proportion of days overdue for waste removal to the set proportion of overdue days is calculated, and the ratio of the proportion of the daily average waste generation exceeding the threshold to the set proportion of waste generation exceeding the threshold is calculated. The weighted calculation and summation of these two ratios are performed to obtain the waste removal urgency for each region.

[0041] In a specific embodiment of the present invention, the proportion of overdue days directly reflects the urgency of the current waste backlog. The longer the overdue period, the more likely it is that the waste storage volume will exceed the safety threshold, leading to immediate environmental risks such as odors and pests. Therefore, when evaluating the waste removal urgency, the weights of the proportion of days overdue for waste removal and the proportion of the daily average waste generation exceeding the threshold in the waste removal urgency assessment can be set to 0.6 and 0.4, respectively.

[0042] The waste removal urgency of each region is compared with the set of waste removal urgencies corresponding to the waste removal priority scores stored in the database. If the waste removal urgency of a certain region is within the set of waste removal urgencies corresponding to a certain waste removal priority score, then this waste removal priority score is used as the waste removal priority score for this region, thereby obtaining the waste removal priority scores for each region.

[0043] In a specific embodiment of the present invention, a dynamic waste removal queue is generated by sorting the regions in descending order of the waste removal priority scores.

[0044] In the embodiments of the present invention, based on historical waste removal data such as the daily average waste generation and waste removal cycle, and the real-time proportion of waste volume exceeding the threshold, the waste removal priority scores for each region are calculated to generate a dynamic task queue. By coupling the number of overdue days and the proportion of waste volume exceeding the threshold, urgent tasks are dynamically divided, avoiding resource waste caused by fixed cycles. The queue is generated in descending order of the scores, and high-demand regions are given priority to improve the waste removal efficiency and service quality.

[0045] The waste removal vehicle allocation module allocates corresponding waste removal vehicles to the dynamic waste removal queue in combination with waste storage data, waste removal vehicle data, and real-time road condition data.

[0046] Please refer to Figure 2 As shown, in a specific embodiment of the present invention, the specific implementation process of allocating corresponding waste removal vehicles to the dynamic waste removal queue is as follows: Screening is performed based on the total waste volume and the volume of each classified waste in each region in the waste storage data, as well as the remaining total storage capacity of each waste removal vehicle and the remaining capacity of each classified storage area in the waste removal vehicle data, to obtain the set of executable task vehicles corresponding to each region in the dynamic waste removal queue.

[0047] In a specific embodiment of the present invention, the specific method of obtaining the set of executable task vehicles corresponding to each area in the dynamic removal queue is: the remaining total storage capacity of each removal vehicle and the remaining capacity of each classified storage partition are respectively compared with the total amount of garbage and the amount of each classified garbage in each area; when the remaining total storage capacity of a certain removal vehicle is greater than the total amount of garbage in a certain area and the remaining capacity of each classified storage partition of the removal vehicle is greater than the amount of garbage of the corresponding garbage type in the area, the removal vehicle is used as the executable task vehicle in the area, thereby obtaining the set of executable task vehicles corresponding to each area in the dynamic removal queue.

[0048] The location and average speed of each removal vehicle in the removal vehicle data and the road congestion level in the real-time road condition data are integrated to obtain the arrival time of each removal vehicle in the set of executable task vehicles corresponding to each area in the dynamic removal queue.

[0049] It should be noted that the road congestion level in the real-time traffic data is determined by the following steps: First, integrate multi-source data, including vehicle-mounted GPS, mobile phone positioning, road sensors (such as ground sensors, cameras) and user-reported information, and collect vehicle speed, location and flow in real time. Secondly, clean the data and align it in time and space, remove outliers and match them to specific sections. Subsequently, the key indicators of specific sections (such as average speed, traffic volume, and travel time ratio) are automatically derived through the data uploaded to the traffic management system. Finally, through machine learning algorithms combined with historical traffic models and dynamic thresholds (50% of the travel time in unblocked conditions is used as the congestion boundary), the traffic management system automatically divides the congestion level of specific sections (smooth, slow, congested, and severely congested).

[0050] In a specific embodiment of the present invention, the specific implementation process of obtaining the time required for the arrival of each removal vehicle in the set of executable task vehicles corresponding to each area in the dynamic removal queue is as follows: based on the position of each removal vehicle and the position of each area in the dynamic removal queue, the arrival distance of each removal vehicle is obtained, and the speed is divided by the average speed of each removal vehicle to obtain the theoretical time required for the arrival of each removal vehicle in the set of executable task vehicles corresponding to each area in the dynamic removal queue.

[0051] It should be noted that the locations of each area and the locations of the transfer stations corresponding to each area mentioned below are all obtained from the map, and the locations of each removal vehicle and each area are simultaneously imported into the map software to directly obtain the arrival distance.

[0052] Compare the road congestion level with the compensation driving duration required for each road congestion level stored in the database to obtain the compensation driving duration required for each cleaning vehicle on the driving road corresponding to the executable task vehicle set in each area in the dynamic cleaning queue, and sum it with the theoretical duration required for arrival to obtain the arrival required duration for each cleaning vehicle in the executable task vehicle set corresponding to each area in the dynamic cleaning queue.

[0053] According to the arrangement order of each area in the dynamic cleaning queue, sequentially extract the cleaning vehicle with the shortest arrival required duration from the corresponding executable task vehicle set as the corresponding cleaning vehicle for each area.

[0054] In the embodiment of the present invention, by combining the remaining capacity of the vehicle, the classified storage area, the real-time position and the road congestion level, the adaptable vehicle is screened and the arrival required duration is calculated to ensure that the total remaining capacity of the vehicle and the classified area capacity meet the task requirements, avoid mixed loading and transportation, integrate the real-time road conditions and vehicle speed, generate the shortest passing time path, reduce the empty driving rate, and reduce fuel consumption and carbon emissions.

[0055] The transfer station allocation feedback module determines whether the transfer station meets the garbage treatment requirements of the cleaning vehicle based on the transfer station processing data according to the garbage treatment rules of the transfer station, dynamically allocates the transfer station for the cleaning vehicle according to the output result, and feeds it back to the cleaning vehicle terminal.

[0056] In a specific embodiment of the present invention, the specific implementation method for determining whether the transfer station meets the garbage treatment requirements of the cleaning vehicle based on the garbage treatment rules of the transfer station is: obtain the remaining storage capacity and unit time processing rate of the transfer station corresponding to each area in real time from the transfer station processing data, obtain the total garbage removal volume and average vehicle speed of the cleaning vehicle corresponding to each area from the cleaning vehicle data and real-time road condition data respectively, and evaluate the garbage capacity that can be accommodated by the transfer station corresponding to each area accordingly.

[0057] In a specific embodiment of the present invention, the specific process for evaluating the garbage capacity that can be accommodated by the transfer station corresponding to each area is: obtain the transportation distance between the transfer station corresponding to each area and the cleaning vehicle according to the positions of each area and the transfer station corresponding to each area, combine the road congestion level and average vehicle speed of the transportation road of the cleaning vehicle corresponding to each area to obtain the required duration for the cleaning vehicle corresponding to each area to drive to the corresponding transfer station, multiply it by the unit time processing rate of the corresponding transfer station, and add the multiplication result to the remaining storage capacity of the corresponding transfer station to obtain the garbage capacity that can be accommodated by the transfer station corresponding to each area.

[0058] It should be noted that the transportation distance is directly obtained by importing the positions of each area and the transfer station corresponding to each area into the map software at the same time.

[0059] It should also be noted that the specific method for obtaining the required time for the garbage collection vehicles corresponding to each region to travel to the corresponding transfer station is as follows: compare the congestion level of the transportation roads of the garbage collection vehicles corresponding to each region with the required compensation travel time corresponding to each road congestion level stored in the database to obtain the required compensation travel time for the transportation roads of the garbage collection vehicles corresponding to each region.

[0060] Divide the transportation distance between the transfer station corresponding to each region and the garbage collection vehicle by the average speed of the corresponding garbage collection vehicle to obtain the theoretical travel time for the garbage collection vehicle corresponding to each region to travel to the corresponding transfer station, and add it to the required compensation travel time to obtain the required time for the garbage collection vehicle corresponding to each region to travel to the corresponding transfer station.

[0061] Compare the garbage capacity that the transfer station corresponding to each region can accommodate with the total garbage collection volume of the garbage collection vehicle corresponding to each region. If the garbage capacity that the transfer station corresponding to a certain region can accommodate is greater than the total garbage collection volume of the garbage collection vehicle corresponding to that region, it means that the transfer station corresponding to that region meets the garbage treatment requirements of the garbage collection vehicle corresponding to that region; otherwise, it means that the transfer station corresponding to that region does not meet the garbage treatment requirements of the garbage collection vehicle corresponding to that region.

[0062] In a specific embodiment of the present invention, the specific method for dynamically allocating transfer stations for garbage collection vehicles according to the output result is as follows: if the transfer station corresponding to a certain region meets the garbage treatment requirements of the garbage collection vehicle corresponding to that region, then use the transfer station corresponding to that region as the final transfer station for the garbage collection vehicle corresponding to that region.

[0063] If the transfer station corresponding to a certain region does not meet the garbage treatment requirements of the garbage collection vehicle corresponding to that region, then subtract the garbage capacity that the transfer station corresponding to that region can accommodate from the total garbage collection volume of the corresponding garbage collection vehicle to obtain the excess task garbage volume. Use the transfer station corresponding to that region as the first transfer station for the corresponding garbage collection vehicle, and allocate a second transfer station for the excess task garbage volume.

[0064] In a specific embodiment of the present invention, the specific implementation method for allocating a second transfer station for the excess task garbage volume is as follows: subtract the garbage capacity that the transfer station corresponding to the remaining regions can accommodate from the total garbage collection volume of the corresponding garbage collection vehicle to obtain the remaining available garbage capacity of the transfer stations corresponding to the remaining regions, and obtain the allocation distance between the garbage collection vehicle and the remaining regions according to the positions of the remaining regions and the garbage collection vehicle. Use the transfer station with the remaining available garbage capacity greater than the excess task garbage volume and the shortest allocation distance as the second transfer station.

[0065] It should be noted that the positions of the remaining regions and the garbage collection vehicle are imported into the map software at the same time to directly obtain the allocation distance.

[0066] It should be noted that the feedback to the terminal of the garbage collection vehicle specifically refers to the feedback of the transfer station location assigned to the garbage collection vehicle to its corresponding navigation system.

[0067] In the embodiment of the present invention, by calculating the available garbage capacity of the transfer station in real time and dynamically allocating tasks to the first and second transfer stations, through the dynamic matching of capacity and processing rate, it is possible to prevent the transfer station equipment from being overloaded or idle, improve resource utilization rate. When the capacity of the first transfer station is insufficient, the excess tasks are automatically allocated to the adjacent idle transfer stations to ensure the continuity of garbage collection.

[0068] Embodiment 2

[0069] As Figure 3 shown, the embodiment of the present invention provides the following technical solution. A computer includes a memory 202, a processor 201, and a computer program stored on the memory 202 and executable on the processor 201. When the processor 201 executes the computer program, it implements a garbage collection full-scenario data monitoring system as described above.

[0070] Specifically, the above-mentioned processor 201 may include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present application.

[0071] Among them, the memory 202 may include a mass storage for data or instructions. By way of example and not limitation, the memory 202 may include a hard disk drive (HDD), a floppy disk drive, a solid state drive (SSD), a flash memory, an optical disc, a magneto-optical disc, a magnetic tape, or a universal serial bus (USB) drive, or a combination of two or more of these. Where appropriate, the memory 202 may include removable or non-removable (or fixed) media. Where appropriate, the memory 202 may be internal or external to the data processing device. In a particular embodiment, the memory 202 is a non-volatile memory. In a particular embodiment, the memory 202 includes a read-only memory (ROM) and a random access memory (RAM). Where appropriate, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), an electrically alterable ROM (EAROM), or a flash memory, or a combination of two or more of these. Where appropriate, the RAM may be a static random access memory (SRAM) or a dynamic random access memory (DRAM), where the DRAM may be a fast page mode dynamic random access memory (FPMDRAM), an extended data output dynamic random access memory (EDODRAM), a synchronous dynamic random access memory (SDRAM), etc.

[0072] The memory 202 can be used to store or cache various data files required for processing and / or communication, as well as possible computer program instructions executed by the processor 201.

[0073] The processor 201 reads and executes the computer program instructions stored in the memory 202 to implement the above-mentioned garbage collection full-scenario data monitoring system.

[0074] In some of these embodiments, the computer may further include a communication interface 203 and a bus 200. Among them, as Figure 3 shown, the processor 201, the memory 202, and the communication interface 203 are connected through the bus 200 and complete communication with each other.

[0075] The communication interface 203 is used to implement communication between the various modules, devices, units, and / or devices in the embodiments of the present application. The communication interface 203 can also implement data communication with other components, such as external devices, image / data acquisition devices, databases, external storage, and image / data processing workstations.

[0076] The bus 200 includes hardware, software, or both, and couples the components of a computer together. The bus 200 includes, but is not limited to, at least one of the following: Data Bus, Address Bus, Control Bus, Expansion Bus, Local Bus. By way of example and not limitation, the bus 200 may include an Accelerated Graphics Port (AGP) or other graphics bus, an Extended Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a Hyper Transport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an InfiniBand interconnect, a Low Pin Count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local Bus (VLB) bus, or other suitable bus or a combination of two or more of these. Where appropriate, the bus 200 may include one or more buses. Although the embodiments of the present application describe and illustrate specific buses, the present application contemplates any suitable bus or interconnect.

[0077] The above content is only an example and illustration of the concept of the present invention. Those skilled in the art of the present technology may make various modifications or supplements to the described specific embodiments or use similar methods for substitution, as long as they do not deviate from the concept of the invention or exceed the scope defined by the present invention, they should fall within the protection scope of the present invention.

Claims

1. A full-scenario data monitoring system for garbage collection and transportation, characterized in that, Including: A full-scenario data collection module that, through a sensor group deployed in trash cans, garbage collection vehicles, and transfer stations, collects garbage storage data, garbage collection vehicle data, and transfer station processing data in real time, and obtains real-time road condition data from the traffic management platform; A dynamic garbage collection queue generation module that, based on historical garbage collection data and garbage storage data, evaluates the garbage collection priority scores of each region, and generates a dynamic garbage collection queue accordingly; A garbage collection vehicle allocation module that, in combination with garbage storage data, garbage collection vehicle data, and real-time road condition data, allocates corresponding garbage collection vehicles to the dynamic garbage collection queue; A transfer station allocation feedback module that, based on the transfer station processing data, determines whether the transfer station meets the garbage processing requirements of the garbage collection vehicle according to the garbage processing rules of the transfer station, dynamically allocates a transfer station to the garbage collection vehicle according to the output result, and feeds it back to the garbage collection vehicle terminal.

2. The garbage collection full-scenario data monitoring system according to claim 1, characterized in that: The specific implementation process of evaluating the garbage collection priority scores of each region includes: Extracting the average daily garbage generation amount and the average garbage collection interval days of each region from the historical garbage collection data; Obtaining the actual interval days between the current garbage collection and the last garbage collection in each region, and obtaining the proportion of overdue garbage collection interval days by taking the ratio of the difference between the actual interval days and the average garbage collection interval days to the average garbage collection interval days; Taking the ratio of the difference between the average daily garbage generation amount in the historical garbage collection data and the average daily garbage generation amount threshold to the average daily garbage generation amount threshold to obtain the proportion of the average daily garbage generation amount exceeding the threshold; Performing coupling calculation based on the proportion of overdue garbage collection interval days and the proportion of the average daily garbage generation amount exceeding the threshold to obtain the garbage collection urgency of each region; Comparing the garbage collection urgency of each region with the set of garbage collection urgencies corresponding to each garbage collection priority score stored in the database. If the garbage collection urgency of a certain region is within the set of garbage collection urgencies corresponding to a certain garbage collection priority score, then taking this garbage collection priority score as the garbage collection priority score of this region, thereby obtaining the garbage collection priority scores of each region.

3. The garbage collection full-scenario data monitoring system according to claim 1, characterized in that: The specific implementation method of generating the dynamic garbage collection queue is: generating a dynamic garbage collection queue by arranging each region in descending order of the garbage collection priority score.

4. The garbage collection full-scenario data monitoring system according to claim 1, wherein: The specific implementation process of allocating corresponding garbage collection vehicles to the dynamic garbage collection queue is: Screening according to the total garbage amount and the amount of each classified garbage in each region in the garbage storage data, and the remaining total storage capacity and the remaining capacity of each classified storage area of each garbage collection vehicle in the garbage collection vehicle data, to obtain a set of executable task vehicles corresponding to each region in the dynamic garbage collection queue; Performing fusion processing on the location and average vehicle speed of each garbage collection vehicle in the garbage collection vehicle data and the road congestion level in the real-time road condition data to obtain the required arrival time of each garbage collection vehicle in the set of executable task vehicles corresponding to each region in the dynamic garbage collection queue; According to the arrangement order of each region in the dynamic garbage collection queue, sequentially extracting the garbage collection vehicle with the shortest required arrival time from the corresponding set of executable task vehicles as the corresponding garbage collection vehicle for each region.

5. A full-scenario data monitoring system for garbage collection and transportation according to claim 4, characterized in that: The specific method for obtaining the set of executable task vehicles corresponding to each area in the dynamic waste collection queue is as follows: Compare the remaining total storage capacity of each waste collection vehicle and the remaining capacity of each classified storage area with the total waste amount of each area and the waste amount of each classified waste type respectively. When the remaining total storage capacity of a certain waste collection vehicle is greater than the total waste amount of a certain area and the remaining capacity of each classified storage area of this waste collection vehicle is greater than the waste amount of the corresponding waste type in this area, then this waste collection vehicle is regarded as an executable task vehicle for this area. Thus, the set of executable task vehicles corresponding to each area in the dynamic waste collection queue is obtained.

6. The garbage collection full-scenario data monitoring system according to claim 4, wherein: The specific implementation process for obtaining the arrival required time of each waste collection vehicle in the set of executable task vehicles corresponding to each area in the dynamic waste collection queue is as follows: Based on the location of each waste collection vehicle and the locations of each area in the dynamic waste collection queue, obtain the arrival distance of each waste collection vehicle, and divide it by the average vehicle speed of each waste collection vehicle to obtain the theoretical arrival required time of each waste collection vehicle in the set of executable task vehicles corresponding to each area in the dynamic waste collection queue; Compare the road congestion level with the required compensation driving time corresponding to each road congestion level stored in the database to obtain the required compensation driving time for the driving roads corresponding to each waste collection vehicle in the set of executable task vehicles corresponding to each area in the dynamic waste collection queue, and sum it with the theoretical arrival required time to obtain the arrival required time of each waste collection vehicle in the set of executable task vehicles corresponding to each area in the dynamic waste collection queue.

7. A full-scenario data monitoring system for garbage collection and transportation according to claim 1, characterized in that: The specific implementation method for judging whether a transfer station meets the waste treatment requirements of waste collection vehicles based on the waste treatment rules of the transfer station is as follows: Obtain the remaining storage capacity and unit time treatment rate of the transfer station corresponding to each area in real time from the transfer station processing data, obtain the total waste collection amount and average vehicle speed of the waste collection vehicle corresponding to each area from the waste collection vehicle data and real-time road condition data respectively, and evaluate the available waste capacity of the transfer station corresponding to each area accordingly; Compare the available waste capacity of the transfer station corresponding to each area with the total waste collection amount of the waste collection vehicle corresponding to each area. If the available waste capacity of the transfer station corresponding to a certain area is greater than the total waste collection amount of the waste collection vehicle corresponding to this area, it means that the transfer station corresponding to this area meets the waste treatment requirements of the waste collection vehicle corresponding to this area. Otherwise, it means that the transfer station corresponding to this area does not meet the waste treatment requirements of the waste collection vehicle corresponding to this area.

8. The full-scenario data monitoring system for garbage collection and transportation according to claim 7, wherein: The specific process for evaluating the available waste capacity of the transfer station corresponding to each area is as follows: Based on the location of each area and the location of the transfer station corresponding to each area, obtain the transportation distance between the transfer station corresponding to each area and the waste collection vehicle, combine the transportation road congestion level and average vehicle speed of the waste collection vehicle corresponding to each area to obtain the required time for the waste collection vehicle corresponding to each area to travel to the corresponding transfer station, multiply it by the unit time treatment rate of the corresponding transfer station, and add the multiplication result to the remaining storage capacity of the corresponding transfer station to obtain the available waste capacity of the transfer station corresponding to each area.

9. The garbage collection full-scenario data monitoring system according to claim 7, characterized in that: The specific method for dynamically allocating transfer stations to waste collection vehicles according to the output result is as follows: If the transfer station corresponding to a certain area meets the garbage disposal requirements of the garbage transport vehicles corresponding to that area, then the transfer station corresponding to that area is taken as the final transfer station for the garbage transport vehicles corresponding to that area; If the transfer station corresponding to a certain area does not meet the garbage disposal requirements of the garbage transport vehicles corresponding to that area, then the difference is calculated between the garbage capacity that the transfer station corresponding to that area can accommodate and the total amount of garbage transported by the corresponding garbage transport vehicles, resulting in the excess task garbage volume. The transfer station corresponding to that area is taken as the first transfer station for the corresponding garbage transport vehicles, and a second transfer station is allocated for the excess task garbage volume.

10. A full-scenario data monitoring system for garbage collection and transportation according to claim 9, characterized in that: The specific implementation method for allocating a second transfer station for the excess task garbage volume is as follows: Calculate the difference between the garbage capacity that the transfer stations corresponding to the other areas can accommodate and the total amount of garbage transported by the corresponding garbage transport vehicles, obtaining the remaining available garbage capacity of the transfer stations corresponding to the other areas. Based on the positions of the other areas and the garbage transport vehicles, calculate the distribution distance between the garbage transport vehicles and the other areas. The transfer station with the remaining available garbage capacity greater than the excess task garbage volume and the shortest distribution distance is taken as the second transfer station.

Images