KR20230071042A - Apparatus, system, method and program for providing shared kitchen service - Google Patents

Abstract

According to an embodiment of the present invention, an apparatus for providing a shared kitchen service is disclosed. The storage device receives a plurality of menu information including information on food sold by users of each of the kitchen terminals from each of the plurality of kitchen terminals, and communicates between the kitchen terminals based on the received menu information. a menu management unit that calculates a menu similarity of ; Dividing a delivery area corresponding to each of the kitchen terminals into a plurality of detailed delivery areas, determining a plurality of delivery groups corresponding to each of the detailed delivery areas, and determining among the kitchen terminals in each of the detailed delivery areas a delivery group matching unit which counts the quantity of a plurality of orders generated for any one of the detailed delivery areas and determines a delivery group corresponding to a detailed delivery area in which the quantity is generated the most among the detailed delivery areas to correspond to any one of the detailed delivery areas; and based on expected completion times and delivery destinations corresponding to each of the plurality of orders generated for the kitchen terminals, determining whether or not to bundle two or more orders among the plurality of orders generated for the kitchen terminals. It may include a bundle delivery generation unit that does.

Description

Apparatus, system, method and program for providing shared kitchen service {APPARATUS, SYSTEM, METHOD AND PROGRAM FOR PROVIDING SHARED KITCHEN SERVICE}

The present invention relates to a shared kitchen service providing apparatus, system, method and program.

Entrepreneurship for self-employment continues to occur. In particular, as the demand for food delivery explodes, the demand for catering businesses specializing in delivery is steadily increasing.

In addition, as large-scale delivery relay platforms that take the majority of the food delivery market are emerging, it is becoming easier to start a restaurant business specializing in delivery through contracts with delivery relay platforms.

However, even if the demand for delivery food gradually increases and accessibility to delivery restaurant start-ups improves, there is still a problem that relatively high initial costs are incurred in starting a restaurant, and a lot of financial loss is incurred in case of failure.

The present invention is a shared kitchen service providing device that calculates a similarity between menus of users who have moved into adjacent shared kitchens, and determines whether a new user can move in and whether an existing user can change a menu based on the calculated similarity. , to provide systems, methods and programs.

In addition, the present invention is a shared kitchen service providing apparatus, system, and method for determining a main delivery area where orders are mainly generated by analyzing order records of users of shared kitchens, and matching users with delivery groups assigned to the main delivery area. and to provide programs for other purposes.

In addition, the present invention shares a method of determining whether to process delivery of a plurality of orders as a bundled delivery based on a plurality of expected completion times corresponding to a plurality of orders and a plurality of delivery destinations corresponding to the plurality of orders. Another object is to provide a kitchen service providing apparatus, system, method and program.

One aspect of the present invention for achieving the above object is provided with a device for providing a shared kitchen service.

The apparatus receives a plurality of menu information including information about food sold by users of each of the kitchen terminals from each of the plurality of kitchen terminals, and communicates between the kitchen terminals based on the received menu information. a menu management unit that calculates a menu similarity of ; Dividing a delivery area corresponding to each of the kitchen terminals into a plurality of detailed delivery areas, determining a plurality of delivery groups corresponding to each of the detailed delivery areas, and determining among the kitchen terminals in each of the detailed delivery areas a delivery group matching unit which counts the quantity of a plurality of orders generated for any one of the detailed delivery areas and determines a delivery group corresponding to a detailed delivery area in which the quantity is generated the most among the detailed delivery areas to correspond to any one of the detailed delivery areas; and based on expected completion times and delivery destinations corresponding to each of the plurality of orders generated for the kitchen terminals, determining whether or not to bundle two or more orders among the plurality of orders generated for the kitchen terminals. It may include a bundle delivery generation unit that does.

In addition, the delivery group matching unit counts the quantity of a plurality of orders generated for any one of the detailed delivery areas in each of the detailed delivery areas for each preset time interval, and for each preset time interval among the detailed delivery areas. A delivery group matched with a detailed delivery area in which the quantity is generated the most may be determined to correspond to one of the above.

In addition, the bundled delivery generation unit generates a plurality of expected completion times corresponding to each of a plurality of orders generated for the kitchen terminals, and determines the expected completion time among the plurality of orders generated for the kitchen terminals. The two or more orders having a time difference of less than a preset reference time are determined as bundled delivery candidates, and a plurality of bundled routes that pass through all of the two or more delivery destinations corresponding to the two or more orders determined as bundled delivery candidates are generated, , Based on each of the bundled routes, a first expected arrival time for each delivery destination corresponding to the two or more delivery destinations is generated, two or more individual routes having each of the two or more delivery destinations as a destination are generated, and the two or more delivery destinations are generated. Based on each of the individual routes, a second expected arrival time for each delivery location corresponding to the two or more delivery locations is generated, and based on a time difference between the second expected arrival time for each delivery location and the first expected arrival time for each delivery location A delay time for each delivery destination is calculated, and when each delay time for each delivery destination is equal to or less than a preset reference delay time, delivery of the two or more orders determined as bundled delivery candidates may be determined as bundled delivery.

In addition, the bundled delivery generation unit receives a plurality of order times corresponding to each of a plurality of orders generated for the kitchen terminals, and a plurality of expected cooking times corresponding to each of the order times from the kitchen terminals. are received, and based on the order times and the expected cooking times, a plurality of expected completion times corresponding to each of a plurality of orders generated for the kitchen terminals may be generated.

In addition, the bundled delivery generation unit calculates a center location based on the two or more delivery destinations, calculates a distance between each of the two or more delivery destinations and the center location, and calculates a distance between the two or more delivery destinations and the center location. When the plurality of distances are less than or equal to the reference distance, the two or more orders corresponding to the two or more delivery destinations may be determined as the bundled delivery candidates.

In addition, in one aspect of the present invention, a method of operating a shared kitchen service providing device is provided.

In addition, the operating method may include receiving a plurality of menu information including information on food sold by users of each of the kitchen terminals from each of the plurality of kitchen terminals, and performing the operation of the kitchen terminal based on the received menu information. an operation of calculating menu similarity between terminals; Dividing a delivery area corresponding to each of the kitchen terminals into a plurality of detailed delivery areas, determining a plurality of delivery groups corresponding to each of the detailed delivery areas, and determining among the kitchen terminals in each of the detailed delivery areas counting the quantity of a plurality of orders generated for any one, and determining a delivery group corresponding to a detailed delivery area in which the quantity is generated the most among the detailed delivery areas to correspond to any one of the detailed delivery areas; and based on expected completion times and delivery destinations corresponding to each of the plurality of orders generated for the kitchen terminals, determining whether or not to bundle two or more orders among the plurality of orders generated for the kitchen terminals. action may be included.

In addition, one aspect of the present invention provides a non-transitory recording medium on which a program for executing the operating method is recorded and which can be read by a computer.

In addition, one aspect of the present invention provides a computer program recorded on a non-transitory recording medium in order to execute the operation method.

In addition, in one aspect of the present invention, a system for providing a shared kitchen service is provided.

In addition, the system includes a device for providing a shared kitchen service to users who have moved into the shared kitchen; and a kitchen terminal providing the device with information on foods sold by the user, a delivery area of the user, and information on a plurality of orders generated for the user.

In addition, the apparatus receives a plurality of menu information including information about food sold by users of each of the kitchen terminals from each of the plurality of kitchen terminals, and based on the received menu information, the kitchen terminal a menu management unit that calculates a similarity between menus; Dividing a delivery area corresponding to each of the kitchen terminals into a plurality of detailed delivery areas, determining a plurality of delivery groups corresponding to each of the detailed delivery areas, and determining among the kitchen terminals in each of the detailed delivery areas a delivery group matching unit which counts the quantity of a plurality of orders generated for any one of the detailed delivery areas and determines a delivery group corresponding to a detailed delivery area in which the quantity is generated the most among the detailed delivery areas to correspond to any one of the detailed delivery areas; and based on expected completion times and delivery destinations corresponding to each of the plurality of orders generated for the kitchen terminals, determining whether or not to bundle two or more orders among the plurality of orders generated for the kitchen terminals. It may include a bundle delivery generation unit that does.

According to an embodiment of the present invention, it is possible to prevent a dispute between users from occurring by preventing users residing in adjacent shared kitchens from selling similar food to each other.

According to another embodiment of the present invention, when an order is generated, the quality of the delivery service may be improved by matching delivery workers who mainly deliver to the area where the order is generated with users who have moved into the shared kitchen.

According to another embodiment of the present invention, delivery costs borne by users of shared kitchens can be reduced by processing delivery of a plurality of orders as bundled delivery when a predetermined criterion is satisfied.

1 is a schematic diagram of a system for providing a shared kitchen service according to one embodiment.
Fig. 2 is a block diagram illustrating functional modules of the device according to Fig. 1 by way of example;
FIG. 3 is a diagram conceptually illustrating a process in which the menu management unit according to FIG. 2 calculates a degree of similarity between different kitchen terminals.
FIG. 4 is a flow chart illustrating a process in which the menu management unit according to FIG. 2 determines whether a kitchen terminal that wishes to move in can be moved in. Referring to FIG.
FIG. 5 is a flow chart illustrating a process in which the menu management unit according to FIG. 2 determines whether the menu can be modified for a kitchen terminal that desires to modify the menu.
FIG. 6 is a diagram conceptually illustrating a process in which the delivery group matching unit according to FIG. 2 collects information on orders generated by region by predetermined time.
FIG. 7 conceptually illustrates a process of matching a kitchen terminal and a delivery group by the delivery group matching unit according to FIG. 2 .
8 is a flowchart illustrating a process of generating a bundled delivery by the bundled delivery generation unit according to FIG. 2 .
9 is a flowchart illustrating a process of generating an expected completion time corresponding to an order by the bundled delivery generation unit according to FIG. 2 .
10 is a diagram conceptually illustrating a process of generating bundled delivery candidates by the bundled delivery generation unit according to FIG. 2 .
FIG. 11 is a flowchart illustrating a detailed process of generating bundled delivery candidates by the bundled delivery generation unit according to FIG. 2 .
12 is a diagram conceptually illustrating a process of generating bundled delivery candidates by the bundled delivery generation unit according to FIG. 2 .
13 is a diagram conceptually illustrating a process of generating bundled delivery by the bundled delivery generator according to FIG. 2 .
FIG. 14 is a diagram showing the hardware configuration of the device according to FIG. 1 by way of example.
15 is a diagram illustrating a wireless communication system that can be applied in a communication process according to an embodiment of the present invention.
16 is a diagram illustrating a base station in the wireless communication system according to FIG. 15;
17 is a diagram illustrating a terminal in the wireless communication system according to FIG. 15;
18 is a diagram illustrating a communication interface in the wireless communication system according to FIG. 15;

Since the present invention can make various changes and have various embodiments, specific embodiments will be illustrated in the drawings and described in detail in the detailed description. However, this is not intended to limit the present invention to specific embodiments, and should be understood to include all modifications, equivalents, and substitutes included in the spirit and scope of the present invention. Like reference numerals have been used for like elements throughout the description of each figure.

Terms such as first, second, A, and B may be used to describe various components, but the components should not be limited by the terms. These terms are only used for the purpose of distinguishing one component from another. For example, a first element may be termed a second element, and similarly, a second element may be termed a first element, without departing from the scope of the present invention. The terms and/or include any combination of a plurality of related recited items or any of a plurality of related recited items.

It is understood that when an element is referred to as being "connected" or "connected" to another element, it may be directly connected or connected to the other element, but other elements may exist in the middle. It should be. On the other hand, when an element is referred to as “directly connected” or “directly connected” to another element, it should be understood that no other element exists in the middle.

Terms used in this application are only used to describe specific embodiments, and are not intended to limit the present invention. Singular expressions include plural expressions unless the context clearly dictates otherwise. In this application, the terms "include" or "have" are intended to designate that there is a feature, number, step, operation, component, part, or combination thereof described in the specification, but one or more other features It should be understood that the presence or addition of numbers, steps, operations, components, parts, or combinations thereof is not precluded.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which the present invention belongs. Terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with the meaning in the context of the related art, and unless explicitly defined in the present application, they should not be interpreted in an ideal or excessively formal meaning. don't

The term 'shared kitchen' used in this specification is a space for rent, and means a space in which kitchen facilities are installed.

The term 'shared kitchen service' used in this specification means a service that rents a space in which kitchen facilities are installed. In one embodiment, the shared kitchen service may be provided in the form of installing kitchen facilities in all of a plurality of dense spaces and renting the space in which the kitchen facilities are installed to a plurality of tenants.

Hereinafter, preferred embodiments according to the present invention will be described in detail with reference to the accompanying drawings.

1 is a schematic diagram of a system for providing a shared kitchen service according to one embodiment.

Referring to FIG. 1 , a system for providing a shared kitchen service may include a device 100, a kitchen terminal 200, an order terminal 300, a delivery terminal 400, and an order server 500.

The kitchen terminal 200 is a terminal of a user who wants to use the shared kitchen service, and can register user information in the device 100 and use various functions of the shared kitchen service through the device 100 . At this time, the shared kitchen service may be provided in the form of a platform. Also, the kitchen terminal 200 is a terminal of a user who has rented at least one of a plurality of shared kitchens included in one building or a plurality of adjacent buildings.

The ordering terminal 300 is a terminal of an orderer who wants to use the food sales brokerage platform provided by the ordering server 500, registers orderer information with the ordering server 500, and wishes to purchase through the ordering server 500. It may be matched with a user of the kitchen terminal 200 that sells food.

The delivery terminal 400 is a terminal of a delivery man who wants to use the food sales brokerage platform provided by the order server 500, and registers delivery man information with the order server 500 and the device 100, and the order server 500 It can be matched with a user of the kitchen terminal 200 who wants to receive a delivery service that delivers food to the house of the ordering terminal 300 through .

Examples of the kitchen terminal 200, the ordering terminal 300, and the delivery terminal 400 include a communicable desktop computer, a laptop computer, a notebook, a smart phone, Tablet PC, mobile phone, smart watch, smart glass, e-book reader, PMP (portable multimedia player), portable game console, navigation device, digital Digital camera, digital multimedia broadcasting (DMB) player, digital audio recorder, digital audio player, digital video recorder, digital video player, It may be a PDA (Personal Digital Assistant) or the like.

The order server 500 is a server that stores various types of information required to service a food sales relay platform. In one embodiment, the order server 500 receives a food purchase request from the ordering terminal 300, transmits the request to the kitchen terminal 200, receives approval or rejection of the food purchase request from the kitchen terminal 200, and orders the food purchase request. It can be transmitted to the terminal 300. In addition, the order server 500 receives a delivery request from the kitchen terminal 200, transmits the request to the delivery terminal 400, and receives an approval for the delivery request from the delivery terminal 200, and receives the delivery request from the kitchen terminal 200 and the ordering terminal. (300).

The device 100 may be a server for providing a shared kitchen service to the kitchen terminal 200 . The apparatus 100 may provide various services to the kitchen terminal 200 by operating a shared kitchen platform for renting a space where kitchen facilities are installed.

Specifically, the apparatus 100 may calculate a similarity between menus of a plurality of users who have rented a plurality of shared kitchens adjacent to each other, limit the sale of foods similar to each other, and deliver delivery consisting of users who have rented the shared kitchens and deliverymen. Groups can be matched by time, and a bundled delivery can be created that bundles multiple orders and delivers them at once for efficient delivery.

Fig. 2 is a block diagram illustrating functional modules of the device according to Fig. 1 by way of example;

Referring to FIG. 2 , the device 100 communicates with the order terminal 200 using a wired/wireless network to register a user (lessee for a shared kitchen) and manage information about the registered user (hereinafter referred to as user information). can In addition, by communicating with the delivery terminal 400 through a wired/wireless network, a delivery man may be registered and information on the registered delivery man (hereinafter referred to as delivery man information) may be managed. In one embodiment, the device 100 may receive delivery person information registered in the order server 500 from the order server 500 .

In addition, the apparatus 100 receives user menu information from the ordering terminal 200, and based on the plurality of menu information corresponding to each of the plurality of ordering terminals 200, the similarity between the plurality of users. It includes a menu management unit 101 that calculates. In one embodiment, the menu information may include information on foods sold by the user.

In addition, the menu management unit 101 may determine whether the new kitchen terminal 200 can move into the shared kitchen based on the calculated similarity, and determine whether the menu can be modified.

In addition, the device 100 includes a delivery group matching unit 102 that divides a delivery area into a plurality of preset detailed delivery areas and matches each of the plurality of detailed delivery areas with a plurality of delivery groups. In one embodiment, the delivery area is an area previously set by the plurality of kitchen terminals 200, and when the orderer's address included in the orderer information is included in the delivery area, the orderer enters the plurality of kitchens through the ordering terminal 300. A food purchase request may be transmitted to the terminals 200 .

The delivery group matching unit 102 may count the number of orders generated for the ordering terminal 200 in each of a plurality of detailed delivery areas, and set a detailed delivery area in which the largest number of orders are generated as a main delivery area. In one embodiment, the main delivery area may be set for each preset time interval. The delivery group matching unit 102 may match the ordering terminal 200 and the delivery group based on the main delivery area.

In addition, the device 100 includes a bundled delivery generation unit 103 that generates a bundled delivery for a plurality of orders based on the location of the order, the expected food completion time of the order, and the delay time occurring at the time of bundled delivery. .

FIG. 3 is a diagram conceptually illustrating a process in which the menu management unit 101 according to FIG. 2 calculates a degree of similarity between different kitchen terminals.

Referring to FIG. 3 , the menu management unit 101 determines the degree of similarity between users corresponding to each of the kitchen terminals 200 based on menu information.

The menu information includes information on foods sold by the user, and the menu management unit 101 controls the foods included in the menu information of one user (hereinafter, the first user) and another user (hereinafter, the first user). 2) Match the foods included in the user's menu information. A similarity score between a pair of matched foods is preset and stored in the database of the device 100, and the menu management unit 101 determines which one of the first user's foods and the second user's foods. After matching any one of the foods, a similarity score corresponding to a pair of matched foods is searched.

The menu manager 101 matches all of the second user's foods with any one of the first user's foods, searches for a plurality of similarity points, and selects the highest similarity point among the plurality of similarity points. It can be determined by the similarity score for one food. In the illustrated embodiment, the first user's menu includes dumplings, jajangmyeon, sweet and sour pork, and sheep's skin, and the second user's menu includes aglio olio, cream pasta, salad pasta, and cream risotto. Search for similarity scores between dumplings included in the first user's menu and aglio olio, cream pasta, salad pasta, and cream rosotto included in the second user's menu, and find a similarity score that is equal to or greater than a preset score among the searched similarity scores may be determined as a similarity score for dumplings included in the first user's menu. If there are a plurality of similarity points that are equal to or greater than a preset score, a plurality of similarity points for dumplings included in the first user's menu may be determined.

The menu management unit 101 may calculate a degree of similarity between the first user and the second user based on the sum of similarity points for all foods included in the first user's menu.

FIG. 4 is a flowchart illustrating a process in which the menu management unit 101 according to FIG. 2 determines whether a kitchen terminal 200 that desires to move in can be moved in or not.

If the menu of the user who wants to move into the shared kitchen is similar to the menu of the user who has moved into the shared kitchen and is running business, a dispute arises between the user who has moved into the shared kitchen and the user who wants to move into the shared kitchen. It can be.

Accordingly, the menu management unit 101 calculates a similarity between a user who newly moves into the shared kitchen and a user who has previously moved into the shared kitchen, and among a plurality of users who have previously moved into the shared kitchen, the user who newly moves into the shared kitchen If there is a user whose similarity with the user is equal to or greater than a predetermined reference value, the entry of the new user is restricted.

First, the menu manager 101 receives a first menu including food sold by a user requesting occupancy from the kitchen terminal 200 requesting occupancy (S110).

Upon receiving the first menu, the menu management unit 101 calculates a similarity between the first menu and the plurality of second menus corresponding to the plurality of kitchen terminals 200 previously moved in (S120). The similarity calculation process replaces the above description with reference to FIG. 3 .

When a plurality of similarities between each of the plurality of second menus and the first menu are calculated, the menu management unit 101 compares the plurality of similarities with a preset reference value to first menu among the plurality of second menus. It is determined whether there is a second menu whose similarity with is greater than or equal to a preset reference value (S130).

If there is no second menu among the plurality of second menus whose degree of similarity to the first menu is equal to or greater than a preset reference value, the menu management unit 101 notifies the kitchen terminal 200 requesting occupancy that the occupancy is possible ( S140).

If there is a second menu among a plurality of second menus whose similarity to the first menu is equal to or greater than a predetermined reference value, the menu management unit 101 transmits a request for modification of the first menu to the kitchen terminal 200 requesting moving in. Do (S150).

When the modification request is transmitted, the menu management unit 101 determines whether the modified first menu has been received from the kitchen terminal 200 that has received the modification request (S160).

When the modified first menu is received, the menu management unit 101 re-performs steps S110, S120, and S130 described above based on the modified first menu.

If the modified first menu is not received, the menu management unit 101 notifies the kitchen terminal 200 that requested the move-in that the move-in is not possible (S170).

FIG. 5 is a flow chart illustrating a process in which the menu management unit 101 according to FIG. 2 determines whether the menu can be modified for the kitchen terminal 200 that desires to modify the menu.

Referring to FIG. 5 , when a user who has previously moved into the shared kitchen modifies a menu, and the modified menu is similar to menus of other users who have previously moved into the shared kitchen, the user who has previously moved into the shared kitchen Conflicts may arise between them.

Therefore, the menu management unit 101 calculates the similarity between the user who wants to modify the menu and other users, and the similarity with the user who wants to modify the menu among a plurality of users who have previously moved into the shared kitchen is equal to or greater than a preset reference value. If the user exists, the menu modification is restricted.

First, the menu management unit 101 receives a modified second menu including modified foods from the kitchen terminal 200 that has requested modification of the menu (S210).

Upon receiving the modified second menu, the menu management unit 101 calculates a similarity between the modified second menu and the plurality of second menus corresponding to the plurality of kitchen terminals 200 whose menus have not been modified. (S220). The similarity calculation process replaces the above description with reference to FIG. 3 .

When a plurality of similarities between each of the plurality of second menus and the modified second menu are calculated, the menu management unit 101 compares the plurality of similarities with a preset reference value to modify one of the plurality of second menus. It is determined whether there is a second menu whose similarity with the second menu is equal to or greater than a predetermined reference value (S230).

If there is no second menu among the plurality of second menus whose similarity to the modified 21 menu is equal to or greater than a predetermined reference value, the menu management unit 101 informs the kitchen terminal 200 that has requested the menu modification that the menu can be modified. Notifies (S240). Also, the menu management unit 101 replaces the second menu of the kitchen terminal 200 that has requested menu modification with the modified second menu and stores it in the database of the apparatus 100 .

If there is a second menu among the plurality of second menus whose degree of similarity to the modified second menu is equal to or greater than a preset reference value, the menu management unit 101 sends the kitchen terminal 200 that requested the menu modification to re-edit the second menu. Send the request (S250).

When the re-correction request is transmitted, the menu management unit 101 determines whether the re-corrected second menu has been received from the kitchen terminal 200 receiving the re-correction request (S260).

When the re-corrected second menu is received, the menu management unit 101 performs steps S210, S220, and S230 described above again based on the re-corrected second menu.

If the re-modified second menu is not received, the menu management unit 101 notifies the kitchen terminal 200 that requested the menu modification that the menu modification is not possible (S270).

FIG. 6 is a diagram conceptually illustrating a process in which the delivery group matching unit 102 according to FIG. 2 collects information on orders generated by region by predetermined time.

Referring to FIG. 6 , the delivery group matching unit 102 divides the delivery area into a plurality of preset detailed delivery areas, and determines the number of orders generated for the kitchen terminal 200 in each of the plurality of detailed delivery areas. Counting, and the detailed delivery area with the most orders can be set as the main delivery area.

In one embodiment, the delivery group matching unit 102 receives delivery areas corresponding to the plurality of kitchen terminals 200 from the order server 500 . Delivery areas corresponding to the plurality of kitchen terminals 200 may be stored in the database of the order server 500 .

In one embodiment, a plurality of kitchen terminals 200 and corresponding delivery areas may be stored in the database of the apparatus 100 .

The delivery group matching unit 102 may classify delivery areas corresponding to the plurality of kitchen terminals 200 into a plurality of detailed areas. In the illustrated embodiment, the delivery group matching unit 102 classifies the delivery area into four detailed areas. However, it is not limited thereto, and the delivery group matching unit 102 may classify the delivery area into various numbers of detailed areas.

When a food sales contract is made between the ordering terminal 300 and the kitchen terminal 200 by the ordering server 500, the ordering server 500 includes the ordering terminal 300 and the kitchen terminal 200 that have entered into the food sales contract. Sales information for is stored. The sales information includes the orderer's address of the ordering terminal 300, the time when the food sales contract was concluded, and user information of the kitchen terminal 200.

The delivery group matching unit 102 receives sales information about a specific kitchen terminal 200 from the order server 500, and based on the received sales information, the specific order terminal 200 in each of a plurality of detailed delivery areas. ) can be counted. In one embodiment, the delivery group matching unit 102 may receive sales information from a plurality of kitchen terminals 200 .

The delivery group matching unit 102, based on the orderer's address of the ordering terminal 300 that has concluded a sales contract with the specific ordering terminal 200 and the time at which the food sales contract was concluded, in each of a plurality of detailed delivery areas. The number of orders generated for a specific ordering terminal 200 may be counted for each preset time interval.

In the illustrated embodiment, the delivery group matching unit 102 counts the number of orders initiated for a specific ordering terminal 200 in each of the four detailed delivery areas from 11:00 to 2:00. In one embodiment, the preset time interval may be set in various ways.

The delivery group matching unit 102 may determine a detailed area having the largest number of occurrences among a plurality of detailed areas as a main order area. In one embodiment, the main order area may be determined differently for each preset time interval.

FIG. 7 is a diagram conceptually illustrating a process of matching a kitchen terminal 200 and a delivery group by the delivery group matching unit 102 according to FIG. 2 .

Delivery person information corresponding to each of the plurality of delivery terminals 400 is stored in the database of the device 100 . In addition, the database of the device 100 matches and stores a plurality of delivery people, a delivery group, and a main delivery area in charge of the delivery group. In one embodiment, the device 100 may receive delivery person information corresponding to each of the plurality of delivery terminals 400 from the order server 500 .

The delivery group matching unit 102 may search the database for a delivery group that matches the main delivery area of the ordering terminal 200 and match the searched delivery group with the ordering terminal 200 . Matching of the delivery group and the ordering terminal 200 may be performed for each preset time interval.

When the order terminal 200 and the delivery group are matched, the delivery group matching unit 102 assigns the delivery group matched with the kitchen terminal 200 to the order server 500 and a plurality of delivery people included in the delivery group to the order server 500. ) is sent to When a food sales contract is concluded for the kitchen terminal 200, the order server 500 may transmit a request for providing a delivery service to delivery terminals 400 of delivery workers included in a delivery group matched with the kitchen terminal 200. there is.

Through this, it is possible to match the user of the kitchen terminal 200 with the deliverymen who are exclusively in charge of a specific detailed delivery area. When a delivery person provides a delivery service exclusively for a specific detailed delivery area, the quality of the delivery service for a specific detailed delivery area can be improved. As a result, the user of the kitchen terminal 200 and the orderer of the ordering terminal 300 who purchases food from the user of the kitchen terminal 200 can receive a better delivery service.

8 is a flowchart illustrating a process of generating bundled delivery by the bundled delivery generation unit 103 according to FIG. 2 .

First, the bundled delivery generation unit 103 generates a plurality of expected completion times corresponding to each of a plurality of orders from an order server that has received a plurality of orders (S310).

FIG. 9 is a flowchart illustrating a process in which the bundled delivery generation unit 103 according to FIG. 2 generates an expected completion time corresponding to an order.

The bundled delivery generator 103 receives sales information of a food sales contract concluded between the user of the kitchen terminal 200 and the orderer of the order terminal 300 through the order server 500 . The sales information includes an order time, which is a time when a food sales contract is concluded. The bundled delivery generator 103 may receive a plurality of pieces of sales information about a plurality of different kitchen terminals 200 .

The bundled delivery generator 103 receives a plurality of order times corresponding to each of the plurality of orders from the order server 500 having received a plurality of orders for which a food sales contract has been concluded (S311). In one embodiment, the bundled delivery generation unit 103 may receive a plurality of order times corresponding to each of a plurality of orders from a plurality of kitchen terminals 200 .

Also, the bundled delivery generation unit 103 receives a plurality of expected cooking times corresponding to each of a plurality of order times from a plurality of kitchen terminals 200 (S312). That is, the packaged delivery generating unit 103 receives the estimated cooking time, which is the estimated time required for food to be completed, from the kitchen terminal 200 with which the food sales contract has been concluded.

In addition, the bundled delivery generation unit 103 generates a plurality of expected completion times corresponding to each of a plurality of orders based on a plurality of order times and a plurality of expected cooking times (S313). The bundled delivery generation unit 103 adds the expected cooking time corresponding to the order time to the order time to generate the expected completion time.

Referring back to FIG. 8 , the bundled delivery generating unit 103 determines two or more orders having a time difference between expected completion times of a predetermined reference time or less among a plurality of orders as bundled delivery candidates (S320).

In one embodiment, the bundled delivery generation unit 103 may determine bundled delivery candidates based on expected completion times of orders included in the detailed delivery area where the orderer's address of the ordering terminal 300 is the same.

In one embodiment, the bundled delivery generation unit 103 may determine bundled delivery candidates based on expected completion times of orders in which the orderer's address of the ordering terminal 300 is included in the main delivery area.

10 is a diagram conceptually illustrating a process of generating bundled delivery candidates by the bundled delivery generation unit 103 according to FIG. 2 .

In the illustrated embodiment, the expected completion times of the three orders generated in the first zone are 18:30, 18:32, and 18:27, respectively. When the preset reference time is 5 minutes, since the time difference between the expected completion times of the three orders is at most 5 minutes, the three orders are determined as bundled delivery candidates. In one embodiment, a time other than 5 minutes may be determined as a preset reference time.

FIG. 11 is a flowchart illustrating a detailed process of generating bundled delivery candidates by the bundled delivery generating unit 103 according to FIG. 2 .

Referring to FIG. 11 , the bundled delivery generation unit 103 calculates the center position based on two or more orders having a time difference between expected completion time and less than a predetermined reference time among a plurality of orders (S321).

The bundled delivery generation unit 103 may calculate the center location based on two or more orders and two or more delivery destinations corresponding thereto. In one embodiment, the bundled delivery generator 103 may arrange two or more delivery destinations on a plane composed of two mutually perpendicular coordinate axes, and determine a location corresponding to the average of the coordinates of the two or more delivery destinations as the center position.

In addition, the bundled delivery generating unit 103 calculates the distance between each of the two or more delivery destinations corresponding to the two or more orders and the central location (S322).

In addition, the bundled delivery generation unit 103 determines whether the distance between each of the two or more delivery destinations and the central location is equal to or less than a reference distance (S323). Orders are determined as bundled delivery candidates (S324).

12 is a diagram conceptually illustrating a process of generating bundled delivery candidates by the bundled delivery generation unit 103 according to FIG. 2 .

Referring to FIG. 12, three orders for which the difference in expected completion time is less than or equal to a preset reference time and three delivery addresses are shown, and the bundled delivery generating unit 103 is located at a position corresponding to the average of the coordinates of the three delivery addresses. is determined as the center position. When the center location is determined, the bundled delivery generating unit 103 calculates the distance between each of the three delivery destinations and the center location. Since all three calculated distances are equal to or less than the reference distance R, the bundled delivery generation unit 103 determines three orders as bundled delivery candidates. In one embodiment, the reference distance (R) may be calculated based on the traffic volume of the delivery area in the time zone when the order is generated.

Referring back to FIG. 8 , the bundled delivery generation unit 103 generates a plurality of bundled routes that pass through all of the two or more delivery destinations corresponding to each of the two or more orders included in the bundled delivery candidate (S340).

In addition, the bundled delivery generating unit 103 generates a first expected arrival time for each delivery location corresponding to each of two or more delivery locations based on each of a plurality of bundled routes (S350).

In addition, the bundled delivery generating unit 103 generates a plurality of individual routes to each of the two or more delivery addresses as a destination (S350), and based on each of the plurality of individual routes, the delivery address corresponding to each of the two or more delivery addresses. A second expected arrival time for each is generated (S360)

13 is a bundled delivery generation unit 103 according to FIG. 2. It is a diagram conceptually showing the process of creating bundled delivery.

Referring to FIG. 13, when passing through all three shipping destinations included in the bundled delivery candidates, there are three shipping destinations that can be selected as the first destination and two shipping destinations that can be selected as the second destination. 6 are created. The shipping address means the address of the orderer of the ordering terminal 300 that created the order.

When a plurality of bundled routes are generated, the bundled delivery generating unit 103 generates a first expected arrival time corresponding to each of a plurality of delivery destinations included in the bundled route. For example, bundle route 1 is a route that sequentially passes through delivery address 1, delivery address 2, and delivery address 3. In bundled route 1, the first expected arrival time for delivery destination 1 is 18:47, the first expected arrival time for delivery destination 2 is 18:57, and the first expected arrival time for delivery destination 3 is 19:07.

In one embodiment, the bundled delivery generation unit 103 receives a first expected arrival time corresponding to each of a plurality of delivery destinations included in the bundled route from a navigation server (not shown) that provides an estimated required time for a designated route. can do. The bundled delivery generator 103 transmits a plurality of delivery locations included in the bundled route and an order of passing through the plurality of delivery locations to the navigation server, and the navigation server bundles the first expected arrival time corresponding to each of the plurality of delivery locations. It is transmitted to the generator 103.

In addition, the bundled delivery generating unit 103 generates a plurality of individual routes having destinations 1, 2, and 3 as destinations, and based on each of the plurality of individual routes, each of the delivery addresses 1, 2, and 3 A second expected arrival time corresponding to is generated.

The second expected arrival time for delivery location 1 is 18:47, the second expected arrival time for delivery location 2 is 18:55, and the second expected arrival time for delivery location 3 is 19:07.

In one embodiment, the bundled delivery generation unit 103 may receive a second expected arrival time corresponding to a delivery address included in an individual route from a navigation server that provides an estimated required time for a designated route. The bundled delivery generating unit 103 transmits the delivery address included in the individual route to the navigation server, and the navigation server transmits the second expected arrival time corresponding to the delivery address to the bundled delivery generating unit 103 .

Referring back to FIG. 8 , the bundled delivery generation unit 103 calculates the delay time for each delivery location based on the time difference between the second expected arrival time for each delivery location and the first expected arrival time for each delivery location (S370).

The delay time for each delivery destination may be calculated for each of a plurality of bundled routes.

Referring to FIG. 13, the first estimated arrival times for delivery destinations 1, 2, and 3 included in bundled route 1 are 18:47, 18:57, and 19:07, respectively, and delivery address 1 included in individual route 1 , The second expected arrival times for the delivery address 2 included in the individual route 2 and the delivery address 3 included in the individual route 3 are 18:47, 18:55, and 19:04, respectively. The bundled delivery generation unit 103 may calculate a delay time, which is a difference between the second expected arrival time and the first expected arrival time for the delivery address 1, the delivery address 2, and the delivery address 3. The delay times for delivery point 1, delivery point 2 and delivery point 3 are 00:00, 00:02 and 00:03.

Referring back to FIG. 8 , the bundled delivery generation unit 103 determines two or more orders included in the bundled delivery candidates as bundled delivery when the total delay time for each delivery destination is less than a preset reference time (S380).

Referring to FIG. 13, in the bundled route 1, the delay times for each delivery location for delivery address 1, delivery address 2, and delivery address 3 are 00:00, 00:02, and 00:03. When the preset reference time is 5 minutes, since the delay times for each delivery destination for the bundled route 1 are all 5 minutes or less, the bundled delivery generator 103 collects orders for the delivery destinations included in the bundled route 1, the delivery address 2, and the delivery address 3. The delivery for is determined as a bundled delivery.

If the delivery of two or more orders is determined to be bundled delivery, the bundled delivery creation unit 103 transmits the bundled route 1 to the order server 500 and requests that the two or more orders included in the bundled route 1 be collectively delivered. Upon request, the order server 500 assigns two or more orders to one delivery person, and transmits the bundled route 1 to the delivery terminal 400 of the assigned delivery person.

When requesting bundled delivery, the bundled delivery creation unit 103 transmits information on at least one delivery group including delivery destinations included in the bundled delivery to the order server 500, and the order server 500 transmits at least one A bundle delivery execution request is transmitted to the delivery terminal 400 of a delivery person included in any one of the delivery groups.

14 is a diagram showing the hardware configuration of the providing device according to FIG. 1 by way of example.

Referring to FIG. 14 , the apparatus 100 includes at least one processor 110 and a memory storing instructions instructing the at least one processor 110 to perform at least one operation. (memory).

The at least one operation may include the components 101 to 103 of the above-described device 100 or other functions or operation methods.

Here, the at least one processor 110 may mean a central processing unit (CPU), a graphics processing unit (GPU), or a dedicated processor for performing methods according to embodiments of the present invention. can Each of the memory 120 and the storage device 160 may include at least one of a volatile storage medium and a non-volatile storage medium.

For example, the memory 120 may be one of a read only memory (ROM) and a random access memory (RAM), and the storage device 160 may be a flash-memory. , a hard disk drive (HDD), a solid state drive (SSD), or various memory cards (eg, a micro SD card).

In addition, the device 100 may include a transceiver 130 that performs communication through a wireless network. In addition, the device 100 may further include an input interface device 140 , an output interface device 150 , a storage device 160 , and the like. Each component included in the device 100 may be connected by a bus 170 to communicate with each other.

For example, the device 100 may include a communicable desktop computer, a laptop computer, a notebook, a smart phone, a tablet PC, and a mobile phone. , smart watch, smart glass, e-book reader, PMP (portable multimedia player), portable game device, navigation device, digital camera, DMB (digital multimedia broadcasting) player , a digital audio recorder, a digital audio player, a digital video recorder, a digital video player, a personal digital assistant (PDA), and the like.

15 is a diagram illustrating a wireless communication system that can be applied in a communication process according to an embodiment of the present invention. 16 is a diagram illustrating a base station in the wireless communication system according to FIG. 15; 17 is a diagram illustrating a terminal in the wireless communication system according to FIG. 15; 18 is a diagram illustrating a communication interface in the wireless communication system according to FIG. 15;

Hereinafter, an example of a wireless communication network system supporting communication between the device 100 and the terminals 200, 210 and 220 and the base station will be specifically described as an example, and the device 100 and the terminals 200 and 210 , 220) may be interchangeably referred to as a node or a terminal for convenience of description. In the following description, a first node (device) may be an anchor/donor node or a centralized unit (CU) of an anchor/donor node, and a second node (device) may be an anchor/donor node or a distributed unit (DU) of a relay node can be

A base station (BS), terminal, server, etc. may be included as a part of a node using a radio channel in a wireless communication system.

A base station is a network infrastructure that provides wireless access to terminals. A base station has a coverage defined as a predetermined geographic area according to a distance over which a signal can be transmitted.

A base station, like a "base station," is referred to as "access point (AP)", "enodeb (eNB)", "5th generation (5G) node", "wireless point", " It may be referred to as a transmission/reception point (TRP).

A base station and a terminal may transmit and receive wireless signals in a millimeter wave (mmWave) band (eg, 28 GHz, 30 GHz, 38 GHz, and 60 GHz). At this time, the base station and the terminal may perform beamforming to improve channel gain. Beamforming may include transmit beamforming and receive beamforming. That is, the base station and the terminal can give directivity to the transmitted signal and the received signal. To this end, the base station and the terminal may select a serving beam through a beam search procedure or a beam management procedure. After that, communication may be performed using a resource carrying a serving beam and a resource having a quasi co-located relationship.

A first antenna port and a second antenna port are considered quasi-colocated if the large-scale properties of the channel through which the symbol of the first antenna port carries can be inferred from the channel through which the symbol of the second antenna port carries. The large-scale properties may include one or more of delay spread, Doppler spread, Doppler shift, average gain, average delay, and spatial Rx parameters.

Hereinafter, a base station in the wireless communication system described above is exemplified. The terms "-module", "-unit" or "-er" used below may mean a unit that processes at least one function or operation, and may include hardware, software, or both hardware and software. It can be implemented as a combination of

The base station may include a wireless communication interface, a backhaul communication interface, a storage unit and a controller.

The wireless communication interface performs a function of transmitting and receiving signals through a wireless channel. For example, the wireless communication interface may perform a conversion function between a baseband signal and a bit stream according to a physical layer standard of the system. For example, in data transmission, a radio communication interface encodes and modulates a transmitted bit stream to generate composite symbols. Also, upon receiving data, the wireless communication interface demodulates and decodes the baseband signal to reconstruct the received bit stream.

The wireless communication interface performs a function of transmitting and receiving signals through a wireless channel. For example, the wireless communication interface may perform a conversion function between a baseband signal and a bit stream according to a system physical layer standard. For example, in data transmission, a radio communication interface encodes and modulates a transmitted bit stream to generate composite symbols. Also, upon receiving data, the wireless communication interface demodulates and decodes the baseband signal to reconstruct the received bit stream.

In addition, the wireless communication interface up-converts a baseband signal into a radio frequency (RF) band signal, transmits the converted signal through an antenna, and down-converts the RF band signal received through the antenna into a baseband signal. To this end, the wireless communication interface includes a transmission filter, a reception filter, an amplifier, a mixer, an oscillator, a digital-to-analog converter (DAC), An analog-to-digital converter (ADC) and the like may be included. Also, the wireless communication interface may include a plurality of transmit/receive paths. Additionally, the wireless communication interface may include at least one antenna array comprising a plurality of antenna elements.

In terms of hardware, the wireless communication interface may include a digital unit and an analog unit, and the analog unit may include a plurality of sub-units according to operating power, operating frequency, and the like. A digital unit may be implemented with at least one processor (eg, a digital signal processor (DSP)).

The wireless communication interface transmits and receives signals as described above. Accordingly, a wireless communication interface may be referred to as a “transmitter”, “receiver” or “transceiver”. In addition, in the following description, transmission and reception performed through a wireless channel may be used as a meaning including processing performed in a wireless communication interface as described above.

The backhaul communication interface provides an interface for communicating with other nodes in the network. That is, the backhaul communication interface converts the bit stream transmitted to other nodes, for example, other access nodes, other base stations, upper nodes or core networks from base stations into physical signals, and the physical signals received from other nodes into bits. convert to stream

The storage unit stores data such as basic programs, applications, and setting information for operation of the base station. The storage unit may include volatile memory, non-volatile memory, or a combination of volatile and non-volatile memory.

The controller controls the overall operation of the base station. For example, the controller transmits and receives signals through a wireless communication interface or a backhaul communication interface. Also, the controller writes data to the storage unit and reads the recorded data. The controller can perform protocol stack functions required by communication standards. According to another implementation, a protocol stack may be included in a wireless communication interface. To this end, the controller may include at least one processor.

According to an embodiment, the controller may control the base station to perform an operation according to an embodiment of the present invention.

According to various embodiments, a donor node of a wireless communication system includes at least one processor, includes a transceiver operably coupled to the at least one processor, and includes a plurality of radio bearers for a terminal accessing the relay node. configured to transmit to a relay node a first message including first information related to the donor node about; receive a second message including second information related to the relay node regarding a plurality of radio bearers for the terminal from the relay node; Data for the terminal may be transmitted to the relay node. Data may be transmitted to the terminal through a plurality of radio bearers based on the first information and the second information.

According to various embodiments, a radio bearer among a plurality of radio bearers may integrate a plurality of radio bearers. the at least one processor is also configured to determine a radio bearer for a terminal accessing the relay node and multiple radio bearers aggregated by the radio bearer; Alternatively, a radio bearer for a UE accessing a relay node may be determined.

According to various embodiments, the first message may include one or more of: identification of a terminal accessing the relay node; display information indicating the type of terminal accessing the relay node; information about a radio bearer of a terminal accessing a relay node; information about a radio bearer transmitted by a terminal accessing a relay node; information about a tunnel established for a radio bearer between the donor node and the relay node; information about integrated multiple radio bearers; radio bearer mapping information; information about the address of the side of the donor node; information about the address of the relay node side; indication information corresponding to a radio bearer of a terminal accessing the relay node; indication information indicating the relay node to allocate a new address to a radio bearer for a terminal accessing the relay node; a list of address information that cannot be used by a relay node that transmits radio bearer data of a terminal accessing the relay node; and information related to security configuration.

According to various embodiments, the second message may include one or more of: identification of a terminal accessing the relay node; information about the radio bearer granted by the relay node; information about radio bearers not acknowledged by the relay node; information about radio bearers partially granted by the relay node; radio bearer mapping information; Configuration information of a terminal accessing the relay node created by the relay node; information about the address of the relay node side; and information related to security configuration.

According to various embodiments, the second message may further include information on integrated multiple radio bearers.

According to various embodiments, the donor node may include a central unit of the donor node, and the relay node may include a distribution unit of the donor node.

According to various embodiments, a relay node of a wireless communication system includes at least one processor, includes a transceiver operably coupled to the at least one processor, and provides a plurality of information from a donor node to a terminal accessing the relay node. configured to receive a first message including first information related to a donor node for a radio bearer of; transmit to the donor node a second message including second information related to the relay node for the plurality of radio bearers for the terminal; Data on the terminal may be received from the donor node. Data may be transmitted to the terminal through a plurality of radio bearers based on the first information and the second information.

According to various embodiments, a radio bearer among a plurality of radio bearers may integrate a plurality of radio bearers. the at least one processor is also configured to determine a radio bearer for a terminal accessing the relay node and multiple radio bearers aggregated by the radio bearer; Alternatively, multiple radio bearers integrated by radio bearer may be determined.

According to various embodiments, the first message may include one or more of: identification of a terminal accessing the relay node; display information indicating the type of terminal accessing the relay node; information about a radio bearer of a terminal accessing a relay node; information about a radio bearer transmitted by a terminal accessing a relay node; information about a tunnel established for a radio bearer between the donor node and the relay node; information about integrated multiple radio bearers; radio bearer mapping information; information about the address of the side of the donor node; information about the address of the relay node side; indication information corresponding to a radio bearer of a terminal accessing the relay node; indication information indicating the relay node to allocate a new address to a radio bearer for a terminal accessing the relay node; a list of address information that cannot be used by a relay node that transmits radio bearer data of a terminal accessing the relay node; and information related to security configuration.

According to various embodiments, the second message may include one or more of: identification of a terminal accessing the relay node; information about the radio bearer granted by the relay node; information about radio bearers not acknowledged by the relay node; information about radio bearers partially granted by the relay node; radio bearer mapping information; Configuration information of a terminal accessing the relay node created by the relay node; information about the address of the relay node side; and information related to security configuration.

According to various embodiments, the second message may further include information on integrated multiple radio bearers.

According to various embodiments, the donor node may include a central unit of the donor node, and the relay node may include a distribution unit of the donor node.

Hereinafter, components of a terminal in the wireless communication system described above are illustrated. Components of a terminal to be described below are components of a general-purpose terminal supported by a wireless communication system, and may be merged or integrated with components of a terminal according to the foregoing contents, and may overlap or conflict with the above drawings. It can be interpreted that the content described with reference takes precedence. The terms "-module", "-unit" or "-er" used below may mean a unit that processes at least one function.

The terminal includes a communication interface, a storage unit and a controller.

The communication interface performs a function of transmitting and receiving signals through a wireless channel. For example, the communication interface performs a conversion function between a baseband signal and a bit stream according to the physical layer standard of the system. For example, in data transmission, a communication interface encodes and modulates a transmission bit stream to generate composite symbols. Also, when receiving data, the communication interface demodulates and decodes the baseband signal to reconstruct the received bit stream. Further, the communication interface up-converts the baseband signal to an RF-band signal, transmits the converted signal through an antenna, and down-converts the RF-band signal received through the antenna into a baseband signal. For example, the communication interface includes a transmission filter, a reception filter, an amplifier, a mixer, an oscillator, and a digital-to-analog converter (DAC). , an analog-to-digital converter (ADC), and the like.

Also, the communication interface may include a plurality of transmit/receive paths. Additionally, the communication interface may include at least one antenna array comprising a plurality of antenna elements. On the hardware side, the wireless communication interface may include a digital circuit and an analog circuit (eg, a radio frequency integrated circuit (RFIC)). A digital circuit may be implemented with at least one processor (eg, DSP). A communication interface may include multiple RF chains. The communication interface may perform beamforming.

The communication interface transmits and receives signals as described above. Accordingly, a communication interface may be referred to as a “transmitter”, “receiver” or “transceiver”. In addition, in the following description, transmission and reception performed through a radio channel may be used as a meaning including processing performed in a communication interface as described above.

The storage unit stores data such as basic programs for operation of the terminal, applications, and setting information. The storage unit may include volatile memory, non-volatile memory, or a combination of volatile and non-volatile memory. In addition, the storage unit provides stored data according to the request of the controller.

The controller controls the overall operation of the terminal. For example, the controller sends and receives signals through a communication interface. Also, the controller writes data to the storage unit and reads the recorded data. The controller can perform protocol stack functions required by communication standards. According to another implementation, a protocol stack may be included in the communication interface. To this end, the controller may include at least one processor or microprocessor or reproduce parts of a processor. Also, a part of the communication interface or controller may be referred to as a communication processor (CP).

According to an embodiment of the present invention, a controller may control a terminal to perform an operation according to an embodiment of the present invention.

Hereinafter, a communication interface in a wireless communication system is illustrated.

The communication interface includes encoding and modulation circuitry, digital beamforming circuitry, a plurality of transmission paths, and analog beamforming circuitry.

Encoding and modulation circuitry performs channel encoding. At least one of a low-density parity check (LDPC) code, a convolution code, and a polar code may be used for channel encoding. An encoding and modulation circuit generates modulation symbols by performing constellation mapping.

A digital beamforming circuit performs beamforming on a digital signal (eg, a modulation symbol). To this end, a digital beamforming circuit multiplexes modulation symbols by beamforming weights. Beamforming weights can be used to change the size and phrase of a signal, and can be referred to as a "precoding matrix" or "precoder". The digital beamforming circuit outputs digital beamformed modulation symbols to a plurality of transmission paths. In this case, according to a multiple input multiple output (MIMO) transmission method, modulation symbols may be multiplexed or the same modulation symbol may be provided to a plurality of transmission paths.

The plurality of transmission paths convert digital beamformed digital signals into analog signals. To this end, each of the plurality of transmission paths may include an inverse fast fourier transform (IFFT) computation unit, a cyclic prefix (CP) insertion unit, a DAC, and an up conversion unit. The CP insertion unit is for an orthogonal frequency division multiplexing (OFDM) method and may be omitted when another physical layer method (eg, a filter bank multi-carrier: FBMC) is applied. That is, the plurality of transmission paths provide independent signal processing processes for a plurality of streams generated through digital beamforming. However, depending on the implementation, some elements of the plurality of transmission paths may be commonly used.

An analog beamforming circuit performs beamforming on an analog signal. To this end, the digital beamforming circuit multiplexes analog signals by beamforming weighting values. The beamformed weights are used to change the amplitude and phrase of the signal. More specifically, the analog beamforming circuit may be configured in various ways according to a connection structure between a plurality of transmission paths and an antenna. For example, each of a plurality of transmission paths may be connected to one antenna array. In another example, multiple transmission paths may be coupled to one antenna array. In another example, multiple transmission paths may be adaptively coupled to one antenna array or may be coupled to two or more antenna arrays.

The methods according to the present invention may be implemented in the form of program instructions that can be executed by various computer means and recorded on a computer readable medium. Computer readable media may include program instructions, data files, data structures, etc. alone or in combination. Program instructions recorded on a computer readable medium may be specially designed and configured for the present invention or may be known and usable to those skilled in computer software.

Examples of computer readable media may include hardware devices specially configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions may include not only machine language codes generated by a compiler but also high-level language codes that can be executed by a computer using an interpreter and the like. The hardware device described above may be configured to operate with at least one software module to perform the operations of the present invention, and vice versa.

In addition, the above-described method or device may be implemented by combining all or some of its components or functions, or may be implemented separately.

Although the above has been described with reference to preferred embodiments of the present invention, those skilled in the art will variously modify and change the present invention within the scope not departing from the spirit and scope of the present invention described in the claims below. You will understand that it can be done.

Claims (9)

As a device for providing shared kitchen service,
A plurality of menu information including information on food sold by users of each of the kitchen terminals is received from each of the plurality of kitchen terminals, and menu similarity between the kitchen terminals is determined based on the received menu information. a menu management unit that calculates;
Dividing a delivery area corresponding to each of the kitchen terminals into a plurality of detailed delivery areas, determining a plurality of delivery groups corresponding to each of the detailed delivery areas, and determining among the kitchen terminals in each of the detailed delivery areas a delivery group matching unit which counts the quantity of a plurality of orders generated for any one of the detailed delivery areas and determines a delivery group corresponding to a detailed delivery area in which the quantity is generated the most among the detailed delivery areas to correspond to any one of the detailed delivery areas; and
Based on the expected completion time and delivery destination corresponding to each of the plurality of orders generated for the kitchen terminals, determining whether to bundle delivery for two or more orders among the plurality of orders generated for the kitchen terminals Including a bundle delivery generation unit,
Device. According to claim 1,
The delivery group matching unit,
For each predetermined time interval, counting the quantity of a plurality of orders generated for any one of the detailed delivery areas,
Determining, for each preset time interval, a delivery group matched with a detailed delivery area in which the quantity occurs the most among the detailed delivery areas to correspond to any one of the detailed delivery areas,
Device. According to claim 1,
Bundle delivery generation unit,
generating a plurality of expected completion times corresponding to each of a plurality of orders generated for the kitchen terminals;
Among the plurality of orders generated for the kitchen terminals, the two or more orders having a time difference between expected completion times of less than a predetermined reference time are determined as bundle delivery candidates;
generating a plurality of bundled routes via all of the two or more delivery destinations corresponding to the two or more orders determined as the bundled delivery candidates;
Based on each of the bundled routes, a first expected arrival time for each delivery address corresponding to the two or more delivery addresses is generated;
Creating two or more individual routes each of the two or more delivery destinations as a destination;
Based on each of the two or more individual routes, a second expected arrival time for each delivery address corresponding to the two or more delivery addresses is generated;
Calculating a delay time for each delivery location based on a time difference between the second expected arrival time for each delivery location and the first expected arrival time for each delivery location;
Determining delivery of the two or more orders determined as bundled delivery candidates as bundled delivery when each delay time for each delivery destination is less than or equal to a preset reference delay time,
Device. According to claim 3,
The bundle delivery generation unit,
Receiving a plurality of order times corresponding to each of a plurality of orders generated for the kitchen terminals;
Receiving a plurality of expected cooking times corresponding to each of the order times from the kitchen terminals;
generating a plurality of expected completion times corresponding to each of a plurality of orders generated for the kitchen terminals based on the order times and the expected cooking times;
Device. According to claim 4,
The bundle delivery generation unit,
Calculate a center position based on the two or more delivery destinations,
Calculate the distance between each of the two or more delivery destinations and the center position,
When a plurality of distances between the two or more delivery destinations and the central location are less than or equal to a reference distance, determining the two or more orders corresponding to the two or more delivery destinations as the bundle delivery candidates.
Device. A method of operating a shared kitchen service providing device,
A plurality of menu information including information on food sold by users of each of the kitchen terminals is received from each of the plurality of kitchen terminals, and menu similarity between the kitchen terminals is determined based on the received menu information. action to calculate;
Dividing a delivery area corresponding to each of the kitchen terminals into a plurality of detailed delivery areas, determining a plurality of delivery groups corresponding to each of the detailed delivery areas, and determining among the kitchen terminals in each of the detailed delivery areas counting the quantity of a plurality of orders generated for any one, and determining a delivery group corresponding to a detailed delivery area in which the quantity is generated the most among the detailed delivery areas to correspond to any one of the detailed delivery areas; and
Based on the expected completion time and delivery destination corresponding to each of the plurality of orders generated for the kitchen terminals, determining whether to bundle delivery for two or more orders among the plurality of orders generated for the kitchen terminals including action,
how it works. A non-transitory recording medium on which a program for executing the operating method according to claim 6 is recorded and can be read by a computer. A computer program recorded on a non-transitory recording medium to execute the operation method according to claim 6 in an apparatus for providing shared kitchen service. A system for providing shared kitchen service,
A device for providing shared kitchen service to users who reside in the shared kitchen; and
A kitchen terminal providing the device with information on foods sold by the user, a delivery area of the user, and information on a plurality of orders generated for the user,
The device,
A plurality of menu information including information on food sold by users of each of the kitchen terminals is received from each of the plurality of kitchen terminals, and menu similarity between the kitchen terminals is determined based on the received menu information. a menu management unit that calculates;
Dividing a delivery area corresponding to each of the kitchen terminals into a plurality of detailed delivery areas, determining a plurality of delivery groups corresponding to each of the detailed delivery areas, and determining among the kitchen terminals in each of the detailed delivery areas a delivery group matching unit which counts the quantity of a plurality of orders generated for any one of the detailed delivery areas and determines a delivery group corresponding to a detailed delivery area in which the quantity is generated the most among the detailed delivery areas to correspond to any one of the detailed delivery areas; and
Based on the expected completion time and delivery destination corresponding to each of the plurality of orders generated for the kitchen terminals, determining whether to bundle delivery for two or more orders among the plurality of orders generated for the kitchen terminals Including a bundle delivery generation unit,
system.

Images