Intersection merge control in automated transportation systems

R. J. Caudill; J. N. Youngblood

doi:10.1016/0041-1647(76)90097-6

Intersection merge control in automated transportation systems

R. J. Caudill, J. N. Youngblood

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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.

Original language	English (US)
Pages (from-to)	17-24
Number of pages	8
Journal	Transportation Research
Volume	10
Issue number	1
DOIs	https://doi.org/10.1016/0041-1647(76)90097-6
State	Published - Feb 1976
Externally published	Yes

All Science Journal Classification (ASJC) codes

General Engineering

Access to Document

10.1016/0041-1647(76)90097-6

Cite this

@article{23e790bb22d040babdc36e6b3b699667,

title = "Intersection merge control in automated transportation systems",

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.",

author = "Caudill, {R. J.} and Youngblood, {J. N.}",

year = "1976",

month = feb,

doi = "10.1016/0041-1647(76)90097-6",

language = "English (US)",

volume = "10",

pages = "17--24",

journal = "Transportation Research",

issn = "0041-1647",

number = "1",

}

TY - JOUR

T1 - Intersection merge control in automated transportation systems

AU - Caudill, R. J.

AU - Youngblood, J. N.

PY - 1976/2

Y1 - 1976/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0016917791&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0016917791&partnerID=8YFLogxK

U2 - 10.1016/0041-1647(76)90097-6

DO - 10.1016/0041-1647(76)90097-6

M3 - Article

AN - SCOPUS:0016917791

SN - 0041-1647

VL - 10

SP - 17

EP - 24

JO - Transportation Research

JF - Transportation Research

IS - 1

ER -

Intersection merge control in automated transportation systems

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this