Abstract
Two interrelated aspects of the synthesis problem for regulated intersections of urban highways are considered. First, the question of determination of all possible distributions of the allowed intersection crossing trajectories between phases of the traffic light cycle (in other words, traffic separation schemes) is being resolved. An algorithm for solving this problem is described and illustrated. As a result, all feasible traffic separation schemes are being found, with a limit on the number of conflict points of merging tracks if needed. Secondly, the question of choosing the duration of phases for a specific traffic separation scheme is considered depending on the intensity of the incoming flows and their distributions among the permitted directions of intersection crossing. Methods are proposed for taking into account the transport demand and security requirements and a compromise between them.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
