US 12,264,928 B2
Distributed traffic management system with dynamic end-to-end routing
Bilal Farooq, Toronto (CA); and Shadi Djavadian, Toronto (CA)
Appl. No. 17/618,296
Filed by Bilal Farooq, Toronto (CA); and Shadi Djavadian, Toronto (CA)
PCT Filed Jun. 24, 2020, PCT No. PCT/CA2020/050875
§ 371(c)(1), (2) Date Dec. 10, 2021,
PCT Pub. No. WO2020/257926, PCT Pub. Date Dec. 30, 2020.
Claims priority of provisional application 62/865,725, filed on Jun. 24, 2019.
Prior Publication US 2022/0316900 A1, Oct. 6, 2022
Int. Cl. G01C 21/34 (2006.01); G01C 21/36 (2006.01); G08G 1/01 (2006.01); H04W 4/44 (2018.01)
CPC G01C 21/3492 (2013.01) [G01C 21/3691 (2013.01); G08G 1/0116 (2013.01); G08G 1/0137 (2013.01); H04W 4/44 (2018.02)] 17 Claims
OG exemplary drawing
 
1. An intelligent intersection computing agent associated with an intersection for facilitating distributed dynamic traffic management, the intelligent intersection computing agent comprising: a processor, a communication subsystem and a memory, the communication subsystem and the memory each in communication with the processor, the memory storing instructions, which when executed by the processor, configure the intelligent intersection computing agent to:
broadcast a presence of the intelligent intersection computing agent at the intersection to one or more other intelligent intersection computing agents located at one or more neighboring intersections;
receive at predefined time intervals, link information providing a link status report comprising an average speed of a link for each local link connected to the intersection from a set of link computing agents comprising sensors for detecting vehicles on each said local link;
determine a first average estimated travel time for each said local link from said link information;
receive, in response to said broadcast, from selected ones of said other intelligent intersection computing agents and located downstream of said intersection at one or more downstream intersections, a second average estimated travel time for downstream links associated with each said downstream intersection; and
calculate a routing table providing a route from said intersection to each one of said neighboring intersections based on said first estimated average travel time and said second average estimated travel time.