INTERSECTION MERGE CONTROL IN AUTOMATED TRANSPORTATION SYSTEMS

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.(a) /TRRL/

• Corporate Authors:

  Pergamon Press, Incorporated

  Maxwell House, Fairview Park
  Elmsford, NY  United States  10523
• Authors:
  • Caudill, R J
  • Youngblood, J N
• Publication Date: 1976-2

Language

• English

Media Info

• Features: Figures; References;
• Pagination: p. 17-24
• Serial:
  • Transportation Research /UK/
  • Volume: 10
  • Issue Number: 1
  • Publisher: Pergamon Press, Incorporated

Subject/Index Terms

• TRT Terms: Algorithms; Automated guideway transit; Automated vehicle control; Automatic control; Automation; Intersections; Mathematical analysis; Merging control; Merging traffic; Personal rapid transit; Rapid transit; Traffic conflicts; Traffic control
• Old TRIS Terms: Automated transit system; Automatic control systems; Merging control system
• ITRD Terms: 6471: Analysis (math); 3882: Automatic; 455: Junction; 647: Merging traffic; 654: Traffic control
• Subject Areas: Highways; Operations and Traffic Management; Planning and Forecasting; Public Transportation; Railroads; I71: Traffic Theory; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00137736
• Record Type: Publication
• Source Agency: Transport and Road Research Laboratory (TRRL)
• Files: ITRD, TRIS
• Created Date: Apr 13 1982 12:00AM