基于遗传算法的舰船航速模糊控制研究

研究并建立了舰船航速控制系统的数学模型,并将模糊控制理论应用到该系统,提出了一种基于遗传算法的舰船航速模糊控制新方法。该方法较常规的模糊控制具有更优的控制性能,仿真实验结果表明该方法可行、有效。     

Lane-following method for high speed autonomous vehicles

This paper presents a steering control method for lane-following in a vehicle using an image sensor. With each image frame acquired from the sensor, the steering control method determines target position and direction, and constructs a travel path from the current position to the target position either as an Arc-path or S-path. The steering angle is calculated from the travel path thus generated, and the vehicle follows the travel path via motor-control. The method was tested using a vehicle dubbed as KAV (Korea Autonomous Vehicle) along an expressway (Seoul Inner Beltway) trajectory with a variety of radii (50 m ∼ 300 m) while traveling at a speed of 60 km/h to 80 km/h. Compared with an experienced human driver, the method showed little much difference in performance in terms of lane-center deviation. The proposed method is currently employed for high speed autonomous driving as well as for stop and go traffic.     

A Variable Time-Discretization Strategies-Based,Time-Dependent Shortest Path Algorithm for Dynamic Traffic Assignment

Within the simulation-based dynamic traffic assignment (SBDTA) model, the time-dependent shortest path (TDSP) algorithm plays a crucial role in the path-set update procedure by solving for the current optimal auxiliary solution (shortest path). Common types of TDSP algorithms require temporal discretization of link/node time/cost data, and the discretization could affect the solution quality of TDSP and of the overall SBDTA as well. This article introduces two variable time-discretization strategies applicable to TDSP algorithms. The strategies are aimed at determining the optimal time discretization for time-dependent links/nodes travel time data. The first proposed strategy produces a specific discretization interval for each link. The second proposed strategy generates time-varying intervals for the same link over the analysis period. The proposed strategies are implemented in a link-based time-dependent A* algorithm in a SBDTA model DynusT and tested with two numerical experiments on two traffic networks. The results show that the proposed discretization methods achieve the research goal—to flexibly and scalably balance the memory usage and run time for SBDTA without degrading the convergence. This property is rather important when dealing with a large real-world network with a long analysis period.     

基于前轮转角约束自适应模型预测控制的路径跟踪研究

针对在车辆行驶中较小的前轮转角无法充分利用路面附着能力,较大的前轮转角使得车辆的行驶稳定性差的问题,文章提出了一种前轮转角约束自适应模型预测方法。首先建立车辆的动力学模型,然后通过计算得到轮胎纵向力,最终得到车辆的前轮转角。将车辆的状态量与前轮转角自适应约束条件输入给模型预测控制器,输出车辆的前轮转角,实现对参考路径的跟踪。在Carsim和MATLAB平台上联合仿真,仿真结果表明前轮转角约束自适应模型预测控制的车辆相比固定转角约束的车辆具有较好的跟踪能力和稳定性。     

考虑驾驶策略的高速列车运行图节能优化方法

为了降低高速列车从始发站至终到站运行的牵引能耗, 研究了针对多列车区间运行时分同步分配的列车运行图节能优化方法。基于高速列车在站间采用的“四阶段”操纵策略构建最优驾驶策略集, 以牵引距离和巡航距离为变化因子, 以牵引能耗和区间运行时分为计算目标, 求解出最优驾驶策略集里牵引能耗与区间运行时分的线性关系。在此基础上构建多列车区间运行时分最优分配的节能运行图模型。模型以牵引能耗最低为目标, 考虑了列车总运行时间约束、变量取值范围约束以及安全间隔时分约束。在模型求解方面, 选取拉格朗日松弛算法, 将复杂约束松弛至目标函数当中, 从而把原问题分解为各区间可独立求解的子问题, 利用次梯度优化的方法得出精确解, 实现了多列车区间运行时分同步分配的目标。以宝兰高速铁路为背景进行算例验证, 结果表明: 通过重新分配区间运行时分, 10列车总共节约了595.958 kW·h牵引能耗, 平均节能率达到了1.2%;从运行图的层面分析, 该算例下通过调整区间运行时分的节能方法对其影响幅度较小, 具有较强的现实意义; 所提出的模型及算法的计算时间为10 s, 针对列车开行对数较多的高速铁路, 可有效提高求解效率。     

基于改进A*算法的智能车路径规划研究

针对智能车使用A*路径规划算法存在转折点和冗余点的问题,提出一种考虑智能车静态特性的改进A*路径规划算法。在已知静态环境信息的栅格地图上,考虑到智能车自身存在实际宽度,对障碍物进行膨胀扩展;其次根据路径上前后节点相对方向的改变提取必要的转折点,并依次连结前后转折点,若转折点连线不经过障碍物,删除连结转折点之间冗余的转折点;重复上述操作,直至所有冗余点被删除,保留关键转折点。仿真结果表明,该方法可以实现车辆安全无碰撞地到达目标终点。     

Sampling of alternatives for route choice modeling

This paper presents a new paradigm for choice set generation in the context of route choice model estimation. We assume that the choice sets contain all paths connecting each origin–destination pair. Although this is behaviorally questionable, we make this assumption in order to avoid bias in the econometric model. These sets are in general impossible to generate explicitly. Therefore, we propose an importance sampling approach to generate subsets of paths suitable for model estimation. Using only a subset of alternatives requires the path utilities to be corrected according to the sampling protocol in order to obtain unbiased parameter estimates. We derive such a sampling correction for the proposed algorithm.Estimating models based on samples of alternatives is straightforward for some types of models, in particular the multinomial logit (MNL) model. In order to apply MNL for route choice, the utilities should also be corrected to account for the correlation using, for instance, a path size (PS) formulation. We argue that the PS attribute should be computed based on the full choice set. Again, this is not feasible in general, and we propose a new version of the PS attribute derived from the sampling protocol, called Expanded PS.Numerical results based on synthetic data show that models including a sampling correction are remarkably better than the ones that do not. Moreover, the Expanded PS shows good results and outperforms models with the original PS formulation.     

Assessing the cost of transfer inconvenience in public transport systems: A case study of the London Underground

Few studies have adequately assessed the cost of transfers² in public transport systems, or provided useful guidance on transfer improvements, such as where to invest (which facility), how to invest (which aspect), and how much to invest (quantitative justification of the investment). This paper proposes a new method based on path choice,³ taking into account both the operator’s service supply and the customers’ subjective perceptions to assess transfer cost and to identify ways to reduce it. This method evaluates different transfer components (e.g., transfer walking, waiting, and penalty) with distinct policy solutions and differentiates between transfer stations and movements.The method is applied to one of the largest and most complex public transport systems in the world, the London Underground (LUL), with a focus on 17 major transfer stations and 303 transfer movements. This study confirms that transfers pose a significant cost to LUL, and that cost is distributed unevenly across stations and across platforms at a station. Transfer stations are perceived very differently by passengers in terms of their overall cost and composition. The case study suggests that a better understanding of transfer behavior and improvements to the transfer experience could significantly benefit public transport systems.     

快速公交(BRT)线路布设优化算法研究

快速公交(BRT)在我国方兴未艾,而目前缺乏实用的快速公交线网布局优化方法。针对传统直达客流方法应用于快速公交线网布局优化的不足,根据快速公交的特点和功能定位,提出了以直达客流运输密度最大和直达客流绕行系数最小为目标的快速公交线网布局双层非线性优化模型,对模型合理性进行了论证,并提出了简单容易操作的实用求解算法。     

Cost scaling based successive approximation algorithm for the traffic assignment problem

This paper presents a cost scaling based successive approximation algorithm, called ε-BA (ε-optimal bush algorithm), to solve the user equilibrium traffic assignment problem by successively refining ε-optimal flows. As ε reduces to zero, the user equilibrium solution is reached. The proposed method is a variant of bush-based algorithms, and also a variant of the min-mean cycle algorithm to solve the min-cost flow by successive approximation. In ε-BA, the restricted master problem, implying traffic equilibration restricted on a bush, is solved to ε-optimality by cost scaling before bush reconstruction. We show that ε-BA can reduce the number of flow operations substantially in contrast to Dial’s Algorithm B, as the former operates flows on a set of deliberately selected cycles whose mean values are sufficiently small. Further, the bushes can be constructed effectively even if the restricted master problem is not solved to a high level of convergence, by leveraging the ε-optimality condition. As a result, the algorithm can solve a highly precise solution with faster convergence on large-scale networks compared to our implementation of Dial’s Algorithm B.