CN110730218A - Intelligent garbage putting method and system and storage medium - Google Patents
Intelligent garbage putting method and system and storage medium Download PDFInfo
- Publication number
- CN110730218A CN110730218A CN201910910720.4A CN201910910720A CN110730218A CN 110730218 A CN110730218 A CN 110730218A CN 201910910720 A CN201910910720 A CN 201910910720A CN 110730218 A CN110730218 A CN 110730218A
- Authority
- CN
- China
- Prior art keywords
- garbage
- movable
- request
- server
- target user
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
- G06F18/232—Non-hierarchical techniques
- G06F18/2321—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions
- G06F18/23213—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions with fixed number of clusters, e.g. K-means clustering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
- H04L67/025—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP] for remote control or remote monitoring of applications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
- H04L67/125—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks involving control of end-device applications over a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Mining & Analysis (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Bioinformatics & Computational Biology (AREA)
- Probability & Statistics with Applications (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Medical Informatics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Refuse Collection And Transfer (AREA)
Abstract
The invention provides a garbage throwing method based on a movable garbage can, which comprises the following steps: the client monitors a garbage throwing request triggered by a user and sends the triggered garbage throwing request to a server; the server receives the garbage throwing request, analyzes client position information in the request and searches for a movable garbage can closest to the position; sending a moving instruction to the movable garbage can, wherein the moving instruction comprises a target user position; according to the garbage throwing method, the garbage throwing system and the storage medium based on the movable garbage can, provided by the embodiment of the invention, tourists can call the movable garbage can to the front of the tourists through the mobile phone client, so that the phenomenon that the tourists randomly throw garbage or cannot find the garbage can is avoided, and the cleanness of a park is improved.
Description
Technical Field
The embodiment of the invention relates to the field of signal control, in particular to an intelligent garbage throwing method, an intelligent garbage throwing system and a storage medium.
Background
At present, the garbage cans in scenic spots are all fixedly thrown, but due to cost consideration, the number and the coverage area of the garbage cans are limited, the garbage cans are usually concentrated in catering centers in scenic spots, and many marginal areas or specific zones are not provided with the garbage cans, so that the problem of how visitors can throw garbage into the garbage cans on the premise of not increasing cost is continuously solved.
Disclosure of Invention
In order to solve the above problem, an embodiment of the present invention provides an intelligent garbage throwing method, including the following steps:
the client monitors a garbage throwing request triggered by a user and sends the triggered garbage throwing request to a server;
the server receives the garbage throwing request, analyzes client position information in the request and searches for a movable garbage can closest to the position;
sending a moving instruction to the movable garbage can, wherein the moving instruction comprises a target user position;
and the movable garbage can receives the movement instruction and drives a motor of the movable garbage can to move along the laid track until the position of a target user is reached.
The movable garbage can detects the saturation of garbage contained in the movable garbage can through an infrared sensor of the movable garbage can, if the saturation is larger than a threshold value, the movable garbage can drives the movable garbage can to go to a garbage recovery site and sends a pause signal to the server, and after the server receives the pause signal, the server caches and marks a request user who does not finish garbage recovery and a request user who subsequently submits garbage recovery until a garbage emptying signal fed back by the movable garbage can is received;
after receiving the garbage emptying signal, the server extracts the marked position of the request user, calculates a sequence queue of the movable garbage can to each target user according to a preset path algorithm, and sends the sequence queue to the movable garbage can;
and after receiving the sequence queue, the movable garbage can reaches the target user positions corresponding to the positions according to the sequence of the queue, and garbage throwing is finished.
Preferably, the client monitors a user-triggered spam delivery request, and the step of sending the triggered spam delivery request to the server includes:
the client monitors a garbage putting request triggered by a user, acquires current position information if the garbage putting request is monitored, defines the current position information as first position information, adds the first position information to the garbage putting request and sends the request to the server.
Preferably, the step of acquiring the current location information includes:
and querying a position providing function preset by the equipment, further selecting a position providing interface with the optimal precision, and pulling the current equipment position information to the pointed background server by using the interface.
Preferably, before the step of receiving the request for trash placement, analyzing the client location information in the request, and finding the movable trash can closest to the location, the server includes:
and the server acquires the position information of each mobile garbage can in real time and stores and updates the position information.
Preferably, the step of the server receiving the request for trash placement, analyzing the client location information in the request, and finding the movable trash can closest to the location includes:
the server receives the garbage putting request, analyzes a data packet requested by the garbage putting request and extracts client position information of a requester;
and traversing the stored position information of each mobile garbage can, calculating the position distance between the position of each mobile garbage can and the position of the requester, and selecting the mobile garbage can with the closest distance as a responder.
Preferably, the preset path algorithm is as follows:
if the number of the movable garbage cans is one, clustering the marked request users to form three area classes, obtaining the optimal central point of each area, and enabling the movable garbage can to move to the optimal central point by the server sending an instruction, and moving to the next optimal central point to complete the next area class after all the marked users of the area class are completed;
if the number of the movable trash cans is n, clustering the labeled requesting users to form n region classes, obtaining the optimal central point of each region, calculating the movable trash can with the closest distance from each optimal central store by the server, and driving each movable trash can to the optimal central store with the closest distance to finish all labeled requesting users of the corresponding region class.
Preferably, the step of receiving the moving command and driving the movable garbage bin to move along the laid track until reaching the target user position comprises the following steps;
the movable garbage can receives the moving instruction, analyzes the position of a target user contained in the moving instruction, calculates the moving direction, and drives a motor per se to move along the laid track according to the moving direction;
and calculating the distance position between the target user and the target user in real time, and stopping the self-movement if the distance position is smaller than a preset threshold value.
Preferably, after the step of receiving the moving command and driving the motor to move along the laid track to the target user position, the movable trash can comprises:
and if the movable garbage can receives the next target user position sent by the server in the moving process, the movable garbage can stores the next target user position.
The embodiment of the invention also provides a garbage throwing system, which comprises;
the request module monitors a garbage throwing request triggered by a user and sends the triggered garbage throwing request to the server;
the analysis module is used for receiving the garbage throwing request by the server, analyzing the client position information in the request and searching a movable garbage can closest to the position;
the moving module is used for sending a moving instruction to the movable garbage can, and the moving instruction comprises a target user position;
and the driving module is used for receiving the moving instruction by the movable garbage bin and driving the motor to move along the laid track until the position of a target user is reached.
The recovery module is used for detecting the saturation of the garbage contained in the movable garbage bin through an infrared sensor of the movable garbage bin, driving the movable garbage bin to go to a garbage recovery site and sending a pause signal to the server if the saturation is larger than a threshold value, and after receiving the pause signal, the server caches and marks the request users who do not finish garbage recovery and the request users who subsequently submit garbage recovery until receiving a garbage emptying signal fed back by the movable garbage bin;
the queue module is used for extracting the marked positions of the requesting users after the server receives the garbage emptying signal, calculating a sequence queue of the movable garbage can to each target user according to a preset path algorithm, and sending the sequence queue to the movable garbage can;
and the return module is used for finishing garbage throwing according to the queue sequence after the movable garbage can receives the sequence queue and reaches the target user position corresponding to each cis position in sequence.
An embodiment of the present invention further provides a computer storage medium, where a computer program is stored, where the computer program can be executed by at least one processor, where the method for intelligent garbage collection is described above.
According to the intelligent garbage throwing method, the system and the storage medium, provided by the embodiment of the invention, the tourists can call the mobile garbage can to the front of the tourists through the mobile phone client, the phenomenon that the tourists randomly throw garbage or cannot find the garbage can is avoided, the cleanness of a garden is improved, and after the garbage center garbage situation of the mobile garbage can is carried out, the server can provide a planned path when returning, so that the mobile garbage can cover more garbage requesting throwing crowds, and the garbage throwing efficiency is high.
Drawings
FIG. 1 is a flow chart of steps of an intelligent garbage putting method according to the present invention;
FIG. 2 is a schematic diagram of program modules of a garbage disposal system according to the present invention;
fig. 3 is a schematic diagram of a hardware structure of the computer device of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the examples of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
It should be understood that although the terms first, second, etc. may be used to describe the designated key in embodiments of the present invention, the designated key should not be limited to these terms. These terms are only used to distinguish specified keywords from each other. For example, the first specified keyword may also be referred to as the second specified keyword, and similarly, the second specified keyword may also be referred to as the first specified keyword, without departing from the scope of embodiments of the present invention.
The word "if" as used herein may be interpreted as referring to "at … …" or "when … …" or "corresponding to a determination" or "in response to a detection", depending on the context. Similarly, the phrase "if determined" or "if detected (a stated condition or time)" may be interpreted as "when determined" or "in response to a determination" or "when detected (a stated condition or event)" or "in response to a detection (a stated condition or event)", depending on the context.
Referring to fig. 1, an embodiment of the present invention provides an intelligent garbage throwing method, including:
step S100, the client monitors a garbage putting request triggered by a user and sends the triggered garbage putting request to a server.
Specifically, the junk placement request is triggered by clicking a button preset in a client interface by a user, after the triggering, the client generates a related junk placement request and sends the request to a server in the background, and the request format and related content of the request are preset by technicians.
Step S200, the server receives the garbage throwing request, analyzes the client position information in the request and searches for the movable garbage can closest to the position.
Specifically, the reported junk placement request includes a geographic position of a requester, that is, a client sending the request, and the server receives the geographic position, searches for position information of a mobile trash can stored in the server, and obtains the mobile trash can closest to the requester through calculation and comparison.
Step S300 is to send a moving instruction to the movable garbage bin, wherein the moving instruction comprises a target user position.
Specifically, a broadcast instruction or a directional paging instruction is sent to a movable trash can closest to the requester, and the position of the target user is used as a content field to be stuffed into a mobile instruction message before sending.
And S400, the movable garbage can receives the movement instruction and drives a motor of the movable garbage can to move along the laid track until the position of a target user.
After the movable garbage can receives the moving instruction, the direction to be moved can be obtained by comparing the position of the movable garbage can with the position of a target user contained in the instruction, because the movable garbage can is paved on a garden and moves through the rail, the movement only has two directions and is very easy to calculate, after the direction is obtained, the movable garbage can drives the movable garbage can to move, namely, the movable garbage can is driven forwards or backwards, the distance between the movable garbage can and the target user is periodically calculated, and the movable garbage can stop moving when the distance is less than 1 m.
Step S500, the movable garbage can detects the saturation of the garbage contained in the movable garbage can through an infrared sensor of the movable garbage can, if the saturation is larger than a threshold value, the movable garbage can drives the movable garbage can to go to a garbage recovery site and sends a pause signal to the server, and after the server receives the pause signal, the server caches and marks the request users who do not finish garbage recovery and the request users who subsequently submit garbage recovery until the movable garbage can feeds back garbage emptying signals.
Specifically, portable garbage bin is provided with infrared module, utilizes infrared module can the whole garbage of perception to pile up the height, and then learns the rubbish saturation of garbage bin, in addition, still is provided with a recovery threshold value to rubbish saturation, if the saturation exceeds the threshold value, then the garbage bin will halt the execution of each rubbish input request, and then go to rubbish recycle bin and carry out rubbish and empty, the preferred value of threshold value is 90%, if set to 100%, then the garbage bin takes place to overflow easily in the track removal in-process and drops.
In addition, when the saturation of the trash can exceeds the threshold value, a pause signal is fed back to be uploaded to the server, after the server receives the pause signal, caching and labeling are carried out on uncompleted trash recycling request users and subsequent request users submitting trash recycling, and the labeling is exemplarily as follows:
requestor A, < Undo >
Requestor B, < Undo >
Step S600, after receiving the garbage emptying signal, the server extracts the marked position of the request user, calculates a sequence queue of the movable garbage can to each target user according to a preset path algorithm, and sends the sequence queue to the movable garbage can.
Specifically, after the movable garbage can goes to a garbage recycling station, cleaning personnel can empty garbage in the garbage can, after the garbage can is emptied, the garbage can feeds back garbage emptying signals to the server, the server marks garbage throwing requests sent by the clients and requests not executed by the garbage can received during the movable garbage can, calculates a sequence queue of request execution through a preset path algorithm, sends the sequence queue to the garbage can, and the garbage can reaches the target user positions corresponding to the positions according to the sequence queue in sequence to finish garbage throwing.
And S700, after receiving the sequence queue, the movable garbage can reaches the target user positions corresponding to the positions according to the sequence of the queue, and garbage throwing is finished.
According to the garbage throwing method, the garbage throwing system and the storage medium based on the movable garbage can, provided by the embodiment of the invention, the tourists can call the movable garbage can to the front of the tourists through the mobile phone client, so that the phenomenon that the tourists randomly throw garbage or cannot find the garbage can is avoided, and the cleanness of a park is improved. And after the movable garbage can carries out garbage center garbage situation, the server can provide a planning path when returning to enable the movable garbage can to cover more garbage request throwing crowds, and garbage throwing efficiency is high.
Optionally, the step S100 of the client monitoring a user-triggered spam delivery request, and sending the triggered spam delivery request to the server includes:
the client monitors a garbage putting request triggered by a user, acquires current position information if the garbage putting request is monitored, defines the current position information as first position information, adds the first position information to the garbage putting request and sends the request to the server.
Optionally, the step of obtaining the current location information includes:
and querying a position providing function preset by the equipment, further selecting a position providing interface with the optimal precision, and pulling the current equipment position information to the pointed background server by using the interface.
Specifically, taking the android system as an example, a system interface location provider (location provider) is called, an optimal location provider is queried, for example, a GPS in a place with a poor signal provides an optimal location providing mode, a place with a good signal is located by using a mobile network, the optimal location providing mode is selected, a corresponding background provider is accessed, that is, a background server pulls location information identifying its own location,
optionally, before the step of receiving the request for trash placement by the server in step S200, analyzing the client location information in the request, and finding the movable trash can closest to the location, the method includes:
and the server acquires the position information of each mobile garbage can in real time and stores and updates the position information.
Specifically, the mobile trash can periodically reports the position information of the mobile trash can to the server, the server stores the position information of all the mobile trash cans as basic data so that a user can select the trash can with the closest distance, preferably, the mobile trash can uploads the position information data of the mobile trash can to the server once in 2S, and the server updates the data after receiving the position information data.
Optionally, in step S200, the step of receiving, by the server, the garbage throwing request, analyzing client location information in the request, and finding a movable garbage can closest to the location includes:
step S210, the server receives the garbage release request, analyzes the data packet requested by the garbage release request, and extracts the client location information of the requester.
Step S220 traverses the stored position information of each mobile trash can, calculates the distance between the position of each mobile trash can and the position of the requester, and selects the mobile trash can closest to the requester as the responder.
Optionally, the step of calculating the distance between the position of each mobile trash can and the requester in step S220 includes:
wherein d is a record value of the mobile garbage can and the requester, x and y are respectively the longitude and the latitude of the requester, and xn and yn are respectively the longitude and the latitude of each mobile garbage can.
Specifically, the invention adopts the longitude and latitude of the plane, so the calculation of the distance does not relate to the calculation of the center of the earth, and only needs to directly calculate through the Euclidean distance.
Optionally, the preset path algorithm in step S600 is:
if the number of the movable garbage cans is one, clustering the marked request users to form three area classes, obtaining the optimal central point of each area, and enabling the movable garbage can to move to the optimal central point by the server sending an instruction, and moving to the next optimal central point to complete the next area class after all the marked users of the area class are completed;
if the number of the movable garbage cans is n, clustering the labeled requesting users to form n region classes, obtaining the optimal central point of each region, calculating the movable garbage can with the nearest distance from each optimal central store by the server, and driving each movable garbage can to the optimal central point with the nearest distance to finish all labeled requesting users of the corresponding region class.
Specifically, the clustering method and the optimal center point adopt a k-means algorithm, which is not described in detail herein.
Optionally, the step S400 of receiving the movement command and driving the movable trash can to move along the laid track by the motor thereof until the target user position is reached includes;
and S410, the movable garbage can receives the moving instruction, analyzes the position of a target user contained in the moving instruction, calculates the moving direction, and drives a motor of the movable garbage can to move along the laid track according to the moving direction.
Step S420 calculates the distance position to the target user in real time, and stops moving itself if the distance position is smaller than a preset threshold.
Specifically, the distance position between the movable garbage can and the target user is calculated once by 1S during the movement of the movable garbage can, and once the calculated value is lower than 1m, the garbage can is determined to reach the vicinity of the target user, and then the motor can be turned off.
Optionally, after the step of receiving the moving command and driving the motor to move along the laid track to the target user position, the step S of the movable trash can includes:
and if the movable garbage can receives the next target user position sent by the server in the moving process, the movable garbage can stores the next target user position.
Specifically, when the mobile trash can responds to a trash release request once, requests of other target users forwarded by the server may still be received, after the trash can receives the requests, an execution queue is created, the requests are sorted according to the time of receiving the requests, and after the current trash release request is executed, the position heading and trash release of the target users are sequentially completed according to the queue sorting.
The embodiment of the invention also provides a garbage throwing system, which comprises;
a request module 100, which monitors a user-triggered garbage throwing request and sends the triggered garbage throwing request to a server;
the analysis module 200 is configured to receive the garbage throwing request, analyze client location information in the request, and find a movable garbage can closest to the location;
the moving module 300 is configured to send a moving instruction to the movable trash can, where the moving instruction includes a target user location;
and the driving module 400 is used for receiving the moving instruction and driving the motor of the movable garbage bin to move along the laid track until the position of the target user is reached.
Please refer to fig. 3, which is a schematic diagram of a hardware architecture of a computer device according to an embodiment of the present invention. In the present embodiment, the computer device 2 is a device capable of automatically performing numerical calculation and/or information processing in accordance with a preset or stored instruction. The computer device 2 may be a personal computer, a tablet computer, a mobile phone, a smartphone, or a rack server, a blade server, a tower server, or a cabinet server (including an independent server or a server cluster composed of a plurality of servers), and the like, and is configured to provide a virtual client. As shown, the computer device 2 includes, but is not limited to, at least a memory 21, a processor 22, a network interface 23, and a garbage delivery system 20, which are communicatively connected to each other via a system bus, wherein:
in this embodiment, the memory 21 includes at least one type of computer-readable storage medium including a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, and the like. In some embodiments, the storage 21 may be an internal storage unit of the computer device 2, such as a hard disk or a memory of the computer device 2. In other embodiments, the memory 21 may also be an external storage device of the computer device 2, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (Secure Digital) SD Card, a Flash memory Card (Flash Card), etc. provided on the computer device 20, and of course, the memory 21 may also include both an internal storage unit and an external storage device of the computer device 2. In this embodiment, the memory 21 is used for storing an operating system installed on the computer device 2 and various application software, such as program codes of the garbage casting system 20. Further, the memory 21 may also be used to temporarily store various types of data that have been output or are to be output.
The network interface 23 may comprise a wireless network interface or a limited network interface, and the network interface 23 is typically used for establishing a communication connection between the computer device 2 and other electronic apparatuses. For example, the network interface 23 is used to connect the computer device 2 with an external terminal necklace, establish a data transmission channel and a communication connection between the computer device 2 and an external interrupt, and the like via a network. The network may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a Global System of Mobile communication (GSM), Wideband Code Division Multiple Access (WCDMA), a 4G network, a 5G network, Bluetooth (Bluetooth), Wi-Fi, and the like.
In this embodiment, the garbage disposal system 20 stored in the memory 21 can be further divided into one or more program modules, and the one or more program modules are stored in the memory 21 and executed by one or more processors (in this embodiment, the processor 22) to complete the present invention.
In addition, the present embodiment also provides a computer-readable storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, a server, an App application store, etc., on which a computer program is stored, which when executed by a processor implements a corresponding function. The computer readable storage medium of the embodiment is used for storing the garbage throwing system 20, and when being executed by the processor, the computer readable storage medium implements an intelligent garbage throwing method of the present invention.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. An intelligent garbage throwing method is characterized by comprising the following steps:
the client monitors a garbage throwing request triggered by a user and sends the triggered garbage throwing request to a server;
the server receives the garbage throwing request, analyzes client position information in the request and searches for a movable garbage can closest to the position;
sending a moving instruction to the movable garbage can, wherein the moving instruction comprises a target user position;
the movable garbage can receives the moving instruction and drives a motor of the movable garbage can to move along the laid track until the position of a target user is reached;
the movable garbage can detects the saturation of garbage contained in the movable garbage can through an infrared sensor of the movable garbage can, if the saturation is larger than a threshold value, the movable garbage can drives the movable garbage can to go to a garbage recovery site and sends a pause signal to the server, and after the server receives the pause signal, the server caches and marks a request user who does not finish garbage recovery and a request user who subsequently submits garbage recovery until a garbage emptying signal fed back by the movable garbage can is received;
after receiving the garbage emptying signal, the server extracts the marked position of the request user, calculates a sequence queue of the movable garbage can to each target user according to a preset path algorithm, and sends the sequence queue to the movable garbage can;
and after receiving the sequence queue, the movable garbage can reaches the target user positions corresponding to the positions according to the sequence of the queue, and garbage throwing is finished.
2. The intelligent garbage throwing method according to claim 1, wherein the client monitors a user-triggered garbage throwing request, and the step of sending the triggered garbage throwing request to the server comprises:
the client monitors a garbage putting request triggered by a user, acquires current position information if the garbage putting request is monitored, defines the current position information as first position information, adds the first position information to the garbage putting request and sends the request to the server.
3. The intelligent garbage putting method according to claim 2, wherein the step of obtaining current location information comprises:
and querying a position providing function preset by the equipment, further selecting a position providing interface with the optimal precision, and pulling the current equipment position information to the pointed background server by using the interface.
4. The intelligent garbage throwing method according to claim 1, wherein the server receives the garbage throwing request, analyzes client location information in the request, and finds a movable garbage can closest to the location before the step of searching for the movable garbage can closest to the location, the method comprises:
and the server acquires the position information of each mobile garbage can in real time and stores and updates the position information.
5. The intelligent garbage throwing method according to claim 4, wherein the server receives the garbage throwing request, analyzes client location information in the request, and finds the movable garbage can closest to the location, comprising:
the server receives the garbage putting request, analyzes a data packet requested by the garbage putting request and extracts client position information of a requester;
and traversing the stored position information of each mobile garbage can, calculating the position distance between the position of each mobile garbage can and the position of the requester, and selecting the mobile garbage can with the closest distance as a responder.
6. The intelligent garbage putting method according to claim 1, wherein the preset path algorithm is:
if the number of the movable garbage cans is one, clustering the marked request users to form three area classes, obtaining the optimal central point of each area, and enabling the movable garbage can to move to the optimal central point by the server sending an instruction, and moving to the next optimal central point to complete the next area class after all the marked users of the area class are completed;
if the number of the movable trash cans is n, clustering the labeled requesting users to form n region classes, obtaining the optimal central point of each region, calculating the movable trash can with the closest distance from each optimal central store by the server, and driving each movable trash can to the optimal central store with the closest distance to finish all labeled requesting users of the corresponding region class.
7. The intelligent trash can putting method of claim 1, wherein the step of the movable trash can receiving the movement command and driving its own motor to move along the paved track until reaching the target user position comprises;
the movable garbage can receives the moving instruction, analyzes the position of a target user contained in the moving instruction, calculates the moving direction, and drives a motor per se to move along the laid track according to the moving direction;
and calculating the distance position between the target user and the target user in real time, and stopping the self-movement if the distance position is smaller than a preset threshold value.
8. The intelligent trash can putting method of claim 1, wherein the step of the movable trash can receiving the movement command and driving its own motor to move along the paved track until the target user position is reached is followed by:
and if the movable garbage can receives the next target user position sent by the server in the moving process, the movable garbage can stores the next target user position.
9. A garbage throwing system is characterized by comprising;
the request module monitors a garbage throwing request triggered by a user and sends the triggered garbage throwing request to the server;
the analysis module is used for receiving the garbage throwing request by the server, analyzing the client position information in the request and searching a movable garbage can closest to the position;
the moving module is used for sending a moving instruction to the movable garbage can, and the moving instruction comprises a target user position;
and the driving module is used for receiving the moving instruction by the movable garbage bin and driving the motor to move along the laid track until the position of a target user is reached.
The recovery module is used for detecting the saturation of the garbage contained in the movable garbage bin through an infrared sensor of the movable garbage bin, driving the movable garbage bin to go to a garbage recovery site and sending a pause signal to the server if the saturation is larger than a threshold value, and after receiving the pause signal, the server caches and marks the request users who do not finish garbage recovery and the request users who subsequently submit garbage recovery until receiving a garbage emptying signal fed back by the movable garbage bin;
the queue module is used for extracting the marked positions of the requesting users after the server receives the garbage emptying signal, calculating a sequence queue of the movable garbage can to each target user according to a preset path algorithm, and sending the sequence queue to the movable garbage can;
and the return module is used for finishing garbage throwing according to the queue sequence after the movable garbage can receives the sequence queue and reaches the target user position corresponding to each cis position in sequence.
10. A computer storage medium, characterized in that it stores a computer program that can be executed by at least one processor to perform the intelligent garbage putting method according to claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910910720.4A CN110730218A (en) | 2019-09-25 | 2019-09-25 | Intelligent garbage putting method and system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910910720.4A CN110730218A (en) | 2019-09-25 | 2019-09-25 | Intelligent garbage putting method and system and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110730218A true CN110730218A (en) | 2020-01-24 |
Family
ID=69218358
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910910720.4A Pending CN110730218A (en) | 2019-09-25 | 2019-09-25 | Intelligent garbage putting method and system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110730218A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110730223A (en) * | 2019-09-30 | 2020-01-24 | 恒大智慧科技有限公司 | Garbage throwing method and system based on movable garbage can |
| CN111443614A (en) * | 2020-03-27 | 2020-07-24 | 珠海格力电器股份有限公司 | Smart home control method and device, electronic equipment and storage medium |
| CN111459162A (en) * | 2020-04-07 | 2020-07-28 | 珠海格力电器股份有限公司 | Standby position planning method and device, storage medium and computer equipment |
| CN112528137A (en) * | 2020-11-30 | 2021-03-19 | 中国联合网络通信集团有限公司 | Rubbish drop point recommendation method and system, server and terminal |
| CN113093731A (en) * | 2021-03-12 | 2021-07-09 | 广东来个碗网络科技有限公司 | Mobile control method and device for intelligent recycling bin |
| CN113627510A (en) * | 2021-08-04 | 2021-11-09 | 浙江联运知慧科技有限公司 | Application processing system for garbage classification |
| CN114217611A (en) * | 2021-12-01 | 2022-03-22 | 北京云迹科技股份有限公司 | Garbage clearing method and device, storage medium and equipment of epidemic prevention robot |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050281653A1 (en) * | 2004-05-27 | 2005-12-22 | Donald Channel | Automated trash delivery system |
| CN204916826U (en) * | 2015-08-06 | 2015-12-30 | 深圳市领芯者科技有限公司 | Intelligence garbage recycling device and rubbish recovery system |
| US20160288995A1 (en) * | 2008-07-03 | 2016-10-06 | David A. Bidelspach | Mobile Waste & Recyclable Material Dumpster |
| CN107918316A (en) * | 2017-11-16 | 2018-04-17 | 五邑大学 | Intelligent garbage recovery system and dustbin overflow processing method |
| CN108762258A (en) * | 2018-05-07 | 2018-11-06 | 北京三辰环卫机械有限公司 | Control the mthods, systems and devices of dustbin recycling rubbish |
| CN109760975A (en) * | 2019-03-29 | 2019-05-17 | 深圳中科云海科技有限公司 | A kind of system of intelligence recycling rubbish |
-
2019
- 2019-09-25 CN CN201910910720.4A patent/CN110730218A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050281653A1 (en) * | 2004-05-27 | 2005-12-22 | Donald Channel | Automated trash delivery system |
| US20160288995A1 (en) * | 2008-07-03 | 2016-10-06 | David A. Bidelspach | Mobile Waste & Recyclable Material Dumpster |
| CN204916826U (en) * | 2015-08-06 | 2015-12-30 | 深圳市领芯者科技有限公司 | Intelligence garbage recycling device and rubbish recovery system |
| CN107918316A (en) * | 2017-11-16 | 2018-04-17 | 五邑大学 | Intelligent garbage recovery system and dustbin overflow processing method |
| CN108762258A (en) * | 2018-05-07 | 2018-11-06 | 北京三辰环卫机械有限公司 | Control the mthods, systems and devices of dustbin recycling rubbish |
| CN109760975A (en) * | 2019-03-29 | 2019-05-17 | 深圳中科云海科技有限公司 | A kind of system of intelligence recycling rubbish |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110730223A (en) * | 2019-09-30 | 2020-01-24 | 恒大智慧科技有限公司 | Garbage throwing method and system based on movable garbage can |
| CN111443614A (en) * | 2020-03-27 | 2020-07-24 | 珠海格力电器股份有限公司 | Smart home control method and device, electronic equipment and storage medium |
| CN111443614B (en) * | 2020-03-27 | 2021-07-23 | 珠海格力电器股份有限公司 | Smart home control method and device, electronic equipment and storage medium |
| CN111459162A (en) * | 2020-04-07 | 2020-07-28 | 珠海格力电器股份有限公司 | Standby position planning method and device, storage medium and computer equipment |
| CN111459162B (en) * | 2020-04-07 | 2021-11-16 | 珠海格力电器股份有限公司 | Standby position planning method and device, storage medium and computer equipment |
| CN112528137A (en) * | 2020-11-30 | 2021-03-19 | 中国联合网络通信集团有限公司 | Rubbish drop point recommendation method and system, server and terminal |
| CN113093731A (en) * | 2021-03-12 | 2021-07-09 | 广东来个碗网络科技有限公司 | Mobile control method and device for intelligent recycling bin |
| CN113627510A (en) * | 2021-08-04 | 2021-11-09 | 浙江联运知慧科技有限公司 | Application processing system for garbage classification |
| CN114217611A (en) * | 2021-12-01 | 2022-03-22 | 北京云迹科技股份有限公司 | Garbage clearing method and device, storage medium and equipment of epidemic prevention robot |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110730218A (en) | Intelligent garbage putting method and system and storage medium | |
| US20210191979A1 (en) | Distributed video storage and search with edge computing | |
| CN110765371A (en) | Position selection method and system of movable garbage can and storage medium | |
| US10715949B2 (en) | Determining timing for determination of applicable geo-fences | |
| CN101657697B (en) | Systems, and methods for generating reference geocodes for point addresses | |
| CN107492262A (en) | Parking navigation method and readable storage medium storing program for executing based on block chain | |
| US10794714B2 (en) | Self-driving vehicle systems and methods | |
| US10466057B1 (en) | Self-driving vehicle systems and methods | |
| CN103632572A (en) | Intelligent parking method and system | |
| EP3462427A1 (en) | Method of predicting the probability of occurrence of vacant parking slots and its realization system | |
| CN107705609B (en) | Vehicle searching method and device for parking lot | |
| CN105444770A (en) | Intelligent mobile phone-based lane grade map generating and positioning system and method | |
| CN108230664A (en) | Vehicles management method based on virtual electronic fence | |
| CN106448241A (en) | Method and device for parking induction, terminal and server | |
| CN111667715A (en) | Parking lot parking space management method and device, computer equipment and storage medium | |
| CN113449207A (en) | Method, device, server, system and storage medium for positioning electronic equipment | |
| CN113269898A (en) | Intelligent parking lot management system based on Internet of things and management method thereof | |
| CN1737871A (en) | City parking inducement motion prompting method and realizing system | |
| JP2019087131A (en) | Parking position search system and parking position search method | |
| CN108154701A (en) | A kind of intelligent parking scheduling system based on technology of Internet of things | |
| CN106875720A (en) | Vehicle based on parking stall data looks for Time Service System and method | |
| CN108615394A (en) | A kind of parking lot guidance system and method for setting threshold value | |
| CN110730223A (en) | Garbage throwing method and system based on movable garbage can | |
| CN105679085A (en) | Parking lot query system based on big data | |
| CN116069028A (en) | Garbage collection method, system, terminal equipment and storage medium for garbage can |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200124 |
|
| WD01 | Invention patent application deemed withdrawn after publication |