US 12,276,515 B2
Method for computing fastest route on road networks with dynamic traffic information
Craig Gotsman, Jersey City, NJ (US); and Renjie Chen, Saarbrucken (GB)
Assigned to New Jersey Institute of Technology, Newark, NJ (US); and Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V., (DE)
Filed by New Jersey Institute of Technology, Newark, NJ (US); and Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V., Munich (DE)
Filed on Feb. 14, 2020, as Appl. No. 16/791,596.
Claims priority of provisional application 62/805,384, filed on Feb. 14, 2019.
Prior Publication US 2020/0264002 A1, Aug. 20, 2020
Int. Cl. G01C 21/34 (2006.01); G06F 16/27 (2019.01); G06F 16/901 (2019.01); G06F 16/9537 (2019.01)
CPC G01C 21/3492 (2013.01) [G06F 16/278 (2019.01); G06F 16/9027 (2019.01); G06F 16/9537 (2019.01)] 8 Claims
OG exemplary drawing
 
1. A method for determining a scalable heuristic for fastest path determination on a map, comprising:
constructing in a preprocess step a separator tree and storing the separator tree with a network, wherein the separator tree includes at least one node or a road junction of a roadmap;
determining in the preprocess step at least one minimal cost value, and associating the value to the at least one node or the road junction for later use during an online query to compute a local separator heuristic (LSH) function; and
responding to the online query by a user through utilization of both the stored separator tree and the heuristic function that is computed after the preprocess step to determine a fast path on the roadmap; and
wherein, response to the online query is improved over a similar query utilizing a classical A* algorithm without the heuristic function when computing fastest paths.