# US 2026/0065223 A1 · System and Method of Reinforced Machine-Learning Retail Allocation

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

- Number: US 2026/0065223 A1
- Document ID: US20260065223A1
- Status: Published application
- Kind: A1
- Application number: 19/382,965
- Filed: 2025-11-07
- Published: 2026-03-05
- Earliest claimed: 2019-12-13
- Assignees: Blue Yonder Group, Inc.
- Applicants: Blue Yonder Group, Inc.
- Inventors: Ganesh Muthusamy; Sudhakar Jayapal; Karthik Kondapaneni; Rajneesh Kumar Agrawal
- Web page: https://patentgrep.com/patent/US20260065223A1

## CPC

- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06N 3/006: based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
- G06N 5/04: Inference or reasoning models
- G06N 20/00: Machine learning
- G06Q 10/06313: {Resource planning in a project environment}
- G06Q 10/067: Enterprise or organisation modelling
- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q 10/0872: {using inventory planning}
- G06Q 30/0202: Market predictions or forecasting for commercial activities
- G06Q 10/08726: {for replenishment processing, procedures, or recommendations using forecasting or optimisation}
- 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
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A system and method for allocation planning comprise a server comprising a processor and memory and configured to calculate a reward for a historical allocation of a product to one or more stores associated with a retailer. Embodiments include simulating what-if scenarios for the historical allocation to identify an allocation having a greater reward than the historical allocation and allocating a quantity of a product for a current allocation to the one or more stores based, at least in part, on a distance calculation of one or more independent variables for the historical allocation and the current allocation and the identified allocation having the greater reward then the historical allocation.

## Claims

### Claim 1

A system for modelling allocation of products as a decision process, comprising:
a server, comprising a processor and memory, the server further configured to:
create a state space comprising a set of states and a set of actions;
define transitions between states within the set of states;
model a reward-penalty function as the decision process, wherein the decision process comprises a reward or penalty for taking an action between each of the states of the set of states;
determine an initial state representing on-hand inventory;
calculate a reward or a penalty for each action at each of the states in a supply chain history to determine an amount of an allocation that would have maximized a profit given a particular state of inventory; and
send instructions over a network to automated warehousing equipment of one or more distribution centers to automatically retrieve a quantity of a product associated with the amount of the allocation.

### Claim 2 (depends on 1)

The system of claim 1, wherein the set of states comprises an amount of stock of the product at a particular time for one or more inventory locations.

### Claim 3 (depends on 1)

The system of claim 1, wherein the reward is represented by Bellman's equation.

### Claim 4 (depends on 1)

The system of claim 1, wherein the reward is determined to be a maximum profit that can be made at a current action as a sum of a maximum reward for a current state and a cumulative weighted sum of maximum rewards for previous states.

### Claim 5 (depends on 1)

The system of claim 1, wherein each of the states represent a state of inventory at different time points in an allocation cycle.

### Claim 6 (depends on 1)

The system of claim 1, wherein the decision process comprises an allocation horizon.

### Claim 7 (depends on 1)

The system of claim 1, wherein the reward-penalty function is based on one or more of: product margin, inventory carrying cost and opportunity cost.

### Claim 8

A computer-implemented method for modelling allocation of products as a decision process, comprising:
creating, by a computer comprising a processor and memory, a state space comprising a set of states and a set of actions;
defining, by the computer, transitions between states within the set of states;
modelling, by the computer, a reward-penalty function as the decision process, wherein the decision process comprises a reward or penalty for taking an action between each of the states of the set of states;
determining, by the computer, an initial state representing on-hand inventory;
calculating, by the computer, a reward or a penalty for each action at each of the states in a supply chain history to determine an amount of an allocation that would have maximized a profit given a particular state of inventory; and
sending, by the computer, instructions over a network to automated warehousing equipment of one or more distribution centers to automatically retrieve a quantity of a product associated with the amount of the allocation.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, wherein the set of states comprises an amount of stock of the product at a particular time for one or more inventory locations.

### Claim 10 (depends on 8)

The computer-implemented method of claim 8, wherein the reward is represented by Bellman's equation.

### Claim 11 (depends on 8)

The computer-implemented method of claim 8, wherein the reward is determined to be a maximum profit that can be made at a current action as a sum of a maximum reward for a current state and a cumulative weighted sum of maximum rewards for previous states.

### Claim 12 (depends on 8)

The computer-implemented method of claim 8, wherein each of the states represent a state of inventory at different time points in an allocation cycle.

### Claim 13 (depends on 8)

The computer-implemented method of claim 8, wherein the decision process comprises an allocation horizon.

### Claim 14 (depends on 8)

The computer-implemented method of claim 8, wherein the reward-penalty function is based on one or more of: product margin, inventory carrying cost and opportunity cost.

### Claim 15

A non-transitory computer-readable medium embodied with software for modelling allocation of products as a decision process, the software when executed:
creates a state space comprising a set of states and a set of actions;
defines transitions between states within the set of states;
models a reward-penalty function as the decision process, wherein the decision process comprises a reward or penalty for taking an action between each of the states of the set of states;
determines an initial state representing on-hand inventory;
calculates a reward or a penalty for each action at each of the states in a supply chain history to determine an amount of an allocation that would have maximized a profit given a particular state of inventory; and
sends instructions over a network to automated warehousing equipment of one or more distribution centers to automatically retrieve a quantity of a product associated with the amount of the allocation.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the set of states comprises an amount of stock of the product at a particular time for one or more inventory locations.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the reward is represented by Bellman's equation.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the reward is determined to be a maximum profit that can be made at a current action as a sum of a maximum reward for a current state and a cumulative weighted sum of maximum rewards for previous states.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein each of the states represent a state of inventory at different time points in an allocation cycle.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the decision process comprises an allocation horizon.
