An intersection control strategy for a short‐headway P.R.T. network

Much PRT development and research is currently being undertaken assuming quasi‐synchronous longitudinal control of guideway vehicles. This method of control has the characteristic that intersection performance has a substantial influence on the efficiency of trip demand processing. An algorithm for the control of a PRT intersection is discussed here, which would appear to have significant advantages over all other known existing stratagems. The stratagem is not only efficient but its flexibility facilitates tailoring to diverse local conditions; furthermore, the algorithm does not require intractable computations or excessive computer memory requirements. The algorithm is described and simulation results are presented. A comparative study is also made between this algorithm and its fore‐runner.