2013
DOI: 10.1007/978-3-642-40669-0_26
|View full text |Cite
|
Sign up to set email alerts
|

Online SLAM Based on a Fast Scan-Matching Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…Having this in mind, we have tested 3 datasets typically used in SLAM benchmarking: ACES Building, Intel Research Lab, and Killian Court. 5 These were tested in the two computer architectures depicted in Table I The first immediate evidence is that scan matching takes less time to process in the Odroid X2 than in the Asus EeePC, as expected due to the former's superior computation power. Also, it is clear that multithreading accelerates the scan matching process by an approximate factor of 2.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Having this in mind, we have tested 3 datasets typically used in SLAM benchmarking: ACES Building, Intel Research Lab, and Killian Court. 5 These were tested in the two computer architectures depicted in Table I The first immediate evidence is that scan matching takes less time to process in the Odroid X2 than in the Asus EeePC, as expected due to the former's superior computation power. Also, it is clear that multithreading accelerates the scan matching process by an approximate factor of 2.…”
Section: Resultsmentioning
confidence: 99%
“…These methods rely heavily on scan matching of consecutive sensor readings, with combination of other techniques like multi-resolution occupancy grid maps [4] or dynamic likelihood field models for measurement [5]. Despite the evident advancements in research in the SLAM problem, a robot with such capabilities still has to be equipped with a modern computer to adequately handle the processing and memory requirements.…”
Section: Related Workmentioning
confidence: 99%
“…These methods rely heavily on scan matching of consecutive sensor readings, with combination of other techniques, like multi-resolution occupancy grid maps [13], or dynamic likelihood field models for measurement [14]. Despite the evident advances in research on SLAM, most approaches do not consider environments disturbed by smoke, dust, or steam.…”
Section: Related Workmentioning
confidence: 99%
“…thresholds will vary. If the value of sonar readings do not match measurements taken by laser scans, and the smoke levels detected by the alcohol sensor hits values below a minimum threshold SM OKE M IN (130mV ) 14 , a greater confidence is given to LRF readings. If the alcohol sensor retrieves values greater than SM OKE M IN , sonar readings are superimposed to LRF readings.…”
Section: Smokenav V1 : Heuristic Modelmentioning
confidence: 99%
“…An advanced method likes sensor fusion in complementary characteristics of Laser Range Finder (LRF) that can map under reduced visibility conditions, e.g. particles of smoke [9]. In addition, classifying graph-based algorithms [10] [11] which use a robust function that generalizes classification and discard irrelevant measurements also is an efficiency solution to maintain large-scale maps.…”
Section: Introductionmentioning
confidence: 99%