An efficient representation of edge shapes in topological maps

Nakju Doh, Kyun Chung Wan

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.

Original languageEnglish
Pages (from-to)655-666
Number of pages12
JournalETRI Journal
Volume29
Issue number5
Publication statusPublished - 2007 Oct 1

Fingerprint

Mobile robots
Experiments

Keywords

  • Dynamic time warping
  • Localization
  • Mobile robots
  • Topological map
  • Wavelet transformation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

An efficient representation of edge shapes in topological maps. / Doh, Nakju; Wan, Kyun Chung.

In: ETRI Journal, Vol. 29, No. 5, 01.10.2007, p. 655-666.

Research output: Contribution to journalArticle

Doh, Nakju ; Wan, Kyun Chung. / An efficient representation of edge shapes in topological maps. In: ETRI Journal. 2007 ; Vol. 29, No. 5. pp. 655-666.
@article{87f067cd4f0b4c1f8e8b3aba92a2b04f,
title = "An efficient representation of edge shapes in topological maps",
abstract = "There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.",
keywords = "Dynamic time warping, Localization, Mobile robots, Topological map, Wavelet transformation",
author = "Nakju Doh and Wan, {Kyun Chung}",
year = "2007",
month = "10",
day = "1",
language = "English",
volume = "29",
pages = "655--666",
journal = "ETRI Journal",
issn = "1225-6463",
publisher = "ETRI",
number = "5",

}

TY - JOUR

T1 - An efficient representation of edge shapes in topological maps

AU - Doh, Nakju

AU - Wan, Kyun Chung

PY - 2007/10/1

Y1 - 2007/10/1

N2 - There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.

AB - There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.

KW - Dynamic time warping

KW - Localization

KW - Mobile robots

KW - Topological map

KW - Wavelet transformation

UR - http://www.scopus.com/inward/record.url?scp=35148875512&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35148875512&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35148875512

VL - 29

SP - 655

EP - 666

JO - ETRI Journal

JF - ETRI Journal

SN - 1225-6463

IS - 5

ER -