JP2007133582A - Cooking procedure generation apparatus, cooking procedure generation method and cooking procedure generation program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a cooking procedure generation apparatus, a cooking procedure generation method and a cooking procedure generation program which allow scheduling with an order condition based on common senses in cooking taken into consideration to be performed. <P>SOLUTION: The cooking procedure generation apparatus for generating a cooking procedure based on an input recipe is provided with: a recipe database (105) for storing a recipe including at least one partial recipe with a start condition which is a unit recipe for one working unit of the cooking procedure, in which a first intermediate product necessary for starting the unit recipe, resources necessary for cooking, time required for the cooking, and a second intermediate product generated by the cooking are described; an order restriction registration part (103) for specifying a unit recipe to be started when the preceding unit recipe stored in the recipe database (105) ends in the unit recipe stored in the recipe database (105); and a schedule generation part (102) for scheduling the cooking based on the input recipe and the restriction of the cooking order. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a cooking procedure generation device, a cooking procedure generation method, and a cooking procedure generation program that support scheduling generation work of a cooking procedure.

  The recipe shows the cooking procedure, but there are many cases where the recipe is not written in such a way that even when the writings are executed in order from the top, the cooking is completed. Even in such a way of writing, an inexperienced cook does not know what procedure should be used when cooking a plurality of dishes in parallel.

  In order to solve this problem, in Patent Document 1, regarding the basic cooking procedure scheduling, for a work module in which cooking work is divided into indivisible work units for each dish, the work subject is a cooker and the work type is the same. Assign work modules ready for cooking in parallel. For this reason, a some work module can be performed in parallel with a cooking device. However, since the order for all work units cannot be changed, the degree of freedom in scheduling is low. Moreover, in patent document 1, since there is no concept regarding the intermediate product of cooking, the reuse cannot be performed and the resource used for every procedure cannot be changed.

In addition, Patent Document 2 is for efficiently creating a cooking work process chart for smoothly performing a large amount of cooking when cooking a large amount of menus determined like school lunches or employee cafeterias, The rearrangement (mapping) of each process is performed in consideration of the restrictions of the equipment used in the pretreatment process and the cooking process. However, in Patent Document 2, the cooking procedure is not changed as in Patent Document 1, and further, there is no concept regarding the intermediate product of cooking. Therefore, it is possible to reuse the resource or to use resources for each procedure. Cannot make changes. It is also impossible to create a schedule for a plurality of dishes that are executed in parallel.
JP 2003-141234 A JP 2005-250857 A

  As described above, in the prior art, it is assumed that the cooking procedure written in the recipe when cooking is performed in accordance with the order of work, so from the viewpoint of cooking time, etc., a suitable schedule Is not always possible. Furthermore, in addition to the cooking procedure entered in the recipe, there are cases where there is an order relationship from the common sense of cooking (this is not written in a general recipe description). For example, when creating spaghetti entwined with sauce, there is a cooking knowledge that “entanglement” must be performed immediately after the spaghetti is struck, but scheduling only considering the waiting for intermediate products Doing so may create a schedule for boiled spaghetti and then creating sauces, which may violate common sense ordering conditions for cooking. Experts have such knowledge as common sense, but inexperienced cooks do not have, so they tend to be the reason for failure.

  An object of this invention is to provide the cooking procedure production | generation apparatus, the cooking procedure production | generation method, and cooking procedure production | generation program which can perform the scheduling which considered the order conditions based on the common sense of cooking. At the same time, a cooking procedure generation device that automatically recognizes a distinction between a portion that must be performed immediately before a meal and a portion that does not need to be prepared (the latter is a so-called preparation) in a cooking procedure, and that enables a more flexible cooking plan, It is an object to provide a cooking procedure generation method and a cooking procedure generation program.

  The invention according to the aspect of the present invention is a unit recipe for one work unit of a cooking procedure in a cooking procedure generation apparatus that generates a cooking procedure based on an input recipe, and is necessary for starting the unit recipe A recipe including at least one partial recipe with a start condition in which a first intermediate product, a resource necessary for cooking, a time required for cooking, and a second intermediate product generated by cooking are described , A sequence constraint registration unit for specifying a unit recipe to be started when the unit recipe ends in the unit recipe stored in the recipe database, the input recipe, and the cooking order And a schedule generation unit that schedules cooking based on the restrictions. Note that the present invention is not limited to the invention of the apparatus, but also the invention of the method and the invention of the program realized by the apparatus.

  According to the present invention, a scheduler based on the idea of job shop scheduling can perform scheduling in consideration of order conditions based on common sense of cooking. Further, by automatically recognizing the prepared portion, a more flexible cooking plan can be made.

  Scheduling that does not violate common sense order conditions of dishes as well as waiting for intermediate products is possible. In addition, a more flexible cooking plan can be made by recognizing the prepared portion.

  Embodiments of the present invention will be described with reference to the drawings. In the present invention, in describing a recipe, a description of a semi-finished product (referred to as an “intermediate product” in the present specification and the following embodiments) generated in one cooking procedure is introduced, It supports the creation of scheduling for multiple dishes from descriptions of intermediate products. The semi-finished product corresponds to, for example, sanded clams, chopped parsley, etc., as will be described in detail later. Note that a finished product (final product) generated as a result of all cooking is also referred to as an intermediate product in this specification for convenience of explanation.

  FIG. 1 is a diagram showing a schematic configuration of a cooking procedure generation apparatus according to an embodiment of the present invention. The cooking procedure generation apparatus according to the present embodiment includes a menu input unit 101, a schedule generation unit 102, an order constraint registration unit 103, a schedule output unit 104, a resource database (DB) 105, a preparation preparation recognition unit 106, An intermediate product registration unit 107 and a recipe database (DB) 108 are provided. In FIG. 1, the cooking procedure generation apparatus is described as one apparatus. However, each component may be connected via a network to be configured as one system. -It is possible to build with a client model.

  In the above configuration, the menu input unit 101 specifies a dish to be cooked. The schedule generation unit 102 generates a cooking procedure corresponding to the menu. The order constraint registration unit 103 registers constraints on the execution order of partial recipes described later in detail. The schedule output unit 104 outputs the cooking procedure generated by the schedule generation unit 102. The resource DB 105 holds data describing resources required for cooking (for example, a cook or a cooking tool). FIG. 2 is a diagram illustrating a description example of resources stored in the resource DB 105. The resources described in FIG. 2 are: one cook, one cutting board, one knife, one sink, two bowls, pan There are 2 pieces, 1 pasta pot (ppan), 2 cooktops, 1 sieve. The preparation preparation recognition unit 106 analyzes the recipe and recognizes a portion corresponding to the preparation. The intermediate product registration unit 107 registers the intermediate product generated by the partial recipe.

The recipe DB 109 stores recipes described in a predetermined format. FIG. 4 is a diagram showing a description example of a conventional recipe. On the other hand, in this embodiment, for example, a recipe as shown in FIG. 3 is described. Note that the recipes described in FIGS. 3 and 4 are almost the same. However, as a specific description example in FIG. 3, for example, the description example of the partial recipe 301 is
lr (7, [xprawn, xclam],
[['Wine Steam Preparation', [cook, pan, heat], [2]],
['Wine Steamed', [pan, heat], [5]]], [wine-steamed], []).
It has become. In the above “partial recipe”, for example, xprawn and xclam must be prepared as start conditions for generating an intermediate product called wine-steamed. For this reason, the partial recipe in one embodiment of the present invention for generating an intermediate product (including a final product) is particularly referred to as a “partial recipe with a start condition”. In this case, in the wine-steamed partial recipe described in the recipe DB 109, the intermediate product required to generate wine-steamed is xprawn, xclam, the required resources are cook, pan, heat, and the work time is 2 minutes Furthermore, it is described that pan and heat are used for 5 minutes. A partial recipe is a recipe for one work unit of a cooking procedure (for example, individual work such as cutting, washing, and sacrificing vegetables), and may be referred to as a “unit recipe”. ). In the above description example, details of each description are as follows.
lr is an identifier indicating one unit recipe. Further, 7 following lr is an identification number of the unit recipe, and [xprawn, xclam] indicates a material (referred to as an “intermediate product” in this specification) necessary for starting the unit recipe, and [] In the case of, it indicates that the necessary intermediate product is not necessary. In this case, it indicates that the prawn (xprawn) with the shell and the back cotton and the sanding clam (xclam) are necessary.
The descriptions on the second and third lines indicate the cooking method, and describe that “preparing wine steaming” and “steaming wine” are performed, respectively. In this cooking method, resources necessary for cooking, time required for cooking, and a product (intermediate product) by cooking are described. In particular,
“Wine Steaming Preparation” shows that cooking, pan and heat are used and cooking takes 2 minutes. Next, “steaming wine” means that it takes 5 minutes to cook, using two resources, pan and heat. And it shows that an intermediate product called wine-steamed has been generated by 'steaming wine'.

  Next, the partial recipe 302 in FIG. 3 will be described. The basic description is the same as that of the partial recipe 301. The partial recipe 302 shows the recipe with the identification number 10, but the description [11] is added at the end of one lot number in the fourth line. This description of [11] is a recipe for identification number 10, that is, a recipe for sprinkling parsley with a taste by immediately blending the recipe for identification number 11, that is, the spaghetti sauce, immediately after the cooking of spaghetti is finished. , Shows the procedure of executing. As a result, it is possible to present a common-sense procedure in which the sauce is blended as soon as the spaghetti is boiled.

  FIG. 5 is a diagram showing the partial recipe described in the recipe DB 109 in a tree format. As shown in FIG. 5, assume that there are xprawn, xocto, xclam, xparsley, xchili, xgarlic, hotwater, wine-steamed, sauce, xspa, ebitakoasarispa as intermediate products (ebitakoasarispa is the final product). Here, xprawn, xocto, xclam, xparsley, xchili, xgarlic, hotwater can be generated without using other intermediate products. That is, the intermediate product data to be used becomes null data. However, in order to obtain the intermediate product wine-steamed, xprawn and xclam are used, and in order to obtain the intermediate product sauce, xocto, xchili, xgarlic, and wine-steamed are used. Thus, for example, in order to obtain the intermediate product sauce, it is necessary to prepare xocto, xchili, xgarlic, wine-steamed, so after the procedure for generating the intermediate products xocto, xchili, xgarlic, wine-steamed Need to generate the intermediate product sauce. As described above, in the recipe DB 109, it is necessary to define an intermediate product necessary for generating a certain intermediate product (that is, to define a condition). Therefore, the recipe for generating the intermediate product is the above-described recipe. Thus, it is referred to as “partial recipe with start condition”.

With reference to FIG. 6, the flow of operation | movement of the cooking procedure production | generation apparatus which concerns on one Embodiment of this invention comprised as mentioned above is demonstrated. FIG. 6 is a flowchart showing a flow of operations of the cooking procedure generation apparatus according to the present embodiment.
A dish to be cooked is input via the menu input unit 101 (step 601). In this case, the recipe may be input by the user, or a desired recipe may be input via the network if the apparatus is connected to the network. When the recipe is input, the resource described in the recipe is selected from the resource DB 105 (step 602). For example, for the description of the partial recipe 301, descriptions of the cook, the sink, and the frying pan are selected from the resource DB 105.

  When the resource described in the recipe is selected, a schedule is generated by the schedule generation unit 102 with reference to the recipe DB 109 (step 603). In this schedule generation process, the schedule generation unit 102 creates a schedule for generating intermediate products in accordance with the recipe procedure so that the resources selected in step 602 do not overlap. Furthermore, the schedule generation unit 102 generates a shortest recipe schedule by performing all combinations of resources and procedures so that waiting for intermediate products does not occur. Limits such as the number of times of combination, recipe schedule time, and recipe schedule generation time can also be provided. When the generation of the schedule ends, the schedule is output and the cooking procedure is presented to the user (step 605).

  The procedure of the recipe schedule generation process in step 603 will be described in detail with reference to FIG. FIG. 7 is a flowchart of the recipe schedule generation process in step 603. In this process, for the input menu, a corresponding partial recipe is taken out from the recipe DB, intermediate products (hereinafter referred to as “start condition products”) necessary to execute each partial recipe, and a procedure A specific schedule is generated while confirming the availability of resources necessary for executing.

  First, a partial recipe group corresponding to the selected menu is loaded into the work area (step 701). At this time, a variable that holds a set of intermediate products completed by a certain point is initialized with an empty set (step 702). Then, a Gantt chart, which is a standard expression method of a schedule showing a specific cooking procedure, is initialized to empty (step 703). The Gantt chart is a table that shows which resource is occupied by which work at which time, with the vertical axis indicating resources and the horizontal axis indicating time. The details are shown in FIG. These steps 701 to 703 are initialization steps.

  When the initialization is completed, one partial recipe that can be started is selected nondeterministically based on the intermediate product completed up to now (step 704). Here, the partial recipes that can be started are those in which the start condition deliverable is included in a set of (intermediate) deliverables that have been completed by a certain point in time. Initially, the set of completed (intermediate) deliverables is empty, so a partial recipe with an empty start condition deliverable is selected. Next, regarding the work included in the partial recipe selected in Step 704, the work is arranged on the leftmost side where it can be secured on the Gantt chart based on the resources required and the required time (Step 705). At this time, this partial recipe must not be arranged before the start condition deliverable of the partial recipe is created. Then, the output product of the partial recipe selected in step 704 is added to the set of completed (intermediate) products (step 706), and the partial recipe selected in step 704 is removed from the work area (step 707). ). Here, Step 706 and Step 707 are processes accompanying the completion of the partial recipe scheduling.

  Then, it is checked whether a partial recipe remains in the work area (step 708). If there are no partial recipes left, the desired menu should be complete, and the current Gantt chart should be a viable schedule. If there is any remaining partial recipe, the menu has not been completed yet, so the process returns to step 704 to schedule a partial recipe for which scheduling has not ended. When an executable schedule is created in step 708, the schedule is compared with the previous “best” schedule (step 709). The goodness of the schedule can be defined in various ways according to the purpose, and is typically a short total cooking time. However, as a good schedule, there may be a small number of other pans or a combination of several indicators. If the schedule completed in step 708 is better than the previous “best” schedule, this schedule is stored as a new best schedule (candidate schedule) (step 710). Initially, the first executable schedule is a candidate schedule.

  Next, it is determined whether or not to search for a better schedule (step 711). If a better schedule search is to be performed, the process returns to step 701. If not, the process proceeds to step 712. The candidate schedule is presented to the user (step 712). Here, there are generally a plurality of executable schedules for a certain menu, and in this embodiment, the executable schedules are searched based on the non-determinism of selection in step 704. This nondeterminism can be deterministically simulated by a technique called backtracking that is employed in, for example, the programming language Prolog. The determination in step 711 may be terminated when all possibilities are exhausted by backtracking, or may be terminated when the number of times this step has been reached and it exceeds a predetermined threshold.

The above specific flow will be described in detail by taking the recipe of FIG. 3 as an example.
FIG. 3 shows a partial recipe group corresponding to the input menu. After performing the initialization procedures 501 to 503, the schedule generation unit 102 selects, for example, a partial recipe with identification number 3 as a partial recipe whose start condition deliverable is empty in step 704. In step 705, the operation “preparation for clam sand discharge” is placed on the leftmost position where the resource [cook, bowl] can be occupied for 2 minutes on the Gantt chart, that is, at the 0 minute position. Next, the operation “clam sanding” is arranged on the Gantt chart at the leftmost position where the resource [cook] can be occupied for 23 minutes, that is, at a position of 2 minutes. Then, in addition to the completed intermediate product, the output product xclam, the partial recipe of the partial recipe with the identification number 3 is removed from the work area. Since there is still a partial recipe in the work area (step 708), the process returns to step 704 to select, for example, the partial recipe with identification number 1. In step 705, the work “shrimp leaves its tail, takes its shell and spine” on the Gantt chart at the leftmost position that can occupy the resources [cook, knife, sink, board] for 5 minutes, ie, 2 minutes Deploy. In addition to the completed intermediate product, xrawn which is an output product, the partial recipe of the partial recipe with identification number 1 is removed from the work area. A Gantt chart at this time is shown in FIG. FIG. 8 is a Gantt chart showing an example after schedule generation up to the partial recipe 301 in FIG. 3, and FIG. 8 shows a result of performing a schedule for a linear partial recipe in which the start condition deliverable is empty.

  Since there is still a partial recipe in the work area (step 708), the process returns to step 704, and the partial recipes with identification numbers 2, 4, 5, and 6 are selected in the same manner, and the schedule is advanced as described above. . The intermediate artifacts completed in these partial recipes are xprawn, xclam, xocto, xparsley, xchili, and xgarlic. Since there is still a partial recipe in the work area (step 708), the process returns to step 704 and, for example, the partial recipe 301 is selected as the partial recipe included in the intermediate product in which the start condition product is completed. In step 705, the operation “preparation for steaming wine” can occupy the resources [cook, pan, heat] on the Gantt chart for 2 minutes, and is placed at the leftmost position after completion of [xprawn, xclam], ie, 30 minutes . Thereafter, scheduling will proceed in the same manner. A Gantt chart at this time is shown in FIG. FIG. 9 is a Gantt chart showing an example of the schedule generation result of the partial recipe 301 in FIG. 3. As a result of generating the schedule, the preparation of steaming wine for the partial recipe 301 is performed for 2 minutes using a cook, a pan, and a stove. In addition, the work of steaming wine has been added to work in a pot and stove for 5 minutes. FIG. 10 shows an example of a Gantt chart when the menu is completed.

  In the example of the recipe by the description method used so far as shown in FIG. 4, when generating a recipe procedure, when one procedure is completed, the procedure proceeds to the next procedure, and further to the next procedure. It becomes the procedure of migrating and performing work. Inexperienced cooks recognize that they will work in the order described in the recipe, and after performing the procedure of the partial recipe 401, perform the procedure of the partial recipe 402. However, it can be seen in FIG. 9 that the time can be shortened by performing the partial recipe 401 while performing sand removal of clams by performing the procedure performed in the partial recipe 402 first. Therefore, by preparing the recipe DB 109 as shown in the above embodiment, it is possible to provide a schedule that is optimal for the user because it eliminates resource duplication and schedules recipes while generating intermediate products. .

  However, in the scheduling that considers only the waiting for the intermediate product shown in the above embodiment, after selecting the partial recipes with the identification numbers 9 and 10, the identification numbers 1 to 8 are selected and the scheduling to proceed to the identification number 11 is performed. There is a possibility to do. In other words, there is a possibility that the spaghetti will start to make the source after the spaghetti has been boiled up, and present a scheduling that will make it last. This schedule is a feasible schedule from a scheduling point of view, but when creating spaghetti entwined with the sauce, the knowledge of cooking that the “entanglement” work must be performed immediately after the spaghetti is struck. If you consider it, you are violating the common sense order condition of cooking. In order to prevent this, in the present embodiment, as shown in a partial recipe 302 in FIG. 3, a partial recipe that must be started immediately after the completion of a certain partial recipe is specified. Specifically, at the end of the partial recipe 302, a condition that the partial recipe with the identification number 11 must be selected immediately after the partial recipe 302 is executed is added by the order constraint registration unit 103, for example, with a description of [11]. is doing. Thereby, the production | generation of the schedule which is violating the common sense order condition violation of said cooking can be prevented.

  By using the above-mentioned constraints, it is possible to determine “a set of partial recipes that must be serially operated without interruption” for each dish to complete the dish. This means that partial recipes not included in this set can be implemented in advance. In this way, the portion that can be implemented in advance is a portion corresponding to preparation. Therefore, by specifying this and storing it in the recipe DB 109 as a separate recipe, the preparation of party dishes can be started from the previous day, or the preparation of lunch for one week can be made a holiday. Can be planned.

  Note that the present invention is not limited to the above-described embodiment as it is, and can be embodied by modifying the components without departing from the scope of the invention in the implementation stage. In addition, various inventions can be formed by appropriately combining a plurality of constituent elements disclosed in the embodiment. For example, some components may be deleted from all the components shown in the embodiment. Furthermore, constituent elements over different embodiments may be appropriately combined.

The figure which shows schematic structure of the cooking procedure production | generation apparatus which concerns on one Embodiment of this invention. The figure which shows the example of a description of the resource accumulate | stored in resource DB105. The figure which shows the example of a description of the recipe which concerns on embodiment of this invention. The figure which shows the example of description of the conventional recipe. The figure which showed the partial recipe described in recipe DB109 in the tree format. The flowchart which shows the flow of operation | movement of the cooking procedure production | generation apparatus which concerns on this embodiment. The flowchart of the recipe schedule production | generation process of step 603. FIG. The Gantt chart which shows the example after the schedule production | generation to the partial recipe 301 of FIG. The Gantt chart which shows the example of the schedule production | generation result of the partial recipe 301 of FIG. The figure which shows the example of the Gantt chart at the time of menu completion.

Explanation of symbols

DESCRIPTION OF SYMBOLS 101 ... Menu input part 102 ... Schedule production | generation part 103 ... Order restriction registration part 104 ... Schedule output part 105 ... Resource database 106 ... Preparation preparation recognition part 107 ... Intermediate product registration part 108 ... Recipe database

Claims (8)

In a cooking procedure generation device that generates a cooking procedure based on an input recipe,
A unit recipe for one work unit of a cooking procedure, which is generated by cooking, a first intermediate product required to start the unit recipe, resources required for cooking, time required for cooking A recipe database describing a recipe including at least one partial recipe with a start condition in which a second intermediate product is described;
A cooking order constraint registration unit for designating a unit recipe to be cooked when the unit recipe is finished in the unit recipe stored in the recipe database;
A cooking procedure generation apparatus, comprising: a schedule generation unit that schedules cooking based on the input recipe and the restriction of the cooking order. The preparation preparation recognition apparatus according to claim 1, wherein at least one unit recipe corresponding to a preparation part is extracted from the input recipe based on a cooking order restriction registered by the order restriction registration unit. The cooking procedure generation device further comprising a section. 3. The cooking procedure generation device according to claim 2, further comprising a schedule output unit for presenting the prepared portion. The cooking procedure generation device according to claim 2, wherein the schedule generation unit performs scheduling only for the prepared portion. 3. The cooking procedure generation apparatus according to claim 2, wherein the schedule generation unit performs scheduling from the point in time when the second intermediate product by the preparation is completed with respect to the preparation part. apparatus. In the cooking procedure production | generation apparatus of Claim 1,
The cooking order constraint registration unit allows a description of a unit recipe that does not designate a unit recipe that must be started immediately after the unit recipe is finished,
The schedule generation unit schedules a cooking procedure of a unit recipe whose start time is not specified to execute the unit recipe at an arbitrary timing after the first intermediate product is generated. A cooking procedure generation device. A unit recipe for one unit of work in the cooking procedure, which is generated by cooking, a first intermediate product required to start the unit recipe, resources required for cooking, time required for cooking Input a recipe including at least one unit recipe in which the second intermediate product is described,
In the input unit recipe, specify the unit recipe to be started when the unit recipe ends,
A cooking procedure generation method comprising performing scheduling of cooking based on the input recipe and the restriction of the cooking order. In a cooking procedure generation program for generating a cooking procedure based on an input recipe,
A unit recipe for one work unit of a cooking procedure, which is generated by cooking, a first intermediate product required to start the unit recipe, resources required for cooking, time required for cooking Input a recipe including at least one unit recipe in which the second intermediate product is described,
In the input unit recipe, specify the unit recipe to be started when the unit recipe ends,
A cooking procedure generation program comprising scheduling cooking based on the input recipe and the restriction of the cooking order.

Images