Vehicle Positioning for Improving Road Safety

Abstract

Vehicle positioning is a key requirement for many safety applications. Active safety systems require precise vehicle positioning in order to assess the safety threats accurately, especially for those systems which are developed for warning/intervention in safety critical situations. When warning drivers of a local hazard (e.g. an accident site), accurate vehicle location information is important for warning the right driver groups at the right time. Global positioning system and digital maps have become major tools for vehicle positioning providing not only vehicle location information but also geometry preview of the road being used. Advances in wireless communication have made it possible for a vehicle to share its location information with other vehicles and traffic operation centres which greatly increases the opportunities to apply vehicle positioning technologies for improving road safety. This paper presents a state‐of‐the‐art review of vehicle positioning requirements for safety applications and vehicle positioning technologies. The paper also examines key issues relating to current and potential future applications of vehicle positioning technologies for improving road safety.     

Integrity of map-matching algorithms

Map-matching algorithms are used to integrate positioning data with digital road network data so that vehicles can be placed on a road map. However, due to error associated with both positioning and map data, there can be a high degree of uncertainty associated with the map-matched locations. A quality indicator representing the level of confidence (integrity) in map-matched locations is essential for some Intelligent Transport System applications and could provide a warning to the user and provide a means of fast recovery from a failure. The objective of this paper is to determine an empirical method to derive the integrity of a map-matched location for three previously developed algorithms. This is achieved by formulating a metric based on various error sources associated with the positioning data and the map data. The metric ranges from 0 to 100 where 0 indicates a very high level of uncertainty in the map-matched location and 100 indicates a very low level of uncertainty. The integrity method is then tested for the three map-matching algorithms in the cases when the positioning data is from either a stand-alone global positioning system (GPS) or GPS integrated with deduced reckoning (DR) and for map data from three different scales (1:1250, 1:2500, and 1:50 000). The results suggest that the performance of the integrity method depends on the type of map-matching algorithm and the quality of the digital map data. A valid integrity warning is achieved 98.2% of the time in the case of the fuzzy logic map-matching algorithm with positioning data come from integrated GPS/DR and a digital map data with a scale of 1:2500.     

Current map-matching algorithms for transport applications: State-of-the art and future research directions

Map-matching algorithms integrate positioning data with spatial road network data (roadway centrelines) to identify the correct link on which a vehicle is travelling and to determine the location of a vehicle on a link. A map-matching algorithm could be used as a key component to improve the performance of systems that support the navigation function of intelligent transport systems (ITS). The required horizontal positioning accuracy of such ITS applications is in the range of 1 m to 40 m (95%) with relatively stringent requirements placed on integrity (quality), continuity and system availability. A number of map-matching algorithms have been developed by researchers around the world using different techniques such as topological analysis of spatial road network data, probabilistic theory, Kalman filter, fuzzy logic, and belief theory. The performances of these algorithms have improved over the years due to the application of advanced techniques in the map matching processes and improvements in the quality of both positioning and spatial road network data. However, these algorithms are not always capable of supporting ITS applications with high required navigation performance, especially in difficult and complex environments such as dense urban areas. This suggests that research should be directed at identifying any constraints and limitations of existing map matching algorithms as a prerequisite for the formulation of algorithm improvements. The objectives of this paper are thus to uncover the constraints and limitations by an in-depth literature review and to recommend ideas to address them. This paper also highlights the potential impacts of the forthcoming European Galileo system and the European Geostationary Overlay Service (EGNOS) on the performance of map matching algorithms. Although not addressed in detail, the paper also presents some ideas for monitoring the integrity of map-matching algorithms. The map-matching algorithms considered in this paper are generic and do not assume knowledge of ‘future’ information (i.e. based on either cost or time). Clearly, such data would result in relatively simple map-matching algorithms.     

Generating lane-based intersection maps from crowdsourcing big trace data

Lane-based road information plays a critical role in transportation systems, a lane-based intersection map is the most important component in a detailed road map of the transportation infrastructure. Researchers have developed various algorithms to detect the spatial layout of intersections based on sensor data such as high-definition images/videos, laser point cloud data, and GPS traces, which can recognize intersections and road segments; however, most approaches do not automatically generate Lane-based Intersection Maps (LIMs). The objective of our study is to generate LIMs automatically from crowdsourced big trace data using a multi-hierarchy feature extraction strategy. The LIM automatic generation method proposed in this paper consists of the initial recognition of road intersections, intersection layout detection, and lane-based intersection map-generation. The initial recognition process identifies intersection and non-intersection areas using spatial clustering algorithms based on the similarity of angle and distance. The intersection layout is composed of exit and entry points, obtained by combining trajectory integration algorithms and turn rules at road intersections. The LIM generation step is finally derived from the intersection layout detection results and lane-based road information, based on geometric matching algorithms. The effectiveness of our proposed LIM generation method is demonstrated using crowdsourced vehicle traces. Additional comparisons and analysis are also conducted to confirm recognition results. Experiments show that the proposed method saves time and facilitates LIM refinement from crowdsourced traces more efficiently than methods based on other types of sensor data.     

Hardware-in-the-loop testbed for evaluating connected vehicle applications

Connected vehicle environment provides the groundwork of future road transportation. Researches in this area are gaining a lot of attention to improve not only traffic mobility and safety, but also vehicles’ fuel consumption and emissions. Energy optimization methods that combine traffic information are proposed, but actual testing in the field proves to be rather challenging largely due to safety and technical issues. In light of this, a Hardware-in-the-Loop-System (HiLS) testbed to evaluate the performance of connected vehicle applications is proposed. A laboratory powertrain research platform, which consists of a real engine, an engine-loading device (hydrostatic dynamometer) and a virtual powertrain model to represent a vehicle, is connected remotely to a microscopic traffic simulator (VISSIM). Vehicle dynamics and road conditions of a target vehicle in the VISSIM simulation are transmitted to the powertrain research platform through the internet, where the power demand can then be calculated. The engine then operates through an engine optimization procedure to minimize fuel consumption, while the dynamometer tracks the desired engine load based on the target vehicle information. Test results show fast data transfer at every 200 ms and good tracking of the optimized engine operating points and the desired vehicle speed. Actual fuel and emissions measurements, which otherwise could not be calculated precisely by fuel and emission maps in simulations, are achieved by the testbed. In addition, VISSIM simulation can be implemented remotely while connected to the powertrain research platform through the internet, allowing easy access to the laboratory setup.     

Integrated solution for anomalous driving detection based on BeiDou/GPS/IMU measurements

There has been an increasing role played by Global Navigation Satellite Systems (GNSS) in Intelligent Transportation System (ITS) applications in recent decades. In particular, centimeter/decimetre positioning accuracy is required for some safety related applications, such as lane control, collision avoidance, and intelligent speed assistance. Lane-level Anomalous driving detection underpins these safety-related ITS applications. The two major issues associated with such detection are (1) accessing high accuracy vehicle positioning and dynamic parameters; and (2) extraction of irregular driving patterns from such information. This paper introduces a new integrated framework for detecting lane-level anomalous driving, by combining Global Positioning Systems (GPS), BeiDou, and Inertial Measurement Unit (IMU) with advanced algorithms. Specifically, we use Unscented Particle Filter (UPF) to perform data fusion with different positioning sources. The detection of different types of Anomalous driving is achieved based on the application of a Fuzzy Inference System (FIS) with a newly introduced velocity-based indicator. The framework proposed in this paper yield significantly improved accuracy in terms of positioning and Anomalous driving detection compared to state-of-the-art, while offering an economically viable solution for performing these tasks.     

Traffic signal timing problems with environmental and equity considerations

Traffic signal timings in a road network can not only affect total user travel time and total amount of traffic emissions in the network but also create an inequity problem in terms of the change in travel costs of users traveling between different locations. This paper proposes a multi‐objective bi‐level programming model for design of sustainable and equitable traffic signal timings for a congested signal‐controlled road network. The upper level of the proposed model is a multi‐objective programming problem with an equity constraint that maximizes the reserve capacity of the network and minimizes the total amount of traffic emissions. The lower level is a deterministic network user equilibrium problem that considers the vehicle delays at signalized intersections of the network. To solve the proposed model, an approach for normalizing incommensurable objective functions is presented, and a heuristic solution algorithm that combines a penalty function approach and a simulated annealing method is developed. Two numerical examples are presented to show the effects of reserve capacity improvement and green time proportion on network flow distribution and transportation system performance and the importance of incorporating environmental and equity objectives in the traffic signal timing problems. Copyright © 2013 John Wiley & Sons, Ltd.     

A driving cycle detection approach using map service API

Following advancements in smartphone and portable global positioning system (GPS) data collection, wearable GPS data have realized extensive use in transportation surveys and studies. The task of detecting driving cycles (driving or car-mode trajectory segments) from wearable GPS data has been the subject of much research. Specifically, distinguishing driving cycles from other motorized trips (such as taking a bus) is the main research problem in this paper. Many mode detection methods only focus on raw GPS speed data while some studies apply additional information, such as geographic information system (GIS) data, to obtain better detection performance. Procuring and maintaining dedicated road GIS data are costly and not trivial, whereas the technical maturity and broad use of map service application program interface (API) queries offers opportunities for mode detection tasks. The proposed driving cycle detection method takes advantage of map service APIs to obtain high-quality car-mode API route information and uses a trajectory segmentation algorithm to find the best-matched API route. The car-mode API route data combined with the actual route information, including the actual mode information, are used to train a logistic regression machine learning model, which estimates car modes and non-car modes with probability rates. The experimental results show promise for the proposed method’s ability to detect vehicle mode accurately.     

Multicriteria evaluation on accessibility‐based transportation equity in road network design problem

This paper investigates the performance of accessibility‐based equity measurements in transportation and proposes a multiobjective optimization model to simulate the trade‐offs between equity maximization and cost minimization of network construction. The equity is defined as the spatial distribution of accessibilities across zone areas. Six representative indicators were formulated, including GINI coefficient, Theil index, mean log deviation, relative mean deviation, coefficient of variation, and Atkinson index, and incorporated into an equity maximization model to evaluate the performance sensitivity. A bilevel multiobjective optimization model was proposed to obtain the Pareto‐optimal solutions for link capacity enhancement in a stochastic road network design problem. A numerical analysis using the Sioux Falls data was implemented. Results verified that the equity indicators are quite sensitive to the pattern of network scenarios in the sense that the level of equity varies according to the amount of overall capacity enhancement as well as the assignment of improved link segments. The suggested multiobjective model that enables representing the Pareto‐optimal solutions can provide multiple options in the decision making of road network design. Copyright © 2012 John Wiley & Sons, Ltd.     

Developing link-based particle number emission models for diesel transit buses using engine and vehicle parameters

To better assess health impacts from diesel transportation sources, particle number emissions can be modeled on a road network using traffic operating parameters. In this work, real-time particle number emissions rates from two diesel transit buses were aggregated to the roadway link-level and modeled using engine parameters and then vehicle parameters. Modern statistical methods were used to identify appropriate predictor variables in the presence of multicollinearity, and controlled for correlated emission measurements made on the same day and testing route. Factor analysis helped to reduce the number of potential engine parameters to engine load, engine speed, and exhaust temperature. These parameters were incorporated in a linear mixed model that was shown to explain the variation attributable to link-characteristics. Vehicle specific power and speed were identified as two surrogate vehicle travel variables that can be used in the absence of engine parameters, although with a loss in predictive power compared to the engine parameter model. If vehicle speed is the only operating input available, including road grades in the model can significantly improve particle number emission estimates even for links with mild grade. Although the data used are specific to the buses tested, the approach can be applied to modeling emissions from other vehicle models with different engine types, exhaust systems, and engine retrofit technologies.     

Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks

In this paper, we propose a new model for the within-day Dynamic Traffic Assignment (DTA) on road networks where the simulation of queue spillovers is explicitly addressed, and a user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles, i.e., in the infinite dimension space of time’s functions. The model integrates spillback congestion into an existing formulation of the DTA based on continuous-time variables and implicit path enumeration, which is capable of explicitly representing the formation and dispersion of vehicle queues on road links, but allows them to exceed the arc length. The propagation of congestion among adjacent arcs will be achieved through the introduction of time-varying exit and entry capacities that limit the inflow on downstream arcs in such a way that their storage capacities are never exceeded. Determining the temporal profile of these capacity constraints requires solving a system of spatially non-separable macroscopic flow models on the supply side of the DTA based on the theory of kinematic waves, which describe the dynamic of the spillback phenomenon and yield consistent network performances for given arc flows. We also devise a numerical solution algorithm of the proposed continuous-time formulation allowing for “long time intervals” of several minutes, and give an empirical evidence of its convergence. Finally, we carry out a thorough experimentation in order to estimate the relevance of spillback modeling in the context of the DTA, compare the proposed model in terms of effectiveness with the Cell Transmission Model, and assess the efficiency of the proposed algorithm and its applicability to real instances with large networks.     

Vehicle classification from low-frequency GPS data with recurrent neural networks

The categorization of the type of vehicles on a road network is typically achieved using external sensors, like weight sensors, or from images captured by surveillance cameras. In this paper, we leverage the nowadays widespread adoption of Global Positioning System (GPS) trackers and investigate the use of sequences of GPS points to recognize the type of vehicle producing them (namely, small-duty, medium-duty and heavy-duty vehicles). The few works which already exploited GPS data for vehicle classification rely on hand-crafted features and traditional machine learning algorithms like Support Vector Machines. In this work, we study how performance can be improved by deploying deep learning methods, which are recently achieving state of the art results in the classification of signals from various domains. In particular, we propose an approach based on Long Short-Term Memory (LSTM) recurrent neural networks that are able to learn effective hierarchical and stateful representations for temporal sequences. We provide several insights on what the network learns when trained with GPS data and contextual information, and report experiments on a very large dataset of GPS tracks, where we show how the proposed model significantly improves upon state-of-the-art results.     

Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times

This paper presents a dynamic vehicle routing and scheduling model that incorporates real time information using variable travel times. Dynamic traffic simulation was used to update travel times. The model was applied to a test road network. Results indicated that the total cost decreased by implementing the dynamic vehicle routing and scheduling model with the real time information based on variable travel times compared with that of the forecast model. As well, in many cases total running times of vehicles were also decreased. Therefore, the dynamic vehicle routing and scheduling model will be beneficial for both carriers in reducing total costs and society at large by alleviating traffic congestion.     

Urban road traffic noise spatiotemporal distribution mapping using multisource data

Many residents are disturbed by road traffic noise which needs to be controlled and managed. The noise map is a helpful and important tool for noise management and acoustical planning in urban areas. However, the static noise map is not sufficient for evaluating noise annoyance at different temporal periods. It is necessary to develop the dynamic noise map or the noise spatiotemporal distribution. In this study, a method about urban road traffic noise spatiotemporal distribution mapping is proposed to obtain the representative road traffic noise maps of different periods. This method relies on the proposed noise spatiotemporal distribution model with two time-dependent variables - traffic density and traffic speed, and the spatiotemporal characteristics derived from multisource data. There are three steps in the method. First, the urban road traffic noise spatiotemporal distribution model is derived from the law of sound propagation. Then, the temporal characteristics are extracted from traffic flow detecting data and E-map road segment speed data by the outlier detection analysis. Finally, the noise distributions corresponding to different periods are calculated by an efficient algorithm which can save 90% above of the computing time. Moreover, a validation experiment was conducted to evaluate the accuracy of the proposed method. There is only 2.26-dB[A] mean absolute error that is within an acceptable range, which shows that the method is effective.     

临时关闭道路以疏导城市道路交通流的可行性分析

文章基于Braess悖论,以单位车辆的平均出行时间为最优目标,以网络道路系统为约束条件,从逆向思维角度建立了通过临时关闭道路引导交通流以缓解城市道路交通拥挤的Narsh均衡非线性规划模型,并以北京二环道路网络为研究对象进行了实例分析。结果表明,在城市道路网中,关闭部分路段并不能明显缓解交通拥堵现状,但可以在不影响路网整体通行时间的条件下改善路网局部拥堵状况。建议城市道路交通临时疏导方案应该根据路网交通流的分布特点和道路通过能力等因素进行制订。     

Likelihood-based offline map matching of GPS recordings using global trace information

In batch map matching the objective is to derive from a time series of position data the sequence of road segments visited by the traveler for posterior analysis. Taking into account the limited accuracy of both the map and the measurement devices several different movements over network links may have generated the observed measurements. The set of candidate solutions can be reduced by adding assumptions about the traveller’s behavior (e.g. respecting speed limits, using shortest paths, etc.). The set of feasible assumptions however, is constrained by the intended posterior analysis of the link sequences produced by map matching. This paper proposes a method that only uses the spatio-temporal information contained in the input data (GPS recordings) not reduced by any additional assumption.The method partitions the trace of GPS recordings so that all recordings in a part are chronologically consecutive and match the same set of road segments. Each such trace part leads to a collection of partial routes that can be qualified by their likelihood to have generated the trace part. Since the trace parts are chronologically ordered, an acyclic directed graph can be used to find the best chain of partial routes. It is used to enumerate candidate solutions to the map matching problem.Qualification based on behavioral assumptions is added in a separate later stage. Separating the stages helps to make the underlying assumptions explicit and adaptable to the purpose of the map matched results. The proposed technique is a multi-hypothesis technique (MHT) that does not discard any hypothesized path until the second stage.A road network extracted from OpenStreetMap (OSM) is used. In order to validate the method, synthetic realistic GPS traces were generated from randomly generated routes for different combinations of device accuracy and recording period. Comparing the base truth to the map matched link sequences shows that the proposed technique achieves a state of the art accuracy level.     

Closed-form multiclass cell transmission model enhanced with overtaking,lane-changing,and first-in first-out properties

A novel multiclass macroscopic model is proposed in this article. In order to enhance first-in, first-out property (FIFO) and transmission function in the multiclass traffic modeling, a new multiclass cell transmission model with FIFO property (herein called FM-CTM) is extended from its prior multiclass cell transmission model (M-CTM). Also, to enhance its analytical compactness and resultant computational convenience, FM-CTM is formulated in this paper as a set of closed-form matrix equations. The objective is to improve the accuracy of traffic state estimation by enforcing FIFO property when a fast vehicle cannot overtake a slow vehicle due to a limitation of a single-lane road. Moreover, the proposed model takes into account a different priority for vehicles of each class to move forward through congested road conditions, and that makes the flow calculation independent from their free-flow speeds. Some hypothetical and real-world freeway networks with a constant or varying number of lanes are selected to verify FM-CTM by comparing with M-CTM and the conventional CTM. Observed densities of VISSIM and real-world dataset of I-80 are selected to compare with the simulated densities from the three CTMs. The numerical results show that FM-CTM outperforms the other two models by 15% of accuracy measures in most cases. Therefore, the proposed model is expected to be well applicable to the road network with a mixed traffic and varying number of lanes.     

A theoretical travel-time model for flexible-route buses

A theoretical model for estimating the expectation and variance of buses' running times under a flexibly-routed mode of service is proposed. The model is based on a probabilistic concept that adequately accommodates the usual randomness in the number and location of passengers served during successive vehicle trips. A few simplifications are embodied in the model but it can serve as a basis for a more refined model such as a computer simulation model that can be used in designing real bus systems.The physical setting assumed in the model is a rectangular grid road network where all houses face the side streets as in some suburban regions. Because it oversimplifies real-life situations, this assumption would need to be relaxed to make the model applicable to more general cases.Both the partially flexible-route service where some passengers are captive to fixed-route service and others are served at their doorsteps, and the fully flexible-route service where all passengers are served at their doorsteps, are studied. In each case, a very simple routing convention that can be conveniently executed by the bus drivers is assumed. The proposed travel time model confirms the intuitively correct phenomenon that when the concentration of passenger trip-ends is very high, the vehicle-route degenerates into a fixed-route in which the buses visit all possible loading points within the service area.     

On the existence of stationary states in general road networks

Our daily driving experience and empirical observations suggest that traffic patterns in a road network are relatively stationary during peak periods. In numerous transportation network studies, there has been an implicit conjecture that stationary states exist in a network when origin demands, route choice proportions, and destination supplies are constant. In this study, we first rigorously formulate the conjecture within the framework of a network kinematic wave theory with an invariant junction model. After defining stationary states, we derive a system of algebraic equations in 3-tuples of stationary link flow-rates, demands, and supplies. We then introduce a new definition of junction critical demand levels based on effective demands and supplies. With a map in critical demand levels, we show that its fixed points and, therefore, stationary states exist with the help of Brouwer’s fixed point theorem. For two simple road networks, we show that the map is well-defined and can be used to solve stationary states with a brute-force method. Finally we summarize the study and present some future extensions and applications.     

广西路网工程路线设计方法

文章结合广西路网工程建设背景、路网工程建设程序、路线设计步骤,介绍了以公路运行安全、新征用土地数量、工程造价、地形地物、方便施工等为原则控制路线的设计方法,同时针对当前路网工程路线设计中存在的主要问题,提出了相关的处理措施。