Distributed traffic management system with dynamic end-to-end routing
View Patent ↗There is provided a decentralized system and method for distributed traffic management comprising: a plurality of intersection computing agents connected across a communication network, each intersection computing agent located at a particular intersection communicating with a plurality of corresponding local link computing agents comprising sensors located on each respective road link directly connected to the particular intersection, to receive a link status report comprising speed and number of vehicles on said each respective road link; and said each intersection computing agent calculating an estimated travel time for said each respective road link from said link status report and receiving link information packet comprising the estimated travel time for said each respective road link from a first plurality of intersection computing agents located at a first plurality of intersections physically located downstream to create a network travel time matrix for routing vehicles at said particular intersection.
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.
2. The intelligent intersection computing agent of claim 1 , further configured to:
in response to the broadcast: receive identification information from the one or more neighbouring intersections and associated link computing agents and determine therefrom a set of upstream and a set of downstream neighbour intersection computing agents to determine a view of a road network using location information provided in the response of each of the upstream the downstream neighbour intersection computing agents.
3. The intelligent intersection computing agent of claim 1 , wherein the average speed of the link is determined by the link computing agents based on a total number of the vehicles on the link at a first time interval and a speed of each of the vehicles on the link for the respective link computing agent at the first time interval.
4. The intelligent intersection computing agent of claim 3 further configured to communicate via intersection to vehicle communications and receive vehicle destination information for a first vehicle located proximal to the intersection and customizing the routing table to provide an on-demand routing table to the first vehicle based on the vehicle destination information.
5. The intelligent intersection computing agent of claim 3 comprises at least one of: a roadside computer unit, a Raspberry Pi computer unit, a computer server, a tablet computer, a laptop computer, a tabletop computer, a personal computer or workstation.
6. The intelligent intersection computing agent of claim 3 further configured to filter out outdated information from the first estimated average travel time and the second average estimated travel time for determining an updated routing table.
7. The intelligent intersection computing agent of claim 3 further comprising sending time stamped information packets containing the routing table to said one or more downstream intersections for respectively updating one or more routing tables associated with the downstream intersections.
8. The intelligent intersection computing agent of claim 4 wherein the routing table further comprises information relating to a next node on a path to the vehicle destination information and a time of generation of the routing table.
9. The intelligent intersection computing agent of claim 4 wherein the routing table is further modified based on a pre-defined objective for optimizing the routing table, the objective comprising at least one of: system travel time, individual travel times, and gas emissions.
10. A computer implemented method for facilitating distributed dynamic traffic management, comprising:
broadcasting a presence of an intelligent intersection computing agent at an intersection to other intelligent intersection computing agents located at one or more neighboring intersections;
receiving at predefined time intervals, link information providing a link status report comprising 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;
determining a first average estimated travel time for each said local link from said link information;
receiving, in response to said broadcast, from said other intelligent intersection computing agents 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
calculating a routing table providing a route from said intersection to each one of said one or more neighboring intersections based on said first estimated average travel time and said second average estimated travel time.
11. The method of claim 10 wherein in response to the broadcast, the method further comprises: receiving an identification response from the one or more neighbouring intersections and associated link computing agents and determine therefrom a set of upstream and a set of downstream neighbour intersection computing agents to determine a view of a road network using location information provided in the response of each of the upstream the downstream neighbour intersection computing agents.
12. The method of claim 10 , wherein the average speed of each local link is determined by the link computing agents based on a total number of the vehicles on the link at a first time interval and a speed of each of the vehicles on the link for the respective link computing agent at the first time interval.
13. The method of claim 12 , further configured to communicate via intersection to vehicle communications and receive vehicle destination information for a first vehicle located proximal to the intersection and customizing the routing table to provide an on-demand routing table to the first vehicle based on the vehicle destination information.
14. The method of claim 12 , further configured to filter out outdated information from the first average travel time and the second average estimated travel time for determining an updated routing table.
15. The method of claim 12 further comprising sending time stamped information packets containing the routing table to said one or more downstream intersections for respectively updating one or more routing tables associated with the downstream intersections.
16. The method of claim 13 wherein calculating the routing table further comprises including information relating to a next node on a path to the vehicle destination information and a time of generation of the routing table.
17. The method of claim 13 wherein calculating the routing table further comprises modifying based on a pre-defined objective for optimizing the routing table, the objective comprising at least one of: system travel time, individual travel times, and gas emissions.