个人快速交通（PRT）车辆在异常交通条件下分布式管理
Distributed management of Personal Rapid Transit (PRT) vehicles under unusual transport conditions
AI总结：
本文提出了一种灵活的PRT网络车辆管理算法，通过多参数分析分配空车，采用分布式结构实现适应极端需求的交通管理。
摘要：
本文提出了用于个人快速交通（PRT）网络中车辆管理的灵活性。用于向等待乘客配送空车的算法基于多参数分析。由于其分布式构造，该算法具有一个时间范围参数，规定通信在车站之间的最大距离。每个决策基于车站之间发送的状况信息（车站停放的车辆数、前往车站的车辆数、等待乘客数），而没有包含交通状况的中央数据库。展示了随机情况（典型）和单个地点社会活动的异常情况下的交通模拟。证明了简单调整时间范围参数可以将网络适应到极端不均匀的需求和目的地选择。
英文摘要：
The paper presents a flexibility of management of vehicles in Personal Rapid Transit (PRT) network. The algorithm used for delivering empty vehicles for waiting passengers is based on multiparameter analysis. Due to its distributed construction, the algorithm has a horizon parameter, which specifies the maximum distance between stations the communications is performed. Every decision is made basing on an information about situation (number of vehicles standing at a station, number of vehicles travelling to a station, number of passengers waiting) sent between stations, without any central data base containing traffic conditions. The simulation of the traffic in random case (typical) and in unusual case of delivering people to a social event occurring at single place is presented. It is shown that simple manipulation with horizon parameter allows to adapt the network to extremely uneven demand and destination choice.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
