patent.fyi
Applications  /  US 2026/0356589
United States Patent Application Publication

US 2026/0356589 A1

Published
Nov 12, 2026
Filed
Mar 4, 2024
Earliest date on the face
Mar 7, 2023
Classification
B65G 1/1378
First published here
Nov 20, 2026

Generated automatically. Not reviewed by a person. Not legal advice or an opinion.

Section 1 · machine-generated

What if?

Questions about how individual parts of claim 1 might be changed. A question may describe something different from what the claim language recites, or a version of it; no view is offered on which.

1.1Batch tasks by destination

What ifWhat if the controller groups transport tasks by delivery workstation and release window?
Claim language“grouping the plurality of tasks to be transported based on candidate aisles”

A dispatch table indexes each batch by the required workstation and a five-minute release window. The route planner reads the pickup coordinates from each task and builds a route across the storage area for the selected batch.

1.2Aisle selection by token

What ifWhat if a rotating token selects an aisle through binary readiness checks without calculating aisle scores?
Claim language“score calculation on the candidate aisles”

The controller keeps a fixed cyclic list of aisle identifiers and advances a cursor after each assignment. It grants the first aisle in that sequence with a pending pickup, a route reservation, and an available workstation buffer slot.

1.3Assign pairs from requests

What ifWhat if workstation requests and pickup timestamps determine the workstation and seed aisle?
Claim language“based on the candidate aisle scores”

A workstation controller sends a request with its identifier when an inbound buffer slot opens. The dispatcher serves requests in arrival order and uses the storage location of the oldest pending pickup for the requesting workstation to set the seed aisle.

1.3Route across all pickup locations

What ifWhat if the dispatcher selects a workstation and plans a route across all required pickup locations without designating a seed aisle?
Claim language“a seed aisle corresponding to the target workstation”

The route planner starts at the robot's current position and takes all pickup coordinates and the workstation as inputs. It orders the stops using travel times on the warehouse path graph and ends the route at the workstation.

1.4Move containers on fixed conveyors

What ifWhat if fixed conveyors carry containers from aisle transfer points to the selected workstation?
Claim language“to a target transport robot”

Powered rollers accept containers from aisle-end transfer platforms, and a reader matches each container identifier to its destination record. A conveyor controller actuates diverters along the route and stops the final roller zone when the workstation buffer is full.

Section 2 · machine-generated

Variations

Further arrangements of the same subject matter, described here as of the publication date at the foot of this page.

Other field of use

Specimen totes in a hospital laboratory

A transport controller groups sealed specimen tote tasks by staging aisle and pairs each aisle with laboratory intake stations equipped for the required assay and tote temperature range. The controller scores each pair by the number of totes projected to arrive before their handoff deadlines, using predicted trip and intake wait times. It selects the highest-scoring pair and sends its tote pickup and delivery tasks to a transport robot with an insulated compartment.

Component substitution

Tugger with a detachable tote cart

An autonomous tugger with a powered hitch and a detachable tote cart serves as the target transport robot. The dispatcher groups tote moves by aisle and scores each aisle and workstation pair using the estimated time to collect a loaded cart, reach the workstation, and exchange carts. It sends the selected cart pickup and delivery tasks to the tugger, which verifies hitch engagement before towing and releases the cart after a dock sensor confirms placement.

Parameter or scale variation

Five second dispatch for twelve aisles

A controller serves 12 storage aisles and 4 workstations and groups pending tasks by aisle in 5-second dispatch cycles. Each cycle ranks eligible aisle and workstation pairs by the sum of the waiting times of their two oldest tasks, using one task when only one is pending. The controller assigns up to two tasks from the highest-ranked pair to a two-bay robot and reserves both tasks in one transaction before transmission.

Combination with existing systems

Dispatch with a conveyor merge controller

Each workstation feeds a shared conveyor through a metered merge controlled by a programmable logic controller. The robot dispatcher groups tasks by source aisle and scores each aisle and workstation pair using the predicted robot arrival time and the next available merge slot. It reserves a slot for the selected pair before sending the batch to a robot, and the merge controller releases each tote when a photoelectric sensor detects an open gap.

Automated or data-driven variant

Travel time estimates from fleet logs

A fleet controller records pickup completion times, workstation arrival times, route lengths, and the number of robots in each travel zone at dispatch. A gradient-boosted regression tree estimates pickup-to-arrival time for each feasible aisle and workstation pair after the controller groups pending tasks by aisle. The controller ranks pairs by estimated arrival time plus the expected workstation wait, then sends the selected pair's tasks to an available robot.

Aisle scoring with live occupancy sensors

Overhead lidar units report occupancy for shared travel segments, and a route map links each aisle and workstation pair to its available paths. After grouping tasks by pickup aisle, the dispatcher excludes occupied segments from path selection and scores each reachable pair by the shortest remaining path time. It selects the pair with the lowest path time, reserves the route, and sends the pair's tasks to a transport robot.

Specific version of a part

Terminal guides manual transport

The terminal displays container identifiers, pickup locations, and the destination workstation. The worker scans each container at pickup, pushes the cart to the workstation, and records delivery with a second scan.

Index tasks by aisle

The controller maps each pickup location to an aisle identifier using a storage-location table and appends the task identifier to that aisle's group. Each group also stores a list of candidate workstation identifiers drawn from a table of permitted aisle-to-workstation routes.

Score expected batch duration

For each candidate workstation and aisle pair, the controller reads the grouped pickup locations and estimates driving time, container loading time, and waiting time at the workstation buffer. It adds the estimates and stores the total in seconds as the pair's aisle score.

Select the lowest duration

The dispatcher scans the candidate workstation and aisle pairs in ascending order of their duration scores. It selects the first pair with an available workstation buffer slot and uses the pair's aisle as the seed aisle.

Transmit a confirmed task batch

The dispatcher sends the selected robot a batch identifier, the container identifiers and pickup coordinates for the selected workstation and seed aisle, and the workstation drop-off coordinate. The robot stores the batch, acknowledges its identifier, and executes the pickup and delivery sequence.

Section 3 · quoted from USPTO records

Other work

Passages reproduced word for word from two earlier-published U.S. patent documents, placed beside the language of claim 1. No characterization is offered. Each passage is marked A or B for the document it comes from; ¶ numbers are the paragraph numbers in the USPTO’s published full text of that document.

Document AUS 10,040,632 B2
Published
Aug 7, 2018
Filed
Jan 31, 2017
Class
B65G 1/1378
Document BUS 2023/0022823 A1
Published
Jan 26, 2023
Filed
Jul 14, 2022
Class
G01C 21/3469
Document CUS 2021/0183250 A1
Published
Jun 17, 2021
Filed
Nov 17, 2020
Class
G08G 1/202
Claim 1
Document A
Document B
1.1in response to acquiring a plurality of tasks to be transported, grouping the plurality of tasks to be transported based on candidate aisles to obtain grouping results corresponding to the candidate aisles, wherein the grouping results include tasks to be transported corresponding to the candidate aisles and candidate workstations corresponding to the candidate aisles;
1.2performing, based on the grouping results, score calculation on the candidate aisles corresponding to the candidate workstations to obtain candidate aisle scores corresponding to the candidate workstations;
1.3determining, based on the candidate aisle scores corresponding to the candidate workstations, a target workstation and a seed aisle corresponding to the target workstation from the candidate workstations and the candidate aisles corresponding to the candidate workstations; and
1.4sending the tasks to be transported corresponding to the target workstation and the seed aisle to a target transport robot, so that the target transport robot performs container transportation according to the tasks to be transported.
For example, on a typical round trip starting from a pick location inside the storage rack, the R-Bot picks the assigned P-Tote off the rack, travels West to and up the ramp and onto the guideway, turns South onto the guideway, travels to and through the Picking Workstation, returns to the interconnect guideway traveling North, turns into an aisle and go down the ramp to the target level, drives East down the aisle to the assigned put-away location, and finally puts the P-Tot
A · US 10,040,632 B2 · ¶ 51
In this case, at the point in time when processor 210 determines that vehicle 1 as a processing target can be remained as a candidate vehicle (YES in step S20 or YES in step S30), processor 230 may determine this vehicle 1 as a dispatch vehicle and transmit the information indicating traveling route TR to this vehicle 1.
B · US 2023/0022823 A1 · ¶ 106

An empty cell means only that no passage was reproduced there.

Statements in these documents
Conventional operations to fulfill orders for eaches (usually referred to as “each-picking” or “piece-picking”) are generally labor-intensive because they generally apply man-to-goods processes that are not highly automated.
A · US 10,040,632 B2 · ¶ 5
It is an object of the disclosed embodiment to be highly cost-efficient and effective in both domains of each-picking, but to provide design flexibility that allows the configuration to be optimized for the application based on operational metrics.
A · US 10,040,632 B2 · ¶ 7
As a result, the vehicle dispatch efficiency decreases.
B · US 2023/0022823 A1 · ¶ 4
According to the configuration as described above, even when the amount of power storage in the power storage device is low, the vehicle can travel to the destination without requiring charging of the power storage device in the middle of the route from the vehicle dispatch location to the destination after it arrives at the vehicle dispatch location via the vehicle dispatch route.
B · US 2023/0022823 A1 · ¶ 7
Cite aspatent.fyi, US 2026/0356589 A1, claim 1, first published 2026-11-20T04:17:34-05:00, https://patent.fyi/US20260356589/, SHA-256 80a9ed7619a5407d678b4015ad42e6c2983fb48c4c2598487fc810d2e150c9b5
First published
Permanent addresshttps://patent.fyi/US20260356589/
Content fingerprint (SHA-256)80a9ed7619a5407d678b4015ad42e6c2983fb48c4c2598487fc810d2e150c9b5
Methodv2026-11-18.2 · automated, not reviewed by a person
Correctionscorrections@patent.fyi