DRM同步与均衡技术研究

DRM（Digital Radio Mondiale）是世界上唯一非专利的数字广播系统,它为30MHz以下频段的长波、中波、短波广播提供了数字化的标准。同步算法和信道估计作为其关键技术对系统性能有着十分重要的影响,文章提出了适用于DRM系统的符号同步算法、整数倍载波频偏估计算法、小数倍载波频偏估计算法以及时频域联合信道估计和均衡算法,并对这些算法进行了仿真分析。     

基于冗余信息融合的车辆质心侧偏角估计方法

车辆质心侧偏角是表征车辆横向稳定性的重要参数之一,相关的估计方法研究可为整车稳定控制提供重要支撑.为提高车辆质心侧偏角估计效果,提出了一种基于冗余信息融合的质心侧偏角估计方法.分别建立了车辆动力学模型和运动学模型,利用容积卡尔曼滤波算法分别设计了用于车辆行驶状态估计的动力学模型估计器和运动学模型估计器,同时,分析了动力...     

基于改进容量增量分析法的锂电池可用容量估计

针对动力锂电池在使用过程中难以高效准确估计其衰退后可用容量的问题,提出一种不依赖滤波算法的容量增量分析法获取不同型号电池的容量衰退特征,并基于数据驱动的方法搭建可用容量估计模型。首先,分别分析低通滤波与小波滤波在获取容量增量曲线中存在的问题,并对比差分电压值在1、10、20、50 mV时容量增量曲线的形态。其次,采用移动方差算法对不同电压差分值下容量增量曲线的波动性做出评价,确定出峰值特性明显且平滑的容量增量曲线。提取曲线的峰值作为动力锂电池的老化特征,运用斯皮尔曼相关性系数验证老化特征与电池老化状态之间的相关性。然后,引入门控循环单元建立锂电池的可用容量估计模型。最后,将不同老化测试条件下的2类电池老化数据集用于模型验证。研究结果表明:所建立的估计模型能够有效估算锂电池全寿命循环内的可用容量值,2组数据集中测试结果的相对误差除个别值外,多数相对误差值在2%以内;数据组1中,分别选取电池1和电池3测试数据的前50%为训练数据,后50%为测试数据,训练结果绝对误差稳定在0.05 A·h左右,测试结果绝对误差在0.04 A·h左右;对电池2与电池3的全寿命循环可用容量做出估计,结果相对误差稳定在2%左右;数据组2中对电池5、电池6和电池7的全寿命循环可用容量估计结果的相对误差整体亦在2%以内;且模型能够对锂电池循环过程中出现容量再生现象的循环做出4%以内的准确估计,显示出良好的估算精度和泛化能力。     

Simulation-based severe weather-induced container terminal economic loss estimation

Container terminals play a critical role in maritime supply chains. However, they show vulnerabilities to severe weather events due to the sea–land interface locations. Previous severe weather risk analysis focused more on larger assessment units, such as regions and cities. Limited studies assessed severe weather risks on a smaller scale of seaports. This paper aims to propose a severe weather-induced container terminal loss estimation framework. Based on a container terminal operation simulation model, monthly average loss and single event-induced loss are obtained by using historical hazard records and terminal operation records as model inputs. By studying the Port of Shenzhen as the case study, we find that the fog events in March lead to the longest monthly port downtime and the highest monthly severe weather-induced economic losses in the studied port. The monthly average loss is estimated to be 30 million USD, accounting for 20% of the intact income. The worst-case scenario is found to be a red-signal typhoon attack which results in nearly 20% decrease in the month’s income. The results provide useful references for various container terminal stakeholders in severe weather risk management.     

A nested recursive logit model for route choice analysis

We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination. The value functions are the solution to a system of non-linear equations. We propose an iterative method with dynamic accuracy that allows to efficiently solve these systems.We report estimation results and a cross-validation study for a real network. The results show that the NRL model yields sensible parameter estimates and the fit is significantly better than the RL model. Moreover, the NRL model outperforms the RL model in terms of prediction.     

Link travel time inference using entry/exit information of trips on a network

This paper studies link travel time estimation using entry/exit time stamps of trips on a steady-state transportation network. We propose two inference methods based on the likelihood principle, assuming each link associates with a random travel time. The first method considers independent and Gaussian distributed link travel times, using the additive property that trip time has a closed-form distribution as the summation of link travel times. We particularly analyze the mean estimates when the variances of trip time estimates are known with a high degree of precision and examine the uniqueness of solutions. Two cases are discussed in detail: one with known paths of all trips and the other with unknown paths of some trips. We apply the Gaussian mixture model and the Expectation–Maximization (EM) algorithm to deal with the latter. The second method splits trip time proportionally among links traversed to deal with more general link travel time distributions such as log-normal. This approach builds upon an expected log-likelihood function which naturally leads to an iterative procedure analogous to the EM algorithm for solutions. Simulation tests on a simple nine-link network and on the Sioux Falls network respectively indicate that the two methods both perform well. The second method (i.e., trip splitting approximation) generally runs faster but with larger errors of estimated standard deviations of link travel times.     

Fatigue damage estimation in non-linear systems using a combination of Monte Carlo simulation and the First Order Reliability Method

For non-linear systems the estimation of fatigue damage under stochastic loadings can be rather time-consuming. Usually Monte Carlo simulation (MCS) is applied, but the coefficient-of-variation (COV) can be large if only a small set of simulations can be done due to otherwise excessive CPU time. The reason is that the fatigue damage estimation is very sensitive to the largest values from the simulations. The paper suggests the additional use of the First Order Reliability Method (FORM) to get a better estimation of the tail in the distribution of the estimated fatigue damage and thereby reducing the COV. For a specific example dealing with stresses in a tendon in a tension leg platform the COV is thereby reduced by a factor of three.     

Fine-grained OD estimation with automated zoning and sparsity regularisation

Given a road network, a fundamental object of interest is the matrix of origin destination (OD) flows. Estimation of this matrix involves at least three sub-problems: (i) determining a suitable set of traffic analysis zones, (ii) the formulation of an optimisation problem to determine the OD matrix, and (iii) a means of evaluating a candidate estimate of the OD matrix. This paper describes a means of addressing each of these concerns. We propose to automatically uncover a suitable set of traffic analysis zones based on observed link flows. We then employ regularisation to encourage the estimation of a sparse OD matrix. We finally propose to evaluate a candidate OD matrix based on its predictive power on held out link flows. Analysis of our approach on a real-world transport network reveals that it discovers automated zones that accurately capture regions of interest in the network, and a corresponding OD matrix that accurately predicts observed link flows.     

Towards data-driven car-following models

Car following models have been studied with many diverse approaches for decades. Nowadays, technological advances have significantly improved our traffic data collection capabilities. Conventional car following models rely on mathematical formulas and are derived from traffic flow theory; a property that often makes them more restrictive. On the other hand, data-driven approaches are more flexible and allow the incorporation of additional information to the model; however, they may not provide as much insight into traffic flow theory as the traditional models. In this research, an innovative methodological framework based on a data-driven approach is proposed for the estimation of car-following models, suitable for incorporation into microscopic traffic simulation models. An existing technique, i.e. locally weighted regression (loess), is defined through an optimization problem and is employed in a novel way. The proposed methodology is demonstrated using data collected from a sequence of instrumented vehicles in Naples, Italy. Gipps’ model, one of the most extensively used car-following models, is calibrated against the same data and used as a reference benchmark. Optimization issues are raised in both cases. The obtained results suggest that data-driven car-following models could be a promising research direction.     

Cellpath: Fusion of cellular and traffic sensor data for route flow estimation via convex optimization

A new convex optimization framework is developed for the route flow estimation problem from the fusion of vehicle count and cellular network data. The issue of highly underdetermined link flow based methods in transportation networks is investigated, then solved using the proposed concept of cellpaths for cellular network data. With this data-driven approach, our proposed approach is versatile: it is compatible with other data sources, and it is model agnostic and thus compatible with user equilibrium, system-optimum, Stackelberg concepts, and other models. Using a dimensionality reduction scheme, we design a projected gradient algorithm suitable for the proposed route flow estimation problem. The algorithm solves a block isotonic regression problem in the projection step in linear time. The accuracy, computational efficiency, and versatility of the proposed approach are validated on the I-210 corridor near Los Angeles, where we achieve 90% route flow accuracy with 1033 traffic sensors and 1000 cellular towers covering a large network of highways and arterials with more than 20,000 links. In contrast to long-term land use planning applications, we demonstrate the first system to our knowledge that can produce route-level flow estimates suitable for short time horizon prediction and control applications in traffic management. Our system is open source and available for validation and extension.