Computing Headway Bounds under Worst-Case Bunching in Fixed-Line Transit Systems
固定线路公交系统中最坏情况串车下的车头时距界限计算
专题命中 规划决策 :planning(abstract)
AI总结 针对公交串车问题,提出一种动态规划方法,在停靠时间和行驶时间有界条件下,计算单条公交线路的最大和最小车头时距,并应用于实际系统验证其规划效用。
Comments 11 pages, 9 figures, to be presented at the 2026 IEEE 32nd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)