Proceedings Article10.1109/yac57282.2022.10023652
A 3D Point Cloud Registration Algorithm Generalized Demonstration Trajectory Scheme
19 Nov 2022
TL;DR: In this article , a technique for detecting changes in the front and back locations of the workpiece using point cloud registration and transforming the original grinding trajectory, eliminating the need for re-teaching is presented.
read more
Abstract: Industrial robots are becoming more significant as the age of intelligent production progresses. Grinding robots have substantially emancipated the labor force in the industrial business. To get the grinding trajectory, many grinding robots still employ the teaching method, which takes a long period. The initial grinding trajectory becomes invalid when the relative location of the grinding robot and the workpiece changes, and it must be taught anew. This research provides a technique for detecting changes in the front and back locations of the workpiece using point cloud registration and transforming the original grinding trajectory, eliminating the need for re-teaching. Single-point instruction and dynamic movement primitives (DMP) generalization are used to create the reference trajectory. The sample consistency initial alignment (SAC-IA) algorithm-based improved matching approach and the Iterative closest point (ICP) algorithm collects point cloud data before and after the workpiece, and the transformation matrix of the front and rear locations of the workpiece is generated. It is used to change the original grinding trajectory, allowing the grinding trajectory to be reused. The suggested approach outperforms the ICP and SAC-IA+NDT algorithms in terms of resilience and accuracy, and saves a significant amount of time when compared to re-teaching.
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
References
Fast Point Feature Histograms (FPFH) for 3D registration
Radu Bogdan Rusu,Nico Blodow,Michael Beetz +2 more
- 12 May 2009
TL;DR: This paper modifications their mathematical expressions and performs a rigorous analysis on their robustness and complexity for the problem of 3D registration for overlapping point cloud views, and proposes an algorithm for the online computation of FPFH features for realtime applications.
4.1K
Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration
TL;DR: This paper presents the first globally optimal algorithm, named Go-ICP, for Euclidean (rigid) registration of two 3D point-sets under the inline-formula notation, and derives novel upper and lower bounds for the registration error function.
Voxel Cloud Connectivity Segmentation - Supervoxels for Point Clouds
Jeremie Papon,Alexey Abramov,Markus Schoeler,Florentin Wörgötter +3 more
- 23 Jun 2013
TL;DR: A novel over-segmentation algorithm which uses voxel relationships to produce over-Segmentations which are fully consistent with the spatial geometry of the scene in three dimensional, rather than projective, space is proposed.
The three-dimensional normal-distributions transform : an efficient representation for registration, surface analysis, and loop detection
Martin Magnusson
- 01 Jan 2009
TL;DR: This dissertation extends the original two-dimensional NDT registration algorithm of Biber and Straser to 3D and introduces a number of improvements and proposes to use a combination of local visual features and Colour-NDT for robust registration of coloured 3D scans.
Tutorial: Point Cloud Library: Three-Dimensional Object Recognition and 6 DOF Pose Estimation
Aitor Aldoma,Zoltan-Csaba Marton,Federico Tombari,Walter Wohlkinger,Christian Potthast,Bernhard Zeisl,Radu Bogdan Rusu,Suat Gedikli,Markus Vincze +8 more
TL;DR: A rapidly growing group of people can acquire 3- D data cheaply and in real time, as these sensors are commodity hardware and sold at low cost.
420