Abstract
This paper deals with intersection merge control, and presents the results of an analysis of various merging algorithms and their relative effectiveness in resolving merging conflicts under varying capacity and turn-rate conditions. A discussion of various merge algorithms and their theoretical effectiveness, expressed in probabilistic terms as the miss-turn rate, is presented.
Original language | American English |
---|---|
Pages | 307-317 |
Number of pages | 11 |
State | Published - 1976 |
Externally published | Yes |
Event | Int Conf on Pers Rapid Transit - Denver, CO, USA Duration: Sep 16 1975 → Sep 19 1975 |
Other
Other | Int Conf on Pers Rapid Transit |
---|---|
City | Denver, CO, USA |
Period | 9/16/75 → 9/19/75 |
ASJC Scopus subject areas
- General Engineering