智能移动系统中大规模分布式车辆路径规划问题研究

本文针对智能交通和主动交通管理提出了一种适用于大规模交通分配和路径规划的分布式计算方法。讨论了通过信息传递接口(MPI)在多中央处理器(CPU)上并行计算实现的一系列研究需求和实现挑战;将基于时空事件的车辆路径规划模型应用于大规模的城市路网仿真;将原始车辆路径规划模型分解为一系列计算效率较高的子问题,大幅减少了仿真耗时和通信开销。通过将子问题分发到单独的分布式CPU上,使CPU可以同时执行其任务,并保证较好的负载平衡。重点分析了将所提出的方法应用于北京路网大规模路径规划,以及该方法在不同CPU核数下的计算效率。结果表明:所提出的并行计算方法可以显著减少计算耗时,并在512个计算节点上实现200倍以上的加速比。     

滑坡监测无线传感器网络基于事件的信道分配方案

在高速铁路沿线的山体斜坡上部署无线传感器网络,用于监测山体斜坡变化情况。综合考虑传感器节点能量有限性和对采集信息的实时性需求,提出一个基于事件的信道分配方案用于滑坡监测信息的传输。以是否有列车经过山体斜坡区域作为事件,当无列车经过时,为节点分配活跃周期和睡眠周期,采用TDMA的方式唤醒节点并分配一个可用信道进行数据传输,从而在保证数据传输的前提下节省节点能量,延长网络寿命;当有列车即将经过时,节点完全进入活跃周期,采用多个信道并行传输的方式传输数据,减少传输过程中由于信息碰撞造成的信息丢失和重传,从而降低传输时延,提高信息传输的实时性。最后,通过仿真实验分析系统性能,证明所提方案的有效性。     

DEADBEAT COVARIANCE CONTROLLER DESIGN FOR SAMPLED-DATA SYSTEMS

ＭＰＬＥＤ－ＤＡＴＡ ＳＹＳＴＥＭＳTX＠霍沛军＠王子栋ＩｎｔｒｏｄｕｃｔｉｏｎＳａｍｐｌｅｄ－ｄａｔａｆｅｅｄｂａｃｋｃｏｎｔｒｏｌｈａｓｒｅｃｅｉｖｅｄｍｕｃｈａｔｅｎｔｉｏｎｉｎｔｈｅａｒｅａｏｆｃｏｎｔｒｏｌｓｙｓｔｅｍｄｅ－ｓｉｇｎｂｅｃａｕｓｅｏ...     

IEEE802．16d无线MESH网络路由协议研究

无线Mesh网络是一种新型的无线通信网络,具有自组织、自管理和自愈的特点,是一种多跳的宽带无线接入网络结构,也是一种高容量、高速率的分布式网络。在介绍WMN基本概念的基础上,针对制约MESH网络发展的路由技术问题,在传统AODV路由协议的基础上提出了新的路由协议OLRP,并给出仿真结果。     

A generic class of first order node models for dynamic macroscopic simulation of traffic flows

Node models for macroscopic simulation have attracted relatively little attention in the literature. Nevertheless, in dynamic network loading (DNL) models for congested road networks, node models are as important as the extensively studied link models. This paper provides an overview of macroscopic node models found in the literature, explaining both their contributions and shortcomings. A formulation defining a generic class of first order macroscopic node models is presented, satisfying a list of requirements necessary to produce node models with realistic, consistent results. Defining a specific node model instance of this class requires the specification of a supply constraint interaction rule and (optionally) node supply constraints. Following this theoretical discussion, specific macroscopic node model instances for unsignalized and signalized intersections are proposed. These models apply an oriented capacity proportional distribution of the available supply over the incoming links of a node. A computationally efficient algorithm to solve the node models exactly is included.     

Schedule-based transit assignment model with vehicle capacity and seat availability

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.     

Frequency-based transit assignment considering seat capacities

This paper proposes a frequency-based assignment model that considers travellers probability of finding a seat in their perception of route cost and hence also their route choice. The model introduces a “fail-to-sit” probability at boarding points with travel costs based on the likelihood of travelling seated or standing. Priority rules are considered; in particular it is assumed that standing on-board passengers will occupy any available seats of alighting passengers before newly boarding passengers can fill any remaining seats. At the boarding point passengers are assumed to mingle, meaning that FIFO is not observed, as is the case for many crowded bus and metro stops, particularly in European countries. The route choice considers the common lines problem and an user equilibrium solution is sought through a Markov type network loading process and the method of successive averages. The model is first illustrated with a small example network before being applied to the inner zone of London’s underground network. The effect of different values passengers might attach to finding a seat are illustrated. Applications of the model for transit planning as well as for information provision at the journey planner stage are discussed.     

��������ʱ��ֲ��Ŀ������ģ�ͪ�

在城市轨道交通的线路网络形成、实行一票换乘并伴随投资主体多元化时,需要建立公平公正的票务清分机制,本文提出一个基于乘客旅行实际时间分布计算各路径上乘客比例的新方法.根据交通卡中的进出站的时间记录,计算出在一段时间内在一对出入站之间完成旅行的所有乘客的时间分布,以这个分布为依据计算在这段时间里各路径上的乘客比例.采用数值模拟的方法在一对有两条有效路径的出入站间产生乘客旅行时间的数据,然后根据这些数据进行客流比例计算.结果表明,即使两条路径的运营时间差异很小也能实现较准确的比例划分,这种动态计算客流分布的方法能更准确地反映实际客流分布.     

A path-based flow formulation for the traffic assignment problem

In order to improve cooperation between traffic management and travelers, traffic assignment is the key component to achieve the objectives of both traffic management and route choice decisions for travelers. Traffic assignment can be classified into two models based on the behavioral assumptions governing route choices: User Equilibrium (UE) and System Optimum (SO) traffic assignment. According to UE and SO traffic assignment, travelers usually compete to choose the least cost routes to minimize their own travel costs, while SO traffic assignment requires travelers to work cooperatively to minimize overall cost in the road network. Thus, the paradox of benefits between UE and SO indicates that both are not practical. Thus, a solution technique needs to be proposed to balance UE and SO models, which can compromise both sides and give more feasible traffic assignments. In this paper, Stackelberg game theory is introduced to the traffic assignment problem, which can achieve the trade-off process between traffic management and travelers. Since traditional traffic assignments have low convergence rates, the gradient projection algorithm is proposed to improve efficiency.     

Validation of a schedule‐based capacity restraint transit assignment model for a large‐scale network

This paper describes the application of a capacity restraint trip assignment algorithm to a real, large‐scale transit network and the validation of the results. Unlike the conventional frequency‐based approach, the network formulation of the proposed model is dynamic and schedule‐based. Transit vehicles are assumed to operate to a set of pre‐determined schedules. Passengers are assumed to select paths based on a generalized cost function including in‐vehicle and out‐of‐vehicle time and line change penalty. The time‐varying passenger demand is loaded onto the network by a time increment simulation method, which ensures that the capacity restraint of each vehicle during passenger boarding is strictly observed. The optimal‐path and path‐loading algorithms are applied iteratively by the method of successive averages until the network converges to the predictive dynamic user equilibrium. The Hong Kong Mass Transit Railway network is used to validate the model results. The potential applications of the model are also discussed.