Skip to main content

A Chain-Code-Based Map Matching Algorithm for Wheelchair Navigation

Buy Article:

$51.00 plus tax (Refund Policy)

Abstract:

Abstract

Accurate vehicle tracking is essential for navigation systems to function correctly. Unfortunately, GPS data is still plagued with errors that frequently produce inaccurate trajectories. Research in map matching algorithms focuses on how to efficiently match GPS tracking data to the underlying road network. This article presents an innovative map matching algorithm that considers the trajectory of the data rather than merely the current position as in the typical map matching case. Instead of computing the precise angle which is traditionally used, a discrete eight-direction chain code, to represent a trend of movement, is used. Coupled with distance information, map matching decisions are made by comparing the differences between trajectories representing the road segments and GPS tracking data chain-codes. Moreover, to contrast the performance of the chain-code algorithm, two evaluation strategies, linear and non-linear, are analyzed. The presented chain-code map matching algorithm was evaluated for wheelchair navigation using university campus sidewalk data. The evaluation results indicate that the algorithm is efficient in terms of accuracy and computational time.

Keywords: RBF neural network; Wheelchair navigation; chain code; map matching

Document Type: Research Article

DOI: http://dx.doi.org/10.1111/j.1467-9671.2009.01147.x

Affiliations: Geoinformatics Laboratory, School of Information Sciences University of Pittsburgh

Publication date: April 1, 2009

bpl/tgis/2009/00000013/00000002/art00003
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more