A Chain‐Code‐Based Map Matching Algorithm for Wheelchair Navigation
Identifieur interne : 001460 ( Main/Merge ); précédent : 001459; suivant : 001461A Chain‐Code‐Based Map Matching Algorithm for Wheelchair Navigation
Auteurs : Ming Ren [États-Unis] ; Hassan A. Karimi [États-Unis]Source :
- Transactions in GIS [ 1361-1682 ] ; 2009-04.
English descriptors
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.
Url:
DOI: 10.1111/j.1467-9671.2009.01147.x
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002516
- to stream Istex, to step Curation: 002516
- to stream Istex, to step Checkpoint: 000C06
Links to Exploration step
ISTEX:66E90764BE7C8843677DF76F8A05857C46950502Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Chain‐Code‐Based Map Matching Algorithm for Wheelchair Navigation</title><author><name sortKey="Ren, Ming" sort="Ren, Ming" uniqKey="Ren M" first="Ming" last="Ren">Ming Ren</name></author><author><name sortKey="Karimi, Hassan A" sort="Karimi, Hassan A" uniqKey="Karimi H" first="Hassan A" last="Karimi">Hassan A. Karimi</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:66E90764BE7C8843677DF76F8A05857C46950502</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1111/j.1467-9671.2009.01147.x</idno><idno type="url">https://api.istex.fr/document/66E90764BE7C8843677DF76F8A05857C46950502/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002516</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002516</idno><idno type="wicri:Area/Istex/Curation">002516</idno><idno type="wicri:Area/Istex/Checkpoint">000C06</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000C06</idno><idno type="wicri:doubleKey">1361-1682:2009:Ren M:a:chain:code</idno><idno type="wicri:Area/Main/Merge">001460</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Chain‐Code‐Based Map Matching Algorithm for Wheelchair Navigation</title><author><name sortKey="Ren, Ming" sort="Ren, Ming" uniqKey="Ren M" first="Ming" last="Ren">Ming Ren</name><affiliation wicri:level="4"><country>États-Unis</country><placeName><settlement type="city">Pittsburgh</settlement><region type="state">Pennsylvanie</region></placeName><orgName type="university">Université de Pittsburgh</orgName></affiliation></author><author><name sortKey="Karimi, Hassan A" sort="Karimi, Hassan A" uniqKey="Karimi H" first="Hassan A" last="Karimi">Hassan A. Karimi</name><affiliation wicri:level="4"><country>États-Unis</country><placeName><settlement type="city">Pittsburgh</settlement><region type="state">Pennsylvanie</region></placeName><orgName type="university">Université de Pittsburgh</orgName></affiliation></author></analytic><monogr></monogr><series><title level="j">Transactions in GIS</title><idno type="ISSN">1361-1682</idno><idno type="eISSN">1467-9671</idno><imprint><publisher>Blackwell Publishing Ltd</publisher><pubPlace>Oxford, UK</pubPlace><date type="published" when="2009-04">2009-04</date><biblScope unit="volume">13</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="197">197</biblScope><biblScope unit="page" to="214">214</biblScope></imprint><idno type="ISSN">1361-1682</idno></series><idno type="istex">66E90764BE7C8843677DF76F8A05857C46950502</idno><idno type="DOI">10.1111/j.1467-9671.2009.01147.x</idno><idno type="ArticleID">TGIS1147</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1361-1682</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>RBF neural network</term><term>Wheelchair navigation</term><term>chain code</term><term>map matching</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001460 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001460 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:66E90764BE7C8843677DF76F8A05857C46950502
|texte= A Chain‐Code‐Based Map Matching Algorithm for Wheelchair Navigation
}}
| This area was generated with Dilib version V0.6.31. |  |