# US 2023/0409991 A1 · Systems and methods for determining dynamic substitutions to minimize distance

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

- Number: US 2023/0409991 A1
- Document ID: US20230409991A1
- Status: Published application
- Kind: A1
- Application number: 18/241,780
- Filed: 2023-09-01
- Published: 2023-12-21
- Earliest claimed: 2021-01-25
- Assignees: 6 River Systems, LLC
- Applicants: 6 River Systems, LLC
- Inventors: Catherine Jones FRANEY; Nikita IVANOV; Timothy DEIGNAN; Jeffrey CHOATE
- Web page: https://patentgrep.com/patent/US20230409991A1

## CPC

- G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem
- G06Q 10/0875: Itemisation or classification of parts, supplies or services, e.g. bill of materials
- 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

Disclosed are systems and methods for identifying an available product for an unavailable product to minimize a deviation or distance from an original planned pick path. A computer can transmit instructions corresponding to a path through a location where products are stored to collect a plurality of products stored at locations along the path. In response to receiving a notification for a particular product that the particular product is not at the location where it is stored, the computer can modify the path to include a location of a substitute product for the particular product. The computer can identify a substitute product for the particular product based on a distance from a location of the one more available products to a location along the path and determine a revised path with the substitute product. The path can be revised to include the location for the available product.

## Claims

### Claim 1

A computer-implemented method comprising:
transmitting, by a computer, instructions corresponding to a path through a location where products are stored to collect a plurality of products stored at locations along the path;
in response to receiving a notification for a particular product of the plurality of products that the particular product is not at the location where it is stored, modifying the path to include a location of a substitute product for the particular product, the modifying including:
identifying a substitute product for the particular product based on a distance from a location of the one more available products to a location along the path;
determining, by the computer, a revised path with the substitute product; and
transmitting, by the computer, instructions for the revised path to include the location for the available product.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising:
generating, by the computer, the instructions for the path including a plurality of picking tasks, each of the picking tasks including a product identifier and a location for a product to be collected; and
presenting, by the computer for display on an interface, one or more tasks of the plurality of tasks in sequential order based on the instructions for the path.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, further comprising receiving, by the computer from a client application executing on the computer, the notification indicating a status of the product, a product identifier, and a location of a picker along the path.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, further comprising determining, by the computer using an acceptance algorithm, acceptance probability scores for a set of products in a same product class to identify the one or more available products.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein selecting the available product as the substitute further comprises applying, by the computer, a weighted score to each available product of the one or more available products based on the acceptance probability score and the distance.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, further comprising:
receiving, by the computer from a third party server, data indicative of an inventory; and
determining, by the computer based on the data, the one or more available products based on the inventory.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein dynamically determining the revised path further comprises selecting the available product that minimizes a length of the revised path.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein dynamically determining the revised path further comprises adjusting, by the computer, the path to include the available product and the location as a task having a least distance from an unpicked product of the plurality of products along the path.

### Claim 9

A system comprising:
at least one processor configured to:
transmit instructions corresponding to a path through a location where products are stored to collect a plurality of products stored at locations along the path;
in response to receiving a notification for a particular product of the plurality of products that the particular product is not at the location where it is stored, modify the path to include a location of a substitute product for the particular product, the modifying including:
identifying a substitute product for the particular product based on a distance from a location of the one more available products to a location along the path;
determining a revised path with the substitute product; and
transmitting instructions for the revised path to include the location for the available product.

### Claim 10 (depends on 9)

The system of claim 9, wherein the at least one processor is configured to:
generate the instructions for the path including a plurality of picking tasks, each of the picking tasks including a product identifier and a location for a product to be collected; and
present, for display on an interface, one or more tasks of the plurality of tasks in sequential order based on the instructions for the path.

### Claim 11 (depends on 9)

The system of claim 9, wherein the at least one processor is configured to receive, from a client application executing on a computer, the notification indicating a status of the product, a product identifier, and a location of a picker along the path.

### Claim 12 (depends on 9)

The system of claim 9, wherein the at least one processor is configured to determine, using an acceptance algorithm, acceptance probability scores for a set of products in a same product class to identify the one or more available products.

### Claim 13 (depends on 12)

The system of claim 12, wherein the at least one processor is configured to apply a weighted score to each available product of the one or more available products based on the acceptance probability score and the distance.

### Claim 14 (depends on 9)

The system of claim 9, wherein the at least one processor is configured to:
receive, from a third party server, data indicative of an inventory; and
determine, based on the data, the one or more available products based on the inventory.

### Claim 15 (depends on 9)

The system of claim 9, wherein the at least one processor is configured to select the available product that minimizes a length of the revised path.

### Claim 16 (depends on 9)

The system of claim 9, wherein the at least one processor is configured to adjust the path to include the available product and the location as a task having a least distance from an unpicked product of the plurality of products along the path.

### Claim 17

A non-transitory computer readable medium storing instructions when executed by one or more processors cause the one or more processors to:
transmit instructions corresponding to a path through a location where products are stored to collect a plurality of products stored at locations along the path;
in response to receiving a notification for a particular product of the plurality of products that the particular product is not at the location where it is stored, modify the path to include a location of a substitute product for the particular product, the modifying including:
identifying a substitute product for the particular product based on a distance from a location of the one more available products to a location along the path;
determining a revised path with the substitute product; and
transmitting instructions for the revised path to include the location for the available product.

### Claim 18 (depends on 17)

The non-transitory computer readable medium of claim 17, further comprising instructions when executed by the one or more processors further cause the one or more processors to:
generate the instructions for the path including a plurality of picking tasks, each of the picking tasks including a product identifier and a location for a product to be collected; and
present, for display on an interface, one or more tasks of the plurality of tasks in sequential order based on the instructions for the path.

### Claim 19 (depends on 17)

The non-transitory computer readable medium of claim 17, further comprising instructions when executed by the one or more processors further cause the one or more processors to determine, using an acceptance algorithm, acceptance probability scores for a set of products in a same product class to identify the one or more available products.

### Claim 20 (depends on 19)

The non-transitory computer readable medium of claim 19, further comprising instructions when executed by the one or more processors further cause the one or more processors to apply a weighted score to each available product of the one or more available products based on the acceptance probability score and the distance.
