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 traffics. 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 manoeuvre philosophy.