# US 2025/0145376 A1 · Storage and retrieval system

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

- Number: US 2025/0145376 A1
- Document ID: US20250145376A1
- Status: Published application
- Kind: A1
- Application number: 18/832,255
- Filed: 2023-01-23
- Published: 2025-05-08
- Earliest claimed: 2022-01-25
- Assignees: Ocado Innovation Limited
- Applicants: Ocado Innovation Limited
- Inventors: Tim STEINER
- Web page: https://patentgrep.com/patent/US20250145376A1

## CPC

- B65G 1/1373: {for fulfilling orders in warehouses}
- G06Q 10/0835: Relationships between shipper or supplier and carriers
- B65G 1/0464: {with access from above}
- G06Q 10/021: {Re-booking existing reservations}
- G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem
- G06Q 10/0631: Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q 10/083: Shipping
- G06Q 10/0832: Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
- G06Q 10/08355: {Routing methods}
- G06Q 10/08743: {using optimisation of routes}
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- G06Q 10/08741: {by picking of items from inventory for fulfillment}
- B65G: TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS (packaging B65B; handling thin or filamentary materials, e.g. paper sheets or thread, B65H; cranes B66C; portable mobile or lifting or hauling appliances, e.g. hoists, B66D; devices for lifting or lowering goods for loading or unloading purposes, e.g. fork-lift trucks, B66F9/00; emptying bottles, jars, casks, barrels or similar containers, not otherwise provided for, B67C9/00; delivering or transferring liquids B67D; filling or discharging vessels for liquefied, solidified or compressed gases F17C; pipe-line systems for fluids F17D)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

The present disclosure provides a storage and retrieval system which can be operated to efficiently deliver goods, for example groceries, using two different methods. Capacity within one or more delivery vehicles may be assigned to orders placed in advance for later delivery and also for rapid orders for quick delivery.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A system comprising:
a first set of parallel tracks extending in an X-direction;
a second set of parallel tracks extending in a Y-direction transverse to the first set in a substantially horizontal plane, the first set and the second set forming a grid pattern comprising a plurality of grid spaces;
a plurality of stacks of storage containers located beneath the first set and the second set and arranged such that each of the plurality of stacks is located within a footprint of a single grid space of the plurality of grid spaces;
a transporting device configured to move on the first set and second set in the X and Y directions above the plurality of stacks and transport a storage container from the plurality of stacks;
a collecting station configured to receive the storage container transported by the transporting device and transfer an item from the storage container into a container; and
one or more hardware processors programmed to:
for each of a plurality of vehicles:
portion a first portion of a vehicle load capacity for filling by a first method; and
portion a second portion of the vehicle load capacity for filling by a second method.

### Claim 22 (depends on 21)

The system of claim 21, wherein the transporting device has a footprint that occupies only the single grid space.

### Claim 23

A method comprising:
for each of a plurality of vehicles:
portioning, by one or more hardware processors, a first portion of a vehicle load capacity for filling by a first method; and
portioning, by the one or more hardware processors, a second portion of the vehicle load capacity for filling by a second method.

### Claim 24 (depends on 23)

The method of claim 23, further comprising processing, by the one or more hardware processors, first communications made according to the first method prior to a first cut-off time but not after the first cut-off time, the first communications indicating to collect first items.

### Claim 25 (depends on 24)

The method of claim 24, further comprising, subsequent to the first cut-off time, re-portioning, by the one or more hardware processors, a remaining capacity of the first portion of the vehicle load capacity for one of the plurality of vehicles for filling by the second method rather than the first method.

### Claim 26 (depends on 24)

The method of claim 24, further comprising optimizing, by the one or more hardware processors, routes for the plurality of vehicles subsequent to the processing the first communications.

### Claim 27 (depends on 26)

The method of claim 26, further comprising processing, by the one or more hardware processors, second communications made according to the second method prior to a second cut-off time but not after the second cut-off time, the second communications indicating to collect second items.

### Claim 28 (depends on 27)

The method of claim 27, further comprising re-optimizing, by the one or more hardware processors, the routes for the plurality of vehicles subsequent to the processing the second communications.

### Claim 29 (depends on 28)

The method of claim 28, wherein the re-optimizing the routes for the plurality of vehicles is performed based on the second communications.

### Claim 30 (depends on 29)

The method of claim 29, wherein the routes for the plurality of vehicles are re-optimized so that distributions associated with the second communications are assigned to be made during outward portions of the routes.

### Claim 31 (depends on 24)

The method of claim 24, wherein the processing the first communications comprises instructing a plurality of transporting devices to collect the first items from a plurality of stacks of storage containers subsequent to the first cut-off time.

### Claim 32 (depends on 31)

The method of claim 31, wherein the instructing the plurality of transporting devices to collect the first items comprises instructing the plurality of transporting devices to collect the first items prior to a second cut-off time, and further comprising processing, by the one or more hardware processors, second communications made according to the second method prior to a second cut-off time but not after the second cut-off time, the second communications indicating to collect second items.

### Claim 33 (depends on 32)

The method of claim 32, wherein the processing the second communications comprises instructing the plurality of transporting devices to collect the second items from the plurality of stacks of storage containers prior to the second cut-off time.

### Claim 34 (depends on 32)

The method of claim 32, further comprising loading one of the plurality of vehicles with (i) some of the first items based on the portioning the first portion of the vehicle load capacity and (ii) some of the second items based on the portioning the second portion of the vehicle load capacity.

### Claim 35 (depends on 32)

The method of claim 32, further comprising portioning, by the one or more hardware processors, to one of the plurality of vehicles (i) some of the first items based on the portioning the first portion of the vehicle load capacity and (ii) some of the second items based on the portioning the second portion of the vehicle load capacity.

### Claim 36 (depends on 32)

The method of claim 32, further comprising:
subsequent to the first cut-off time, re-portioning, by the one or more hardware processors, a remaining capacity of the first portion of the vehicle load capacity for one of the plurality of vehicles for filling by the second method rather than the first method; and
loading one of the plurality of vehicles with (i) some of the first items based on the portioning the first portion of the vehicle load capacity and (ii) some of the second items based on the portioning the second portion of the vehicle load capacity and the re-portioning the remaining capacity of the first portion of the vehicle load capacity.

### Claim 37 (depends on 32)

The method of claim 32, further comprising:
subsequent to the first cut-off time, re-portioning, by the one or more hardware processors, a remaining capacity of the first portion of the vehicle load capacity for one of the plurality of vehicles for filling by the second method rather than the first method; and
portioning, by the one or more hardware processors, to one of the plurality of vehicles (i) some of the first items based on the portioning the first portion of the vehicle load capacity and (ii) some of the second items based on the portioning the second portion of the vehicle load capacity and the re-portioning the remaining capacity of the first portion of the vehicle load capacity.

### Claim 38 (depends on 23)

The method of claim 23, wherein the second method provides a faster distribution for items collected from a building than the first method.

### Claim 39 (depends on 23)

The method of claim 23, wherein the first method handles first communications, and the second method handles second communications.

### Claim 40 (depends on 23)

Non-transitory physical computer storage comprising computer-executable instructions stored thereon that, when executed by one or more hardware processors, are configured to implement a process comprising the method of claim 23.
