Method, apparatus and computer program product for traffic lane and signal control identification and traffic flow management
First Claim
1. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to at least perform:
- identify each of a plurality of paths through an intersection;
identify states of one or more traffic lights controlling traffic through the intersection;
determine vehicle throughput data for the intersection through a predetermined number of cycles of the one or more traffic lights;
match the vehicle throughput data to each of the plurality of paths of the intersection;
correlate, by the processor, each path through the intersection with one or more of the one or more traffic lights based on the vehicle throughput data and the states of the one or more traffic lights;
store the correlated paths through the intersection and the associated one or more of the one or more traffic lights including a respective state;
catalog the correlated paths through the intersections and the associated one or more traffic lights including a respective associated state as traffic flow examples;
generate a model of the intersection based on the cataloged correlated paths through the intersection;
generate a traffic flow model for the intersection using the correlated paths and associated traffic lights; and
implement a traffic light control strategy derived from the traffic flow model for the intersection to increase the vehicle throughput of the intersection.
2 Assignments
0 Petitions
Accused Products
Abstract
A method is provided for traffic lane and traffic signal control identification and traffic flow management. Methods may identify traffic lights controlling lane movements, cataloging the information through analysis of traffic light signal phase and timing, and analyzing traffic movement through an intersection during specific periods of time. In particular, example methods may include identifying each of a plurality of paths through an intersection; identifying states of one or more traffic lights controlling traffic through the intersection; determining vehicle throughput data for the intersection through a predetermined number of cycles of the one or more traffic lights; and matching the vehicle throughput data to each of the plurality of paths of the intersection. The method may optionally include identifying times of movement and times of non-movement of vehicles across the intersection for each of the plurality of paths.
-
Citations
20 Claims
-
1. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to at least perform:
-
identify each of a plurality of paths through an intersection; identify states of one or more traffic lights controlling traffic through the intersection; determine vehicle throughput data for the intersection through a predetermined number of cycles of the one or more traffic lights; match the vehicle throughput data to each of the plurality of paths of the intersection; correlate, by the processor, each path through the intersection with one or more of the one or more traffic lights based on the vehicle throughput data and the states of the one or more traffic lights; store the correlated paths through the intersection and the associated one or more of the one or more traffic lights including a respective state; catalog the correlated paths through the intersections and the associated one or more traffic lights including a respective associated state as traffic flow examples; generate a model of the intersection based on the cataloged correlated paths through the intersection; generate a traffic flow model for the intersection using the correlated paths and associated traffic lights; and implement a traffic light control strategy derived from the traffic flow model for the intersection to increase the vehicle throughput of the intersection. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method comprising:
-
identifying each of a plurality of paths through an intersection; identifying states of one or more traffic lights controlling traffic through the intersection; determining vehicle throughput data for the intersection through a predetermined number of cycles of the one or more traffic lights; matching the vehicle throughput data to each of the plurality of paths of the intersection; correlating, by a processor, each path through the intersection with one or more of the one or more traffic lights based on the vehicle throughput data and the states of the one or more traffic lights; storing the correlated paths through the intersection and the associated one or more of the one or more traffic lights including a respective state in a memory; cataloging the correlated paths through the intersections and the associated one or more traffic lights including a respective associated state as traffic flow examples; generating a model of the intersection based on the cataloged correlated paths through the intersection; generating a traffic flow model for the intersection using the correlated paths and associated traffic lights; and implementing a traffic light control strategy derived from the traffic flow model for the intersection to increase the vehicle throughput of the intersection. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A computer program product comprising at least one non-transitory computer-readable storage medium having computer-executable program code instructions stored therein, the computer-executable program code instructions comprising:
-
program code instructions for identifying each of a plurality of paths through an intersection; program code instructions for identifying states of one or more traffic lights controlling traffic through the intersection; program code instructions for determining vehicle throughput data for the intersection through a predetermined number of cycles of the one or more traffic lights; program code instructions for matching the vehicle throughput data to each of the plurality of paths of the intersection; program code instructions for correlating each path through the intersection with one or more of the one or more traffic lights based on the vehicle throughput data and the states of the one or more traffic lights; program code instructions for storing the correlated paths through the intersection and the associated one or more of the one or more traffic lights including a respective state; program code instructions for cataloging the correlated paths through the intersections and the associated one or more traffic lights including a respective associated state as traffic flow examples; program code instructions for generating a model of the intersection based on the cataloged correlated paths through the intersection; program code instructions for generating a traffic flow model for the intersection using the correlated paths and associated traffic lights; and program code instructions for implementing a traffic light control strategy derived from the traffic flow model for the intersection to increase the vehicle throughput of the intersection. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification