US 12,236,386 B2
System and method for estimating arrival time of a vehicle at a destination
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); and Scott Plant, San Jose, CA (US)
Assigned to Volkswagen Group of America Investments, LLC, Reston, VA (US)
Filed by Argo AI, LLC, Pittsburgh, PA (US)
Filed on Feb. 8, 2022, as Appl. No. 17/650,283.
Claims priority of provisional application 63/292,140, filed on Dec. 21, 2021.
Claims priority of provisional application 63/252,431, filed on Oct. 5, 2021.
Prior Publication US 2023/0104379 A1, Apr. 6, 2023
Int. Cl. 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)
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)] 18 Claims
OG exemplary drawing
 
1. A method of determining an estimated time of arrival (ETA) at which a vehicle will arrive at a destination, the method comprising, by a processor:
receiving navigation data indicating a present location of the vehicle as autonomous driving operations of the vehicle are being controlled to cause the vehicle to travel along a route to a location in a geographic area;
accessing an adjacency graph comprising a plurality of nodes and edges, in which:
each node is associated with a unique location in the geographic area, and
each edge connects two of the nodes and is associated with an estimated travel time between the two nodes to which the edge is connected;
selecting, from locations in the adjacency graph, a first location that is near the present location of the vehicle and a second location that is near the destination, wherein the first location is associated with a first node in the adjacency graph and the second location is associated with a second node in the adjacency graph;
calculating a shortest path along the edges in the adjacency graph from the first node to the second node using Dijkstra's algorithm, Floyd's algorithm, a depth-first search algorithm, a breadth-first search algorithm, or a Bellman-Ford algorithm;
calculating the ETA as a function of the estimated travel times of the edges along the shortest path;
generating a message that includes the ETA for a trip; and
performing operations by a control system to control movement of the vehicle along a route planned for the trip.