Control Algorithm and Traffic Analysis of PRT Grade-Separated Interchange.

A control algorithm and a probability-theoretical traffic analysis of a grade-separated intersection model of the personal rapid transit (PRT) systems under the quasi-synchronous scheme is presented. At the intersection, vehicles diverge from the less preferential subline and merge into the preferential mainline. To realize efficient cell-assignment, this algorithm makes a slot-slipping decision before the diverge point and performs the actual slot-slipping after it is on the off line. Even a diverge-minded vehicle is forced to go straight (be adopted) when the number of maneuvering cells exceeds its limit and passes the intersection without the maneuver. The behavior of this algorithm under the random arrival assumption is formulated as a Markov chain, the analysis of which leads to the explicit expressions for the delay distribution, the average delay, and the abort rate. [ABSTRACT FROM AUTHOR]