To overcome the limitations of the sparrow search algorithm and the challenges of dynamic obstacle avoidance in mobile robots, an integrated method combining the enhanced sparrow search algorithm with the dynamic window approach is introduced. First, logistic–tent chaotic mapping is utilized for the initialization of the sparrow population, thereby achieving a uniform distribution of the sparrow population and simultaneously enhancing the exploratory capability of the algorithm. The implementation of the elite reverse learning strategy aims to diversify the sparrow population, thus improving the quality of initial solutions and the algorithm’s search accuracy. Additionally, the position update dynamic self-adaptive adjustment strategy is adopted to enhance the optimization capability of the algorithm by refining the position update formulas for both producers and scroungers. By combining the Lévy flight strategy and the optimal position perturbation strategy, the algorithm’s efficacy in escaping local optima can be improved. Second, an adaptive velocity adjustment strategy is presented for the dynamic window approach and optimized for its evaluation function to enhance the safety of the path. Third, the enhanced sparrow search algorithm is integrated with the dynamic window approach to tackle the problems of the non-smooth global path and inadequate dynamic obstacle avoidance capability. Both simulation and experimental results show the superiority of the enhanced sparrow search algorithm in comparison to other algorithms in terms of the path length, total rotation angle, and algorithm execution time. Notably, in comparison to the basic sparrow search algorithm, there is a decrease in average path lengths by 15.31% and 11.92% in the improved sparrow search algorithm. The integrated algorithm not only crafts local paths rooted in global paths but also adeptly facilitates real-time dynamic obstacle evasion, ensuring the robot’s safe arrival at its destination.

Aiming at the problems of low localization accuracy and complicated localization methods of the automatic guided vehicle (AGV) in the current automatic storage and transportation process, a combined localization method based on the ultra-wideband (UWB) and the visual guidance is proposed. Both the UWB localization method and the monocular vision localization method are applied to the indoor location of the AGV. According to the corner points of an ArUco code fixed on the AGV body, the monocular vision localization method can solve the pose information of the AGV by the PnP algorithm in real-time. As an auxiliary localization method, the UWB localization method is called to locate the AGV coordinates. The distance from the tag on the AGV body to the surrounding anchors is measured by the time of flight (TOF) ranging algorithm, and the actual coordinates of the AGV are calculated by the trilateral centroid localization algorithm. Then, the localization data of the UWB is corrected by the mean compensation method to obtain a consistent and accurate localization trajectory. The experiment result shows that this localization system has an error of 15mm, which meets the needs of AGV location in the process of automated storage and transportation.

In this paper, we propose a Circular-ring visual location marker based on a global image-matching model to improve the positioning ability in the fiducial marker system of a single-target mobile robot. The unique coding information is designed according to the cross-ratio invariance of the projective theorem. To verify the accuracy of full 6D pose estimation using the Circular-ring marker, a 6 degree of freedom (DoF) robotic arm platform is used to design a visual location experiment. The experimental result shows in terms of small resolution images, different size markers, and long-distance tests that our proposed robot positioning method significantly outperforms AprilTag, ArUco, and Checkerboard. Furthermore, through a repeatable robot positioning experiment, the results indicated that the proposed Circular-ring marker is twice as accurate as the fiducial marker at 2–4 m. In terms of recognition speed, the Circular-ring marker processes a frame within 0.077 s. When the Circular-ring marker is used for robot positioning at 2–4 m, the maximum average translation error of the Circular-ring marker is 2.19, 3.04, and 9.44 mm. The maximum average rotation error is also 1.703°, 1.468°, and 0.782°.

The 3D scanning of a freeform structure relies on the laser probe and the localization system. The localization system, determining the effect of the point cloud reconstruction, will generate positioning errors when the laser probe works in complex paths with a fast speed. To reduce the errors, in this paper, a linear laser scanning measurement method is proposed based on binocular vision calibration. A simple and effective eight-point positioning marker attached to the scanner is proposed to complete the positioning and tracking procedure. Based on this, the method of marked point detection based on image moment and the principle of global coordinate system calibration are introduced in detail. According to the invariance principle of space distance, the corresponding points matching method between different coordinate systems is designed. The experimental results show that the binocular vision system can complete localization under different light intensities and complex environments, and that the repeated translation error of the binocular vision system is less than 0.22 mm, while the rotation error is less than 0.15°. The repeated error of the measurement system is less than 0.36 mm, which can meet the requirements of the 3D shape measurement of the complex workpiece.

To overcome incomplete point cloud data obtained from laser scanners scanning complex surfaces, multi-viewpoint cloud data needs to be aligned for use. A hybrid improved SAC-IA with a KD-ICP algorithm is proposed for local point cloud alignment optimization. The scanned point cloud data is preprocessed with statistical filtering, as well as uniform down-sampling. The sampling consistency initial alignment (SAC-IA) algorithm is improved by introducing a dissimilarity vector for point cloud initial alignment. In addition, the iterative closest point (ICP) algorithm is improved by incorporating bidirectional KD-tree to form the KD-ICP algorithm for fine point cloud alignment. Finally, the algorithms are compared in terms of runtime and alignment accuracy. The implementation of the algorithms is based on the Visual Studio 2013 software configurating point cloud library environment for testing experiments and practical experiments. The overall alignment method can be 40%~50% faster in terms of running speed. The improved SAC-IA algorithm provides better transformed poses, combined with the KD-ICP algorithm to select the corresponding nearest neighbor pairs, which improves the accuracy, as well as the applicability of the alignment.