Target-based terrestrial laser scan registration extended by target orientation

In almost all projects, in which terrestrial laser scanning is used, the scans must be registered after the data acquisition. Despite more and more new and automated methods for registration, the classical target-based registration is still one of the standard procedures. The advantages are obvious: independence from the scan object, the geometric configuration can often be influenced and registration results are easy to interpret. When plane black-and-white targets are used, the algorithm for estimating the target center fits a plane through the scan of a target, anyway. This information about the plane orientation has remained unused so far. Hence, including this information in the registration does not require any additional effort in the scanning process. In this paper, we extend the target-based registration by the plane orientation. We describe the required methodology, analyze the benefits in terms of precision and reliability and discuss in which cases the extension is useful and brings a relevant advantage. Based on simulations and two case studies we find out that especially for registrations with bad geometric configurations the extension brings a big advantage. The extension enables registrations that are much more precise. These are also visible on the registered point clouds. Thus, only a methodological change in the target-based registration improves its results.

A Robust Framework for Simultaneous Localization and Mapping with Multiple Non-Repetitive Scanning Lidars

With the ability to provide long range, highly accurate 3D surrounding measurements, while lowering the device cost, non-repetitive scanning Livox lidars have attracted considerable interest in the last few years. They have seen a huge growth in use in the fields of robotics and autonomous vehicles. In virtue of their restricted FoV, they are prone to degeneration in feature-poor scenes and have difficulty detecting the loop. In this paper, we present a robust multi-lidar fusion framework for self-localization and mapping problems, allowing different numbers of Livox lidars and suitable for various platforms. First, an automatic calibration procedure is introduced for multiple lidars. Based on the assumption of rigidity of geometric structure, the transformation between two lidars can be configured through map alignment. Second, the raw data from different lidars are time-synchronized and sent to respective feature extraction processes. Instead of sending all the feature candidates for estimating lidar odometry, only the most informative features are selected to perform scan registration. The dynamic objects are removed in the meantime, and a novel place descriptor is integrated for enhanced loop detection. The results show that our proposed system achieved better results than single Livox lidar methods. In addition, our method outperformed novel mechanical lidar methods in challenging scenarios. Moreover, the performance in feature-less and large motion scenarios has also been verified, both with approvable accuracy.

GSR: geometrical scan registration algorithm for robust and fast robot pose estimation

Purpose In this paper, an attempt has been made to develop an algorithm equipped with geometric pattern registration techniques to perform exact, robust and fast robot localization purely based on laser range data. Design/methodology/approach The expected pose of the robot on a pre-calculated map is in the form of simulated sensor readings. To obtain the exact pose of the robot, segmentation of both real laser range and simulated laser range readings is performed. Critical points on two scan sets are extracted from the segmented range data and thereby the pose difference is computed by matching similar parts of the scans and calculating the relative translation. Findings In contrast to other self-localization algorithms based on particle filters and scan matching, the proposed method, in common positioning scenarios, provides a linear cost with respect to the number of sensor particles, making it applicable to real-time resource-limited embedded robots. The proposed method is able to obtain a sensibly accurate estimate of the relative pose of the robot even in non-occluded but partially visible segments conditions. Originality/value A comparison of state-of-the-art localization techniques has shown that geometrical scan registration algorithm is superior to the other localization methods based on scan matching in accuracy, processing speed and robustness to large positioning errors. Effectiveness of the proposed method has been demonstrated by conducting a series of real-world experiments.

Synthetic Aperture Sonar (SAS) without Navigation: Scan Registration as Basis for Near Field Synthetic Imaging in 2D

Sonars are essential for underwater sensing as they can operate over extended ranges and in poor visibility conditions. The use of a synthetic aperture is a popular approach to increase the resolution of sonars, i.e., the sonar with its N transducers is positioned at k places to generate a virtual sensor with kN transducers. The state of the art for synthetic aperture sonar (SAS) is strongly coupled to constraints, especially with respect to the trajectory of the placements and the need for good navigation data. In this article, we introduce an approach to SAS using registration of scans from single arrays, i.e., at individual poses of arbitrary trajectories, hence avoiding the need for navigation data of conventional SAS systems. The approach is introduced here for the near field using the coherent phase information of sonar scans. A Delay and Sum (D&S) beamformer (BF) is used, which directly operates on pixel/voxel form on a Cartesian grid supporting the registration. It is shown that this pixel/voxel-based registration and the coherent processing of several scans forming a synthetic aperture yields substantial improvements of the image resolution. The experimental evaluation is done with an advanced simulation tool generating realistic 2D sonar array data, i.e., with simulations of a linear 1D antenna reconstructing 2D images. For the image registration of the raw sonar scans, a robust implementation of a spectral method is presented. Furthermore, analyses with respect to the trajectories of the sensor locations are provided to remedy possible grating lobes due to the gaping positions of the transmitter devices.

Composite clustering normal distribution transform algorithm

Scan registration is a fundamental step for the simultaneous localization and mapping of mobile robot. The accuracy of scan registration is critical for the quality of mapping and the accuracy of robot navigation. During all of the scan registration methods, normal distribution transform is an efficient and wild-using one. But normal distribution transform will lead to the unreasonable interruption when splitting the grid and can’t express the points’ local geometric feature by prefixed grid. In this article, we propose a novel method, composite clustering normal distribution transform, which comprises the density-based clustering and k-means clustering to aggregate the points with similar local distributing feature. It takes singular value decomposition to judge the suitable degree of one cluster for further division. Meanwhile, to avoid the radiating phenomenon of LIDAR in measuring the points’ distance, we propose a method based on trigonometric to measure the internal distance. The clustering method in composite clustering normal distribution transform could ensure the expression of LIDAR’s local distribution and matching accuracy. The experimental result demonstrates that our method is more accurate and more stable than the normal distribution transform and iterative closest point methods.