Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-16T07:29:24.319Z Has data issue: false hasContentIssue false

Validation of Map Matching Algorithms using High Precision Positioning with GPS

Published online by Cambridge University Press:  18 April 2005

Mohammed A. Quddus
Affiliation:
Imperial College London. Email: [email protected]
Robert B. Noland
Affiliation:
Imperial College London. Email: [email protected]
Washington Y. Ochieng
Affiliation:
Imperial College London. Email: [email protected]

Abstract

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.

Type
Research Article
Copyright
© 2005 The Royal Institute of Navigation

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)