Real-Time Merging of High-Speed Vehicular Strings

Philip E. Sarachik and Kai-Ching Chu
Additional contact information
Philip E. Sarachik: The Polytechnic Institute of New York, Brooklyn, New York
Kai-Ching Chu: IBM Thomas J. Watson Research Center, Yorktown Heights, New York

Transportation Science, 1975, vol. 9, issue 2, 122-138

Abstract: The problem of merging two strings of vehicles is considered and a complete merging strategy is presented. This strategy consists of a combination of a real time assignment algorithm with a decentralized control law. The real time assignment algorithm assigns vehicles to moving reference cells in order to provide for smooth merges at the junction of two guideways. The control law, which has the task of moving the vehicles to follow the reference positions in an optimum way, is implemented by fixed gain controllers aboard each vehicle. These controllers are designed to use information only about the vehicle itself and its nearest neighbors.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.9.2.122 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:9:y:1975:i:2:p:122-138

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().