IP Library Granted Patent US 12,403,601
Granted Patent B2
US 12,403,601 · App. 18/510,041 · Granted Sep 2, 2025

System and method for queueing robot operations in a warehouse environment based on workflow optimization instructions

Inventors: Tomislav Haus (Donja Stubica, HR); Petra Maẑdin Stepić (Slano, HR); Fran Ante Lončar (Zagreb, HR)
Assignee: Gideon Brothers d.o.o.
B25J9/1664B25J9/161B25J9/162G05D1/2462G05D1/646G05D1/69G06V10/82G05D2105/87G05D2107/70G05D2111/10G05D2111/65
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,403,601
App. No.
18/510,041
Granted
Sep 2, 2025
Kind
B2
Abstract

A system and method are described that provide for queueing robot operations in a warehouse environment based on workflow optimization instructions. In one example of the system/method of the present invention, a control system causes certain robots to queue proximate to one another to permit resources to be obtained, transported, deposited, etc. without the robots crashing into one another (or into other objects), or forming traffic jams. A robot may remain at an assigned queue position at least until another position assigned to the robot becomes available.

Claims (37)

1. A system for regulating robot activity comprising:

one or more central processors;

a plurality of robots, each in communication with at least one of said one or more central processors, and each capable of performing an activity, wherein said activity is at least one selected from the group of obtaining, transporting, and depositing a resource;

wherein each robot of said plurality of robots is capable of traveling to any of a number of different queuing positions;

wherein software instructions of said one or more central processors are capable of causing a first robot of said plurality of robots to travel to a first queuing position of said number of different queuing positions, said first queuing position adjacent to and separate from a second queuing position occupied by a second robot of said plurality of robots; and

wherein software instructions of said one or more central processors are capable of causing said first robot to remain at said first queuing position at least until a subsequent position assigned to said first robot is available.

2. The system of claim 1 , wherein said number of different queuing positions are each located at a warehouse.

3. The system of claim 2 , wherein said first queuing position is at least one selected from the group of a portion of an aisle floor, an area proximate to a storage rack, a staging area, a trailer dock area, an area proximate to an empty pallet dispenser, and an area proximate to a printer station.

4. The system of claim 3 , wherein said first queuing position is located inside a trailer, and said second queuing position is proximate to the trailer.

5. The system of claim 1 , wherein said one or more central processors are configured to associate a storage location of said resource with at least one queuing position.

6. The system of claim 1 , further comprising a queueing manager.

7. The system of claim 1 , wherein said one or more central processors are configured to cause the first robot to travel to the second queuing position after the second robot leaves the second queuing position.

8. The system of claim 1 , wherein said one or more central processors are configured to cause position switching in a queue when a robot of said plurality of robots approaches a previously assigned queuing position.

9. The system of claim 1 , wherein said one or more central processors are configured to cause position switching in a queue when a robot of said plurality of robots is assigned to a queuing position that is already occupied by another robot.

10. The system of claim 1 , wherein said first robot is capable of detecting obstructions.

11. A system for regulating robot activity comprising:

one or more central processors;

a plurality of robots, each in communication with at least one of said one or more central processors, and each capable of performing an activity, wherein said activity is at least one selected from the group of obtaining, transporting, and depositing a resource;

wherein each robot of said plurality of robots is capable of traveling to any of a number of different queuing positions, at least one of which is a portion of an aisle floor;

wherein software instructions of said one or more central processors are capable of causing a first robot of said plurality of robots to travel to a first queuing position of said number of different queuing positions, said first queuing position adjacent to and separate from a second queuing position occupied by a second robot of said plurality of robots;

wherein software instructions of said one or more central processors are capable of causing said first robot to remain at said first queuing position at least until a subsequent position assigned to said first robot is available;

wherein software instructions of said one or more central processors are capable of causing said first robot to travel to said second queuing position after said second robot leaves said second queuing position; and

wherein said one or more central processors are configured to associate a storage location of said resource with at least one queuing position.

12. The system of claim 11 , further comprising a queuing manager.

13. The system of claim 11 , wherein said portion of said aisle floor is located proximate to a storage rack.

14. A method for regulating robot activity comprising:

providing one or more central processors;

providing a plurality of robots, and configuring each to be in communication with at least one processor of said one or more central processors, and to be capable of performing an activity, wherein said activity is at least one selected from the group of obtaining, transporting, and depositing a resource;

configuring each robot of said plurality of robots to be capable of traveling to any of a number of different queuing positions;

configuring software instructions of said one or more central processors to be capable of causing a first robot of said plurality of robots to travel to a first queuing position of said plurality of queuing positions, said first queuing position adjacent to and separate from a second queuing position occupied by a second robot of said plurality of robots; and

configuring software instructions of said one or more central processors to be capable of causing said first robot to remain at said first queuing position at least until a subsequent position assigned to said first robot is available.

15. The method of claim 14 , further comprising providing a queue manager at an aisle of a warehouse.

16. The method of claim 15 , further comprising determining, using the queue manager, which robot of said plurality of robots to assign to a particular queuing position of multiple different queuing positions in said aisle.

17. The method of claim 15 , further comprising causing, using the queue manager, a robot of said plurality of robots to travel to a subsequent queuing position when obstructions prevent said robot from arriving at an initial queuing position.

18. The method of claim 14 , further comprising configuring said one or more central processors to associate a storage location of said resource with at least one queuing position.

19. The method of claim 14 , wherein said first queuing position is at least one selected from the group of a portion of an aisle floor, an area proximate to a storage rack, a staging area, a trailer dock area, an area proximate to an empty pallet dispenser, and an area proximate to a printer station.

20. The method of claim 14 , further comprising configuring said one or more central processors to cause position switching in a queue when a robot of said plurality of robots is assigned to a queuing position that is already occupied by another robot.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 4, 2023
From: HAUS, TOMISLAV; MAZDIN, PETRA; LONCAR, FRAN ANTE
To: GIDEON BROTHERS D.O.O.
Reel/Frame 065755/0029 →
Continuity (2)
Provisional Application 63425333 · Nov 15, 2022
Related Publication 20240157556A1 · May 16, 2024
References Cited (58)
US 5847755A · Wixson · 1998 [cited by examiner]
US 6131809A · Drescher · 2000 [cited by examiner]
US 6264101B1 · Ryan · 2001 [cited by examiner]
US 6607081B2 · Graef · 2003 [cited by examiner]
US 7437279B2 · Agrawala · 2008 [cited by examiner]
US 7991576B2 · Roumeliotis · 2011 [cited by examiner]
US 8577539B1 · Morrison · 2013 [cited by examiner]
US 9607401B2 · Roumeliotis · 2017 [cited by examiner]
US 9741140B2 · Birchfield · 2017 [cited by examiner]
US 9996941B2 · Roumeliotis · 2018 [cited by examiner]
US 10012504B2 · Roumeliotis · 2018 [cited by examiner]
US 10203209B2 · Roumeliotis · 2019 [cited by examiner]
US 10371529B2 · Roumeliotis · 2019 [cited by examiner]
US 10388041B2 · Birchfield · 2019 [cited by examiner]
US 10395116B2 · Todeschini · 2019 [cited by examiner]
US 10466953B2 · Eade · 2019 [cited by examiner]
US 10518879B1 · Zhang · 2019 [cited by examiner]
US 10732647B2 · Shen · 2020 [cited by examiner]
US 10884430B2 · Kumar · 2021 [cited by examiner]
US 10907971B2 · Roumeliotis · 2021 [cited by examiner]
US 10943120B2 · Zahnert · 2021 [cited by examiner]
US 11118911B2 · Flint · 2021 [cited by examiner]
US 11466990B2 · Roumeliotis · 2022 [cited by examiner]
US 11579298B2 · Shin · 2023 [cited by examiner]
US 11874399B2 · Shin · 2024 [cited by examiner]
US 11940277B2 · Roumeliotis · 2024 [cited by examiner]
US 12291407B2 · Molina · 2025 [cited by examiner]
US 20020011431A1 · Graef · 2002 [cited by examiner]
US 20020198632A1 · Breed · 2002 [cited by examiner]
US 20040073360A1 · Foxlin · 2004 [cited by examiner]
US 20040167667A1 · Goncalves · 2004 [cited by examiner]
US 20080033645A1 · Levinson · 2008 [cited by examiner]
US 20080167814A1 · Samarasekera · 2008 [cited by examiner]
US 20080279421A1 · Hamza · 2008 [cited by examiner]
US 20090248304A1 · Roumeliotis · 2009 [cited by examiner]
US 20100110187A1 · von Flotow · 2010 [cited by examiner]
US 20120121161A1 · Eade · 2012 [cited by examiner]
US 20120194517A1 · Izadi · 2012 [cited by examiner]
US 20120306847A1 · Lim · 2012 [cited by examiner]
US 20140206443A1 · Sharp · 2014 [cited by examiner]
US 20140228995A1 · Tanaka · 2014 [cited by examiner]
US 20140316698A1 · Roumeliotis · 2014 [cited by examiner]
US 20150204598A1 · Affleck · 2015 [cited by examiner]
US 20150304634A1 · Karvounis · 2015 [cited by examiner]
US 20190114777A1 · Maity · 2019 [cited by examiner]
US 20190188474A1 · Zahnert · 2019 [cited by examiner]
US 20190377952A1 · Kim · 2019 [cited by examiner]
US 20210142095A1 · Shi · 2021 [cited by applicant]
US 20210323768A1 · Lisso · 2021 [cited by examiner]
US 20230115863A1 · Molina · 2023 [cited by examiner]
US 20230259878A1 · Jacquemart · 2023 [cited by examiner]
US 20240027226A1 · Juette et al. · 2024 [cited by applicant]
US 20240066715A1 · Maegawa · 2024 [cited by examiner]
US 20240094975A1 · Eade et al. · 2024 [cited by applicant]
US 20240135707A1 · Zahnert et al. · 2024 [cited by applicant]
US 20240157556A1 · Haus · 2024 [cited by examiner]
US 20240196912A1 · Mitani · 2024 [cited by examiner]
US 20250139571A1 · Nandakumar · 2025 [cited by examiner]