CoChat

A Single LiDAR-Based Feature Fusion Indoor Localization Algorithm

Open access

The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.

Abstract

In past years, there has been significant progress in the field of indoor robot localization. To precisely recover the position, the robots usually relies on multiple on-board sensors. Nevertheless, this affects the overall system cost and increases computation. In this research work, we considered a light detection and ranging (LiDAR) device as the only sensor for detecting surroundings and propose an efficient indoor localization algorithm. To attenuate the computation effort and preserve localization robustness, a weighted parallel iterative closed point (WP-ICP) with interpolation is presented. As compared to the traditional ICP, the point cloud is first processed to extract corners and line features before applying point registration. Later, points labeled as corners are only matched with the corner candidates. Similarly, points labeled as lines are only matched with the lines candidates. Moreover, their ICP confidence levels are also fused in the algorithm, which make the pose estimation less sensitive to environment uncertainties. The proposed WP-ICP architecture reduces the probability of mismatch and thereby reduces the ICP iterations. Finally, based on given well-constructed indoor layouts, experiment comparisons are carried out under both clean and perturbed environments. It is shown that the proposed method is effective in significantly reducing computation effort and is simultaneously able to preserve localization precision.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/s18041294

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Flow chart of feature extraction.
Figure 1 Flow chart of feature extraction.CC BY · PubMed Central
Figure 2 Illustration of the adaptive radius clustering (ARC) algorithm.
Figure 2 Illustration of the adaptive radius clustering (ARC) algorithm.CC BY · PubMed Central
Figure 3 Illustration of the split and merge scheme.
Figure 3 Illustration of the split and merge scheme.CC BY · PubMed Central
Figure 4 Corner-feature-based pose estimation.
Figure 4 Corner-feature-based pose estimation.CC BY · PubMed Central
Figure 5 Incorrect point registration caused by the nearest neighbor search (NNS) Iterative Closest Point (ICP) algorithm.
Figure 5 Incorrect point registration caused by the nearest neighbor search (NNS) Iterative Closest Point (ICP) algorithm.CC BY · PubMed Central
Figure 6 Illustration of feature-based point cloud registration. (a) Corner features are matched to corresponding corner features (b) Line features are matched to corresponding line features.
Figure 6 Illustration of feature-based point cloud registration. (a) Corner features are matched to corresponding corner features (b) Line features are matched to corresponding line features.CC BY · PubMed Central
Figure 7 The weighted parallel iterative closed point (WP-ICP) pose estimation algorithm.
Figure 7 The weighted parallel iterative closed point (WP-ICP) pose estimation algorithm.CC BY · PubMed Central
Figure 8 A LiDAR-based portable module and a moving platform.
Figure 8 A LiDAR-based portable module and a moving platform.CC BY · PubMed Central
Figure 9 Scene-1: a robot moves in a clear environment with no obstacles. (a) Experimental environment. (b) Robot is moved in a guided rectangular path. (c) Robot is moved randomly.
Figure 9 Scene-1: a robot moves in a clear environment with no obstacles. (a) Experimental environment. (b) Robot is moved in a guided rectangular path. (c) Robot is moved randomly.CC BY · PubMed Central
Figure 10 Different algorithms for the first/second experiments.
Figure 10 Different algorithms for the first/second experiments.CC BY · PubMed Central
Figure 11 Pose estimation deviation comparison of the first/second experiments.
Figure 11 Pose estimation deviation comparison of the first/second experiments.CC BY · PubMed Central
Figure 12 ICP performances of the first/second experiments.
Figure 12 ICP performances of the first/second experiments.CC BY · PubMed Central
Figure 13 Scene-2: the 3rd floor, Department of Aeronautics and Astronautics, NCKU.
Figure 13 Scene-2: the 3rd floor, Department of Aeronautics and Astronautics, NCKU.CC BY · PubMed Central
Figure 14 DAA-3F local snapshot with new objects to test the robustness of the algorithm.
Figure 14 DAA-3F local snapshot with new objects to test the robustness of the algorithm.CC BY · PubMed Central
Figure 15 Localization by the WP-ICP with 10 cm interpolation. Upper left corner subplot: corner features. Lower left corner subplot: line features. Right subplot: layout and estimated robot trajectory.
Figure 15 Localization by the WP-ICP with 10 cm interpolation. Upper left corner subplot: corner features. Lower left corner subplot: line features. Right subplot: layout and estimated robot trajectory.CC BY · PubMed Central
Figure 16 Experiments under different algorithms in the DAA-3F.
Figure 16 Experiments under different algorithms in the DAA-3F.CC BY · PubMed Central
Figure 17 ICP performance comparison of the third experiment.
Figure 17 ICP performance comparison of the third experiment.CC BY · PubMed Central
Figure 18 Pose estimation deviation of different interpolations.
Figure 18 Pose estimation deviation of different interpolations.CC BY · PubMed Central
Figure 19 ICP performance of different interpolations.
Figure 19 ICP performance of different interpolations.CC BY · PubMed Central
Figure 20 An environment with unknown moving objects. (a) Random snapshot 1. (b) Random snapshot 2.
Figure 20 An environment with unknown moving objects. (a) Random snapshot 1. (b) Random snapshot 2.CC BY · PubMed Central
Figure 21 Localization result by using full-points ICP. (a) Point registration. (b) Robot trajectories.
Figure 21 Localization result by using full-points ICP. (a) Point registration. (b) Robot trajectories.CC BY · PubMed Central
Figure 22 Localization result by using corner features only (where the line information was not fused for the localization).
Figure 22 Localization result by using corner features only (where the line information was not fused for the localization).CC BY · PubMed Central
Figure 23 Localization result using the WP-ICP with 20 cm interpolation.
Figure 23 Localization result using the WP-ICP with 20 cm interpolation.CC BY · PubMed Central
Figure 24 Localization results and ICP iterations.
Figure 24 Localization results and ICP iterations.CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 1

  1. Duda, R.O., and Hart, P.E. (1973). Pattern Classification and Scene Analysis, John Wiley & Sons.

Cited by

See all 84

Metadata

Authors
Wang, Y.-T., Peng, C.-C., Ravankar, A. A., & Ravankar, A.
Affiliations
  • National Cheng Kung University (TW)
  • Hokkaido University (JP)
Corresponding author
Peng, Chao-Chung
Venue
Sensors
Publisher
MDPI AG
Published
2018-04-23
Volume
18
Issue
4
Pages
1294
ISSN
1424-8220 (ISSN-L)
OpenAlex
W2801240241
Cited by
84
References
38
Citations by year
2026: 2 · 2025: 5 · 2024: 12 · 2023: 12 · 2022: 13 · 2021: 13 · 2020: 12 · 2019: 13 · 2018: 2
FWCI
8.14
Type
journal article
Language
en
Open access
Locations
  • Sensors (publishedVersion, cc-by)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • Institutional Repositories DataBase (IRDB) (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Hokkaido University Collection of Scholarly and Academic Papers (Hokkaido University) (submittedVersion, cc-by)
Funders
Ministry of Science and Technology, Taiwan (MOST107-2218-E006-004, MOST106-2221-E006-138)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Indoor and Outdoor Localization Technologies
  • Physical Sciences › Earth and Planetary Sciences › Geology › 3D Surveying and Cultural Heritage
Keywords
indoor robot localization, LiDAR, feature fusion, point cloud registration, pose estimation, computation reduction, sensor fusion

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.