AN INTERSECTION CONTROL STRATEGY FOR A SHORT-HEADWAY P.R.T. NETWORK
AN INTERSECTION CONTROL STRATEGY FOR A SHORT-HEADWAY P.R.T. NETWORK
复制标题
DOI：
10.1080/03081067508717090
复制
发表时间：
1975
影响因子：
1.6
通讯作者：
F. Mcginley
中科院分区：
文献类型：
--
作者：
F. Mcginley
目前正在进行许多PRT的开发和研究，假定对轨道车辆进行准同步纵向控制。这种控制方法的特点是交叉口的性能对出行需求处理的效率有很大影响。这里讨论了一种控制PRT交叉口的算法，该算法似乎比所有其他已知的现有策略具有显著的优势。该策略不仅高效，而且其灵活性便于根据不同的局部条件进行定制；此外，该算法不需要复杂的计算或过多的计算机内存需求。描述了该算法，并给出了仿真结果。并将该算法与前人算法进行了比较研究。
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.