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.     

Map-matching poor-quality GPS data in urban environments: the pgMapMatch package

Global Positioning System (GPS) data have become ubiquitous in many areas of transportation planning and research. The usefulness of GPS data often depends on the points being matched to the true sequence of edges on the underlying street network – a process known as ‘map matching.’ This paper presents a new map-matching algorithm that is designed for use with poor-quality GPS traces in urban environments, where drivers may circle for parking and GPS quality may be affected by underground parking and tall buildings. The paper is accompanied by open-source Python code that is designed to work with a PostGIS spatial database. In a test dataset that includes many poor-quality traces, our new algorithm accurately matches about one-third more traces than a widely available alternative. Our algorithm also provides a ‘match score’ that evaluates the likelihood that the match for an individual trace is correct, reducing the need for manual inspection.     

Route choice of cyclists in Zurich

This paper presents the first route choice model for bicyclists estimated from a large sample of GPS observations and overcomes the limitations inherent in the generally employed stated preference approach. It employs an improved mode detection algorithm for GPS post-processing to determine trips made by bicycle, which are map matched to an enriched street network. The alternatives are generated as a random sample from an exhaustive, but constrained search. Accounting for the similarity between the alternatives with the path-size factor the MNL estimates show that the elasticity with regards to trip length is nearly four times larger than that with respect to the share of bike paths. The elasticity with respect to the product of length and maximum gradient of the route is small. No other variable describing the routes had an impact. The heterogeneity of the cyclists is captured through interaction terms formulated on their average behaviour.     

A tensor-based Bayesian probabilistic model for citywide personalized travel time estimation

Urban travel time information is of great importance for many levels of traffic management and operation. This paper develops a tensor-based Bayesian probabilistic model for citywide and personalized travel time estimation, using the large-scale and sparse GPS trajectories generated by taxicabs. Combined with the knowledge learned from historical trajectories, travel times of different drivers on all road segments in some time slots are modeled with a 3-order tensor. This tensor-based modeling approach incorporates both the spatial correlation between different road segments and the person-specific variation between different drivers, as well as the coarse-grain temporal correlation between recent and historical traffic conditions and the fine-grain temporal correlation between different time slots. To account for the variability caused by the intrinsic uncertainties in urban road network, each travel time entry in the built tensor is treated as a variable following a log-normal distribution. With the help of the fully Bayesian treatment, the model achieves automatic hyper-parameter tuning and model complexity controlling, and therefore the problem of over-fitting is prevented even when the used data is large-scale and sparse. The proposed model is applied to a real case study on the citywide road network of Beijing, China, using the large-scale and sparse GPS trajectories collected from over 32,670 taxicabs for a period of two months. Empirical results of extensive experiments demonstrate that the proposed model provides an effective and robust approach for urban travel time estimation and outperforms the considered competing methods.     

Transit-network design methodology for actual-size road networks

The main purpose of this study is to design a transit network of routes for handling actual-size road networks. This transit-network design problem is known to be complex and cumbersome. Thus, a heuristic methodology is proposed, taking into account the major concerns of transit authorities such as budget constraints, level-of-service standards and the attractiveness of the transit routes. In addition, this approach considers other important aspects of the problem including categorization of stops, multiclass of transit vehicles, hierarchy planning, system capacity (which has been largely ignored in past studies) and the integration between route-design and frequency-setting analyses. The process developed starts with the construction of a set of potential stops using a clustering concept. Then, by the use of Newton gravity theory and a special shortest-path procedure, a set of candidate routes is formed, categorized by hierarchy (mass, feeder, local routes). In the last step of the process a metaheuristic search engine is launched over the candidate routes, incorporating budgetary constraints, until a good solution is found. The algorithm was tested on the actual-size transit network of the city of Winnipeg; the results show that under the same conditions (budget and constraints) the proposed set of routes resulted in a reduction of 14% of total travel time compared to the existing transit network. In addition the methodology developed is compared favorably with other studies using the transit network of Mandl benchmark. The generality of the methodology was tested on the recent real dataset (pertaining to the year 2010) of the larger city of Chicago, in which a more efficient and optimized scheme was proposed for the existing rail system.     

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.     

Determining structural route components from GPS traces

Analysis of GPS traces shows that people often do not use the least cost path through the transportation network while making trips. This leads to the question which structural path characteristics can be used to construct realistic route choice sets for use in traffic simulation models. In this paper, we investigate the hypothesis that, for utilitarian trips, the route between origin and destination consists of a small number of concatenated least cost paths. The hypothesis is verified by analyzing routes extracted from large sets of recorded GPS traces which constitute revealed preference information. Trips have been extracted from the traces and for each trip the path in the transportation network is determined by map matching. This is followed by a path decomposition phase for which the algorithm constitutes the first contribution of this paper. There are multiple ways to split a given path in a directed graph into a minimal number of subpaths of minimal cost. By calculating two specific path splittings, it is possible to identify subsets of the vertices (splitVertexSuites) that can be used to generate every possible minimum path splitting by taking one vertex from each such subset. As a second contribution, we show how the extracted information is used in microscopic travel simulation. The distribution for the size of the minimum decomposition, extracted from the GPS traces, can be used in constrained enumeration methods for route choice set generation. The sets of vertices that can act as boundary vertices separating consecutive route parts contain way points (landmarks) having a particular meaning to their user. The paper explains the theoretical aspects of route splitting as well as the process to extract splitVertexSuites from big data. It reports statistical distributions extracted from sets of GPS traces for both multimodal person movements and unimodal car trips.     

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.     

A probabilistic map matching method for smartphone GPS data

Smartphones have the capability of recording various kinds of data from built-in sensors such as GPS in a non-intrusive, systematic way. In transportation studies, such as route choice modeling, the discrete sequences of GPS data need to be associated with the transportation network to generate meaningful paths. The poor quality of GPS data collected from smartphones precludes the use of state of the art map matching methods. In this paper, we propose a probabilistic map matching approach. It generates a set of potential true paths, and associates a likelihood with each of them. Both spatial (GPS coordinates) and temporal information (speed and time) is used to calculate the likelihood of the data for a specific path. Applications and analyses on real trips illustrate the robustness and effectiveness of the proposed approach. Also, as an application example, a Path-Size Logit model is estimated based on a sample of real observations. The estimation results show the viability of applying the proposed method in a real route choice modeling context.     

Predicting travel time reliability using mobile phone GPS data

Estimates of road speeds have become commonplace and central to route planning, but few systems in production provide information about the reliability of the prediction. Probabilistic forecasts of travel time capture reliability and can be used for risk-averse routing, for reporting travel time reliability to a user, or as a component of fleet vehicle decision-support systems. Many of these uses (such as those for mapping services like Bing or Google Maps) require predictions for routes in the road network, at arbitrary times; the highest-volume source of data for this purpose is GPS data from mobile phones. We introduce a method (TRIP) to predict the probability distribution of travel time on an arbitrary route in a road network at an arbitrary time, using GPS data from mobile phones or other probe vehicles. TRIP captures weekly cycles in congestion levels, gives informed predictions for parts of the road network with little data, and is computationally efficient, even for very large road networks and datasets. We apply TRIP to predict travel time on the road network of the Seattle metropolitan region, based on large volumes of GPS data from Windows phones. TRIP provides improved interval predictions (forecast ranges for travel time) relative to Microsoft’s engine for travel time prediction as used in Bing Maps. It also provides deterministic predictions that are as accurate as Bing Maps predictions, despite using fewer explanatory variables, and differing from the observed travel times by only 10.1% on average over 35,190 test trips. To our knowledge TRIP is the first method to provide accurate predictions of travel time reliability for complete, large-scale road networks.     

Modeling unobserved heterogeneity using finite mixture random parameters for spatially correlated discrete count data

Road segments with identical site-specific attributes often exhibit significantly different crash counts due to unobserved reasons. The extent of unobserved heterogeneity associated with a road feature is to be estimated prior to selecting the relevant safety treatment. Moreover, crash count data is often over-dispersed and spatially correlated. This paper proposes a spatial negative binomial specification with random parameters for modeling crash counts of contiguous road segments. The unobserved heterogeneity is incorporated using a finite multi-variate normal mixture prior on the random parameters; this allows for non-normality, skewness in the distribution of the random parameters, facilitates correlation across the random parameters, and relaxes any distributional assumptions. The model extracts the inherent groups of road segments with crash counts that are equally sensitive to the road attributes on an average; the heterogeneity within these groups is also allowed in the proposed framework. The specification simultaneously accounts for potential spatial correlation of the crash counts from neighboring road segments. A Gibbs sampling framework is proposed that leverages recent theoretical developments on data-augmentation algorithms, and elegantly sidesteps many of the computational difficulties usually associated with Bayesian inference of count models. Empirical results suggests the presence of two latent groups and spatial correlation within the study road network. Road features with significantly different effect on crash counts across two latent groups of road segments were identified.     

Estimation of a route choice model for urban public transport using smart card data

This paper describes a logit model of route choice for urban public transport and explains how the archived data from a smart card-based fare payment system can be used for the choice set generation and model estimation. It demonstrates the feasibility and simplicity of applying a trip-chaining method to infer passenger journeys from smart card transactions data. Not only origins and destinations of passenger journeys can be inferred but also the interchanges between the segments of a linked journey can be recognised. The attributes of the corresponding routes, such as in-vehicle travel time, transfer walking time and to get from alighting stop to trip destination, the need to change, and the time headway of the first transportation line, can be determined by the combination of smart card data with other data sources, such as a street map and timetable. The smart card data represent a large volume of revealed preference data that allows travellers' behaviour to be modelled with higher accuracy than by using traditional survey data. A multinomial route choice model is proposed and estimated by the maximum likelihood method, using urban public transport in ?ilina, the Slovak Republic, as a case study     

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.     

Real world vehicle emissions: Their correlation with driving parameters

Vehicular population in developing countries is expected to proliferate in the coming decade, centred on Tier II and Tier III cities rather than large metropolis. WLTP is being introduced as a global instrument for emission regulation to reduce gap between standard test procedures and actual road conditions. This work aims at quantifying and discernment of the gap between WLTC and real-world conditions in an urban city in a developing country on the basis of driving cycle parameters and simulated emissions for gasoline fuelled light passenger cars. Real world driving patterns were recorded on different routes and varying traffic conditions using car-chasing technique integrated with GPS monitoring and speed sensors. Real-world driving patterns and ambient conditions were used to simulate emissions using International Vehicle Emissions model for average rate (g/km) and Comprehensive Modal Emissions Model for instantaneous emission (g/s) analysis. Cycle parameters were mathematically calculated to compare WLTC and road trips. The analyses revealed a large gap between WLTC and road conditions. CO emissions were predicted to be 155% higher than WLTC and HC and NOx emissions were estimated to be 63% and 64% higher respectively. These gaps were correlated to different driving cycle parameters. It was observed that road driving occurs at lower average speeds with higher frequency and magnitudes of accelerations. The positive kinetic energy required by road cycles, was 100% higher than WLTC and the Relative Positive Acceleration (RPA) demanded by road cycles, was found to be 60% higher in real-world driving patterns and thereby contribute to higher emissions.     

Low cost two dimension navigation using an augmented Kalman filter/Fast Orthogonal Search module for the integration of reduced inertial sensor system and Global Positioning System

Due to their complementary characteristics, Global Positioning System (GPS) is integrated with standalone navigation devices like odometers and inertial measurement units (IMU). Recently, intensive research has focused on utilizing Micro-Electro-Mechanical-System (MEMS) grade inertial sensors in the integration because of their low-cost. In this study, a low cost reduced inertial sensor system (RISS) is considered. It consists of a MEMS-grade gyroscope and the vehicle built-in odometer. The system works together with GPS to provide 2D navigation for land vehicles. With adequate accuracy, Kalman filter (KF) is the commonly used estimation technique to achieve the data fusion of GPS and inertial sensors in case of high-end IMUs. However, due to the inherent error characteristics of MEMS grade devices, MEMS-based RISS suffers from the non-stationary stochastic sensor errors and nonlinear inertial errors, which cannot be handled by KF and its linear error models. To overcome the problem, Fast Orthogonal Search (FOS), a nonlinear system identification technique, is suggested for modeling the higher order RISS errors. As a general-purpose numerical method, FOS algorithm has the ability to figure out the system nonlinearity efficiently with a tolerance of arbitrary stochastic system noise. Even using online short-term training data, this method is still able to build an accurate nonlinear model that predicts the system dynamics. Motivated by the above merits, an augmented KF/FOS module is proposed by cascading FOS algorithm to a traditional KF structure. By estimating and reducing both linear and nonlinear RISS errors, the proposed method is supposed to offer substantial enhancement on the positioning accuracy of MEMS-based RISS during GPS outages. In order to examine the effectiveness of the proposed technique, the KF/FOS module is applied on the low cost RISS together with GPS in a land vehicle for several road test trajectories. The performance of the proposed method is compared to KF-only solution, both assessed with respect to a reference offered by a high-end solution. The experimental results confirm that KF/FOS module outperforms KF-only method. The results also show the applicability of the proposed method for real-time vehicle applications.     

Urban road transport navigation: performance of the global positioning system after selective availability

Satellite navigation systems have a potential to support multi-modal transport navigation requirements. In road transport, the global positioning system (GPS) is currently supporting a wide variety of in-car navigation and transport telematics systems. The performance of GPS has in the past been limited by the artificial degradation of the signal through the process of selective availability (SA). With SA operational, the instantaneous horizontal positional accuracy was 100 m 95% of the time. Additional infrastructure was used with the differential concept (where range errors are determined at a known location and transmitted to users) to improve this to the level of a few metres. The US Government on 1 May 2000 removed SA. This paper presents the results of a study to assess and characterise the post-SA performance of GPS for positioning vehicles in urban areas. This is an important functionality of advanced transport telematics systems that aim to address everyday problems associated with road transport, particularly in urban areas. The performance assessment addresses, in varying levels of detail, the issues of service coverage, positioning accuracy, integrity and availability of service. Comparison is made with the results of a previous study conducted when SA was turned on. The results show an improvement in stand-alone navigation accuracy without SA compared to the period when SA was operational. Furthermore, no significant difference is seen between the level of accuracy achievable with differential positioning and post-SA stand-alone navigation. The parameters that characterise the performance of GPS determined at the analysis stage have been used to specify an architecture for a local navigation system for urban areas.     

Virtual 3D city model as a priori information source for vehicle localization system

This paper aims at demonstrating the usefulness of integrating virtual 3D models in vehicle localization systems. Usually, vehicle localization algorithms are based on multi-sensor data fusion. Global Navigation Satellite Systems GNSS, as Global Positioning System GPS, are used to provide measurements of the geographic location. Nevertheless, GNSS solutions suffer from signal attenuation and masking, multipath phenomena and lack of visibility, especially in urban areas. That leads to degradation or even a total loss of the positioning information and then unsatisfactory performances. Dead-reckoning and inertial sensors are then often added to back up GPS in case of inaccurate or unavailable measurements or if high frequency location estimation is required. However, the dead-reckoning localization may drift in the long term due to error accumulation. To back up GPS and compensate the drift of the dead reckoning sensors based localization, two approaches integrating a virtual 3D model are proposed in registered with respect to the scene perceived by an on-board sensor. From the real/virtual scenes matching, the transformation (rotation and translation) between the real sensor and the virtual sensor (whose position and orientation are known) can be computed. These two approaches lead to determine the pose of the real sensor embedded on the vehicle. In the first approach, the considered perception sensor is a camera and in the second approach, it is a laser scanner. The first approach is based on image matching between the virtual image extracted from the 3D city model and the real image acquired by the camera. The two major parts are: 1. Detection and matching of feature points in real and virtual images (three features points are compared: Harris corner detector, SIFT and SURF). 2. Pose computation using POSIT algorithm. The second approach is based on the on–board horizontal laser scanner that provides a set of distances between it and the environment. This set of distances is matched with depth information (virtual laser scan data), provided by the virtual 3D city model. The pose estimation provided by these two approaches can be integrated in data fusion formalism. In this paper the result of the first approach is integrated in IMM UKF data fusion formalism. Experimental results obtained using real data illustrate the feasibility and the performances of the proposed approaches.     

Speed,travel time and delay for intersections and road segments in the Montreal network using cyclist Smartphone GPS data

Very little is known about cyclist speeds and delays at the disaggregate level of each road segment and intersection in an entire city network. Speeds and delays serve as vital information for planning, navigation and routing purposes including how they differ for different times of the day and across road and bicycle facility types, after controlling for other factors. In this work, we explore the use of recent GPS cyclist trip data, from the Mon RésoVélo Smartphone application, to identify different performance measures such as travel time, speed and delay at the level of the entire network of roads and intersections on the island of Montreal. Also, a linear regression model is formulated to identify the geometric design and built environment characteristics affecting cyclist speeds on road segments. Among other results, on average, segment speeds are greater along arterials than on local streets and greater along segments with bicycle infrastructure than those without. Incorporating different measures of cyclist personality in the models revealed that the following characteristics all affect cyclist speeds along segments, each cyclist’s average speed on uphill, downhill and level segments as well as geometric design and built environment characteristics. The model results also identify that the factors that increase cyclist speeds along segments include, segments which have cyclists biking for work or school related purposes, segments used during morning peak and segments which do not have signalized intersections at either end.     

The effects of the 2013 floods on Germany’s freight traffic

This article analyzes the spatio-temporal effect of the 2013 floods on freight traffic in Germany by using automatic traffic counter data. The methodology uses a proven time-series outlier detection and identification technique to endogenously determine if a counter was affected during the flood and estimate the magnitude and duration of the change in the number of vehicles passing through it. This is the first paper able to quantify climate-related variations in traffic across all the counters of a national network. Results show variations on 10% of all counters and 23% of all main roads. Results allow us to trace the configuration of disrupted and detour routes, recovery times, and the total effect on the network. Our findings serve as an input to other studies on the impact of exogenous events on the transport system and contribute towards the formulation of public policies to improve road resilience.     

Exploration of route choice behavior with advanced traveler information using neural network concepts

A model of driver's route choice behavior under advanced traveler information system (ATIS) is developed based on data collected from learning experiments using interactive computer simulation. The experiment subjected drivers to 32 simulated days in which they were to choose between the freeway or a side road. A neural network model is used as a convenient modeling technique in this initial phase of the analysis. The results indicated that most subjects made route choices based mainly on their recent experiences. It was also demonstrated that route choice behaviors are related to the personal characteristics as well as the characteristics of the respective routes. Travel experiences have less effect on the choice of the side road compared to the freeway and the results indicate that the prediction accuracy of the model, the acceptance rate of advice, and the quality of advice are closely correlated. The model developed here was for advice consistently provided at a level of 75 percent accuracy. The paper concludes with a discussion of experimental limitations and suggestions for future research.