IP Library › Granted Patent US 12,736,968
Granted Patent B2
US 12,736,968 · App. 18/982,730 · Granted Sep 15, 2026

Robotic vehicle navigaton system and method

Inventors: James M. Serstad (Orlando, FL); Michael C. Futch (Orlando, FL); Shenghong Zhang (Orlando, FL)
Assignee: TOMPKINS ROBOTICS, INC.
G05D1/0289G05D1/0214G05D1/617G05D1/693
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,736,968
App. No.
18/982,730
Granted
Sep 15, 2026
Kind
B2
Abstract

System is configured to receive article information corresponding to articles to be transported by computer-controlled vehicles, the articles comprising a first article and a second article, each having a maximum article dimension. System is also configured to assign travel routes about a grid comprising grid cells for the vehicles to travel thereon. The travel route of a first vehicle carrying the first article includes a turning maneuver at a first grid cell. System is configured to control the turning maneuver of the first vehicle in the first grid cell such that there is no contact between the first article carried on the first vehicle with a second article carried on a second vehicle present in a second grid cell that is adjacent to the first grid cell when the first vehicle is undertaking the turning maneuver.

Claims (28)

1 . A method comprising:

assigning, by a routing engine, travel routes about a grid comprising grid cells for a first computer-controlled vehicle such that during a period when the first computer-controlled vehicle is undertaking a turning maneuver in a first grid cell,

either a second computer-controlled vehicle does not undertake a turning maneuver in a second grid cell that is adjacent to the first grid cell,

or the second computer-controlled vehicle is not present in the second grid cell that is adjacent to the first grid cell; and

transporting, by the first computer-controlled vehicle, of a first article.

2 . The method of claim 1 , further comprising: transporting of a second article on the second computer-controlled vehicle.

3 . The method of claim 2 , further comprising: receiving, at a control server, article information corresponding to the first article and the second article.

4 . The method of claim 2 , further comprising: controlling, by the routing engine, the turning maneuver of the first computer-controlled vehicle in the first grid cell such that there is no contact between the first article carried on the first computer-controlled vehicle with the second article carried on a second computer-controlled vehicle present in a second grid cell that is adjacent to the first grid cell when the first computer-controlled vehicle is undertaking the turning maneuver.

5 . The method of claim 2 , wherein the first article and a second article each have a first article dimension, wherein the first article dimension exceeds a predetermined range such that a turn radius of the first article carried on the first computer-controlled vehicle overlaps the turn radius of the second article carried on the second computer-controlled vehicle during simultaneous turning maneuvers of the first and second computer-controlled vehicles in the first and second grid cells respectively.

6 . The method of claim 5 , wherein the first article dimension comprises a first length L and a first width W, wherein C is a required clearance distance between the first and second articles when both the first and second computer-controlled vehicles are undertaking the turning maneuvers simultaneously, wherein a length G of each grid cell is calculated such that G≥V√(W{circumflex over ( )}2+L{circumflex over ( )}2)/2+L/2+C.

7 . The method of claim 6 , wherein the turning maneuver by the first computer-controlled vehicle comprises a turn diameter that equals a length of a diagonal D formed by the first length L and the first width W.

8 . The method of claim 2 , further comprising: assigning, by the routing engine, a value of C, wherein C is a required clearance distance between the first and second articles when both the first and second computer-controlled vehicles are undertaking the turning maneuvers simultaneously, such that C≥1 mm.

9 . The method of claim 5 , further comprising: calculating, by the routing engine, an area for each of the grid cells that the grid is comprised of based on the first article dimension.

10 . The method of claim 5 , further comprising: providing, to the routing engine, an area for each of the grid cells that the grid is comprised of based on the first article dimension.

11 . The method of claim 5 , wherein the first article dimension comprises at least one of a: first length, first width, first area, and first volume.

12 . The method of claim 2 , further comprising: calculating a minimum area of each of the grid cells that the grid is comprised of such that there is no contact between the first article and the second article when the first computer-controlled vehicle is undertaking the turning maneuver.

13 . The method of claim 1 , further comprising: directing, by the routing engine, a plurality of computer-controlled vehicles to transport a plurality of articles to a plurality of destination containers.

14 . The method of claim 1 , further comprising: controlling, by the routing engine, a travel path of the first computer-controlled vehicle such that the first computer-controlled vehicle does not deviate more than 10 mm of an intended travel path.

15 . The method of claim 1 , wherein the grid cell comprises a polygon shape.

16 . The method of claim 1 , wherein the grid cell comprises a square shape.

17 . The method of claim 1 , wherein the grid cell comprises a rectangle shape.

18 . The method of claim 1 , wherein the turning maneuver by the first computer-controlled vehicle comprises a turn of at least 90-degrees.

19 . The method of claim 1 , wherein the turning maneuver by the first computer-controlled vehicle comprises a turn of at least 180-degrees.

20 . A system comprising a server, the server comprising a memory, a processor, and a routing engine, the system configured to:

assign, by the routing engine, travel routes about a grid comprising grid cells for a first computer-controlled vehicle such that during a period when the first computer-controlled vehicle is undertaking a turning maneuver in a first grid cell,

either a second computer-controlled vehicle does not undertake a turning maneuver in a second grid cell that is adjacent to the first grid cell,

or the second computer-controlled vehicle is not present in the second grid cell that is adjacent to the first grid cell; and

transport, by the first computer-controlled vehicle, of an article.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 9, 2025
From: FUTCH, MICHAEL C.; SERSTAD, JAMES M.; ZHANG, SHENGHONG
To: TOMPKINS ROBOTICS, INC.
Reel/Frame 070780/0499 →
Continuity (4)
Continuation 18598246 · Mar 7, 2024
Continuation 18351035 · Jul 12, 2023
Continuation 18050283 · Oct 27, 2022
Related Publication 20250117011A1 · Apr 10, 2025
References Cited (18)
US 3635322A · Raudat et al. · 1972 [cited by applicant]
US 6082523A · Weeks · 2000 [cited by applicant]
US 11720122B1 · Serstad et al. · 2023 [cited by applicant]
US 20140368330A1 · Watanabe · 2014 [cited by examiner]
US 20160297072A1 · Williams et al. · 2016 [cited by applicant]
US 20180141211A1 · Wellman et al. · 2018 [cited by applicant]
US 20180335782A1 · Xu et al. · 2018 [cited by applicant]
US 20180357601A1 · Jacobus et al. · 2018 [cited by applicant]
US 20190064785A1 · Wurman et al. · 2019 [cited by applicant]
US 20200101971A1 · Fan · 2020 [cited by examiner]
US 20210114062A1 · Liu et al. · 2021 [cited by applicant]
US 20210138649A1 · Baer et al. · 2021 [cited by applicant]
US 20220024691A1 · Serstad · 2022 [cited by examiner]
US 20220100184A1 · Natarajan et al. · 2022 [cited by applicant]
US 20220194248A1 · Kalouche · 2022 [cited by applicant]
US 20230019883A1 · Austrheim et al. · 2023 [cited by applicant]
US 20240255966A1 · Segall et al. · 2024 [cited by applicant]
SU 1131487A1 · 1984 [cited by examiner]