Efficient and reliable Monte Carlo localization with thinning edges

Tae Bum Kwon, Ju Ho Yang, Jae-Bok Song

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The global convergence of MCL is time-consuming because of a large number of random samples. Moreover, its success is not guaranteed at all times. This paper presents a novel approach to reduce the number of samples of MCL and one heuristic approach to detect localization failure using thinning edges extracted in real time. Random samples are drawn only around the neighborhood of the thinning edges rather than over the entire free space and localization quality is estimated through the probabilistic analysis of samples added around the thinning edges. A series of experiments verified the performance of the proposed scheme.

Original languageEnglish
Pages (from-to)328-338
Number of pages11
JournalInternational Journal of Control, Automation and Systems
Volume8
Issue number2
DOIs
Publication statusPublished - 2010 Apr 1

Fingerprint

Experiments

Keywords

  • Kidnapped robot problems
  • Monte carlo localization
  • Particle filters
  • Thinning edges

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications

Cite this

Efficient and reliable Monte Carlo localization with thinning edges. / Kwon, Tae Bum; Yang, Ju Ho; Song, Jae-Bok.

In: International Journal of Control, Automation and Systems, Vol. 8, No. 2, 01.04.2010, p. 328-338.

Research output: Contribution to journalArticle

@article{03f5a8d4b99e49a089aec1f528ca212b,
title = "Efficient and reliable Monte Carlo localization with thinning edges",
abstract = "The global convergence of MCL is time-consuming because of a large number of random samples. Moreover, its success is not guaranteed at all times. This paper presents a novel approach to reduce the number of samples of MCL and one heuristic approach to detect localization failure using thinning edges extracted in real time. Random samples are drawn only around the neighborhood of the thinning edges rather than over the entire free space and localization quality is estimated through the probabilistic analysis of samples added around the thinning edges. A series of experiments verified the performance of the proposed scheme.",
keywords = "Kidnapped robot problems, Monte carlo localization, Particle filters, Thinning edges",
author = "Kwon, {Tae Bum} and Yang, {Ju Ho} and Jae-Bok Song",
year = "2010",
month = "4",
day = "1",
doi = "10.1007/s12555-010-0219-3",
language = "English",
volume = "8",
pages = "328--338",
journal = "International Journal of Control, Automation and Systems",
issn = "1598-6446",
publisher = "Institute of Control, Robotics and Systems",
number = "2",

}

TY - JOUR

T1 - Efficient and reliable Monte Carlo localization with thinning edges

AU - Kwon, Tae Bum

AU - Yang, Ju Ho

AU - Song, Jae-Bok

PY - 2010/4/1

Y1 - 2010/4/1

N2 - The global convergence of MCL is time-consuming because of a large number of random samples. Moreover, its success is not guaranteed at all times. This paper presents a novel approach to reduce the number of samples of MCL and one heuristic approach to detect localization failure using thinning edges extracted in real time. Random samples are drawn only around the neighborhood of the thinning edges rather than over the entire free space and localization quality is estimated through the probabilistic analysis of samples added around the thinning edges. A series of experiments verified the performance of the proposed scheme.

AB - The global convergence of MCL is time-consuming because of a large number of random samples. Moreover, its success is not guaranteed at all times. This paper presents a novel approach to reduce the number of samples of MCL and one heuristic approach to detect localization failure using thinning edges extracted in real time. Random samples are drawn only around the neighborhood of the thinning edges rather than over the entire free space and localization quality is estimated through the probabilistic analysis of samples added around the thinning edges. A series of experiments verified the performance of the proposed scheme.

KW - Kidnapped robot problems

KW - Monte carlo localization

KW - Particle filters

KW - Thinning edges

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

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

U2 - 10.1007/s12555-010-0219-3

DO - 10.1007/s12555-010-0219-3

M3 - Article

VL - 8

SP - 328

EP - 338

JO - International Journal of Control, Automation and Systems

JF - International Journal of Control, Automation and Systems

SN - 1598-6446

IS - 2

ER -