静态多路径交通分配模型综述

静态交通分配反映路网交通流的拥挤性、路径选择的随机性等典型交通流特征,是交通规划方案评价和路网分析的重要方法.文章在介绍交通分配理论的基础上,对静态多路径交通分配的发展进行分析,并总结了静态多路径非平衡交通分配法的关键问题,分别对路阻函数及路权的计算、有效路径的定义、路网最短路算法、分配算法流程设计4个方面进行研究,总结静态交通非平衡分配法存在的不足,可为交通分配研究提供参考.     

An optimal model-based trajectory following architecture synthesising the lateral adaptive preview strategy and longitudinal velocity planning for highly automated vehicle

Automated driving has received a broad of attentions from the academia and industry, since it is effective to greatly reduce the severity of potential traffic accidents and achieve the ultimate automobile safety and comfort. This paper presents an optimal model-based trajectory following architecture for highly automated vehicle in its driving tasks such as automated guidance or lane keeping, which includes a velocity-planning module, a steering controller and a velocity-tracking controller. The velocity-planning module considering the optimal time-consuming and passenger comforts simultaneously could generate a smooth velocity profile. The robust sliding mode control (SMC) steering controller with adaptive preview time strategy could not only track the target path well, but also avoid a big lateral acceleration occurred in its path-tracking progress due to a fuzzy-adaptive preview time mechanism introduced. In addition, an SMC controller with input–output linearisation method for velocity tracking is built and validated. Simulation results show this trajectory following architecture are effective and feasible for high automated driving vehicle, comparing with the Driver-in-the-Loop simulations performed by an experienced driver and novice driver, respectively. The simulation results demonstrate that the present trajectory following architecture could plan a satisfying longitudinal speed profile, track the target path well and safely when dealing with different road geometry structure, it ensures a good time efficiency and driving comfort simultaneously.     

一种混合优化的全局路径规划算法

针对全局路径规划研究中遗传算法存在搜索范围广而导致收敛速度慢的问题,本文提出一种混合优化的全局路径规划方法,完成对图像读取、处理后使用A*算法预处理缩小可行区域从而提高收敛速度。所提出的混合优化规划方法主要优化遗传算法的初始种群,在不影响最终路线的情况下,缩小初始种群的搜索范围,提高算法进行全局路径规划的速度,快速有效的规划出全局路线。另外本文给出一种评价体系对规划结果进行定量的避障评价,评价结果能够以数值形式对规划结果进行综合评价,评价结果显示通过混合优化算法规划出的路径具有更佳的安全性。     

内河交管雷达数据处理研究

我国船舶交通管制系统正在向内河发展。作为基本的监视设备。雷达及其数据处理系统面对着狭窄水道与拥挤交通的挑战。在内河条件下,雷达数据处理在其工作的3个主要方面会有困难:录取、跟踪与交通形势估计。现场试验清楚地表明了这一点。本文在测试结果的基础上分析了引起困难的诸因素。这些因素仅靠修改运动模型或自适应控制滤波器参数等方法是不易克服的。因此作者建议引入下述设计概念: 1.“双分辨率录取”。此设计可以在多个目标靠近时录取感兴趣的目标。 2.要充分利用雷达回波和环境条件信息,利用模式识别方法。这些信息可以减少航迹关联及交接的失误概率,从而改善跟踪性能。 3.在交通形势分析中利用专家的经验而不只是CPA,TCPA等参数,这可更好地预测交通形势的演进。应用上述概念设计的雷达数据处理可以在内河交管中起重要作用。     

面向协调路径集与双环结构的区域绿波控制模型

考虑到区域内交叉口之间的方向性协调控制需求，以协调路径集作为区域绿波控制对象，针对双环相位结构建立一种区域绿波协调控制模型。通过对协调路径链、协调路径进行特征表述，结合协调路径的相交情况，分析在进行区域绿波协调控制设计时，不同类型的交叉口协调相位时间基点约束条件；在初选协调路径集的基础上，通过分析公共信号周期、相位时间、相位结构、相位差等优化变量之间的约束条件，以所有满足协调控制设计的协调路径总流量最大为优化目标，建立面向协调路径集与双环结构的区域绿波控制模型，实现对区域绿波协调控制参数的综合优化。模型通过引入协调路径决策变量以及设置交叉口协调相位基点最大允许偏移时间，保证通过区域协调路径集再优选后，纳入最终协调路径集的各协调路径上下游交叉口的协调相位基点受到最大允许偏移时间约束，以获得理想的绿波协调控制效果。算例仿真试验结果表明：与Synchro软件的单点优化和区域协调信号配时设计方案相比，所提模型方案的协调路径集平均延误时间分别减少了35.5%和18.1%，平均停车次数分别减少了74.1%和63.8%，所提模型方案的整个路网平均停车次数分别减少了38.9%和25.1%，可见所提模型能够最大限度地保证区域内协调路径集的绿波协调控制效果，在减少区域停车次数方面效果显著。     

一种基于物影匹配算法的道路小目标跟踪方法

针对复杂道路环境下小目标抛洒物难以被检测与跟踪，且落地静止像素易被纳入背景而导致目标丢失等问题，本文提出一种基于物影匹配算法(OSMA)的道路小目标跟踪方法来解决上述问题。首先，采用混合高斯模型对背景进行建模以此获取前景图像，对前景图像采用膨胀、腐蚀等形态学处理；其次，根据道路抛洒物移动时在前景产生独立的物与影双轮廓特征，进行连续帧前景轮廓的物影匹配，并将连续的匹配结果定为疑似抛洒物；最后，采用多帧质心偏移法判断疑似抛洒物是否处于静止状态，并对运动状态中的疑似抛洒物进行位置判定与帧间轮廓匹配，从而实现抛洒物的逐帧跟踪。基于大量实验表明：本文所提出的OSMA与核化相关滤波器(KCF)、辨别尺度空间跟踪器(DSST)、背景感知相关滤波器(BACF)、深度注意力跟踪器(DAT)、视觉跟踪时空变换器(SATRK)等跟踪器相比，准确性更优越，可较好解决道路复杂场景下各类抛洒物的跟踪问题；复杂背景、快速旋转的小目标场景中跟踪表现优异，具有良好的跟踪尺度，实时性满足预期要求。     

Estimating the most likely space–time paths,dwell times and path uncertainties from vehicle trajectory data: A time geographic method

Global Positioning System and other location-based services record vehicles’ spatial locations at discrete time stamps. Considering these recorded locations in space with given specific time stamps, this paper proposes a novel time-dependent graph model to estimate their likely space–time paths and their uncertainties within a transportation network. The proposed model adopts theories in time geography and produces the feasible network–time paths, the expected link travel times and dwell times at possible intermediate stops. A dynamic programming algorithm implements the model for both offline and real-time applications. To estimate the uncertainty, this paper also develops a method based on the potential path area for all feasible network–time paths. This paper uses a set of real-world trajectory data to illustrate the proposed model, prove the accuracy of estimated results and demonstrate the computational efficiency of the estimation algorithm.     

智能车避障路径规划方法研究

避障路径规划是智能车技术的关键部分,对智能车研究具有重大意义,正确的选择规划方法至关重要。本文首先初步选定人工势场法规划路径,仿真得知传统人工势场法规划出的路径存在局部最优、碰撞及达不到目标点的问题。因此提出改进人工势场法,通过改变势场函数和设定初始条件来解决此问题。最后,为了规划出能够同时避开静态和动态障碍物且能到达目标点的理想路径,在改进人工势场法中加入速度元素,经过仿真,证明了基于速度的改进人工势场法在智能车避障路径规划中的可行性和优越性。     

Stochastic optimal path problem with relays

This paper studies the optimal path problem for travelers driving with vehicles of a limited range, such as most battery electric vehicles currently available in the market. The optimal path in this problem often consists of several relay points, where the vehicles can be refueled to extend its range. We propose a stochastic optimal path problem with relays (SOPPR), which aims at minimizing a general expected cost while maintaining a reasonable arrival probability. To account for uncertainty in the road network, the travel speed on a road segment is treated as a discrete random variable, which determines the total energy required to traverse the segment. SOPPR is formulated in two stages in this paper. In the first stage, an optimal routing problem is solved repeatedly to obtain the expected costs and arrival probabilities from any node to all refueling nodes and the destination. With this information, the second stage constructs an auxiliary network, on which the sequence of refueling decisions can be obtained by solving another optimal path problem. Label-correcting algorithms are developed to solve the routing problems in both stages. Numerical experiments are conducted to compare the stochastic and deterministic models, to examine the impact of different parameters on the routing results, and to evaluate the computational performance of the proposed algorithms.     

中国古代视觉理论探索

中国古人对视觉理论有过内容丰富的探讨。在对视觉形成机制的认识上,古人大都认为眼睛本身不能发光,它只有在接收到外光时才能见物,但也确有一些学者主张眼睛本身可以向外发射光线。古人还对视觉的局限性做过深入的分析,讨论了导致出现视觉局限性的主客观各种因素。他们用视觉局限性理论解释了一些重要科学问题,推进了相应学科的发展。他们对形成视觉局限性的物理机制的探讨,导致光行曲线学说和测不准观念的诞生。