汽车ACC毫米波雷达和视觉传感器目标级融合方法研究

自适应巡航控制系统是实现未来智能化汽车辅助驾驶的重要功能之一,以往该系统主要采用毫米波雷达感知周围环境,但是容易出现较多的误识别和漏识别情况.针对现存的问题,文章研究了自适应巡航感知系统,不同于以往单一雷达的方案,本设计采用毫米波雷达和视觉传感器融合的办法改善感知系统的性能.通过搭建电动车传感器数据采集系统,编写CAN...     

Real time detection of driver attention: Emerging solutions based on robust iconic classifiers and dictionary of poses

Real time monitoring of driver attention by computer vision techniques is a key issue in the development of advanced driver assistance systems. While past work mostly focused on structured feature-based approaches, characterized by high computational requirements, emerging technologies based on iconic classifiers recently proved to be good candidates for the implementation of accurate and real-time solutions, characterized by simplicity and automatic fast training stages.In this work the combined use of binary classifiers and iconic data reduction, based on Sanger neural networks, is proposed, detailing critical aspects related to the application of this approach to the specific problem of driving assistance. In particular it is investigated the possibility of a simplified learning stage, based on a small dictionary of poses, that makes the system almost independent from the actual user.On-board experiments demonstrate the effectiveness of the approach, even in case of noise and adverse light conditions. Moreover the system proved unexpected robustness to various categories of users, including people with beard and eyeglasses. Temporal integration of classification results, together with a partial distinction among visual distraction and fatigue effects, make the proposed technology an excellent candidate for the exploration of adaptive and user-centered applications in the automotive field.     

基于自适应神经模糊推理的交通状态判别方法

文章针对交通状态具有模糊性和主观性的特点,建立能够真实反映人对交通拥塞程度感觉的自适应-神经模糊推理系统,使具有变化连续的交通流参数模糊化处理,实现了道路交通状态的准确、快速辨别。     

Path-constrained traffic assignment: A trip chain analysis under range anxiety

This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in equilibrium network flows. The purpose of studying this problem is to develop an appropriate modeling tool for characterizing traffic flow patterns in emerging transportation networks that serve a massive adoption of plug-in electric vehicles. This need arises from the facts that electric vehicles suffer from the “range anxiety” issue caused by the unavailability or insufficiency of public electricity-charging infrastructures and the far-below-expectation battery capacity. It is suggested that if range anxiety makes any impact on travel behaviors, it more likely occurs on the trip chain level rather than the trip level, where a trip chain here is defined as a series of trips between two possible charging opportunities (Tamor et al., 2013). The focus of this paper is thus given to the development of the modeling and solution methods for the proposed traffic assignment problem. In this modeling paradigm, given that trip chains are the basic modeling unit for individual decision making, any traveler’s combined travel route and activity location choices under the distance limit results in a distance-constrained, node-sequenced shortest path problem. A cascading labeling algorithm is developed for this shortest path problem and embedded into a linear approximation framework for equilibrium network solutions. The numerical result derived from an illustrative example clearly shows the mechanism and magnitude of the distance limit and trip chain settings in reshaping network flows from the simple case characterized merely by user equilibrium.     

Short-term speed predictions exploiting big data on large urban road networks

Big data from floating cars supply a frequent, ubiquitous sampling of traffic conditions on the road network and provide great opportunities for enhanced short-term traffic predictions based on real-time information on the whole network. Two network-based machine learning models, a Bayesian network and a neural network, are formulated with a double star framework that reflects time and space correlation among traffic variables and because of its modular structure is suitable for an automatic implementation on large road networks. Among different mono-dimensional time-series models, a seasonal autoregressive moving average model (SARMA) is selected for comparison. The time-series model is also used in a hybrid modeling framework to provide the Bayesian network with an a priori estimation of the predicted speed, which is then corrected exploiting the information collected on other links. A large floating car data set on a sub-area of the road network of Rome is used for validation. To account for the variable accuracy of the speed estimated from floating car data, a new error indicator is introduced that relates accuracy of prediction to accuracy of measure. Validation results highlighted that the spatial architecture of the Bayesian network is advantageous in standard conditions, where a priori knowledge is more significant, while mono-dimensional time series revealed to be more valuable in the few cases of non-recurrent congestion conditions observed in the data set. The results obtained suggested introducing a supervisor framework that selects the most suitable prediction depending on the detected traffic regimes.     

Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem

In this paper, we study two closely related airline planning problems: the robust weekly aircraft maintenance routing problem (RWAMRP) and the tail assignment problem (TAP). In real life operations, the RWAMRP solution is used in tactical planning whereas the TAP solution is implemented in operational planning. The main objective of these two problems is to minimize the total expected propagated delay (EPD) of the aircraft routes. To formulate the RWAMRP, we propose a novel weekly line-of-flights (LOF) network model that can handle complex and nonlinear cost functions of EPD. Because the number of LOFs grows exponentially with the number of flights to be scheduled, we propose a two-stage column generation approach to efficiently solve large-scale real-life RWAMRPs. Because the EPD of an LOF is highly nonlinear and can be very time-consuming to accurately compute, we propose three lower bounds on the EPD to solve the pricing subproblem of the column generation. Our approach is tested on eight real-life test instances. The computational results show that the proposed approach provides very tight LP relaxation (within 0.6% of optimal solutions) and solves the test case with more than 6000 flights per week in less than three hours. We also investigate the solutions obtained by our approach over 500 simulated realizations. The simulation results demonstrate that, in all eight test instances, our solutions result in less EPDs than those obtained from traditional methods. We then extend our model and solution approach to solve realistically simulated TAP instances.     

Prioritizing road extension projects with interdependent benefits under time constraint

Since transportation projects are costly and resources are limited, prioritizing or sequencing the projects is imperative. This study was inspired by a client who asked: “I have tens of approved road extension projects, but my financial resources are limited. I cannot construct all the projects simultaneously, so can you help me prioritize my projects?” To address this question, the benefits and costs of all the possible scenarios must be known. However, the impacts (or benefit) of road extension projects are highly interdependent, and in sizable cases cannot be specified thoroughly. We demonstrate that the problem is analogous to the Traveling Salesman Problem (TSP). Dynamic change in travel demand during construction is another aspect of the complexity of the problem. The literature is yet to provide efficient methods for large cases. To this end, we developed a heuristic methodology in which the variation of travel demand during the construction period is considered. We introduce a geometrical objective function for which a solution-finding policy based on “gradient maximization” is developed. To address the projects’ interdependency, a special neural network (NN) model was devised. We developed a search engine hybridized of Ant Colony and Genetic Algorithm to seek a solution to the TSP-like problem on the NN based on gradient maximization. The algorithm was calibrated and applied to real data from the city of Winnipeg, Canada, as well as two cases based on Sioux-Falls. The results were reliable and identification of the optimum solution was achievable within acceptable computational time.     

Stability and bifurcation in network traffic flow: A Poincaré map approach

Previous studies have shown that, in a diverge-merge network with two intermediate links (the DM network), the kinematic wave model always admits stationary solutions under constant boundary conditions, but periodic oscillations can develop from empty initial conditions. Such contradictory observations suggest that the stationary states be unstable. In this study we develop a systematic approach to investigate the stability property of stationary states in this and other networks within the framework of network kinematic wave theories. Based on the observation that kinematic waves propagate in a circular path when only one of the two intermediate links is congested, we derive a one-dimensional, discrete Poincaré map in the out-flux at a Poincaré section. We then prove that the fixed points of the Poincaré map correspond to stationary flow-rates on the two links. With Lyapunov’s first method, we demonstrate that the Poincaré map can be finite-time stable, asymptotically stable, or unstable. When unstable, the map is found to have periodical points of period two, but no chaotic solutions. We further analyze the bifurcation in the stability of the Poincaré map caused by varying route choice proportions. We apply the Poincaré map approach to analyzing traffic patterns in more general (DM)ⁿ and beltway networks, which are sufficient and necessary structures for network-induced unstable traffic and gridlock, respectively. This study demonstrates that the Poincaré map approach can be efficiently applied to analyze traffic dynamics in any road networks with circular information propagation and provides new insights into unstable traffic dynamics caused by interactions among network bottlenecks.     

Airline energy efficiency measures using the Virtual Frontier Network RAM with weak disposability

In this paper, airline energy efficiency is divided into three stages: the operations stage, the services stage and the sales stage. Greenhouse gas emissions are treated as an undesirable output of the services stage. This new three-stage strategic operating framework is a modification of existing models. A new model, Virtual Frontier Network Range Adjusted Measure with weak disposability, is proposed to evaluate the efficiencies of 22 international airlines, from 2008 to 2012. The results show that the new model can establish more reasonable rankings and confirm new benchmarking airlines and that inclusion in the European Union’s Emissions Trading Scheme has had little influence on the improvement of airline energy efficiency.     

Short-term Hourly Traffic Forecasts using Hong Kong Annual Traffic Census

The need for acquiring the current-year traffic data is a problem for transport planners since such data may not be available for on-going transport studies. A method is proposed in this paper to predict hourly traffic flows up to and into the near future, using historical data collected from the Hong Kong Annual Traffic Census (ATC). Two parametric and two non-parametric models have been employed and evaluated in this study. The results show that the non-parametric models (Non-Parametric Regression (NPR) and Gaussian Maximum Likelihood (GML)) were more promising for predicting hourly traffic flows at the selected ATC station. Further analysis encompassing 87 ATC stations revealed that the NPR is likely to react to unexpected changes more effectively than the GML method, while the GML model performs better under steady traffic flows. Taking into consideration the dynamic nature of the common traffic patterns in Hong Kong and the advantages/disadvantages of the various models, the NPR model is recommended for predicting the hourly traffic flows in that region.