城市一幅路道路的慢行系统改造方案研究

该文以武汉市香港北路为例,分析总结了一幅路道路的慢行系统在使用中存在的问题及其产生的原因,通过两个具体改造方案探讨了武汉市乃至我国其他城市改造一幅路道路慢行系统的可行方法与措施,并对城市道路慢行系统及非机动车道改造提出了相关建议。     

北京市朝阳路可变车道交通组织研究

阐述了可变车道交通组织的相关概念及应用情况。通过对北京市朝阳路的道路、交通流量等情况进行分析,运用实地调查数据,论证了设置可变车道的可行性,并提出了可变车道的实施方案及相关问题的解决策略,以达到缓解早、晚高峰时段朝阳路的交通拥堵状况的目的。     

基于饱和度的车道数量确定方法

文章从理论上推导了交通需求与道路宽度、有效通行时间比的相对关系，进而推导出一个流向上的车道数量的计算公式，并针对典型的十字交叉口和路段情况，详细讨论了交叉口进出口道和路段上车道数量计算公式。最后，对一个算例进行了验证和总结。     

ETC系统缴费方式随机选择模型

针对组合式收费系统中驾驶员缴费方式的随机选择行为,以排队论与非集计理论为基础,建立电子收费(Electronic Toll Collection,ETC)系统缴费方式随机选择模型及均衡状态求解算法。通过均衡分析与灵敏度分析探讨了ETC技术的采用对道路使用者的技术选择与车道选择行为所产生的影响,所得结果可为ETC系统的规划和管理提供帮助。     

商用车电液复合转向系统的车道保持策略

为了提高商用车的行驶安全性,避免因驾驶人的分心驾驶出现车辆偏离车道的问题,提出一种基于电液复合转向系统的商用车车道保持策略;在建立电液复合转向系统模型、二自由度车辆模型、预瞄驾驶人模型的基础上,设计基于驾驶人在环的MPC和ADRC串级的车道保持控制策略。首先,采用MPC算法将车辆横向位置控制的最优问题转化为二次规划求得目标前轮转角;然后,考虑电液复合转向系统的不确定和干扰问题,利用ADRC算法对目标转向盘转角和实际驾驶人的转向盘转角差值以转矩信号的形式进行补偿。同时研究车道保持系统对驾驶人的干预问题,引入干预系数的概念,采用模糊控制的方法,将驾驶人手力和车辆的运动状态作为输入变量,干预系数作为输出变量,保证整车行驶安全性的前提下减小车道保持辅助系统对驾驶人的干预。最后,通过MATLAB/Simulink仿真和硬件在环试验对所设计的控制策略进行验证。研究结果表明：所设计的基于商用车电液复合转向系统的车道保持策略能够及时地纠正因驾驶人的分心驾驶而导致车辆偏离所在行驶车道的行为,特别是在弯道处出现驾驶人转向不足或过度转向的情况时,能够将车辆维持在车道线之内,保证车辆的行驶安全性,同时由于干预系数的设计,使得驾驶人也有良好的人机交互体验感。     

基于绿色交通理念的拉萨交通优化研究——以朵森格路中段为例

绿色交通强调交通与环境的和谐发展,强调社会的可持续发展。拉萨处于高原地区,生态环境脆弱,随着拉萨的不断发展,交通问题和其引起的环境问题日益凸显,对拉萨交通进行符合绿色交通理念的优化有着重要的意义。基于绿色交通的理念,对拉萨的交通特点进行概述,对朵森格路中段的交通状况进行详细分析,并对其提出规整慢行通道和以公共交通为主地位的潮汐车道等优化策略,为拉萨交通的绿色规划和优化提供参考。     

Implications of path tolerance and path characteristics on critical vehicle manoeuvres

Path planning and path following are core components in safe autonomous driving. Typically, a path planner provides a path with some tolerance on how tightly the path should be followed. Based on that, and other path characteristics, for example, sharpness of curves, a speed profile needs to be assigned so that the vehicle can stay within the given tolerance without going unnecessarily slow. Here, such trajectory planning is based on optimal control formulations where critical cases arise as on-the-limit solutions. The study focuses on heavy commercial vehicles, causing rollover to be of a major concern, due to the relatively high centre of gravity. Several results are obtained on required model complexity depending on path characteristics, for example, quantification of required path tolerance for a simple model to be sufficient, quantification of when yaw inertia needs to be considered in more detail, and how the curvature rate of change interplays with available friction. Overall, in situations where the vehicle is subject to a wide range of driving conditions, from good transport roads to more tricky avoidance manoeuvres, the requirements on the path following will vary. For this, the provided results form a basis for real-time path following.     

Development of realistic shortest path algorithm considering lane changes

Lane changes occur as many times as turning movements are needed while following a designated path. The cost of a route with many lane changes is likely to be more expensive than that with less lane changes, and unrealistic paths with impractical lane changes should be avoided for drivers' safety. In this regard, a new algorithm is developed in this study to find the realistic shortest path considering lane changing. The proposed algorithm is a modified link‐labeling Dijkstra algorithm considering the effective lane‐changing time that is a parametric function of the prevailing travel speed and traffic density. The parameters were estimated using microscopic traffic simulation data, and the numerical test demonstrated the performance of the proposed algorithm. It was found that the magnitude of the effect of the effective lane‐changing time on determining the realistic shortest path is nontrivial, and the proposed algorithm has capability to exclude links successfully where the required lane changes are practically impossible. Copyright © 2015 John Wiley & Sons, Ltd.     

A Cooperative Intelligent Transport Systems (C‐ITS)‐based lane‐changing advisory for weaving sections

Weaving sections, a common design of motorways, require extensive lane‐change manoeuvres. Numerous studies have found that drivers tend to make their lane changes as soon as they enter the weaving section, as the traffic volume increases. Congestion builds up as a result of this high lane‐changing concentration. Importantly, such congestion also limits the use of existing infrastructure, the weaving section downstream. This behaviour thus affects both safety and operational aspects. The potential tool for managing motorways effectively and efficiently is cooperative intelligent transport systems (C‐ITS). This research investigates a lane‐change distribution advisory application based on C‐ITS for weaving vehicles in weaving sections. The objective of this research is to alleviate the lane‐changing concentration problem by coordinating weaving vehicles to ensure that such lane‐changing activities are evenly distributed over the existing weaving length. This is achieved by sending individual messages to drivers based on their location to advise them when to start their lane change. The research applied a microscopic simulation in aimsun to evaluate the proposed strategy's effectiveness in a one‐sided ramp weave. The proposed strategy was evaluated using different weaving advisory proportions, traffic demands and penetration rates. The evaluation revealed that the proposed lane‐changing advisory has the potential to significantly improve delay. Copyright © 2016 John Wiley & Sons, Ltd.     

A network enhancement model with integrated lane reorganization and traffic control strategies

Lane reorganization strategies such as lane reversal, one‐way street, turning restriction, and cross elimination have demonstrated their effectiveness in enhancing transportation network capacity. However, how to select the most appropriate combination of those strategies in a network remains challenging to transportation professionals considering the complex interactions among those strategies and their impacts on conventional traffic control components. This article contributes to developing a mathematical model for a traffic equilibrium network, in which optimization of lane reorganization and traffic control strategies are integrated in a unified framework. The model features a bi‐level structure with the upper‐level model describing the decision of the transportation authorities for maximizing the network capacity. A variational inequality (VI) formulation of the user equilibrium (UE) behavior in choosing routes in response to various strategies is developed in the lower level. A genetic algorithm (GA) based heuristic is used to yield meta‐optimal solutions to the model. Results from extensive numerical analyses reveal the promising property of the proposed model in enhancing network capacity and reducing congestion. Copyright © 2016 John Wiley & Sons, Ltd.