Evaluating continuous-time slam using a predefined trajectoryprovided by a robotic arm
TL;DR: A novel benchmarking technique is presented that allows to compare a precise map generated with an accurate ground truth trajectory to a map with a manipulated trajectory which was distorted by different forms of noise.
read more
Abstract: . Recently published approaches to SLAM algorithms process laser sensor measurements and output a map as a point cloud of the environment. Often the actual precision of the map remains unclear, since SLAMalgorithms apply local improvements to the resulting map. Unfortunately, it is not trivial to compare the performance of SLAMalgorithms objectively, especially without an accurate ground truth. This paper presents a novel benchmarking technique that allows to compare a precise map generated with an accurate ground truth trajectory to a map with a manipulated trajectory which was distorted by different forms of noise. The accurate ground truth is acquired by mounting a laser scanner on an industrial robotic arm. The robotic arm is moved on a predefined path while the position and orientation of the end-effector tool are monitored. During this process the 2D profile measurements of the laser scanner are recorded in six degrees of freedom and afterwards used to generate a precise point cloud of the test environment. For benchmarking, an offline continuous-time SLAM algorithm is subsequently applied to remove the inserted distortions. Finally, it is shown that the manipulated point cloud is reversible to its previous state and is slightly improved compared to the original version, since small errors that came into account by imprecise assumptions, sensor noise and calibration errors are removed as well.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An Offline Coarse-To-Fine Precision Optimization Algorithm for 3D Laser SLAM Point Cloud
TL;DR: An offline coarse-to-fine precision optimization algorithm is presented to improve the precision of 3D laser SLAM point cloud and demonstrates that it achieved good performance both in the test datasets and the Cartographer public dataset.
9
A Novel SLAM Quality Evaluation Method
Felix Caesar
- 01 Jan 2019
TL;DR: This research presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and expensive and expensive process of manually calibrating and controlling several different types of systems within a vehicle.
2
Building Large-Scale SLAM
Janusz Bedkowski
- 01 Jan 2022
TL;DR: In this paper , the Schur Complement method is used to improve the performance of BA system optimization, trajectory centric versus map-centric approach, and continuous trajectory SLAM.
References
A method for registration of 3-D shapes
Paul J. Besl,H.D. McKay +1 more
TL;DR: In this paper, the authors describe a general-purpose representation-independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
20.6K
•Proceedings Article
ROS: an open-source Robot Operating System
Morgan Quigley
- 01 Jan 2009
TL;DR: This paper discusses how ROS relates to existing robot software frameworks, and briefly overview some of the available application software which uses ROS.
10.2K
LOAM: Lidar Odometry and Mapping in Real-time
Ji Zhang,Sanjiv Singh +1 more
- 12 Jul 2014
TL;DR: The method achieves both low-drift and low-computational complexity without the need for high accuracy ranging or inertial measurements and can achieve accuracy at the level of state of the art offline batch methods.
Real-time loop closure in 2D LIDAR SLAM
Wolfgang Hess,Damon Kohler,Holger H. Rapp,Daniel Andor +3 more
- 16 May 2016
TL;DR: This work presents the approach used in the backpack mapping platform which achieves real-time mapping and loop closure at a 5 cm resolution and provides experimental results and comparisons to other well known approaches which show that, in terms of quality, this approach is competitive with established techniques.
2K
Direct Methods for Sparse Linear Systems
Timothy A. Davis
- 01 Jan 2006
TL;DR: Direct methods for sparse linear systems cover various algorithms and techniques for solving sparse systems efficiently. These methods include basic algorithms, solving triangular systems, Cholesky factorization, orthogonal methods, LU factorization, fill-reducing orderings, and CSparse library usage.
1.3K