Abstract Merging algorithms capable of resolving conflicts in automated transit systems are studied. The effectiveness of five basic algorithms are compared via theoretical evaluations of the ability of each algorithm to resolve merge conflicts. The measure of efficiency is the miss-turn rate, the probability of successfully completing a desired merge. The miss-turn rate for each algorithm is calculated as a function of guideway density and turn rate. Four of these algorithms are sequential strategies while the fifth is a dependent maneuver philosophy.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Intersection merge control in automated transportation systems


    Contributors:

    Publication date :

    1974-07-12


    Size :

    8 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Model Predictive Control based Automated Driving Lane Change Control Algorithm for Merge Situation on Highway Intersection

    Chae, Heungseok / Min, Kyong Chan / Yi, Kyongsu | British Library Conference Proceedings | 2017


    Automated Intersection Control

    Fajardo, David / Au, Tsz-Chiu / Waller, S. Travis et al. | Transportation Research Record | 2011



    Optimization of Velocity Ramps with Survival Analysis for Intersection Merge-Ins

    Puphal, Tim / Probst, Malte / Li, Yiyang et al. | IEEE | 2018