Real-time localization is an important mission for self-driving cars and it is difficult to achieve precise pose information in dynamic environments. In this paper, a novel localization method is proposed to estimate the pose of self-driving cars using a 3D-LiDAR sensor. First, the multi-frame curb features and laser intensity features are extracted. Meanwhile, based on the high-precision curb map generated offline, obstacles on road are detected using region segmentation methods and their features are removed. Furthermore, a map-matching method is proposed to match the features to the map, a robust iterative closest point algorithm is utilized to deal with curb features along with a probability search method dealing with intensity features. Finally, two separate Kalman filters are used to fuse the low-cost global positioning systems and map-matching results. Both offline and online experiments are carried out in dynamic environments and the results demonstrate the accuracy and robustness of the proposed method.

Precise positioning with low-cost single-frequency global navigation satellite system (GNSS) receivers has great potential in a wide range of applications because of its low price and improved accuracy. However, challenges remain in achieving reliable and accurate solutions using low-cost receivers. For instance, the successful ambiguity fixing rate could be low for real-time kinematic (RTK) while large errors may occur in precise point positioning (PPP) in some scenarios (e.g., trees along the road). To solve the problems, this paper proposes a method with the aid of additional lane-level digital map information to improve the accuracy and reliability of RTK and PPP solutions. In the method, a digital camera will be applied for lane recognition and the positioning solution from a low-cost receiver will be projected to the digital map lane link. With the projected point position as a constraint, the RTK ambiguity fixing rate and PPP performance can be enhanced. A field kinematic test was conducted to verify the improvement of the RTK and PPP solutions with the aid of map matching. The results show that the RTK ambiguity fixing rate can be increased and the PPP positioning error can be reduced by map matching.

Map matching is an important algorithm for any location-based service, especially in navigation and tracking systems and services. Identifying the relevant road segments accurately and efficiently, given positioning data, is the first and most important step in any map matching algorithm. This paper proposes a new approach to searching for road candidates by clustering and then searching road segments through a constructed hierarchical clustering tree, rather than using indexing techniques to query segments within a fixed search window. A binary tree is created based on the hierarchical clustering tree and adaptive searches are conducted to identify candidate road segments given GPS positions. The approach was validated using road maps with different scales and various scenarios in which moving vehicles were located. Both theoretical analysis and experimental results confirm that the proposed approach can efficiently find candidate road segments for map matching.

Today's mobile technology features several sensors that when integrated can provide ubiquitous navigation assistance to pedestrians including wheelchair users. Common sensors found in most smartphones are Global Positioning System (GPS), accelerometer, and compass. In this paper, a user's movement pattern recognition algorithm to improve map matching efficiency and accuracy in pedestrian/wheelchair navigation systems/services is discussed. The algorithm integrates GPS positions, orientation data from compass, and movement states recognized from accelerometer data in a client/server architecture. The algorithm is tested in an Android mobile phone, and the results show that the proposed map matching algorithm is efficient and provides good accuracy.

Cooperative positioning (CP) is a localization technique originally developed for use across wireless sensor networks. With the emergence of Dedicated Short Range Communications (DSRC) infrastructure for use in Intelligent Transportation Systems (ITS), CP techniques can now be adapted for use in location determination across vehicular networks. In vehicular networks, the technique of CP fuses GPS positions with additional sensed information such as inter-vehicle distances between the moving vehicles to determine their location within a neighbourhood. This paper presents the results obtained from a research study undertaken to demonstrate the capabilities of DSRC for meeting the positioning accuracies of road safety applications. The results show that a CP algorithm that fully integrates both measured/sensed data as well as navigation information such as map data can meet the positioning requirements of safety related applications of DSRC (<0·5 m). This paper presents the results of a Cramer Rao Lower Bound analysis which is used to benchmark the performance of the CP algorithm developed. The Kalman Filter (KF) models used in the CP algorithm are detailed and results obtained from integrating GPS positions, inter-vehicular ranges and information derived from in-vehicle maps are then discussed along with typical results as determined through a variety of network simulation studies.

Map Matching (MM) algorithms are usually employed for a range of transport telematics applications to correctly identify the physical location of a vehicle travelling on a road network. Two essential components for MM algorithms are (1) navigation sensors such as the Global Positioning System (GPS) and dead reckoning (DR), among others, to estimate the position of the vehicle, and (2) a digital base map for spatial referencing of the vehicle location. Previous research by the authors (Quddus et al., 2003; Ochieng et al., 2003) has developed improved MM algorithms that take account of the vehicle speed and the error sources associated with the navigation sensors and the digital map data previously ignored in conventional MM approaches. However, no validation study assessing the performance of MM algorithms has been presented in the literature. This paper describes a generic validation strategy and results for the MM algorithm previously developed in Ochieng et al. (2003). The validation technique is based on a higher accuracy reference (truth) of the vehicle trajectory as determined by high precision positioning achieved by the carrier-phase observable from GPS. The results show that the vehicle positions determined from the MM results are within 6 m of the true positions. The results also demonstrate the importance of the quality of the digital map data to the map matching process.

Map matching has been widely applied in car navigation systems as an efficient method to display the location of vehicles on maps. Various map-matching algorithms have been proposed. Inevitably, the correctness of the map matching is closely related to the accuracy of positioning sensors, such as GPS or Dead Reckoning (DR), and the complexity of the road network and map, especially in urban areas where the GPS signal may be constantly blocked by buildings and the road network is complicated. The existing map matching algorithms cannot resolve the positioning problems under all circumstances. They sometimes give the wrong position estimates of the car on road; the result is called mismatching. In order to improve the quality of map matching, a deep understand of the accuracy of sensor errors on mismatching is important. This paper analyses various factors that may affect the quality of map matching based on extensive tests in Hong Kong. Suggestions to improve the success rate of map matching are also provided.

Accurate vehicle location is essential for various applications in the field of intelligent transportation systems (ITS). Existing vehicle location systems rely on multiple positioning sensors and powerful computing devices to execute complex map matching algorithms. There exists a strong need for exploring a solution for vehicle location that relies on a GPS receiver as the sole means of positioning and does not require complex computations. Towards this end, the error characteristics of the GPS signal were studied through the analysis of GPS data collected during test drives. Based on the inferences drawn and a simple fuzzy rule set, a novel yet simple map matching algorithm was developed. Due to the difficulties in testing the algorithm through on-road trials, a simulation environment that is capable of reproducing the field conditions in the laboratory was developed. Simulation results confirm that the proposed algorithm overcomes many of the inadequacies of the existing methods and is capable of achieving high accuracy with minimal computational requirements.