KR102580486B1 - System for providing recycling collecting service using identification code - Google Patents

Abstract

A system for providing a recycling waste separation service using an identification code is provided. When a user applies for registration, an identification code is given to identify the user, a discharge event is output by taking a photo of the identification code printed on the collection bag, and the recycling waste separation results are displayed. A user terminal that receives a reward or penalty according to the emission event, receives the vehicle movement route according to the emission event, receives the user registration of the collection engineer terminal and the user terminal that prints the address where the emission event was output on the vehicle movement route, and , a user register that generates an identification code using the address, name, and phone number included in the user registration and assigns it to the user terminal, and provides a waybill so that the collection bag printed with the identification code assigned to the user terminal is delivered to the address of the user terminal. Output unit, which prints the identification code from the user terminal and outputs the emission event. Route creation unit that collects the address and time at which the emission event was output to generate the vehicle movement route. Vehicle movement route and emission event are sent to the collection engineer's terminal. It includes a recycling service providing server including an allocation unit that delivers the output address.

Description

System for providing recycling service separation using identification codes {SYSTEM FOR PROVIDING RECYCLING COLLECTING SERVICE USING IDENTIFICATION CODE}

The present invention relates to a system for providing a recycling service for separating recycling using an identification code. An identification code assigned to each individual is printed on a collection bag, and instead of complicated separation of recyclables, only the washing is left to the individual and all recyclables are placed in the collection bag and disposed of. Provides a platform.

The improvement in living standards brought about by economic growth due to rapid industrialization led to changes in consumption habits and promoted an increase in the amount of waste generated. The Framework Act on Resource Circulation came into effect to promote recycling and minimize incineration and landfill of waste, resulting in resource circulation performance. A management system, circular resource recognition system, and waste disposal fee system were introduced. As interest in recycling is growing around the world, the Ministry of Environment announced that it will mark the first year of a major change in resource circulation policy. Although each household is diligent in separating and disposing of waste, most of the waste cannot be recycled and is thrown away as trash again. Because we are facing reality. Although separate recycling has now become routine and almost all citizens participate in it as a habit, recycled resources that have been separated are being landfilled and incinerated due to a lack of awareness of waste disposal.

At this time, when separating waste, a method of requesting separate collection by specifying a location and time or visiting a home to collect waste was researched and developed. In this regard, a method of collecting waste was researched and developed, which is a prior art, Korean Patent Publication No. 2018-0136156 (2018 In Korea Patent Publication No. 2020-0034577 (published on December 24, 2020), service application information is received from the user terminal, and garbage separation service is provided for the address included in the service application information. In order to start, a garbage collection time is designated by the user terminal, and the collection terminal is assigned a task in the time zone applied by the user and performs collection. When the garbage delivery request from the user terminal is received, the collection terminal performs the garbage collection work. After being assigned and visiting the user's home, the garbage is delivered to a temporary storage site, and the collection terminal collects the garbage delivery fee using the identification code printed on the garbage bag.

However, in the case of the former of the above-mentioned configurations, the separation vehicle must visit according to the time zone, so the optimal movement route cannot be obtained, which results in the need to use more oil or electricity resources while trying to recycle the waste. Even in the latter case, it is unlikely to be realistically implemented as waste delivery using couriers would result in higher collection costs. In the case of complex buildings such as apartments, security guards and separate recycling personnel are assigned separately to guide and instruct each resident on separate recycling. However, in the case of residential areas where studio apartments, multi-family homes, or multi-family houses are concentrated, it is specified which house did not separate recycling. Unlike landlords, who are specific because it is difficult to do, tenants are rarely eager to separate waste. Accordingly, a platform that can identify waste dischargers and maximize the recycling effect of resources by providing compensation when separate collection is performed, penalizing when separate collection is not properly carried out, and optimally operating the route of separate collection vehicles Research and development are required.

One embodiment of the present invention is to raise the problem of the reality that recyclables that are separated as recyclable resources become trash again and to solve the rapidly increasing waste problem, a cash compensation platform for recycled products that can induce voluntary participation of residents is provided. It can be constructed, and each household is given a collection bag with an identification code that identifies each household. The user washes and separates the recyclables, places them in a collection bag, and places them in front of the house. After the collection technician collects the bags, When moving to the sorting station to sort recyclables, if the recyclables are not properly washed or separated, a penalty is imposed to be mapped to the identification code of the collection bag, and if the recyclables are properly washed and separated, a penalty is imposed to be mapped to the identification code of the collection bag. By accumulating points, the user terminal can cash out the points using the identification code assigned to the user terminal, and when a penalty is imposed, it can provide individual guidance by checking which part the penalty was imposed. A system for providing recycling separation service using identification codes can be provided. However, the technical challenge that this embodiment aims to achieve is not limited to the technical challenges described above, and other technical challenges may exist.

As a technical means for achieving the above-described technical problem, one embodiment of the present invention provides, when a user applies for registration, an identification code is given to identify the user, and a discharge event is output by photographing the identification code printed on the collection bag. , a user terminal that is given a reward or penalty depending on the results of recycling waste separation, a collection engineer terminal and a user terminal that receive vehicle movement routes according to emission events and output the address where the emission event was output on the vehicle movement route. A user register that receives user registration, generates an identification code using the address, name, and phone number included in the user registration, and assigns it to the user terminal. A collection bag printed with the identification code assigned to the user terminal is provided to the user terminal. An output unit that prints out a waybill so that it can be delivered to an address; a route creation unit that collects the address and time at which the discharge event was printed to generate a vehicle movement route when an emission event is output by capturing an identification code on the user terminal; and a collection engineer terminal. It includes a separate collection service providing server that includes an allocation unit that delivers the address where the vehicle movement path and emission events are output.

According to one of the above-described problem-solving means of the present invention, it is possible to encourage voluntary participation of residents in order to raise the problem of the reality that recyclables separated as recyclable resources become waste again and to solve the rapidly increasing waste problem. A platform for cash compensation for recycled products can be established, and collection bags with an identification code that can identify each household are distributed to each household. Users can wash and separate recyclables, place them in collection bags, and leave them in front of their homes, and a collection technician can collect them. After collecting the collection bag, when moving to the sorting area to sort the recyclables, if the recyclables are not properly washed or separated, a penalty is imposed to be mapped to the identification code of the collection bag, and if the recyclables are properly washed and separated, a penalty is imposed on the collection bag. Points are accumulated to be mapped to an identification code, and the user terminal can cash out the points using the identification code assigned to the user terminal, and when a penalty is imposed, it is possible to check which part the penalty was imposed to provide individual guidance. It can have an effect.

1 is a diagram illustrating a system for providing a recycling service for separating recycling using an identification code according to an embodiment of the present invention.
FIG. 2 is a block diagram illustrating a recycling service providing server included in the system of FIG. 1.
Figures 3 and 4 are diagrams for explaining an embodiment in which a recycling service for separating recycling using an identification code is implemented according to an embodiment of the present invention.
Figure 5 is an operation flowchart illustrating a method of providing a recycling service for separating recycling using an identification code according to an embodiment of the present invention.

Below, with reference to the attached drawings, embodiments of the present invention will be described in detail so that those skilled in the art can easily implement the present invention. However, the present invention may be implemented in many different forms and is not limited to the embodiments described herein. In order to clearly explain the present invention in the drawings, parts that are not related to the description are omitted, and similar parts are given similar reference numerals throughout the specification.

Throughout the specification, when a part is said to be "connected" to another part, this includes not only the case where it is "directly connected," but also the case where it is "electrically connected" with another element in between. . In addition, when a part is said to "include" a certain component, this does not mean excluding other components unless specifically stated to the contrary, but may further include other components, and one or more other features. It should be understood that it does not exclude in advance the presence or addition of numbers, steps, operations, components, parts, or combinations thereof.

The terms "about", "substantially", etc. used throughout the specification are used to mean at or close to that value when manufacturing and material tolerances inherent in the stated meaning are presented, and are used to enhance the understanding of the present invention. Precise or absolute figures are used to assist in preventing unscrupulous infringers from taking unfair advantage of stated disclosures. The term “step of” or “step of” as used throughout the specification of the present invention does not mean “step for.”

In this specification, 'part' includes a unit realized by hardware, a unit realized by software, and a unit realized using both. Additionally, one unit may be realized using two or more pieces of hardware, and two or more units may be realized using one piece of hardware. Meanwhile, '~ part' is not limited to software or hardware, and '~ part' may be configured to reside in an addressable storage medium or may be configured to reproduce one or more processors. Therefore, as an example, '~ part' refers to components such as software components, object-oriented software components, class components, and task components, processes, functions, properties, and procedures. , subroutines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and variables. The functions provided within the components and 'parts' may be combined into a smaller number of components and 'parts' or may be further separated into additional components and 'parts'. Additionally, components and 'parts' may be implemented to regenerate one or more CPUs within a device or a secure multimedia card.

In this specification, some of the operations or functions described as being performed by a terminal, apparatus, or device may instead be performed on a server connected to the terminal, apparatus, or device. Likewise, some of the operations or functions described as being performed by the server may also be performed in a terminal, apparatus, or device connected to the server.

In this specification, some of the operations or functions described as mapping or matching with the terminal mean mapping or matching the terminal's unique number or personal identification information, which is identifying data of the terminal. It can be interpreted as

Hereinafter, the present invention will be described in detail with reference to the attached drawings.

1 is a diagram illustrating a system for providing a recycling service for separating recycling using an identification code according to an embodiment of the present invention. Referring to FIG. 1, the system 1 for providing a recycling service separation service using an identification code includes at least one user terminal 100, a separation service providing server 300, at least one collection engineer terminal 400, and at least It may include one autonomous vehicle 500 and a selection terminal 600. However, since the system 1 for providing a recycling product separation service using the identification code of FIG. 1 is only an embodiment of the present invention, the present invention is not limited to the interpretation of FIG. 1.

At this time, each component of FIG. 1 is generally connected through a network (Network, 200). For example, as shown in FIG. 1, at least one user terminal 100 may be connected to the recycling service providing server 300 through the network 200. And, the recycling service providing server 300, through the network 200, at least one user terminal 100, at least one collection engineer terminal 400, at least one autonomous vehicle 500, and a selection terminal ( 600). Additionally, at least one collection engineer terminal 400 may be connected to the separate recycling service providing server 300 through the network 200. In addition, at least one autonomous vehicle 500 may be connected to at least one user terminal 100, a recycling service providing server 300, and at least one collection engineer terminal 400 through the network 200. . Finally, the sorting terminal 600 can be connected to the user terminal 100, the collection engineer terminal 400, the separate recycling service providing server 300, and at least one autonomous vehicle 500 through the network 200. there is.

Here, the network refers to a connection structure that allows information exchange between each node, such as a plurality of terminals and servers. Examples of such networks include a local area network (LAN) and a wide area network (WAN). Wide Area Network, Internet (WWW: World Wide Web), wired and wireless data communication network, telephone network, wired and wireless television communication network, etc. Examples of wireless data communication networks include 3G, 4G, 5G, 3rd Generation Partnership Project (3GPP), 5th Generation Partnership Project (5GPP), Long Term Evolution (LTE), World Interoperability for Microwave Access (WIMAX), and Wi-Fi. , Internet, LAN (Local Area Network), Wireless LAN (Wireless Local Area Network), WAN (Wide Area Network), PAN (Personal Area Network), RF (Radio Frequency), Bluetooth network, NFC ( It includes, but is not limited to, Near-Field Communication (Near-Field Communication) network, satellite broadcasting network, analog broadcasting network, and DMB (Digital Multimedia Broadcasting) network.

In the following, the term at least one is defined as a term including singular and plural, and even if the term at least one does not exist, each component may exist in singular or plural, and may mean singular or plural. This should be self-explanatory. In addition, whether each component is provided in singular or plural form may be changed depending on the embodiment.

At least one user terminal 100 inputs an address, phone number, email address, account number, etc. when registering a user using a web page, app page, program, or application related to a recycling service separation service using an identification code. And, it may be a user terminal that receives an identification code. At this time, the user of the user terminal 100 can place the washed recyclables in a collection bag with an identification code printed on it, and when the identification code is photographed using the user terminal 100, a discharge event is output to provide a separate collection service. It may be a terminal transmitting information to the server 300. At this time, in addition to the method of photographing the identification code, the emission event is set so that it is not necessary to photograph the identification code when the user terminal 100 recognizes the location by photographing only once for the first time under the assumption that emissions are emitted at a preset cycle, for example, every day. It could be. Additionally, the user terminal 100 may be a terminal that receives compensation or a penalty depending on the cleaning results, and when recycled, may be a terminal that receives recycled products or receives compensation by bank transfer.

Here, at least one user terminal 100 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, a laptop equipped with a navigation system and a web browser, a desktop, a laptop, etc. At this time, at least one user terminal 100 may be implemented as a terminal capable of accessing a remote server or terminal through a network. At least one user terminal 100 is, for example, a wireless communication device that guarantees portability and mobility, and includes navigation, personal communication system (PCS), global system for mobile communications (GSM), personal digital cellular (PDC), PHS (Personal Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless Broadband Internet) ) It may include all types of handheld-based wireless communication devices such as terminals, smartphones, smartpads, and tablet PCs.

The recycling service providing server 300 may be a server that provides a recycling product separation service web page, app page, program, or application using an identification code. In addition, the separate recycling service providing server 300 is a server that generates an identification code when a user registers at the user terminal 100, stores it by mapping it to the user terminal 100, and delivers the collection bag to the user's address. It can be. In addition, the separate recycling service providing server 300 is a server that maps and stores at least one collection engineer terminal 400 and the autonomous vehicle 500 and creates a vehicle movement route to connect the address where the emission event is output. You can. In addition, when the sorting terminal 600 reports recyclables that have not been properly washed or have foreign substances still attached, the recycling service providing server 300 scans the identification code of the collection bag from which the recyclables came, identifies the user, and uses the user terminal ( 100) may be a server that provides penalty information. The separate collection service providing server 300 may be a server that can collect the vehicle movement path of the autonomous vehicle 500 in real time and transmit guidance to the user terminal 100 when collection is performed. At this time, the recycling service providing server 300 may be a server that transmits a push message informing the estimated arrival time to at least one user terminal 100 with an address within the vehicle movement path. Here, the separate collection service providing server 300 uses the collection technician terminal 400 or the camera of the autonomous vehicle 500 when there are parking violation vehicles, two-wheeled vehicles, and kickboards within the vehicle movement path of the autonomous vehicle 500. It could be a server that collects data and sends reports to local governments for vehicles and to police stations for two-wheelers and kickboards.

Here, the recycling service providing server 300 may be implemented as a computer that can connect to a remote server or terminal through a network. Here, the computer may include, for example, a laptop equipped with a navigation system and a web browser, a desktop, a laptop, etc.

At least one collection technician terminal 400 may be a terminal of a doctor who uses a web page, app page, program, or application related to a recycling service separation service using an identification code. And, when the autonomous vehicle 500 stops in front of the address where the emission event was output, at least one collection engineer terminal 400 checks the address where the emission event was output and the identification code in the collection bag, and then collects the discharged vehicle. It may be the terminal of a collection engineer who collects bags. If additional parking violation enforcement duties are imposed, the collection technician terminal 400 checks to see if there are any illegally parked vehicles, two-wheelers, or kickboards in front of the address where the discharge event was output, and takes a photo if there are illegally parked vehicles, two-wheelers, etc. It may be a terminal that takes a picture, inserts GPS and time as metadata, and then transmits it to the recycling service providing server 300. Illegal parking is the next problem in residential areas after garbage. If illegal parking can be solved at once, the user terminal 100 can more actively press discharge events and increase citizen participation rate. However, in the case of two-wheeled vehicles, the jurisdiction is the police station (fine), in the case of vehicles, the jurisdiction is the local government (fine), and in the case of kickboards, crackdowns are carried out only in Seoul (fine, police station). Therefore, it is necessary to check where each competent agency is before filing a report. You can.

Here, at least one collection technician terminal 400 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, a laptop equipped with a navigation system and a web browser, a desktop, a laptop, etc. At this time, at least one collection technician terminal 400 may be implemented as a terminal that can connect to a remote server or terminal through a network. At least one collection technician terminal 400 is, for example, a wireless communication device that ensures portability and mobility, and is capable of performing navigation, PCS (Personal Communication System), GSM (Global System for Mobile communications), and PDC (Personal Digital Cellular) , PHS (Personal Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless Broadband) It may include all types of handheld-based wireless communication devices such as Internet) terminals, smartphones, smartpads, and tablet PCs.

At least one autonomous vehicle 500 may be a vehicle that receives the vehicle movement route from the separate collection service providing server 300 using a web page, app page, program, or application related to the recycling service separation service using an identification code. there is. At this time, the autonomous vehicle 500 is a vehicle that is controlled to move along the vehicle path in a group with a collection engineer and stop for a preset time, for example, 1 to 3 minutes in front of the address where the emission event is received. You can. Here, when the autonomous vehicle 500 discovers an illegally parked vehicle, two-wheeler, or kickboard, the vehicle may extend the stopping time until the collection engineer returns to the vehicle. At this time, the way to distinguish illegally parked vehicles is by using the lines marked on the road. In the case of a solid white line, parking is allowed, so this section is not cracked down on, and a yellow dotted line prohibits parking and allows stopping within 5 minutes, a solid yellow line. Parking is selectively permitted depending on the time or day of the week, while the double solid yellow line is a section where parking is absolutely prohibited. Most of the sections where people and cars can travel together in residential areas, such as back roads, or residential roads, are yellow dotted lines. If the vehicle does not move even after 5 minutes after stopping, it is subject to crackdown, so self-driving vehicles (500) are yellow. If 5 minutes have passed since checking the parking on the dotted line, send it to the police station in the case of a two-wheeled vehicle, to the local government in charge in the case of a vehicle, to the Seoul Metropolitan Government in the case of a Seoul city kickboard, and enter the timeline as metadata and send it together.

Here, at least one autonomous vehicle 500 may be implemented as a computer capable of accessing a remote server or terminal through a network. Here, the computer may include, for example, a laptop equipped with a navigation system and a web browser, a desktop, a laptop, etc. At this time, at least one autonomous vehicle 500 may be implemented as a terminal that can connect to a remote server or terminal through a network. At least one autonomous vehicle 500 is, for example, a wireless communication device that guarantees portability and mobility, and includes navigation, personal communication system (PCS), global system for mobile communications (GSM), and personal digital cellular (PDC). , PHS (Personal Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless Broadband) It may include all types of handheld-based wireless communication devices such as Internet) terminals, smartphones, smartpads, and tablet PCs.

The sorting terminal 600 may be a terminal including a scanner, a camera, and a touch display located in a sorting area using a web page, app page, program, or application related to a recycling service separation service using an identification code. The autonomous vehicle (500) and the collection engineer come to the sorting area together, and as soon as the collection engineer arrives at the sorting area, he or she performs the unloading task of putting down the collection bags collected in the autonomous vehicle (500). At this time, an identification code is attached to the collection bag, so when the identification code is scanned on the scanner of the sorting terminal 600, the address, user name, etc. are identified together, and the recyclables inside are taken out and placed on the conveyor belt. In the process, if you find a recyclable product with foreign substances on it, press the "Foreign Matter" button on the touch display, and the picture is taken with the camera, and [Identification code-foreign matter-picture of recyclable product] is mapped and stored together, and this is stored on the separate collection service provider server (300). It is uploaded to and a penalty is given that deducts the reward granted to the user terminal 100. Of course, this process can be performed automatically through CCTV, etc., but since there is no or insufficient data set in the beginning, a person must manually label the photo by pressing the "Foreign Matter" button on the touch screen to determine which recyclable product has foreign substances attached. The photos labeled in this way are accumulated as a dataset for learning and testing of the artificial intelligence algorithm, and when a sufficiently large number and type are secured, the artificial intelligence algorithm can be trained, so later, through CCTV or cameras, Only human intervention is required for some parts, and the rest can be automatically determined whether there is foreign matter attached (if it has not been cleaned) or not.

Here, the selection terminal 600 may be implemented as a computer that can connect to a remote server or terminal through a network. Here, the computer may include, for example, a laptop equipped with a navigation system and a web browser, a desktop, a laptop, etc. At this time, the selection terminal 600 may be implemented as a terminal that can connect to a remote server or terminal through a network. The selection terminal 600 is, for example, a wireless communication device that guarantees portability and mobility, and includes navigation, personal communication system (PCS), global system for mobile communications (GSM), personal digital cellular (PDC), and personal communication system (PHS). Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), Wibro (Wireless Broadband Internet) terminal, It may include all types of handheld wireless communication devices such as smartphones, smartpads, tablet PCs, etc.

Figure 2 is a block diagram illustrating the server providing the separation service included in the system of Figure 1, and Figures 3 and 4 show the implementation of the recycling service separation service using an identification code according to an embodiment of the present invention. This drawing is for explaining an embodiment.

Referring to FIG. 2, the recycling service providing server 300 includes a user registration unit 310, an output unit 320, a route creation unit 330, an allocation unit 340, an automatic penalty assessment unit 350, and a manual penalty assessment unit 350. It may include a penalty imposition unit 360, a reward unit 370, a guidance unit 380, and a location sharing unit 390.

The recycling service providing server 300 according to an embodiment of the present invention or another server (not shown) operating in conjunction with at least one user terminal 100, at least one collection engineer terminal 400, and at least one When transmitting a recycling recycling service application, program, app page, web page, etc. using an identification code to the autonomous vehicle 500 and at least one sorting terminal 600, at least one user terminal 100, at least one The collection engineer terminal 400, at least one self-driving vehicle 500, and at least one sorting terminal 600 install or open a recycling waste separation service application, program, app page, web page, etc. using an identification code. You can. In addition, using a script running in a web browser, the service program is installed on at least one user terminal 100, at least one collection engineer terminal 400, at least one autonomous vehicle 500, and at least one selection terminal 600. ) can also be run. Here, a web browser is a program that allows the use of web (WWW: World Wide Web) services and refers to a program that receives and displays hypertext written in HTML (Hyper Text Mark-up Language), for example, Netscape. , Explorer, Chrome, etc. Additionally, an application refers to an application on a terminal and includes, for example, an app running on a mobile terminal (smartphone).

Referring to FIG. 2, the user registration unit 310 receives user registration of the user terminal 100, generates an identification code using the address, name, and phone number included in the user registration, and sends it to the user terminal 100. It can be granted. If the resident registration number is not used, it may be difficult to identify the user, so other information such as address, name, phone number, and email address should be received. The identification code may be, for example, a two-dimensional code or a one-dimensional code such as a QR code or barcode, and pages that can be identified by scanning a QR code or barcode are set to be available only within the platform of the present invention. This is because allowing anyone to scan a QR code would violate the Personal Information Protection Act as it would be possible to determine who lives where and what their phone number is. The collection technician terminal 400 only displays the address where the discharge event was output, and is configured so that it is not possible to determine who lives where or what their phone number is by scanning the QR code. To this end, when an address, phone number, email, etc. is received from the user terminal 100, the user registration unit 310 generates an identification code, for example, a QR code, and maps the address, phone number, email, etc. to the QR code. can be saved. At this time, the QR code can be scanned at the sorting terminal 600 or the collection technician terminal 400, but the information mapped to it is set to be confirmed only at the separate recycling service providing server 300. The sorting terminal 600 or the collection technician terminal 400 only performs the function of tagging which recycling bag with foreign substances came out of the collection bag with which identification code was printed by simply scanning, and cannot retrieve user information.

The output unit 320 may output a waybill so that the collection bag on which the identification code assigned to the user terminal 100 is printed is delivered to the address of the user terminal 100. The collection bag may preferably be a bag with a zipper or a lid that cannot be easily opened from the outside. For example, if user A cleans the recyclables thoroughly and puts the collection bag out outside the house, but a passerby B puts a tteokbokki cup containing tteokbokki in the collection bag, then no matter how cleanly user A washed it, passerby B Recyclables washed by become covered in tteokbokki soup again. At this time, if a penalty is imposed on User A after the collection bag is collected, this is unfair because User A will be disadvantaged even though he has done his job. Accordingly, it may be a bag with a zipper or a lock that cannot be easily opened from the outside, or it may be a collection bag made of material that may not be transmitted to the recyclables even if it rains or contaminants are thrown from the outside. Additionally, an identification code, such as a QR code or barcode, may be printed on the outside of the collection bag, and the printed barcode or QR code may be coated so that it is not easily erased.

When the user terminal 100 captures an identification code and outputs an emission event, the route creation unit 330 may collect the address and time at which the emission event was output to generate a vehicle movement path. The collection engineer terminal 400 may receive the vehicle movement route according to the emission event and output the address where the emission event was output on the vehicle movement route. At this time, an autonomous vehicle 500 that operates autonomously to move according to the vehicle movement path may be further included. Generally, a garbage collection vehicle consists of one collector and one driver, working in a team of two. However, when using an autonomous vehicle (500), it is possible to collect garbage with just one collection worker even if there is no driver. At this time, in the case of large-sized waste, local governments outsource the processing to each company, so most of the items put out as recycling are not heavy.

Accordingly, only one collection engineer can collect recyclables in a group with an autonomous vehicle (500). At this time, the autonomous vehicle 500 may be a vehicle that runs on electric energy. In the case of residential areas, there are speed limits because they are mostly back roads (residential roads), and they do not require fast and complex autonomous driving, so when using an autonomous vehicle (500) that moves with electric energy, it can travel quietly and slowly through residential areas without engine noise. can be moved. Also, in the case of side roads, you must be careful of children, pedestrians, other vehicles, two-wheeled vehicles, kickboards, pets, etc., so you can program autonomous driving that avoids interference with moving pedestrians and other vehicles as the top priority. At this time, the collection technician can figure out which house provided the next discharge event, collect it, and then take a break until moving to the next address.

<Create vehicle path>

We decide to use a mixed integer programming model to model the visit route optimization problem considering the realistic constraints of a visit by an autonomous vehicle (500). The modeled mixed integer programming model is a type of Vehicle Routing Problem with Time Window (VRPTW) with time constraints. Since this series of problems is an NP-hard problem, an optimal solution can be found for small-sized problems. As the size of the problem increases, the computation time to solve the problem becomes very large. Therefore, as a way to find a solution within a reasonable time, we decided to model the VRPTW problem with added realistic constraints using a mixed integer program model and use a two-stage GA (Genetic Algorithm) model to generate the model solution.

Before explaining the work allocation and scheduling method below, the basic concept behind it will first be explained.

Existing research methods to solve the VRPTW problem can be broadly divided into four types. The first method is to find the exact solution. The second way to solve VRPTW is the use of a path generation heuristic. The path creation heuristic is a method of sequentially selecting nodes until a possible solution is obtained according to the minimum cost standard while satisfying given constraints. Typically, a cluster-first route second method is used to divide a node into several groups, design a route for each group, and create one large route that includes all nodes, then use the route as a solution. The route-first cluster-second method, which is a method of dividing into small routes that can be derived, belongs to the classification. The third method to solve VRPTW is the incremental solution method. This method is based on the concept of local search, which seeks to improve the solution by exploring neighboring solutions from the initial solution. Step by step, one possible solution is changed to another possible solution with a lower overall cost, so that the solution is no longer needed. This method is repeated until there is no cost reduction. In order to improve speed, methods such as omitting selection of incomprehensibility or evaluation of unnecessary objective functions have also been developed. The fourth method to solve VRPTW is a method based on mathematical programming. This method directly uses the mathematical planning formula included in the vehicle path problem. This approach is easy to handle additional constraints if they are not purely constraints added to VRPTW.

At this time, in one embodiment of the present invention, the VRPTW problem with added realistic constraints is modeled as a mixed integer program model and a two-stage GA (Genetic Algorithm) model is used to generate a solution to the model.

In one embodiment of the present invention, the constraints shown in Table 1 below are considered.

Pharmaceutical classification Constraints One One autonomous vehicle (500) visits multiple destinations in a week. 2 Each destination has two types of visits required. Random visit sites do not specify visit days and only require the number of visits per week, while fixed visit sites require a specified number of visits and days of the week. 3 Each destination has a preferred time window for visiting, divided into the earliest start time and the longest start time. There are three levels of visit preference time constraints, and each visit destination has as high a priority as possible.
Visits are required to be made during preferred time constraints. When a visit that violates the time limit occurs due to other restrictions, a fine proportional to the severity is incurred. 4 Each place to visit has a rating according to its importance. When deciding when to visit a destination with a high rating, visit preference time constraints must be satisfied with priority over a destination with a low rating. Here, the importance of places to visit is divided into 5 levels.

In addition to the above-mentioned restrictions, the basic geographical data of the visited place (visited place coordinates in the KATECH coordinate system) and the required service time at each visited place may be additionally added. Next, the mixed integer programming model is explained. At this time, the symbols used in modeling are as shown in Table 2 below.

sign Justice N Set of visited destinations, N = NF∪NR NF Set of fixed places to visit with fixed visit days, NF ⊆ ?NR: Set of random places to visit, NR⊆N where visit days can be arbitrarily determined Ki i ∈ NF fixed visit day of visit destination i, j = 0, … , n Index for origin and destination, i, j ∈ N, if i = 0, then origin, n = total number of destinations. k = 0, … , 6 Index representing the day of the week, k = 0 for Monday, k = 6 for Sunday p = 1, 2, 3 A constant index indicating the priority of the visit preferred time constraint section. xijk Whether or not there is movement between visited location i and visited location j on day k, if 0, no movement, if 1, movement dij Travel costs between destination i and destination j M very large number Tik Time to arrive at destination i on day k (minutes) si iService time at the destination (minutes) tij Travel time between destination i and destination j (minutes) eip, lip Shortest start time, longest start time (minutes) of time-constrained section p for visit location i P1ikp, P2ikp Degree of violation of visit time (minutes) for time-constrained section p on visited location i and day k. ci iThe weight of fines for each level of the destination (total of 5 levels) vi i∈NRRandomly requested number of visits to the destination

The decision variables to be solved in this problem are the binary variable xijk and the continuous variable Tik representing the arrival time. The mixed integer programming model using the above symbols is as shown in Equations 1 to 9 below.

Equation 1 is the objective function of the problem, which is to minimize the sum of the total travel cost incurred by the autonomous vehicle (500) to visit all destinations for a week and the fine incurred by failing to adhere to the visiting time when visiting the destination. Fines that may be incurred when visiting a destination are explained in Equation 6. Equation 2 represents the constraint that all visit paths must be connected. Equation 3 is a constraint on the random visit type in which only the required number of visits per week is given. Equation 4 is a constraint on the fixed visit type, and Equation 5 means that the arrival time at a specific visit point must be greater than the sum of the arrival time at the previous visit point, the service time at that point, and the travel time to the destination. am. Equation 6 means that the variable (Tik) representing the arrival time at the destination must be between the upper and lower limits of the time constraint given to the destination, that is, the shortest start time (eip) and the longest start time (lip). At this time, if a visit occurs that exceeds the upper and lower limits of the assigned time constraint of the visited destination, the variable (P1ijk or P2ijk) indicating the degree has a positive value of 0 or more.

At this time, variables P1ijk and P2ijk are mutually exclusive. In other words, if a time constraint occurs, the time constraint will only occur in either the upper or lower limit of the time constraint, and accordingly, only one of the two variables, P1ijk and P2ijk, will have a positive value of 0 or more, and the other variables will be 0. It has the value of , and if no time constraint occurs, both variables have 0. Equation 7 means that the arrival time and service time at the departure point are 0, and Equation 8 is a condition indicating that the decision variable Equation 9 is a constraint expression that represents the non-negative condition that the remaining decision variables Tik, P1ijk, and P2ijk have positive values.

Next, the two-stage GA model is explained. The mixed integer programming model described above is largely divided into two parts: i) a part for generating a visit path consisting of the left term of the objective function equation and the constraints Equation 2, Equation 3, and Equation 4, and ii) the right part of the objective function equation. It can be divided into a decision problem at the time of visit that minimizes violation of time constraints consisting of terms and constraints, Equation 5, Equation 6, and Equation 7. In one embodiment of the present invention, a two-step GA method is used to solve a given problem by converting it into a two-step GA problem as a method for generating a visit path. Forward scheduling and backward scheduling methods are used to determine when to visit a destination according to the path generated by the two-step GA method. Forward deployment and backward deployment scheduling methods will be described later.

The mixed integer model is an NP-hard problem of the VRPTW series, so as the number of visited locations increases, exponential calculation time is required. Therefore, a meta-heuristic algorithm is needed as a realistic approach, and we decided to use a genetic algorithm among the meta-heuristics. Genetic algorithms do not start the search from a single solution, but perform the search in parallel starting from a population. One solution in a solution group is called a chromosome, and each chromosome consists of a gene. Each chromosome evolves through successive repetitive calculations expressed as generations. As each generation adapts to the environment through genetic operators, that is, selection, crossover, and mutation, each chromosome is evaluated according to the fitness function.

Next, the expression for the solution is explained. GA begins with determining the solution expression to solve the problem. For general GA problems such as TSP (Traveling Salesperson Problem) or VRP (Vehicle Routing Problem), various expressions and corresponding genetic operators have been developed. Path Representation, typically used in TSP problems, is to visit city 3 first, visit city 1 second, and visit city 2 third when the solution expression is (3 1 2 4). The order of visits is expressed by visiting city number 4, then visiting city number 4 fourth, and so on. In the solution expression that follows this path expression, genetic operators such as OX (Order Crossover), CX (Cycle Crossover), and PMX (Partially Mapped Crossover), which can be typically used in TSP problems, as well as one-point crossover and two-point crossover, can be used. The possibility of time and solution cannot be maintained. Accordingly, the entire problem is solved by separating it into a two-stage GA problem. i) In the first step, the visit days are determined for the random visit sites, and ii) in the second step, the visit order of all the visit sites selected for each day of the week, including the fixed visit sites for the random visit sites for each day of the week selected in the first step, is determined.

The expression of the solution required for each stage includes a random schedule for solving the first-stage problem, and a fixed schedule and a mixed schedule for solving the second-stage problem. An expression consisting of a combination of a random schedule and a fixed schedule is a mixed schedule. For example, deciding to visit on XX day of the next week is a fixed schedule, and visiting any time of the next week is a random schedule. However, if only the week other than these days is fixed (random) and the date as well as the installation week A schedule that is fixed until (fixed) is a mixed schedule.

First, the genetic factor of the random schedule is a hexadecimal value indicating the day of the week, and the length of the entire chromosome is determined by the number of random visits. In other words, the location of each genetic factor corresponds to the order among all random visit destinations, and the number of visit requests for a random visit destination corresponds to the number of digits of the hexadecimal value of the genetic factor. On the other hand, the genetic factor of a fixed schedule consists of a number representing the fixed visit destination itself and a delimiter 0 that distinguishes the fixed visit days. The population used in the first stage uses only a random schedule. In the first stage, the visit day of the random destination is determined, and the order of visits within each day is determined in the second stage. In the second step, a mixed schedule is created considering the fixed schedule for one solution (random schedule) constituting the population of the GA problem in the first step, decomposed into 7 path equations for each day of the week, and then the decomposed 7 Solve the TSP problem to complete the evaluation of one solution that constitutes the population of the first stage problem.

Genetic operators will be explained. If you use the same solution expression (random schedule) as in the first and second steps described above, the possibility of a solution is not damaged even if you use traditional crossing operations such as one-point intersection or two-point intersection for the upper first-stage problem. The mutation operation used in the upper first stage problem involves selecting a random chromosomal locus from a random schedule and then generating a random 7-base random number corresponding to the number of digits of the selected chromosomal locus to replace the selected chromosomal locus. You can use it. The lower second stage problem is similar to the solution of the general TSP problem, and in one embodiment of the present invention, improved neighbor factor recombination crossover, which is known to be useful in solving the TSP problem, can be used for the crossover operation. The mutation operation can use the SWAP operation, which randomly selects two visited locations and exchanges their locations. The selection operation may use a tournament operation in both the first and second stages.

Forward deployment and backward deployment scheduling are explained. In this scheduling process, given the visit route for each day of the week, the problem of determining a visit time that adheres to this and does not violate time constraints as much as possible is explained. The two-stage GA model described above was a genetic calculation model that only dealt with the visit route generation part, and as in the mixed integer planning model, the objective function must include the penalty that occurs when the visit time for each visit site violates the time constraint. Of course, this penalty is added up at the evaluation stage of the solution of the upper GA problem through the solution of the lower GA problem. The most important criterion in determining specific visit timing for a given visit route for each day of the week is the grade of the destination. The higher the level of the destination, the more the time constraints assigned to the destination must be adhered to. Even if the visit order is given, the number of cases for determining visit time slots for each visit destination is at most mn when the number of visit destinations is n and the number of preferred visit time slots is m. For example, if the number of visit preference time constraint sections is 3, the number of cases for determining visit preference time may be at most 3n.

Of course, from a realistic point of view, the decision on when to visit a destination is a choice of a continuous variable called time, so it will have a very large number of alternatives, which is different from a combination of discrete variables such as the choice of a visit time period. Therefore, an appropriate heuristic is needed to determine the visit time in a situation where such a visit order (visit route) is given. For convenience of explanation, assuming that i) the level of each visitation site is the same and ii) there is only one type of preferred time zone, the first daily schedule that follows the forward-deployment scheduling method will first be explained, and the first daily schedule After relaxing the assumptions, that is, the second daily schedule that performs forward and backward scheduling together, the third daily schedule in the generalized case where both i) and ii) assumptions are relaxed will be explained.

First, if there is a fixed day of the week (k = K) and one type of preferred time zone (p = P), and the grades of all visited destinations are the same, the situation will be the same regardless of which destination is initially selected, so the arrival time of the first visited destination ( Time of visit) can be set as the shortest start time of the first visited destination (T1K = e1P). To minimize fines, the arrival time at the second destination is the sum of the arrival time at the first destination (T1K), the service time at the first destination (s1), and the travel time from the first destination to the second destination (t12). It must be the larger of the shortest start time (e2P) for the second visit destination. In this way, the first daily schedule is the procedure of omnidirectionally determining the visit times of the visited destinations sequentially, starting from the time of the first visit. When following this schedule, time constraint violations occur only when arriving at the visited destination beyond the latest start time, so the total time constraint violation sum is ∑i=1~n max{TiK-liP, 0}.

Again, in a situation where the visit destinations do not all have ratings, the visit time of the visit site with the highest rating (i = i') is set as the shortest start time for the visit site (Ti'K = ei'P), and the visit time for the visit site with the highest rating (i = i') is set as the shortest start time for the visit site (Ti'K = ei'P), and the visit time for the visit site with the highest rating (i = i') is set as the shortest start time for the visit site (Ti'K = ei'P) For the arrival time, the same forward-deployment scheduling as in the first daily schedule is performed. In addition, scheduling in the direction immediately preceding the destination with the highest rating is sequentially performed as backward scheduling in a similar manner to forward scheduling. At this time, time constraint violations occur both in arrival at the destination beyond the shortest start time and in arrival at the destination before the shortest start time, so the total is ∑i=1~nmax{TiK-liP, 0}-∑i=1~nmin. becomes {TiK-eiP, 0}.

Since the given original problem has three different preferred time constraints for each destination, the modified algorithm that reflects this in the second daily schedule, that is, relaxes the conditions, is the same as the third daily schedule. At this time, the total number of time constraint violations is ∑i = 1~n{max(TiK-liP, 0)|P = argmax(liP)}-∑i=1~n{min(TiK-eiP, 0)|P = argmin(eiP)}. Through the above-described configuration, an embodiment of the present invention can monitor the current progress compared to the generated optimal installation path, and the optimal visit path obtained under given constraints is monitored in real time through a GIS control system and autonomous vehicle If (500) deviates from the optimal path or progress is observed to be slow compared to plan, you can respond quickly. In addition, by using a GA model that pursues solution improvement while maintaining possible solutions at all times, real-time approximate optimal rescheduling can be possible even if exceptional situations such as vehicle breakdowns, accidents, emergency requests, etc. occur. Accordingly, the route creation unit 330 generates the vehicle movement route of the autonomous vehicle 500 by setting the address where the emission event is output at preset time intervals as a stopover, and generates the vehicle movement path of the autonomous vehicle 500 by setting it as a waypoint. It can be sent to (400).

<Autonomous driving>

In one embodiment of the present invention, in order to drive with a focus on crisis detection in an autonomous vehicle 500 that must drive on a back road (residential road) in a residential area, the vehicle is currently using the situation outside the vehicle and sensor data inside the vehicle. Print the crisis situation as a value between 0 and 1. A vehicle crisis detection system may consist of two modules. The first module, the vehicle external situation collection module, uses the vehicle's front camera and CNN to collect vehicle information and pedestrian information around the currently driving vehicle. The second module, the vehicle crisis situation determination module, uses the results of the vehicle's external situation collection module and sensor data inside the vehicle to output the risk level of the vehicle's current situation between 0 and 1.

The vehicle exterior situation collection module uses two CNN (Convolutional Neural Network) models to collect data outside the vehicle. First, the vehicle external situation collection module stores information about surrounding vehicles through V2V communication and recognizes the license plate of a vehicle directly adjacent to the currently driving vehicle through the vehicle's front camera. For example, a VR-CNN (Vehicle Recognition CNN) model can be used to recognize surrounding vehicles through front images. VR-CNN outputs results using 3 layers consisting of 1 Convolution and 1 Max Polling and 2 Fully Connected layers. The vehicle's external situation collection module uses VR-CNN and YOLO (You Only Look Once), a CNN-based algorithm, to detect pedestrians while driving. In order to quickly calculate two CNN models, the vehicle external situation collection module removes noise from images input to YOLO and increases calculation speed by limiting the size of the Binding Box used in YOLO. YOLO can use Leaky ReLU as an activation function for Fully Connected operation for fast operation, which is shown in Equation 10.

When the vehicle external situation collection module collects pedestrian information and surrounding vehicle information (cars, two-wheelers, and kickboards), the vehicle crisis situation determination module uses a DNN (Deep Neural Network) model to determine the crisis situation of the autonomous vehicle (500). do. Table 3 below shows the input of the vehicle crisis situation determination module.

node Justice x1 The number of vehicles ahead x2 The distance to the nearest vehicle x3 The speed of the nearest vehicle x4 The distance to the farthest vehicle x5 The number of pedestrians ahead x6 The distance to the nearest pedestrian x7 The speed of the nearest pedestrian x8 The distance to the farthest pedestrian x9 Tire pressure x10 Engine RPM x11 Current speed x12 Average speed over 5 seconds x13 Headlight condition

The vehicle crisis situation judgment module uses 13 inputs, and all input values are normalized to 0 to 1. The DNN of the vehicle crisis situation judgment module has only one output node, and the value of the output node is between 0 and 1. The vehicle crisis situation determination module uses the Sigmoid function as an activation function for deep learning calculations.

Since the sigmoid function always has a value between 0 and 1, both the input and output values have a value between 0 and 1. Equation 11 represents the calculation method of the Sigmoid function.

In order to accurately determine the emergency situation of the vehicle, the vehicle emergency judgment module must learn the DNN model in advance. The vehicle crisis situation judgment module trains DNN using back-propagation. The training data used for DNN learning is generated based on directly collected normal driving data and vehicle accident data using traffic accident statistical analysis data. Among the generated training data, the output of normal driving data is all set to 0, and the output of accident data is specified between 0 and 1 through the vehicle's repair records. Equation 12 represents the loss function when using training data.

In order to determine the effectiveness of the vehicle crisis detection system, experiments on the vehicle external situation collection module can be conducted using driving data in a virtual environment. In order to prove the real-time and accuracy of pedestrian detection used in the vehicle external situation collection module of the vehicle crisis detection system, CNN and R-CNN can be constructed under the same conditions as the vehicle external situation collection module (VESCM) to compare accuracy and computation speed. there is. In the test dataset, the computation time of VESCM, R-CNN, and CNN can be measured as the number of pedestrians increases, and the model that has the most similar accuracy and the fastest computation time to satisfy real-time can be extracted and used. .

The allocation unit 340 may transmit the address where the vehicle movement path and discharge event are output to the collection technician terminal 400. The collection technician terminal 400 can receive information about where to collect the collection bag. When the user terminal 100 applies for user registration, it is given an identification code to identify the user, takes a photo of the identification code printed on the collection bag, outputs a discharge event, and provides rewards or penalties depending on the results of separate collection of recyclables. can be granted.

When a collection bag is collected and the recyclables in the collection bag are sorted, the automatic penalty assessment unit 350 collects the identification code of the collection bag and the washing status of the recyclables contained in the collection bag through at least one camera in the sorting area, If it is determined that the recycling product contains foreign substances using at least one previously stored foreign matter detection algorithm, a penalty may be imposed on the user terminal 100. However, this may be possible after the [image-label], that is, the data set, for learning the artificial intelligence algorithm through the manual penalty imposing unit 360, which will be described later, is prepared.

When the collection bag is collected and the recyclables in the collection bag are sorted, the manual penalty assessment unit 360 receives a video or photo from at least one sorting terminal 600 when the recyclables in the collection bag are not washed and contain foreign substances. When uploaded and a photo of the identification code printed on the collection bag is received from at least one sorting terminal 600, a penalty may be imposed on the user terminal 100 that has already been mapped and stored with the identification code. After the autonomous vehicle 500 and the collection engineer arrive at the sorting station, the collection engineer performs the task of unloading the collection bags as described above. At this time, a scanner is provided at the workshop where the collection bags are unloaded, and a conveyor belt is provided right after the scanner to move the recyclables to the sorting workshop. After the collection technician or sorters scan the collection bags using a scanner, a touch screen is provided on the upper part of the support that supports the conveyor belt. Recyclables are moved by a conveyor belt, and the sorter checks whether or not there are any foreign substances on the recyclables. When the sorter presses the "Foreign Materials" button on the touch screen, the owner of the recyclables scanned by the scanner, i.e. Since the identification code of the collection bag of the user terminal 100 has been identified, it is possible to know which user discharged the recyclables with foreign substances.

At this time, when the button called "Foreign matter" is selected, the camera immediately takes pictures of the recyclables on the conveyor belt. In this case, the sorter can take a picture by bringing the recyclables in front of the camera and pressing the "Film" button, or the moment the "Foreign matter" button is pressed. A camera that takes pictures from top to bottom of the conveyor belt where the touch screen with the “Foreign object” button selected is located may be automatically activated. The camera takes pictures from a top-down angle, as if creating a floor plan, and identifies the recyclables held by the sorter as recyclables with foreign substances. When the sorter holds a recyclable in his hand and clicks the "Foreign Matter" button, the camera takes a picture of it, and [Identification code - photo of recyclable with foreign matter] is mapped and stored. With just this simple task, images can be labeled for artificial intelligence algorithms. Labeling refers to the work in which labelers attach a given label to each image or data. At least thousands to tens of thousands of photos are needed to train an artificial intelligence algorithm. It is possible to impose a penalty on users without hiring a labeler one by one, and still use the penalized photos as a dataset for learning artificial intelligence algorithms.

At this time, the method of mapping the user's identification code and the recycling product is, for example, user A's identification code B was scanned by the scanner at 7 PM, the moving speed of the conveyor belt is Y [m/sec], and the identification code Assuming that the time from when B was scanned by the scanner until the next identification code C was scanned by the scanner was 1 minute (60 seconds), Y At this time, a location identifier indicating the location of the conveyor belt is displayed, and if a dividing bar is placed on each conveyor belt to distinguish each user, it is possible to check how many meters belongs to user A based on the dividing bar, Even if the scanner is at the beginning of the conveyor belt, it is possible to check where user A belongs to user A. At this time, the arrangement of each component is [scanner-conveyor belt], and touch screens are provided at preset intervals from the start point to the end point of the conveyor belt.

Alternatively, as soon as the collection engineer unloads the recyclables, before they are moved to the conveyor belt, scan the identification code of the collection bag on the scanner, and if foreign matter is found in the recyclables, press the "Foreign Matter" button on the touch screen. , You can also use the method of moving it on a conveyor belt afterwards. In this case, errors or errors that may occur in the above-described method can be reduced. At this time, the arrangement of each component is [scanner-touch screen-conveyor belt], and the touch screen is provided right next to the scanner.

When the collection bag is collected and the recyclables in the collection bag are sorted, the reward unit 370 receives the identification code of the collection bag from at least one sorting terminal 600 and, if the washing completion button for the recyclables is selected, the washing is completed. A preset compensation may be provided to the user terminal 100 in which the button is previously mapped and stored with the selected identification code. If the reward accumulated in the user terminal 100 is more than a preset amount, the reward unit 370 automatically transfers it to the account of the user terminal 100 or provides at least one point usage location so that the user terminal 100 can use it as a point. can be provided. For example, if you link up with a local government, you may be able to purchase an additional set of volume-based garbage bags, or you may be able to purchase eco-friendly laundry soap.

The information unit 380 may collect an image of the process of recycling the recyclables in the collection bag from at least one recycling company terminal and transmit it to the user terminal 100. For example, after a 1.5-liter plastic bottle of Cola is collected, a video can be provided showing the process of re-washing, disinfecting, separating foreign substances, processing, and being reborn into clothes.

The location sharing unit 390 receives the current location of at least one autonomous vehicle 500 and shares it with the user terminal 100, and provides the number of stops to be reached to the address of the user terminal 100 and the user terminal ( The time it takes to travel to the address of 100) can be transmitted to the user terminal 100. At this time, in addition to the user who printed the discharge event, other users whose address is the corresponding route can also be notified. This can help them dispose of their recycling quickly without dirtying the inside of the house, and the self-driving vehicle 500 can With one trip, more recyclables can be collected. For example, assuming that an autonomous vehicle (500) moves from Sadang 1-dong to Sadang-dong 5, a text message is sent to residents along the route telling them where the autonomous vehicle (500) is currently located and when it will arrive at the address. It can inform awareness. By sending messages through text instead of making noise through speakers, you can deliver messages quietly and accurately.

Hereinafter, the operation process according to the configuration of the recycling service providing server of FIG. 2 described above will be described in detail using FIGS. 3 and 4 as an example. However, it will be apparent that the embodiment is only one of various embodiments of the present invention and is not limited thereto.

Referring to Figure 3, (a) when the recycling service providing server 300 receives user registration from the user terminal 100, it collects the address, phone number, email, etc., generates an identification code, and maps it with the user information. and save it. Then, an identification code is printed on the outside of the collection bag and a waybill is printed for delivery to the user's address. And, (b) the separate collection service providing server 300 generates a discharge event when the user mixes all recyclable items such as cans, glass bottles, paper, and plastic in the collection bag and scans the identification code on the user terminal 100. It is reported as a transmission of , and the address is added to the collection list. At this time, the reason for putting all the recyclables in one bag is that even if the user separates them, the classification is complicated and the markings are different, so not only is it not classified properly, but each user is responsible for ensuring that even a little bit of waste from the recyclables is his or her own. Since I hate staying at home and want a clean house, I considered putting all the recyclables in one bag and throwing them away anyway.

Instead, the only thing asked of the user is cleaning and disassembly. If the sesame oil bottle has not been washed, it cannot be placed in the collection bag. If you are throwing away paper and it is still stapled, you cannot put it in the collection bag. If you enter it, you are subject to a penalty. If you throw away plastic as recycling, but it still has kimchi soup or food on it, you are subject to a penalty. Also, if you throw away a Spam can and the residual Spam oil and pieces of Spam remain in the can, this is also subject to a penalty. Instead of leaving the complicated recycling sorting to the user, thorough cleaning is requested. If you eat chicken and try to throw away the paper containing the chicken, but there is seasoning on it, you are also subject to a penalty. In this way, users can place all recyclables in one collection bag at a time, but they must all be separated and washed individually.

The user terminal 100 puts the separated and washed recyclables into one collection bag, and then scans the QR code printed on the outside of the collection bag when the collection bag is full. Accordingly, the recycling service providing server 300 adds a waypoint according to [QR code scan = discharge event transmission] and provides a vehicle movement route to the collection engineer terminal 400 and the autonomous vehicle 500. For example, assuming that a vehicle goes around route A of one shrine building every two hours, the route will already be confirmed two hours in advance. For example, using the emission event received from 10:00 AM to 12:00 AM, the route is confirmed at 12:00, and the vehicle travels through the stopover from 12:00 to 1:00. At this time, even if another user outputs an emission event at 12:30, even if it is on route A from 12:00 to 1:00, the autonomous vehicle 500 passes by without stopping because it is not in its waypoint list. To this end, the address of the user terminal 100 that transmitted the discharge event can be added in real time to the path to be passed in addition to the path that has already been passed, so that it can be further provided for stopping.

(c) The self-driving vehicle 500, which is a collection vehicle that has collected all the collection bags, moves to the sorting area, and after arriving at the sorting area, the recyclables are sorted by a sorter through [scanner-conveyor belt-camera]. If there is foreign matter, the sorter presses the foreign matter button on the touch screen, and the camera immediately takes pictures of the recyclables held in the sorter's hand. At this time, the user is identified by the identification code scanned by the scanner, a photo of the recyclable product with foreign substances is transmitted to the user terminal 100 in real time, and a penalty is assigned. If the foreign matter button is not pressed, compensation for cleaning the recycled product is transmitted to the user terminal 100. At this time, compensation can be implemented only when cleaning completion is input, or compensation can be processed based on the fact that the foreign matter button is not pressed as cleaning completion, but this may vary depending on the embodiment.

(d) Assuming that 100 points are provided for one collection, and that the penalty is deducted by 10 points per foreign matter occurrence, if 3 foreign matter buttons are selected, 100 points - 30 points = 70 points are provided to the user. can do.

As shown in Figure 4a, 55% of household waste is incinerated, and the method according to an embodiment of the present invention helps each individual more easily separate and dispose of recyclables and prevents incorrect separation and collection that occurs during separation and recycling. do. The resource circulation process is the same as Figure 4c, but it allows solving problems such as the reason for the low recycling rate, that is, when contaminants are stained, mixed, or the recyclables are too small, as shown in Figure 4d, as shown in Figure 4e. As shown in Figure 4f, users can do their part, i.e., wash and separate, and put them all in one bag for recycling, so there is no need to separate each item and put it in a plastic bag. As shown in Figure 4g, the unsorted mixed plastic is minimized to maximize profit. Make it possible to pay As shown in Figure 4h, to avoid contamination and mixing of materials, which are the causes of lowering the recycling rate, the user is left with only washing and separation, and the selection of each material is carried out at a sorting station, allowing the user to use an electric vehicle that is quiet enough to drive around residential areas. A comparison between the separation of waste of the present invention and the existing waste separation is shown in Figure 4i.

Matters that are not explained regarding the method of providing a separate collection service for recyclables using the identification codes of FIGS. 2 to 4 are the same as or have not been explained previously with respect to the method of providing a separate collection service for recyclables using an identification code through FIG. 1. Since it can be easily inferred from the content, the description below will be omitted.

FIG. 5 is a diagram illustrating a process in which data is transmitted and received between each component included in the system for providing a service for separating recycling products using the identification code of FIG. 1 according to an embodiment of the present invention. Hereinafter, an example of the process of transmitting and receiving data between each component will be described with reference to FIG. 5, but the present application is not limited to this embodiment, and the process shown in FIG. 5 according to the various embodiments described above It is obvious to those skilled in the art that the process of transmitting and receiving data can be changed.

Referring to FIG. 5, the recycling service providing server receives user registration of the user terminal, generates an identification code using the address, name, and phone number included in the user registration, and grants it to the user terminal (S5100), A waybill is printed so that the collection bag printed with the identification code assigned to the user terminal is delivered to the address of the user terminal (S5200), and when the user terminal captures the identification code and outputs a discharge event, the address and time at which the discharge event was output Collect and create a vehicle movement route (S5300).

In addition, the separate collection service providing server transmits the address where the vehicle movement path and discharge event are output to the collection engineer terminal (S5400).

The sequence between the above-described steps (S5100 to S5400) is only an example and is not limited thereto. That is, the order between the above-described steps (S5100 to S5400) may change, and some of the steps may be executed simultaneously or deleted.

Matters that are not explained regarding the method of providing a recycling service for separate collection using the identification code of FIG. 5 are the same as or have not been explained previously with respect to the method of providing a recycling product separation service using an identification code through FIGS. 1 to 4. Since it can be easily inferred from the content, the description below will be omitted.

The method of providing a recycling service for separating recycling using an identification code according to an embodiment described with reference to FIG. 5 is also implemented in the form of a recording medium containing instructions executable by a computer, such as an application or program module executed by a computer. It can be. Computer-readable media can be any available media that can be accessed by a computer and includes both volatile and non-volatile media, removable and non-removable media. Additionally, computer-readable media may include all computer storage media. Computer storage media includes both volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data.

The method of providing a recycling service for separating recycling using an identification code according to an embodiment of the present invention described above includes an application installed by default on a terminal (this may include programs included in the platform or operating system, etc., which are installed by default on the terminal). It may be executed by, or may be executed by an application (i.e., program) installed by the user directly on the master terminal through an application providing server such as an application store server, an application, or a web server related to the service. In this sense, the method of providing a recycling service for separating recycling using an identification code according to an embodiment of the present invention described above is implemented as an application (i.e., a program) installed by default on the terminal or directly installed by the user, and is installed on a computer such as the terminal. It can be recorded on a readable recording medium.

The description of the present invention described above is for illustrative purposes, and those skilled in the art will understand that the present invention can be easily modified into other specific forms without changing the technical idea or essential features of the present invention. will be. Therefore, the embodiments described above should be understood in all respects as illustrative and not restrictive. For example, each component described as unitary may be implemented in a distributed manner, and similarly, components described as distributed may also be implemented in a combined form.

The scope of the present invention is indicated by the claims described below rather than the detailed description above, and all changes or modified forms derived from the meaning and scope of the claims and their equivalent concepts should be construed as being included in the scope of the present invention. do.

Claims (10)

A user terminal that receives an identification code to identify the user upon application for user registration, prints a discharge event by taking a photo of the identification code printed on the collection bag, and receives a reward or penalty depending on the results of separate collection of recyclables;
A collection engineer terminal that receives a vehicle movement route according to the emission event and outputs the address where the emission event was output on the vehicle movement route; and
A user register that receives user registration of the user terminal, generates an identification code using the address, name, and phone number included in the user registration, and grants it to the user terminal, and the identification code assigned to the user terminal is printed. An output unit that outputs a waybill so that the collection bag is delivered to the address of the user terminal. When the user terminal captures the identification code and outputs a discharge event, the address and time at which the discharge event was output are collected to determine the vehicle movement route. A route creation unit that generates a route generation unit, an allocation unit that delivers the address where the vehicle movement route and discharge event is output to the collection engineer terminal, and an image of the process of recycling the recyclables in the collection bag is collected from at least one recycling company terminal. An information unit transmitted to the user terminal, when the collection bag is collected and the recyclables in the collection bag are sorted, the identification code of the collection bag and the washing status of the recyclables contained in the collection bag are displayed through at least one camera in the sorting area. A separate collection service providing server including an automatic penalty imposition unit that collects and imposes a penalty on the user terminal when it is determined that the recyclables contain foreign substances using at least one pre-stored foreign substance detection algorithm;
The user register is,
The identification code, the address, the name, and the phone number are mapped and stored, and the name and phone number mapped to the identification code are set to be confirmed only by the recycling service providing server,
The collection engineer terminal is,
When scanning the identification code, only the address related to the scanned identification code is displayed to protect personal information.
The collection bag is,
It consists of a bag with a zipper or a lock that cannot be easily opened from the outside to prevent other users from putting items inside the collection bag, and even if it rains or contaminants are thrown from the outside, they will not reach the recyclables inside the collection bag. Composed of materials that do not
The server providing the separation service is,
Based on the generated vehicle movement path and the current location of the autonomous vehicle that operates autonomously to move according to the vehicle movement path, the user terminal that transmitted a new emission event in the path to be passed in the future other than the path that has already passed among the vehicle movement path. A system for providing a separate collection service for recyclables using an identification code that adds addresses in real time so that you can stop.
delete delete delete delete delete delete delete delete delete

Images