A method for determining a cooking sequence of a multi-course menu and an integrated cooking center product

Abstract

The application relates to a multi-dish cooking sequence determination method and an integrated cooking center product, and relates to the technical field of intelligent cooking. The method comprises the following steps: acquiring a dish list input by a user and corresponding effect priorities, cooking equipment, cooking time periods and spare time periods of each dish; the spare time period is a time period without manual operation in the cooking process of the dish. The dishes are initially sorted according to the effect priorities and the cooking time periods of the dishes, and an initial cooking sequence is determined. According to the initial cooking sequence, the dishes are inserted based on the spare time periods, the cooking time periods and the cooking equipment of the dishes, and a target cooking sequence is determined. The application can solve the problem of taste deterioration caused by too large differences in cooking completion times of multiple dishes.

Description

Technical Field

[0001] This application relates to the field of intelligent cooking technology, and in particular to a method for determining the cooking order of multiple recipes and an integrated cooking center product. Background Technology

[0002] Currently, integrated cooking centers, as a type of kitchen appliance that combines multiple functions, integrate range hoods, stoves, steamers, ovens, air fryers, double boilers, and insulated lunch boxes, which can meet users' needs to cook multiple recipes at the same time.

[0003] However, when cooking multiple recipes simultaneously, the cooking order is crucial. For users who are not skilled in cooking, a chaotic cooking order can lead to conflicts between cooking equipment, extended cooking time, user confusion, or even cooking failure.

[0004] Therefore, there is an urgent need for a method to determine the cooking order of multiple recipes. Summary of the Invention

[0005] Therefore, it is necessary to provide a method for determining the cooking order of multiple recipes and an integrated cooking center product to address the above-mentioned technical problems.

[0006] Firstly, a method for determining the cooking order of multiple recipes is provided, the method comprising:

[0007] Obtain the list of recipes input by the user, as well as the effect priority, cooking equipment, cooking time, and idle time for each recipe. The idle time is the time period during which no human operation is required during the cooking process of the recipe.

[0008] The recipes are initially sorted according to their effect priority and cooking time to determine the initial cooking order.

[0009] Based on the available time slots, cooking time slots, and cooking equipment of each recipe, the recipes are inserted according to the initial cooking order to determine the target cooking order.

[0010] As an optional implementation, the initial sorting of the recipes according to their effect priority and cooking time, and the determination of the initial cooking order, includes:

[0011] Sort the recipes from highest to lowest priority based on their effectiveness.

[0012] For recipes with the same effect priority, sort them from highest to lowest according to the cooking time.

[0013] As an optional implementation, the step of inserting recipes according to the initial cooking order based on the available time slots, cooking time slots, and cooking equipment of each recipe, and determining the target cooking order, includes:

[0014] For each recipe, the cooking time of the recipe is divided into points according to the preset point interval;

[0015] Based on the available time slots and cooking time slots of the recipe, assign point values ​​to the recipe and determine the corresponding point sequence;

[0016] Get the current merged point sequence and get the point sequence of the recipe to be inserted;

[0017] Perform a bitwise AND operation on each bit of the point sequence of the recipe to be inserted and the current merged point sequence;

[0018] Based on the calculation results and the cooking equipment status of the recipe to be inserted, the point sequence of the recipe to be inserted is inserted into the current merged point sequence;

[0019] The inserted point sequence is updated to the current merged point sequence, and the steps of obtaining the current merged point sequence and obtaining the point sequence of the recipe to be inserted are executed until the insertion of each recipe is completed, and the final point sequence is obtained.

[0020] The cooking order of each recipe in the final point sequence is determined as the target cooking order.

[0021] As an optional implementation, the preset point interval is 30 seconds.

[0022] As an optional implementation, the step of assigning point values ​​to the recipe based on its available time slots and cooking time slots to determine the corresponding point sequence includes:

[0023] Based on the cooking time and the available time, determine the human operation time for this recipe;

[0024] Set the point value corresponding to the manual operation period to 1, and set the point value corresponding to the idle period to 0 to obtain the point sequence corresponding to the recipe.

[0025] As an optional implementation, the method further includes:

[0026] In the initial cooking sequence, when the second recipe is the recipe to be inserted, the first recipe is obtained as the current merge point sequence.

[0027] As an optional implementation, inserting the point sequence of the recipe to be inserted into the current merged point sequence based on the calculation result and the cooking equipment status of the recipe to be inserted includes:

[0028] If there are non-zero bits in the operation result, shift the bit sequence of the recipe to be inserted to the right bit by bit and perform the bitwise AND operation again until the operation result is all 0;

[0029] If there is a conflict with cooking equipment at the insertion position of the recipe to be inserted, the point sequence of the recipe to be inserted will be inserted at the end of the current merged point sequence.

[0030] If there is no conflict with cooking equipment at the insertion position of the recipe to be inserted, then the current movement position of the point sequence of the recipe to be inserted is determined as the insertion position.

[0031] As an optional implementation, the effect priority includes high priority, medium priority, and low priority.

[0032] As an optional implementation, the cooking equipment includes, but is not limited to, steam ovens, ovens, and gas stoves.

[0033] In a second aspect, an integrated cooking center product is provided, which is used to guide a user to cook multiple recipes in the target cooking order according to the method for determining the cooking order of multiple recipes as described in any one of the first aspects.

[0034] Thirdly, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program executable on the processor, and the processor executes the computer program to implement the steps of the method as described in any of the first aspects.

[0035] Fourthly, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the steps of the method as described in any of the first aspects.

[0036] This application provides a method for determining the cooking order of multiple recipes and an integrated cooking center product. The technical solution provided by the embodiments of this application brings at least the following beneficial effects. The method includes: obtaining a list of recipes input by a user and the effect priority, cooking equipment, cooking time, and spare time corresponding to each recipe, wherein the spare time is the time period during which no manual operation is required during the cooking process of the recipe; initially sorting the recipes according to the effect priority and cooking time of each recipe to determine the initial cooking order; and inserting recipes according to the spare time, cooking time, and cooking equipment of each recipe, according to the initial cooking order, to determine the target cooking order. The solution provided by this application, after reasonably sorting the recipes and their cooking equipment, can not only solve the problem of cooking conflicts but also save cooking time, and the final recipes are produced in a relatively concentrated manner, solving the problem of poor taste caused by large differences in the cooking completion time of multiple recipes.

[0037] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and do not limit this application. Attached Figure Description

[0038] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0039] Figure 1 A flowchart illustrating a method for determining the cooking order of multiple recipes, provided in an embodiment of this application;

[0040] Figure 2 A flowchart illustrating a method for determining an initial cooking order as provided in an embodiment of this application;

[0041] Figure 3 A flowchart illustrating a method for determining an initial cooking order as provided in an embodiment of this application;

[0042] Figure 4 A flowchart illustrating a method for determining an initial cooking order as provided in an embodiment of this application;

[0043] Figure 5 A flowchart illustrating a method for determining an initial cooking order as provided in an embodiment of this application;

[0044] Figure 6 A flowchart illustrating an example of a method for determining an initial cooking order provided in an embodiment of this application;

[0045] Figure 7 A schematic diagram illustrating the insertion of a menu item sequence according to an embodiment of this application;

[0046] Figure 8 A schematic diagram illustrating the completion of recipe insertion as provided in an embodiment of this application;

[0047] Figure 9 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0048] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0049] The following will describe in detail, with reference to specific embodiments, a method for determining the cooking order of multiple recipes provided in this application. Figure 1 A flowchart illustrating a method for determining the cooking order of multiple recipes provided in this application embodiment is shown below. Figure 1 As shown, the specific steps are as follows:

[0050] Step 101: Obtain the list of recipes input by the user, as well as the effect priority, cooking equipment, cooking time, and idle time for each recipe. The idle time is the time period during which no human intervention is required during the cooking process of the recipe.

[0051] In implementation, the system can obtain the list of recipes input by the user and acquire necessary information about the recipes, including effect priority, cooking equipment, cooking time, available time slots, and recipe name. Taking the integrated cooking center product as an example, the cooking equipment includes a left gas stove, a right gas stove, a steam oven, and an oven. Users can customize the effect priority, cooking equipment, cooking time, and available time slots for each recipe according to their personal preferences and experience. If the user does not define cooking information, the system can provide recommended cooking information for each recipe based on the user's input list. Table 1 is an example table of a recipe list and cooking information provided in an embodiment of this application, as shown in Table 1:

[0052] Table 1

[0053] Recipe Name Effect priority Cooking time Cooking equipment spare time Stir-fried pork with onions Low 00:00:00-00:07:00 Left stove -- Stir-fried potatoes with shredded pork middle 00:00:00-00:09:00 Left stove -- Stir-fried Shanghai bok choy middle 00:00:00-00:06:00 Right stove -- Cumin Roasted Lamb Chops high 00:00:00-00:26:00 oven 00:06:00-00:25:00 Shrimp and mushroom soup high 00:00:00-00:11:00 Right stove -- Steamed Broccoli middle 00:00:00-00:15:00 Steam oven 00:06:00-00:13:00

[0054] The idle time slots are the periods during which no human intervention is required during the cooking process of a recipe. In Table 1, recipes such as stir-fried pork with onions, stir-fried shredded pork with potatoes, stir-fried Shanghai bok choy, and shrimp and mushroom soup require continuous manual cooking by the user. For example, stir-fried pork with onions requires the user to continuously stir-fry, add seasonings, and observe the color of the dish. Therefore, these recipes do not have idle time slots. During the cooking process of cumin-roasted lamb chops and steamed broccoli, the main cooking process is completed by cooking equipment such as ovens and steamers. During the cooking time slots of the cooking equipment, the user can perform the cooking of other recipes. For example, during the cooking process of cumin-roasted lamb chops, the user can set the time slots for oven preheating, taking out and processing ingredients, putting ingredients into the oven, and taking the dish out of the oven after cooking. Considering that the machine steps require time, a time margin, such as 1 minute, can also be preset. Therefore, the time periods 00:00:00-00:06:00 and 00:25:00-00:26:00 can be considered as periods for manual operation, while no manual operation is required during the time period 00:06:00-00:25:00.

[0055] Step 102: Sort the recipes according to their effect priority and cooking time to determine the initial cooking order.

[0056] In implementation, effect priority represents the user's preference for cooking recipes, and cooking time can represent the cooking time of recipes. The system can initially sort recipes according to their effect priority and cooking time to determine the initial cooking order. The initial cooking order conforms to the user's daily cooking habits, that is, recipes that the user prefers and have the longest cooking time should be cooked first.

[0057] As an optional implementation method, Figure 2 A flowchart illustrating a method for determining an initial cooking order provided in this application embodiment is shown below. Figure 2 As shown, in step 102, the recipes are initially sorted according to their effect priority and cooking time. The specific steps for determining the initial cooking order are as follows:

[0058] Step 201: Sort the recipes from highest to lowest priority based on their effectiveness.

[0059] In practice, Table 2 is another example table of recipe list and cooking information provided in the embodiments of this application, as shown in Table 2:

[0060] Table 2

[0061] Recipe Name Effect priority Cooking time Cooking equipment spare time Cumin Roasted Lamb Chops high 00:00:00-00:26:00 oven 00:06:00-00:25:00 Shrimp and mushroom soup high 00:00:00-00:11:00 Right stove -- Stir-fried Shanghai bok choy middle 00:00:00-00:06:00 Right stove -- Stir-fried potatoes with shredded pork middle 00:00:00-00:09:00 Left stove -- Steamed Broccoli middle 00:00:00-00:15:00 Steam oven 00:06:00-00:13:00 Stir-fried pork with onions Low 00:00:00-00:07:00 Left stove --

[0062] The system can sort recipes according to their priority. The priority of the effect can be divided into three levels: low, medium and high, or into multiple levels, such as 1, 2, 3... with the priority increasing in sequence. The priority of the effect can represent the user's degree of preference for the recipe.

[0063] Step 202: For recipes with the same effect priority, sort them from high to low according to the cooking time.

[0064] In practice, Table 3 is another example table of recipe list and cooking information provided by the embodiments of this application, as shown in Table 3:

[0065] Table 3

[0066] Recipe Name Effect priority Cooking time Cooking equipment spare time Cumin Roasted Lamb Chops high 00:00:00-00:26:00 oven 00:06:00-00:25:00 Shrimp and mushroom soup high 00:00:00-00:11:00 Right stove -- Steamed Broccoli middle 00:00:00-00:15:00 Steam oven 00:06:00-00:13:00 Stir-fried potatoes with shredded pork middle 00:00:00-00:09:00 Left stove -- Stir-fried Shanghai bok choy middle 00:00:00-00:06:00 Right stove -- Stir-fried pork with onions Low 00:00:00-00:07:00 Left stove --

[0067] For recipes with the same effect priority, the system can reorder them according to the length of the cooking time, with recipes with longer cooking times having higher priority, thus obtaining the initial cooking order.

[0068] Step 103: Based on the available time slots, cooking time slots, and cooking equipment of each recipe, insert the recipes according to the initial cooking order to determine the target cooking order.

[0069] In implementation, based on the available time slots, cooking time slots, and cooking equipment for each recipe, the system can insert recipes according to the initial cooking order, thereby optimizing the order of recipes in the initial cooking order and determining the target cooking order. By inserting recipes, the system avoids wasting available time slots and shortens the total cooking time.

[0070] As an optional implementation method, Figure 3 A flowchart illustrating a method for determining an initial cooking order provided in this application embodiment is shown below. Figure 3 As shown, in step 103, based on the available time slots, cooking time slots, and cooking equipment of each recipe, the recipes are inserted according to the initial cooking order, and the specific steps for determining the target cooking order are as follows:

[0071] Step 301: For each recipe, divide the cooking time of the recipe into points according to the preset point interval.

[0072] In implementation, the preset time interval for each cooking point can be a fixed time period, such as 30 seconds or 1 minute. The cooking time of a recipe is divided according to this preset time interval to obtain multiple consecutive time points. For example, if the cooking time of a recipe is 00:00:00-00:10:00, and the preset time interval is 30 seconds, then the cooking time of this recipe can be divided into 20 points. This division method helps in the subsequent calculation process, ensuring that the cooking steps of each recipe can be accurately allocated to the corresponding time period, which is especially suitable for products such as integrated cooking centers where cooking equipment is shared.

[0073] Preferably, the preset interval between points is 30 seconds.

[0074] Step 302: Based on the available time slots and cooking time slots of the recipe, assign point values ​​to the recipe to determine the corresponding point sequence.

[0075] In implementation, point assignment is based on manual operation and equipment occupancy. Typically, the system can distinguish between periods requiring manual operation and periods without manual intervention through point assignment. This assignment process allows the cooking task for each recipe to be identified through a point sequence, helping to identify equipment occupancy and periods of manual intervention during the cooking process, thus facilitating subsequent calculations and processing.

[0076] As an optional implementation method, Figure 4 A flowchart illustrating a method for determining an initial cooking order provided in this application embodiment is shown below. Figure 4 As shown, the specific steps in step 302 to assign point values ​​to the recipe based on its available time slots and cooking time slots, and to determine the point sequence corresponding to the recipe, are as follows:

[0077] Step 401: Determine the human operation time for the recipe based on the cooking time and available time.

[0078] In practice, the cooking time for a recipe can be divided into two parts: the time requiring human intervention and the time requiring no human intervention (i.e., idle time). Human intervention time typically involves tasks such as food preparation, placing items in the equipment, turning them, or adjusting the temperature. Idle time, on the other hand, is the period during which no human intervention is needed while the equipment is running. This division helps to clearly define the status of each time period in the location sequence, ensuring the rational allocation of resources.

[0079] Step 402: Set the point value corresponding to the manual operation period to 1 and the point value corresponding to the idle period to 0 to obtain the point sequence corresponding to the recipe.

[0080] In implementation, periods of manual operation during the cooking process are marked as 1, and periods of inactivity are marked as 0. Each point value corresponds to a state during the cooking process; a point value of 1 indicates that manual intervention is required at that time, while a point value of 0 indicates that the equipment is running automatically and no manual intervention is needed. This assignment method converts the entire cooking process into a point sequence, facilitating comparison and calculation with point sequences from other recipes and avoiding time conflicts. For example, for the recipe of steamed broccoli, the cooking period is 00:00:00-00:15:00, with a preset point interval of 30 seconds. Based on the human operation period and idle period determined in step 401, the point sequence can be represented as follows: the first 6 minutes require human operation, with a point value of 1111111111111; the next 7 minutes are the equipment cooking time, i.e., the idle period, with a point value of 000000000000000; and the last 2 minutes are for human operation, with a point value of 1111. Therefore, the complete point sequence for steamed broccoli is 1111111111111000000000000001111.

[0081] Step 303: Obtain the current merged point sequence and the point sequence of the recipe to be inserted.

[0082] In implementation, merging the cooking point sequence refers to the allocation of time points between the already processed recipe cooking point sequence and its subsequent cooking tasks. The current merged cooking point sequence represents the current usage of equipment and manual operation resources. The cooking point sequence for recipes to be inserted refers to the cooking time slots corresponding to recipes that have not yet been inserted. To prevent resource conflicts (such as equipment being used for multiple dishes simultaneously), the cooking point sequences of each recipe must be inserted gradually to ensure reasonable time allocation.

[0083] As an optional implementation, in the initial cooking sequence, when the second recipe is the recipe to be inserted, the first recipe is obtained as the current merge point sequence.

[0084] In practice, taking Table 3 as an example, when shrimp and mushroom soup is the recipe to be inserted, since there is no previous merged point sequence, the system can take the point sequence corresponding to the first recipe, namely cumin roasted lamb chops, as the current merged point sequence.

[0085] Step 304: Perform a bitwise AND operation between the position sequence of the recipe to be inserted and the current merged position sequence.

[0086] In practice, bitwise AND operations are used to detect time conflicts between the recipe to be inserted and the current merged position sequence, especially detecting conflicts caused by equipment use or manual operation. The rules for bitwise AND operations are: if the position values ​​of both recipes are 1, it indicates a conflict in that time period, and they cannot be inserted simultaneously; if all bitwise AND operations result in 0, it indicates no conflict, and insertion is safe. For example, if the position sequences of two recipes are 11110000000011 and 1111111, the result of a bitwise AND operation is 11110000000000, meaning the first four positions conflict. This implies that recipe 2 cannot be inserted in the current time period.

[0087] Step 305: Based on the calculation results and the status of the cooking equipment to be inserted, insert the point sequence of the recipe to be inserted into the current merged point sequence.

[0088] In practice, the system can insert the point sequence of the recipe to be inserted into the current merged point sequence based on the calculation results and the status of the cooking equipment to be inserted.

[0089] As an optional implementation method, Figure 5 A flowchart illustrating a method for determining an initial cooking order provided in this application embodiment is shown below. Figure 5 As shown, the specific steps in step 305 of inserting the point sequence of the recipe to be inserted into the current merged point sequence based on the calculation result and the cooking equipment status of the recipe to be inserted are as follows:

[0090] Step 501: If there are non-zero bits in the operation result, shift the bit sequence of the recipe to be inserted to the right bit by bit and perform the bitwise AND operation again until the operation result is 0.

[0091] In implementation, if the bitwise AND operation results in a conflict, the bit sequence to be inserted needs to be right-shifted to find a suitable insertion position and avoid resource conflicts. If the bitwise AND operation result is all 0, it means there is no conflict, and the bit sequence of the recipe to be inserted can be directly merged into the current merged bit sequence. For example: the current merged bit sequence is 11110000000011, the bit sequence of the recipe to be inserted is 1111111, the bitwise AND operation result is 111100000000000, meaning the first 4 bits conflict. Shifting the bit sequence of the recipe to be inserted, 1111111, one bit to the right results in 11100000000000, meaning the first 3 bits conflict. Repeat the right shift and operation steps. After shifting the bit sequence of the recipe to be inserted four times to the right, the result is 000000000000000.

[0092] Step 502: If there is a conflict between the insertion position of the recipe to be inserted and the cooking equipment, then insert the point sequence of the recipe to be inserted at the end of the current merged point sequence.

[0093] In practice, there may be device conflicts when inserting a recipe. For example, if one recipe can be inserted during a free period, and the bitwise AND operation results in 0, but both recipes use the same cooking equipment, a device conflict exists. In this case, the bit sequence of the recipe to be inserted can be placed at the end of the currently merged bit sequence. That is, the cooking equipment must be released from its current state before the recipe to be inserted can be cooked. For example, if the current merged bit sequence is 11110000000011, and cooking equipment A is currently occupied, and the recipe to be inserted also uses cooking equipment A with a bit sequence of 11000011, after shifting the bit sequence of the recipe to be inserted four times to the right according to the bitwise AND operation result, the result is 000000000000000. However, since cooking device A is in use, the system inserts the point sequence of the recipe to be inserted at the end of the current merged point sequence, i.e., 1111000000001111000011 instead of 11111100001111.

[0094] Step 503: If there is no conflict with cooking equipment at the insertion position of the recipe to be inserted, then the current movement position of the point sequence of the recipe to be inserted is determined as the insertion position.

[0095] In practice, if there is no conflict with cooking equipment at the insertion position of the recipe to be inserted, the system determines the current movement position of the recipe's bit sequence as the insertion position. For example, if the current merged bit sequence is 11110000000011, and cooking equipment A is currently occupied, and the recipe to be inserted also uses cooking equipment B, whose bit sequence is 11000011, after right-shifting the recipe's bit sequence four times according to the bitwise AND operation result, the result is 000000000000000. Since cooking equipment B is occupied, the system inserts the recipe's bit sequence into the current movement position, i.e., 11111100001111.

[0096] Step 306: Update the inserted point sequence to the current merged point sequence, and execute the steps of obtaining the current merged point sequence and obtaining the point sequence of the recipe to be inserted, until the insertion of each recipe is completed and the final point sequence is obtained.

[0097] In practice, after each recipe insertion, the merged point sequence is updated to reflect the current cooking time occupancy of all recipes. Then, the point sequence of the next recipe to be inserted is obtained, and the insertion process is repeated until all recipe point sequences have been inserted, generating the final merged point sequence. After merging the preceding recipes, the current merged point sequence is updated to 11111100001111. Subsequent recipes to be inserted will then follow the same steps, ultimately generating a complete merged point sequence that covers the cooking tasks of all recipes.

[0098] Step 307: Determine the cooking order of each recipe in the final point sequence as the target cooking order.

[0099] In practice, the final point sequence reflects the temporal distribution of cooking tasks for all recipes. By analyzing this point sequence, the final cooking order for each recipe can be determined, as well as when manual operations or equipment usage should be performed, thereby optimizing the cooking process.

[0100] As an optional implementation method, Figure 6 A flowchart illustrating an example of a method for determining an initial cooking order provided in an embodiment of this application is shown below. Figure 6 As shown, the specific steps are as follows:

[0101] Step 601: Obtain the recipe list and recipe information, including: effect priority, cooking equipment, cooking time and available time.

[0102] Step 602: Sort the recipe list according to the priority of the effects.

[0103] Step 603: Sort the recipe list twice according to the cooking time to determine the initial cooking order.

[0104] Step 604: Arrange the first recipe and corresponding cooking equipment in the initial cooking sequence.

[0105] Step 605: Insert each recipe in the order of the initial cooking steps.

[0106] Step 606: Determine if the device is idle.

[0107] If yes, proceed to step 607; otherwise, proceed to step 608.

[0108] Step 607: Determine if there is an operation conflict.

[0109] If yes, proceed to step 609; otherwise, proceed to step 610.

[0110] Step 608: Wait for the recipe to finish cooking before inserting.

[0111] Step 609, the site offset continues to be inserted, and then step 608 is executed.

[0112] Step 610: Determine whether all recipes have been inserted.

[0113] If yes, then end; otherwise, proceed to step 605.

[0114] As an optional implementation method, the following is another specific embodiment provided by the embodiments of this application. Figure 7 This is a schematic diagram illustrating the insertion of a menu item sequence according to an embodiment of this application. Figure 8 The following is a schematic diagram illustrating the completion of recipe insertion as provided in an embodiment of this application:

[0115] The initial recipe sequence contains three dishes: cumin-roasted lamb chops, shrimp and mushroom soup, steamed broccoli, stir-fried potatoes with shredded pork, stir-fried Shanghai bok choy, and stir-fried onions with pork. Cooking information is shown in Table 3. The cooking time slots for each dish are divided into points according to a 30-second interval. Points requiring human intervention are set to a value of 1, while points not requiring human intervention during machine cooking are set to a value of 0. The point sequence for each dish is as follows: Figure 7As shown. In the point sequence of cumin-roasted lamb chops, the point sequence of shrimp and mushroom soup can be inserted between 00:06:00 and 00:25:00. Furthermore, the cooking equipment for cumin-roasted lamb chops and shrimp and mushroom soup does not conflict, thus obtaining the merged point sequence. When the point sequence of steamed broccoli is shifted to the right to 00:17:00, the calculation result is 0. Also, the cooking equipment for steamed broccoli is a steam oven, which is different from the oven currently in use, so steamed broccoli can be inserted. Stir-fried potatoes with shredded pork, stir-fried Shanghai bok choy, and stir-fried onions with pork are all manually operated time periods, therefore, operation conflicts will occur. They can only be inserted sequentially at the end of the current merged sequence to ensure that the calculation result is always 0, obtaining the final point sequence and the precise start time of each recipe during the cooking process (e.g., ...). Figure 8 As shown, following the target cooking order can ensure the efficient cooking of multiple recipes.

[0116] This application provides a method for determining the cooking order of multiple recipes. The technical solution provided by this application brings at least the following beneficial effects. The method includes: obtaining a list of recipes input by a user, along with the effect priority, cooking equipment, cooking time, and spare time for each recipe, where the spare time is the time period during the cooking process of that recipe that does not require manual operation; initially sorting the recipes according to their effect priority and cooking time to determine the initial cooking order; and inserting recipes according to the initial cooking order based on the spare time, cooking time, and cooking equipment for each recipe to determine the target cooking order. The solution provided by this application, after reasonably sorting the recipes and their cooking equipment, can not only solve the problem of cooking conflicts but also save cooking time. Furthermore, the final dishes are produced relatively centrally, solving the problem of poor taste caused by large differences in the completion time of multiple recipes.

[0117] It should be understood that, although Figures 1 to 6 The steps in the flowchart are shown sequentially as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order in which these steps are executed, and they can be performed in other orders. Figures 1 to 6 At least some of the steps in the process may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but may be executed at different times. The execution order of these steps or stages is not necessarily sequential, but may be executed in turn or alternately with other steps or at least some of the steps or stages in other steps.

[0118] It is understood that the same / similar parts between the various embodiments of the methods described above in this specification can be referred to each other. Each embodiment focuses on the differences from other embodiments, and relevant parts can be referred to the description of other method embodiments.

[0119] This application also provides an integrated cooking center product, which is used to guide users to cook multiple recipes according to a method for determining the cooking order of multiple recipes.

[0120] Specific limitations regarding integrated cooking center products can be found in the above section on determining the cooking order of multiple recipes, and will not be repeated here. Each module in the aforementioned integrated cooking center product can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device, or stored in the computer device's memory as software, allowing the processor to invoke and execute the corresponding operations of each module.

[0121] In one embodiment, a computer device is provided, such as Figure 9 As shown, it includes a memory and a processor. The memory stores a computer program that can run on the processor. When the processor executes the computer program, it implements the method steps of determining the cooking order of the above-mentioned multiple recipes.

[0122] In one embodiment, a computer-readable storage medium stores a computer program thereon, which, when executed by a processor, implements the steps of the method for determining the cooking order of the above-described multiple recipes.

[0123] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0124] It should be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0125] It should also be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for display, data used for analysis, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties.

[0126] The various embodiments in this specification are described in a related manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. In particular, the system embodiments are basically similar to the method embodiments, so the description is relatively simple; relevant parts can be referred to the descriptions of the method embodiments.

[0127] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0128] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the invention patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this patent application should be determined by the appended claims.

Claims

1. A method of determining a cooking sequence of a multi-course menu, characterized by, The method includes: Obtain the list of recipes input by the user, as well as the effect priority, cooking equipment, cooking time, and idle time for each recipe. The idle time is the time period during which no human operation is required during the cooking process of the recipe. The recipes are initially sorted according to their effect priority and cooking time to determine the initial cooking order. Based on the available time slots, cooking time slots, and cooking equipment of each recipe, the recipes are inserted according to the initial cooking order to determine the target cooking order; The process of inserting recipes based on their available time slots, cooking time slots, and cooking equipment, according to the initial cooking order, and determining the target cooking order includes: For each recipe, the cooking time of the recipe is divided into points according to the preset point interval; Based on the available time slots and cooking time slots of the recipe, assign point values ​​to the recipe and determine the corresponding point sequence; Get the current merged point sequence and get the point sequence of the recipe to be inserted; Perform a bitwise AND operation on each bit of the point sequence of the recipe to be inserted and the current merged point sequence; Based on the calculation results and the cooking equipment status of the recipe to be inserted, the point sequence of the recipe to be inserted is inserted into the current merged point sequence; The inserted point sequence is updated to the current merged point sequence, and the steps of obtaining the current merged point sequence and obtaining the point sequence of the recipe to be inserted are executed until the insertion of each recipe is completed, and the final point sequence is obtained. The cooking order of each recipe in the final point sequence is determined as the target cooking order.

2. The method of claim 1, wherein, The initial sorting of the recipes according to their effect priority and cooking time, and the determination of the initial cooking order, includes: Sort the recipes from highest to lowest priority based on their effectiveness. For recipes with the same effect priority, sort them from highest to lowest according to the cooking time.

3. The method of claim 1, wherein, The preset interval between points is 30 seconds.

4. The method of claim 1, wherein, The step of assigning point values ​​to the recipe based on its available time slots and cooking time slots, and determining the corresponding point sequence for the recipe, includes: Based on the cooking time and the available time, determine the human operation time for this recipe; Set the point value corresponding to the manual operation period to 1, and set the point value corresponding to the idle period to 0 to obtain the point sequence corresponding to the recipe.

5. The method of claim 4, wherein, The method further includes: In the initial cooking sequence, when the second recipe is the recipe to be inserted, the first recipe is obtained as the current merge point sequence.

6. The method of claim 4, wherein, The step of inserting the point sequence of the recipe to be inserted into the current merged point sequence based on the calculation result and the cooking equipment status of the recipe to be inserted includes: If there are non-zero bits in the operation result, shift the bit sequence of the recipe to be inserted to the right bit by bit and perform the bitwise AND operation again until the operation result is all 0; If there is a conflict with cooking equipment at the insertion position of the recipe to be inserted, the point sequence of the recipe to be inserted will be inserted at the end of the current merged point sequence. If the insertion position of the to-be-inserted recipe does not exist a cooking equipment conflict, a current moving position of the point sequence of the to-be-inserted recipe is determined as the insertion position.

7. The method of claim 1, wherein, The effect priority includes a high priority, a medium priority and a low priority.

8. The method of claim 1, wherein, The cooking equipment includes a steamer, an oven and a gas stove.

9. An integrated cooking center product, characterized by, The integrated cooking center product is used for guiding a user to cook a multi-course recipe according to the target cooking sequence determined by the method for determining a multi-course recipe cooking sequence according to any one of claims 1-8.

Images