WO2024066089A1 - Cooking plan determination method and apparatus, storage medium, and electronic apparatus - Google Patents

Abstract

The present disclosure provides a cooking plan determination method and apparatus, a storage medium, and an electronic apparatus, and relates to the technical field of smart homes. The cooking plan determination method comprises: obtaining a plurality of recipes, and determining recipe information corresponding to each of the plurality of recipes, wherein each recipe corresponds to one dish; according to the recipe information corresponding to each of the plurality of recipes, determining from a plurality of cooking plans a target cooking plan corresponding to the plurality of recipes, wherein the target cooking plan is the cooking plan of the plurality of cooking plans which requires the least amount of time.

Description

Method and device for determining cooking plan, storage medium and electronic device

This disclosure claims the priority of the Chinese patent application filed with the China Patent Office on September 29, 2022, with application number 202211203429.1, and invention name “Method and device for determining a cooking plan, storage medium and electronic device”, the entire content of which is incorporated by reference in this disclosure.

Technical Field

The present disclosure relates to the field of smart home technology, and in particular to a method and device for determining a cooking plan, a storage medium, and an electronic device.

Background technique

As people pay more and more attention to health, most families choose to cook at home. However, in the smart home scenario, only dishes and corresponding recipes are recommended to users based on their preferences, and then users cook according to the recipes. When multiple dishes need to be cooked, users need to coordinate the start and end time of each process for each dish. However, the time consumed by users to coordinate the cooking process of each dish to cook multiple dishes is often not the shortest, which makes users waste a lot of time.

With regard to the problem in related technologies that users tend to waste a lot of time when cooking multiple dishes, no effective solution has been proposed so far.

Therefore, it is necessary to improve the related technology to overcome the above-mentioned defects in the related technology.

Summary of the invention

According to one aspect of an embodiment of the present disclosure, a method for determining a cooking plan is provided, comprising: acquiring a plurality of recipes, and determining recipe information corresponding to each of the plurality of recipes, wherein each of the recipes corresponds to a dish; and determining a target cooking plan corresponding to the plurality of recipes from a plurality of cooking plans according to the recipe information corresponding to each of the plurality of recipes, wherein the target cooking plan is a cooking plan that consumes the least time among the plurality of cooking plans.

According to another aspect of an embodiment of the present disclosure, a device for determining a cooking plan is also provided, including: a first determination module, configured to obtain a plurality of recipes and determine recipe information corresponding to each of the plurality of recipes, wherein each of the recipes corresponds to a dish; and a second determination module, configured to determine a target cooking plan corresponding to the plurality of recipes from a plurality of cooking plans according to the recipe information corresponding to each of the plurality of recipes, wherein the target cooking plan is a cooking plan that consumes the least time among the plurality of cooking plans.

According to another aspect of the embodiments of the present disclosure, a computer-readable storage medium is provided, in which a computer program is stored, wherein the computer program is configured to execute the above-mentioned method for determining a cooking plan when running.

According to another aspect of the embodiments of the present disclosure, there is also provided an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the method for determining the cooking plan through the computer program.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the present disclosure.

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

FIG1 is a schematic diagram of a hardware environment of a method for determining a cooking plan according to an embodiment of the present disclosure;

FIG2 is a flow chart of a method for determining a cooking plan according to an embodiment of the present disclosure (I);

FIG3 is an overall framework diagram of a method for determining a cooking plan according to an embodiment of the present disclosure;

FIG4 is a flowchart (II) of a method for determining a cooking plan according to an embodiment of the present disclosure;

FIG5 is a structural block diagram of a device for determining a cooking plan according to an embodiment of the present disclosure;

FIG. 6 is a structural block diagram of an optional electronic device according to an embodiment of the present disclosure.

Detailed ways

In order to enable those skilled in the art to better understand the scheme of the present disclosure, the technical scheme in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in the field without creative work should fall within the scope of protection of the present disclosure.

It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products, or devices.

According to one aspect of an embodiment of the present disclosure, a method for determining a cooking plan is provided. The method for determining a cooking plan is widely used in whole-house intelligent digital control application scenarios such as smart home, smart home, smart home device ecology, and smart house ecology. Optionally, in this embodiment, the above-mentioned method for determining a cooking plan can be applied to a hardware environment consisting of a terminal device 102 and a server 104 as shown in Figure 1. As shown in Figure 1, the server 104 is connected to the terminal device 102 through a network, and can be configured to provide services (such as application services, etc.) for the terminal or a client installed on the terminal, a database can be set on the server or independently of the server, and it is configured to provide data storage services for the server 104, cloud computing and/or edge computing services can be configured on the server or independently of the server, and it is configured to provide data computing services for the server 104.

The above network may include but is not limited to at least one of the following: wired network, wireless network. The above wired network may include but is not limited to at least one of the following: wide area network, metropolitan area network, local area network, and the above wireless network may include but is not limited to at least one of the following: WIFI (Wireless Fidelity), Bluetooth. The terminal device 102 may be but is not limited to a PC, a mobile phone, a tablet computer, a smart air conditioner, a smart range hood, a smart refrigerator, a smart oven, a smart stove, a smart washing machine, a smart water heater, a smart washing equipment, a smart dishwasher, a smart projection equipment, a smart TV, a smart clothes drying rack, a smart curtain, a smart audio and video, a smart socket, a smart speaker, a smart fresh air equipment, a smart kitchen and bathroom equipment, a smart bathroom equipment, a smart sweeping robot, a smart window cleaning robot, a smart mopping robot, a smart air purification equipment, a smart steamer, a smart microwave oven, a smart kitchen treasure, a smart purifier, a smart water dispenser, a smart door lock, etc.

In order to solve the above problem, a method for determining a cooking plan is provided in this embodiment. FIG. 2 is a flow chart (I) of the method for determining a cooking plan according to an embodiment of the present disclosure. The flow chart includes the following steps:

Step S202, obtaining a plurality of recipes, and determining recipe information corresponding to each of the plurality of recipes, wherein each of the recipes corresponds to a dish;

In an exemplary embodiment, determining the recipe information corresponding to each of the multiple recipes includes: determining the multiple cooking processes corresponding to each of the recipes, the sequential relationship of the multiple cooking processes, and the duration required for each of the multiple cooking processes; determining the multiple cooking resources corresponding to each of the cooking processes and the duration consumed by each of the multiple cooking resources used by each of the corresponding cooking processes.

For example, if there is a recipe A corresponding to dish A, then you need to parse recipe A to determine the cooking process required to make dish A. Assuming there are two cooking processes X and Y, the order is to execute process X first (which takes 2 minutes) and then execute process Y (which takes 3 minutes). In addition, when executing process X, you need to use two cooking resources, M and N. The time to use cooking resource M is 2 minutes, and the time to use cooking resource N is 1 minute. When executing process Y, you need to use cooking resource M, which takes 3 minutes.

It should be noted that after determining the time required to use each cooking resource in a cooking process, the time of the cooking process can be determined, and specifically, the maximum time of using each cooking resource. For example, when executing process X, two cooking resources M and N are needed, the time to use cooking resource M is 2 minutes, and the time to use cooking resource N is 1 minute, then the time required to execute cooking process X is max(1,2), that is, 2 minutes.

It should be noted that the cooking process includes but is not limited to: boiling, frying, steaming, baking, preparing food, etc. Cooking resources include general resources and special resources, among which general resources include but are not limited to: pots, people, ovens. Special resources include space resources, etc.

It should be noted that after parsing the recipe to determine the recipe information, the recipe information can be classified and identified, for example: n: dish number; p: cooking process number; r: list of cooking resources required for the cooking process. And determine Thres _{npr} (the time required for the nth dish and the pth process to use resource r), n = 1, ..., N; p = 1, ..., P; r = 1, ..., R; and determine Thres _{np} (the time required for the nth dish and the pth process).

It should be noted that Thres _{np} = max{Thres _{npr} , r = 1, ..., R}.

Step S204: determining a target cooking plan corresponding to the multiple recipes from the multiple cooking plans according to the recipe information corresponding to each recipe in the multiple recipes, wherein the target cooking plan is the cooking plan that consumes the least time among the multiple cooking plans.

It should be noted that the target cooking plan includes: the target start time and target end time of each cooking process in the multiple cooking processes corresponding to each recipe, and the target start time and target end time of each cooking resource in the multiple cooking resources corresponding to each cooking process.

That is, assuming that there are two cooking processes X and Y, it is necessary to determine when the two cooking processes X and Y start and end. Assuming that two cooking resources M and N are needed when executing process X, it is necessary to determine the target start time and target end time of using cooking resource M, and the target start time and target end time of using cooking resource N. Similarly, it is also necessary to determine the target start time and target end time of each corresponding cooking resource used by cooking process Y.

Through the above steps, multiple recipes are obtained, and the recipe information corresponding to each of the multiple recipes is determined, and then the target cooking plan corresponding to the multiple recipes is determined from the multiple cooking plans according to the recipe information corresponding to each of the multiple recipes, wherein the target cooking plan is the cooking plan that consumes the least time among the multiple cooking plans. Since the cooking plan that takes the shortest time to cook multiple dishes can be determined according to the recipe information corresponding to each of the multiple recipes, the problem that the user easily wastes a lot of time in the process of cooking multiple dishes is solved, thereby saving cooking time for the user.

In an exemplary embodiment, the above step S204 can be implemented by the following steps S11-S12:

Step S11: determining target decision variables, target constraints and target functions, and establishing a linear programming model through the target decision variables, the target constraints and the target functions;

In an exemplary embodiment, determining the target decision variable includes: determining the start time and the end time of each cooking process among the multiple cooking processes corresponding to each recipe; determining the start time and the end time of each cooking resource among the corresponding multiple cooking resources used by each cooking process among the multiple cooking processes corresponding to each recipe.

That is, the target decision variables include: the start time and the end time of each cooking process in each recipe, and the start time and the end time of each cooking resource used by each cooking process.

Specifically, expressed in mathematical symbols, the decision variables include: S _{np} : the start time of the pth process of the nth dish; E _{np} : the end time of the pth process of the nth dish; S _{npr} : the start time of the pth process of the nth dish using resource r; E _{npr} : the end time of the pth process of the nth dish using resource r.

In an exemplary embodiment, determining the target constraint condition includes: determining a time constraint condition, determining a sequence constraint condition, and determining a resource constraint condition. That is, the target constraint condition includes: a time constraint condition, a sequence constraint condition, and a resource constraint condition.

It should be noted that the time constraint condition includes: the difference between the end time and the start time of each cooking process corresponding to each recipe using each corresponding cooking resource is greater than or equal to the time consumed by each cooking process using each corresponding cooking resource;

Illustratively, the time constraint condition may be expressed by a mathematical formula as E _{npr} −S _{npr} ≥ Thres _{npr} .

It should be noted that the order constraint conditions include: the start time of each cooking resource corresponding to each cooking process corresponding to each recipe is less than or equal to the end time of each cooking resource corresponding to each cooking process corresponding to each recipe, the end time of the N-1th cooking resource corresponding to each cooking process corresponding to each recipe is less than or equal to the end time of the Nth cooking resource corresponding to each cooking process corresponding to each recipe, the start time of each cooking process corresponding to each recipe is less than or equal to the start time of each cooking resource corresponding to each cooking process corresponding to each recipe, and the end time of each cooking resource corresponding to each cooking process corresponding to each recipe is less than or equal to the end time of each cooking process corresponding to each recipe; N is greater than or equal to 2, and N is a positive integer;

Exemplarily, the order constraint condition may be expressed by a mathematical formula as follows: E _{npr} ≥ S _{npr} ≥ 0; E _{npr} ≤ E _{n(p+1)r} ; S _{np} ≤ S _{npr} ≤ E _{npr} ≤ E _{np} .

It should be noted that the resource constraint condition includes: when there are M target cooking resources among a plurality of cooking resources, there are not more than M cooking processes using the target cooking resources in the same time period.

For a better understanding, let's take the cooking resource as an oven. Assuming there is only one oven in the kitchen, it is impossible for the cooking processes of more than two dishes to use the oven at the same time. In mathematical notation, when there are M cooking resources r, [S _{npr} , E _{npr} ] cannot be repeated M times for all np.

In an exemplary embodiment, determining the objective function includes: determining the cooking completion time of the dish corresponding to each recipe, wherein the cooking completion time of the dish corresponding to each recipe is a variable in the linear programming process; and determining the functional relationship of the objective function as the maximum value of the cooking completion time of the dish corresponding to each recipe.

Expressed in mathematical symbols, the objective function T = max{E _{{npr}, {n = 1, ..., Np = 1, ..., Pr = 1, ..., R}} }.

Step S12: using the linear programming model to perform linear programming on the recipe information corresponding to each of the multiple recipes, so as to determine the target cooking plan corresponding to the multiple recipes from the multiple cooking plans.

It should be noted that, when performing linear programming, the target cooking plan is determined by determining the value of the decision variable when the function value of the objective function is minimized.

For better understanding, FIG3 is an overall framework diagram of a method for determining a cooking plan according to an embodiment of the present disclosure, that is, by constructing a linear programming model, and then obtaining a target cooking plan through recipe information corresponding to each recipe in a plurality of recipes.

Obviously, the embodiments described above are only some embodiments of the present disclosure, rather than all embodiments. In order to better understand the above method, the above process is described below in conjunction with the embodiments, but it is not intended to limit the technical solutions of the embodiments of the present disclosure. Specifically:

In an optional embodiment, FIG. 4 is a flow chart (II) of a method for determining a cooking plan according to an embodiment of the present disclosure, specifically:

S1: Get recipes;

For example: Get recipe A, recipe B, and recipe C.

S2: Recipe parsing process; specifically including determining recipe information of the recipe.

S3: Optimization solution; specifically, linear programming is performed according to the recipe information of the recipe to determine the cooking plan.

S4: Output; specifically, output the cooking plan.

It should be noted that in order to better perform linear planning, after obtaining the recipe information, the following conventions are used: n: dish number; p: cooking process number; r: cooking resource list, which includes multiple general resources: such as oven (r1), people (r2), pot (r3), etc.; special resources: r0 represents space resources, which are different from other resources in that they do not need to consider constraints but require time to complete.

When performing linear programming, we want to minimize the total cooking time, where the constraints include:

Time constraint: the time of each process of each dish is greater than a given value (input);

Sequential constraints: The process of each dish needs to be carried out in order;

Resource constraints: Except for special resources, other resources can only be used once at a time.

When performing linear programming, the input includes: Thres _{npr} and the upper limit of cooking time, where Thres _{npr} represents the time required for the p-th cooking process of the n-th dish using cooking resource r, n=1,...,N; p=1,...,P; r=1,..., R is set to 0 if not involved.

It should be noted that Thres _{np} = max{Thres _{npr} , r = 1, ..., R.}, and unnecessary resources Thres _{npr} = 0, wherein Thres _{np} represents the time required for the p-th cooking process of the n-th dish.

It should be noted that when performing optimization solutions, it can be converted into a linear programming problem and then input into the Python ortools solver for solution.

1. Objectives:

min T, T = max{E _{{npr}, {n = 1, ..., Np = 1, ..., Pr = 1, ..., R} }} ;

It should be noted that, given a series of numbers a ₁ , a ₂ , ..., _an, finding the maximum is equivalent to min～T,st.

Σu _i≥1。 in,

Σu _i ≥1.

2. The decision variables (variables that need to be solved later) are: S _{np} : start time of the pth process of the nth dish; E _{np} : end time of the pth process of the nth dish; S _{npr} : start time of the pth process of the nth dish using resource r; E _{npr} : end time of the pth process of the nth dish using resource r.

3. Constraints: Time constraint: E _{npr} – S _{npr} ＞Thres _{npr} ; Order constraint: E _{npr} ≥ _{S {npr}} ≥ 0; E _{npr} ≤ _{E {n(p+1)r}} ; S _{np} ≤ _{S {npr}} ≤ E _{npr} ≤ E _{np} ; Resource constraint: Cooking resources (e.g. ovens) cannot be used simultaneously. In other words, given a resource r: [S _{npr} , E _{npr} ] cannot be repeated for all np.

It should be noted that the interval [a, b][c, d] does not repeat the condition: d-a≤0 or b-c≤0, mathematically expressed as follows: d-a≤0+uM; b-c≤0+(1-u)*Ms; u∈{0,1}.

It should be noted that for r∈{r ₁ , r ₂ , ..., r _R }, given r resources, the above order constraints need to be added to any two processes under r (because the order constraints of processes under the same dish can ensure no duplication, only the repeatability conditions between different dishes need to be considered).

4. Result output

By using the ORTOOLS integer programming optimizer cp_model to solve, we can obtain the start and end times of each process of each dish, and the start and end times of each cooking resource used by each process.

It should be noted that the disclosed embodiment provides a method for automatic coordination of processes between multiple dishes in a recipe recommendation scenario. According to the recommended dishes selected by the user and the time and resource requirements of each process of each dish, a cooking plan that can be completed the fastest can be automatically given. For the user, after entering the recipe, he can get a cooking plan for the dish, saving his own time.

Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present disclosure, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, a disk, or an optical disk), and includes a number of instructions for a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) to execute the methods of each embodiment of the present disclosure.

In this embodiment, a cooking plan determination device is also provided, which is configured to implement the above-mentioned embodiments and preferred implementation modes, and will not be repeated for what has been described. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

FIG5 is a structural block diagram of a device for determining a cooking plan according to an embodiment of the present disclosure, the device comprising:

A first determining module 52 is configured to obtain a plurality of recipes and determine recipe information corresponding to each of the plurality of recipes, wherein each of the recipes corresponds to a dish;

The second determining module 54 is configured to determine a target cooking plan corresponding to the multiple recipes from the multiple cooking plans according to the recipe information corresponding to each recipe in the multiple recipes, wherein the target cooking plan is the cooking plan that consumes the least time among the multiple cooking plans.

Through the above device, multiple recipes are obtained, and the recipe information corresponding to each of the multiple recipes is determined, and then the target cooking plan corresponding to the multiple recipes is determined from the multiple cooking plans according to the recipe information corresponding to each of the multiple recipes, wherein the target cooking plan is the cooking plan that consumes the least time among the multiple cooking plans. Since the cooking plan that takes the shortest time to cook multiple dishes can be determined according to the recipe information corresponding to each of the multiple recipes, the problem that the user easily wastes a lot of time in the process of cooking multiple dishes is solved, thereby saving cooking time for the user.

In an exemplary embodiment, the first determination module 52 is further configured to determine the multiple cooking processes corresponding to each of the recipes, the sequential relationship of the multiple cooking processes, and the duration required for each of the multiple cooking processes; determine the multiple cooking resources corresponding to each of the cooking processes and the duration consumed by each of the multiple cooking resources corresponding to each of the cooking processes.

In an exemplary embodiment, the second determination module 54 is also configured to determine target decision variables, target constraints and objective functions, and establish a linear programming model through the target decision variables, the target constraints and the objective function; use the linear programming model to perform linear programming on the recipe information corresponding to each recipe in the multiple recipes, so as to determine the target cooking plans corresponding to the multiple recipes from the multiple cooking plans.

In an exemplary embodiment, the second determination module 54 is also configured to determine the start time and end time of each cooking process in the multiple cooking processes corresponding to each recipe; and determine the start time and end time of each cooking resource in the multiple cooking resources used by each cooking process in the multiple cooking processes corresponding to each recipe.

In an exemplary embodiment, the second determination module 54 is further configured to determine a time constraint, wherein the time constraint includes: the difference between the end time and the start time of each cooking process corresponding to each recipe using each corresponding cooking resource is greater than or equal to the time consumed by each cooking process using each corresponding cooking resource; determine a sequence constraint, wherein the sequence constraint includes: the start time of each cooking process corresponding to each recipe using each corresponding cooking resource is less than or equal to the end time of each cooking process corresponding to each recipe using each corresponding cooking resource, and the end time of each cooking process corresponding to each recipe using the corresponding N-1th cooking resource is less than or equal to the end time of each cooking process corresponding to each recipe using the corresponding N-1th cooking resource. is equal to the end time of the use of the corresponding Nth cooking resource by each cooking process corresponding to each recipe, the start time of each cooking process corresponding to each recipe is less than or equal to the start time of the use of each cooking resource by each cooking process corresponding to each recipe, and the end time of the use of each cooking resource by each cooking process corresponding to each recipe is less than or equal to the end time of each cooking process corresponding to each recipe; N is greater than or equal to 2, and N is a positive integer; determine the resource constraint condition, wherein the resource constraint condition includes: when there are M target cooking resources among multiple cooking resources, no more than M cooking processes use the target cooking resources in the same time period.

In an exemplary embodiment, the second determination module 54 is further configured to determine the cooking completion time of the dish corresponding to each recipe, wherein the cooking completion time of the dish corresponding to each recipe is a variable in the linear programming process; and the functional relationship of the objective function is determined as the maximum value of the cooking completion time of the dish corresponding to each recipe.

In an exemplary embodiment, the target start time and the target end time of each cooking process in the multiple cooking processes corresponding to each recipe, and the target start time and the target end time of each cooking resource in the multiple cooking resources corresponding to each cooking process.

An embodiment of the present disclosure further provides a computer-readable storage medium, in which a computer program is stored, wherein the computer program is configured to execute the steps of any of the above method embodiments when running.

Optionally, in this embodiment, the storage medium may be configured to store a computer program configured to perform the following steps:

S1, obtaining a plurality of recipes, and determining recipe information corresponding to each of the plurality of recipes, wherein each of the recipes corresponds to a dish;

S2, determining a target cooking plan corresponding to the multiple recipes from multiple cooking plans according to the recipe information corresponding to each recipe in the multiple recipes, wherein the target cooking plan is a cooking plan that consumes the least time among the multiple cooking plans.

According to another aspect of an embodiment of the present disclosure, an electronic device configured to implement the above-mentioned method for determining a cooking plan is also provided. As shown in FIG6 , the electronic device includes a memory 602 and a processor 604. A computer program is stored in the memory 602. The processor 604 is configured to execute the steps in any one of the above-mentioned method embodiments through the computer program.

Optionally, in this embodiment, the electronic device may be located in at least one network device among a plurality of network devices of a computer network.

Alternatively, a person skilled in the art may understand that the structure shown in FIG. 6 is for illustration only, and the electronic device may also be a terminal device such as a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a PDA, and a mobile Internet device (Mobile Internet Devices, MID), PAD, etc. FIG. 6 does not limit the structure of the above-mentioned electronic device. For example, the electronic device may also include more or fewer components (such as a network interface, etc.) than those shown in FIG. 6, or have a configuration different from that shown in FIG. 6.

Among them, the memory 602 can be configured to store software programs and modules, such as program instructions/modules corresponding to the method and device for determining the cooking plan in the embodiment of the present disclosure, and the processor 604 executes various functional applications and data processing by running the software programs and modules stored in the memory 602, that is, to implement the above-mentioned method for determining the cooking plan. The memory 602 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 602 may further include a memory remotely arranged relative to the processor 604, and these remote memories may be connected to the terminal via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof. As an example, the above-mentioned memory 602 may include, as shown in FIG. 6, but is not limited to, the first determination module 52 and the second determination module 54 in the device for determining the cooking plan.

In addition, other module units in the above-mentioned cooking plan determination device may also be included but not limited to, which will not be described in detail in this example.

Optionally, the transmission device 606 is configured to receive or send data via a network. Specific examples of the above-mentioned network may include a wired network and a wireless network. In one example, the transmission device 606 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices and routers via a network cable so as to communicate with the Internet or a local area network. In one example, the transmission device 606 is a radio frequency (RF) module, which is configured to communicate with the Internet wirelessly.

In addition, the electronic device further comprises: a display 608 and a connection bus 610 , wherein the connection bus 610 is configured to connect various module components in the electronic device.

In an exemplary embodiment, the above-mentioned computer-readable storage medium may include, but is not limited to: a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk, and other media that can store computer programs.

For specific examples in this embodiment, reference may be made to the examples described in the above embodiments and exemplary implementation modes, and this embodiment will not be described in detail herein.

An embodiment of the present disclosure further provides an electronic device, including a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.

Optionally, in this embodiment, the processor may be configured to perform the following steps through a computer program:

S1, obtaining a plurality of recipes, and determining recipe information corresponding to each of the plurality of recipes, wherein each of the recipes corresponds to a dish;

S2, determining a target cooking plan corresponding to the multiple recipes from multiple cooking plans according to the recipe information corresponding to each recipe in the multiple recipes, wherein the target cooking plan is a cooking plan that consumes the least time among the multiple cooking plans.

In an exemplary embodiment, the electronic device may further include a transmission device and an input/output device, wherein the transmission device is connected to the processor, and the input/output device is connected to the processor.

For specific examples in this embodiment, reference may be made to the examples described in the above embodiments and exemplary implementation modes, and this embodiment will not be described in detail herein.

Obviously, those skilled in the art should understand that the above-mentioned modules or steps of the present disclosure can be implemented by a general-purpose computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, they can be implemented by a program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be executed in a different order than here, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. In this way, the present disclosure is not limited to any specific combination of hardware and software.

The above is only a preferred embodiment of the present disclosure. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principle of the present disclosure. These improvements and modifications should also be regarded as the protection scope of the present disclosure.

Claims (16)

A method for determining a cooking plan, comprising: Acquire multiple recipes, and determine recipe information corresponding to each recipe in the multiple recipes, wherein each recipe corresponds to a dish; A target cooking plan corresponding to the multiple recipes is determined from multiple cooking plans according to the recipe information corresponding to each recipe in the multiple recipes, wherein the target cooking plan is a cooking plan that consumes the least time among the multiple cooking plans. The method according to claim 1, wherein determining the recipe information corresponding to each recipe in the plurality of recipes comprises: Determine a plurality of cooking processes corresponding to each recipe, a sequence relationship of the plurality of cooking processes, and a duration required for each of the plurality of cooking processes; A plurality of cooking resources corresponding to each cooking process and a duration consumed by each cooking process using each of the corresponding plurality of cooking resources are determined. The method according to claim 1, wherein determining the target cooking plan corresponding to the plurality of recipes from the plurality of cooking plans according to the recipe information corresponding to each of the plurality of recipes comprises: Determine target decision variables, target constraints and target functions, and establish a linear programming model through the target decision variables, the target constraints and the target functions; The linear programming model is used to perform linear programming on recipe information corresponding to each recipe in the multiple recipes, so as to determine a target cooking plan corresponding to the multiple recipes from multiple cooking plans. The method according to claim 3, wherein determining the target decision variable comprises: Determine the start time and the end time of each cooking process in the multiple cooking processes corresponding to each recipe; The start time and the end time of each cooking resource among the corresponding multiple cooking resources used by each cooking process among the multiple cooking processes corresponding to each recipe are determined. The method according to claim 3, wherein determining the target constraint comprises: Determine a time constraint condition, wherein the time constraint condition includes: the difference between the end time and the start time of each cooking process corresponding to each recipe using each corresponding cooking resource is greater than or equal to the time consumed by each cooking process using each corresponding cooking resource; Determine a sequence constraint condition, wherein the sequence constraint condition includes: the start time of each cooking resource corresponding to each cooking process corresponding to each recipe is less than or equal to the end time of each cooking resource corresponding to each cooking process corresponding to each recipe, the end time of each cooking process corresponding to each recipe using the corresponding N-1th cooking resource is less than or equal to the end time of each cooking process corresponding to each recipe using the corresponding Nth cooking resource, the start time of each cooking process corresponding to each recipe is less than or equal to the start time of each cooking resource corresponding to each cooking process corresponding to each recipe, and the end time of each cooking resource corresponding to each cooking process corresponding to each recipe is less than or equal to the end time of each cooking process corresponding to each recipe; N is greater than or equal to 2, and N is a positive integer; A resource constraint condition is determined, wherein the resource constraint condition includes: when there are M target cooking resources among the plurality of cooking resources, no more than M cooking processes use the target cooking resources in the same time period. The method according to claim 3, wherein determining the objective function comprises: Determine the cooking end time of the dish corresponding to each recipe, wherein the cooking end time of the dish corresponding to each recipe is a variable in the linear programming process; The functional relationship of the objective function is determined to obtain the maximum value of the cooking end time of the dish corresponding to each recipe. The method according to any one of claims 1 to 6, wherein the target cooking plan comprises: The target start time and the target end time of each cooking process among the multiple cooking processes corresponding to each recipe, and the target start time and the target end time of each cooking resource among the multiple cooking resources corresponding to each cooking process. A cooking plan determination device, comprising: A first determining module is configured to obtain a plurality of recipes and determine recipe information corresponding to each of the plurality of recipes, wherein each of the recipes corresponds to a dish; The second determination module is configured to determine a target cooking plan corresponding to the multiple recipes from the multiple cooking plans according to the recipe information corresponding to each recipe in the multiple recipes, wherein the target cooking plan is the cooking plan that consumes the least time among the multiple cooking plans. The device according to claim 8, wherein the first determination module is further configured to determine the multiple cooking processes corresponding to each recipe, the sequential relationship of the multiple cooking processes, and the duration required for each of the multiple cooking processes; determine the multiple cooking resources corresponding to each cooking process and the duration consumed by each of the multiple cooking resources corresponding to each cooking process. According to the device according to claim 8, wherein the second determination module is further configured to determine target decision variables, target constraints and objective functions, and establish a linear programming model through the target decision variables, the target constraints and the objective function; use the linear programming model to perform linear programming on the recipe information corresponding to each recipe in the multiple recipes, so as to determine the target cooking plans corresponding to the multiple recipes from the multiple cooking plans. According to the device of claim 10, wherein the second determination module is further configured to determine the start time and the end time of each cooking process among the multiple cooking processes corresponding to each recipe; determine the start time and the end time of each cooking resource among the corresponding multiple cooking resources used by each cooking process among the multiple cooking processes corresponding to each recipe. The device according to claim 10, wherein the second determining module is further configured to determine a time constraint condition, wherein the time constraint condition comprises: the difference between the end time and the start time of each cooking process corresponding to each recipe using each cooking resource is greater than or equal to the time consumed by each cooking process using each cooking resource; and determine a sequence constraint condition, wherein the sequence constraint condition comprises: the start time of each cooking process corresponding to each recipe using each cooking resource is less than or equal to the time consumed by each cooking process corresponding to each recipe using each cooking resource. The end time of the cooking resource, the end time of each cooking process corresponding to each recipe using the corresponding N-1th cooking resource is less than or equal to the end time of each cooking process corresponding to each recipe using the corresponding Nth cooking resource, the start time of each cooking process corresponding to each recipe is less than or equal to the start time of each cooking resource used by each cooking process corresponding to each recipe, and the end time of each cooking process corresponding to each recipe using the corresponding cooking resource is less than or equal to the end time of each cooking process corresponding to each recipe; N is greater than or equal to 2, and N is a positive integer; determine resource constraints, wherein the resource constraints include: when there are M target cooking resources among multiple cooking resources, no more than M cooking processes use the target cooking resources in the same time period. According to the device according to claim 10, wherein the second determination module is further configured to determine the cooking completion time of the dish corresponding to each recipe, wherein the cooking completion time of the dish corresponding to each recipe is a variable in the linear programming process; and the functional relationship of the objective function is determined as the maximum value of the cooking completion time of the dish corresponding to each recipe. The device according to any one of claims 8-13, wherein the target start time and the target end time of each cooking process in the multiple cooking processes corresponding to each recipe, and the target start time and the target end time of each cooking resource in the corresponding multiple cooking resources used by each cooking process. A computer-readable storage medium, comprising a stored program, wherein the program executes the method according to any one of claims 1 to 7 when executed. An electronic device comprises a memory and a processor, wherein the memory stores a computer program, and the processor is configured to execute the method according to any one of claims 1 to 7 through the computer program.

Images