# US 2026/0097518 A1 · Robotic kitchen scheduling system for cooking multiple food items in parallel in a commercial kitchen and related methods

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0097518 A1
- Document ID: US20260097518A1
- Status: Published application
- Kind: A1
- Application number: 19/344,066
- Filed: 2025-09-29
- Published: 2026-04-09
- Earliest claimed: 2024-10-05
- Assignees: Miso Robotics, Inc.
- Applicants: Miso Robotics, Inc.
- Inventors: Nicholas Ardavin; Zachary Zweig Vinegar; Bachir Kharraja
- Web page: https://patentgrep.com/patent/US20260097518A1

## CPC

- B25J 11/0045: {Manipulators used in the food industry}
- A47J 36/32: Time-controlled igniting mechanisms or alarm devices
- A47J 37/1219: {with means for lowering or raising the frying basket}
- A47J 37/1228: {Automatic machines for frying and dispensing metered amounts of food}
- A47J 37/1266: {Control devices, e.g. to control temperature, level or quality of the frying liquid}
- B25J 15/0019: {End effectors other than grippers}
- B25J 19/023: {including video camera means}
- B25J: MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES ({manipulators specially adapted for use in surgery A61B34/70; manipulators used in cleaning hollow articles B08B9/04}; manipulators associated with rolling mills B21B39/20; manipulators associated with forging machines B21J13/10; {manipulators associated with picking-up and placing mechanisms B23P19/007}; means for holding wheels or parts thereof B60B30/00; {vehicles with ground-engaging propulsion means, e.g. walking members B62D57/02, B62D57/032; devices for picking-up and depositing articles or materials between conveyors B65G47/90, B65G47/91; manipulators with gripping or holding means for transferring packages B65H67/065}; cranes B66C; {manipulators used in the protection or supervision of pipe-line installations F17D5/00; walking equipment adapted for nuclear steam-generators F22B37/006}; manipulators specially adapted for, or associated with, nuclear reactors G21C; {apparatus used for handling wafers during manufacture or treatment of semiconductor H10P72/50})
- A47J: KITCHEN EQUIPMENT; COFFEE MILLS; SPICE MILLS; APPARATUS FOR MAKING BEVERAGES

## Abstract

An automated food preparation system includes a robotic arm and a plurality of functional stations for dispensing raw food to a bin, transferring the raw food from the bin to a fry basket, frying the raw food, and transferring the cooked food to a receiving pan. The system is programmed and operable to receive multiple orders, and compute a schedule based on applying a set of heuristic rules, and if more than one option is available for a food preparation step, to simulate the options and apply the option that would result in reducing overcooking lateness. Related methods are described.

## Claims

### Claim 1

An automated food preparation system for cooking raw food comprising:
an enclosure defining a robot workspace;
a robotic arm and gripper arranged within the robot workspace;
a plurality of functional stations comprising:
a dispensing station for dispensing raw food into a basin within the enclosure;
a food transfer station comprising the basin and arranged within the enclosure to receive the raw food from the dispensing station, and operable to lift the basin, and to transfer the raw food from the basin to a fry basket held by the gripper of the robotic arm;
a fry station arranged within the enclosure and comprising at least one fryer slot for submerging a fry basket of raw food, and at least one unsubmerged hanger slot; and
a computer comprising:
a state manager module for maintaining the system state;
a scheduling module programmed and operable to:
receive one or more orders for cooked food;
compute a schedule to control actions of the plurality of functional stations to transfer the raw food to the fry basket, move the fry basket into a fryer slot and fry the raw food, move the fry basket into a hanger slot, dump the cooked food to an egress area for transferring the cooked food from inside the enclosure to outside the enclosure;
send the schedule to each of the plurality of functional stations for execution; and
wherein the scheduling module computes the schedule based on applying a set predetermined heuristic rules and, where more than one option exists for determining an action, the scheduling module applies a predictor model to predict a cost for each option, and selects an optimal option corresponding to reducing the cost; and
converting a simulated system state event history into the schedule.

### Claim 2 (depends on 1)

The system of claim 1, wherein the cost is overcooking lateness.

### Claim 3 (depends on 2)

The system of claim 2, wherein the cost is a weighted sum of overcooking lateness for multiple individual orders.

### Claim 4 (depends on 1)

The system of claim 1, wherein the predetermined heuristic rules are applied for scheduling actions comprising: transferring raw food to the fry basket from the elevator basin, actions for a basket of cooked food, and actions for a basket of uncooked food.

### Claim 5 (depends on 1)

The system of claim 1, wherein the predictor model comprises the following steps:
computing overcooking lateness for a set of predetermined default actions (tc);
computing overcooking lateness for each alternative option (t1, t2, t3, . . . tn); and
selecting for the schedule a behavior or sequence of behaviors from the set of predetermined default actions or the alternative option having the least overcooking lateness.

### Claim 6 (depends on 5)

The system of claim 5, wherein the predictor model is applied when the system state comprises at least one of: robot arm gripper has an empty basket; and when the robot arm gripper is not holding a basket.

### Claim 7 (depends on 6)

The system of claim 6, wherein the predictor model is only applied when the system state comprises: robot arm gripper has an empty basket; and when the robot arm gripper is not holding a basket.

### Claim 8 (depends on 1)

The system of claim 1, further comprising an auto-drawer station arranged within the enclosure comprising at least one drawer movable from a retracted first configuration within the enclosure to an extended second configuration through an ingress window outside of the enclosure, and wherein the at least one drawer and ingress window are arranged, sized and operable to transfer a fry basket between a human outside of the enclosure and the robotic arm inside of the enclosure without the human or robotic arm penetrating a boundary defined by the enclosure, and optionally, further comprising a light curtain or another safety system to detect when the drawer is in the second configuration or when the ingress window is penetrated by an object.

### Claim 9 (depends on 8)

The system of claim 8, further comprising at least one camera arranged to obtain image data of any contents in the fry basket in the retracted configuration.

### Claim 10 (depends on 9)

The system of claim 9, wherein the computer system is further programmed and operable to detect and classify a food item based on the image data, and wherein the computer system is programmed and operable to generate an order based on the food item classified from the perception module.

### Claim 11

A method for automatically cooking raw food comprising:
receiving one or more orders;
computing a schedule to control actions of a plurality of functional stations to transfer the raw food to a fry basket, move the fry basket into a fryer slot and fry the raw food, move the fry basket into a hanger slot, dump the cooked food to an egress area;
sending the schedule to each of the plurality of functional stations for execution; and
wherein the computing a schedule comprises:
applying a set of predetermined heuristic rules;
determining whether more than one option exists based on a simulated system state, and where more than one option exists, predicting a cost for each option, and selecting an optimal option corresponding to reducing the cost; and
converting a simulated system state event history into the schedule.

### Claim 12 (depends on 11)

The method of claim 11, wherein the cost is overcooking lateness.

### Claim 13 (depends on 12)

The method of claim 12, wherein the cost is a weighted sum of overcooking lateness for multiple individual orders.

### Claim 14 (depends on 11)

The method of claim 11, wherein the predetermined heuristic rules are applied for scheduling actions comprising: transferring raw food to the fry basket from the elevator basin, actions for a basket of cooked food, and actions for a basket of uncooked food.

### Claim 15 (depends on 11)

The method of claim 11, wherein the predicting comprises the following steps:
computing overcooking lateness for a set of predetermined default actions (tc);
computing overcooking lateness for each alternative option (t1, t2, t3, . . . tn).

### Claim 16 (depends on 15)

The method of claim 15, wherein the selecting comprises selecting the set of predetermined default actions or the alternative option having the least overcooking lateness.

### Claim 17 (depends on 16)

The method of claim 16, wherein the predicting is applied when the system state comprises at least one of: robot arm gripper has an empty basket; and when the robot arm gripper is not holding a basket.

### Claim 18 (depends on 17)

The method of claim 17, wherein the predicting is only applied when the system state comprises: robot arm gripper has an empty basket; and when the robot arm gripper is not holding a basket.

### Claim 19 (depends on 11)

The method of claim 11, further comprising:
obtaining image data of any contents in the fry basket in a drawer of an auto-drawer station when the drawer is in a retracted configuration;
detecting and classifying a food item in the drawer based on the image data; and
generating an order based on the classified food item.

### Claim 20

A method for automatically cooking raw food comprising:
receiving one or more orders;
updating the actual system state based on the received orders;
computing a schedule to control actions of a plurality of functional stations;
sending the schedule to each of the plurality of functional stations for execution; and
wherein the computing the schedule comprises:
creating a simulated system state;
determining whether more than one option exists based on the simulated system state, and where more than one option exists, predicting a cost for each option, and selecting an optimal option corresponding to reducing the cost;
updating the simulated system state based on the optimal option;
converting a simulated system state event history into the schedule.
