The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Feb. 25, 2025

Filed:

Feb. 08, 2022
Applicant:

Argo Ai, Llc, Pittsburgh, PA (US);

Inventors:

Shubhashree Venkatesh, Fremont, CA (US);

Noe Brito, Cupertino, CA (US);

Yee-Ning Cheng, Sunnyvale, CA (US);

Madhav Chhura, Whittier, CA (US);

Sebastian Dovenor, Pittsburgh, PA (US);

John Drake, Cranbury, NJ (US);

Jonathan Pan, Campbell, CA (US);

Jason Parraga, Fremont, CA (US);

Scott Plant, San Jose, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06Q 10/00 (2023.01); B60W 50/00 (2006.01); B60W 60/00 (2020.01); G01C 21/00 (2006.01); G01C 21/36 (2006.01); G06F 16/28 (2019.01); G06Q 10/0631 (2023.01); G06Q 10/083 (2023.01); G08G 1/00 (2006.01); H04L 9/00 (2022.01); H04L 9/32 (2006.01); H04L 9/40 (2022.01);
U.S. Cl.
CPC ...
G06Q 10/083 (2013.01); B60W 50/0097 (2013.01); B60W 60/0011 (2020.02); B60W 60/00253 (2020.02); B60W 60/00256 (2020.02); G01C 21/36 (2013.01); G01C 21/3841 (2020.08); G01C 21/3856 (2020.08); G01C 21/387 (2020.08); G06F 16/285 (2019.01); G06Q 10/06311 (2013.01); G08G 1/20 (2013.01); H04L 9/3213 (2013.01); H04L 63/0807 (2013.01); H04L 63/0823 (2013.01); H04L 63/101 (2013.01); H04L 63/102 (2013.01); H04L 63/105 (2013.01); H04L 63/107 (2013.01); B60W 2552/00 (2020.02); B60W 2554/00 (2020.02); B60W 2556/40 (2020.02); B60W 2556/45 (2020.02);
Abstract

Methods and systems for estimating a time of arrival for a vehicle at a destination are disclosed. The system will access an adjacency graph comprising nodes and edges. Each node is associated with a unique location in a geographic area in which the vehicle is traveling. Each edge connects two of the nodes and is associated with an estimated travel time between the two connected nodes. The system will select, from the locations in adjacency graph, a first location that is near the vehicle and a second location that is near the destination. The location and destination are each associated with nodes in adjacency graph. The system will calculate a shortest path along the edges in the adjacency graph from the location and destination nodes, and it will calculate an estimated time of arrival for the vehicle as a function of the estimated travel times along the shortest path.


Find Patent Forward Citations

Loading…