# Robot Target Localization and Visual Navigation Based on Neural Network

Authors: Haifeng Guo; Yiyang Wang; Guijun Yu; Xiang Li; Baoqi Yu; Wenyi Li
Journal: Journal of Sensors
 (2022)

---

## Abstract

Deep neural network has been widely used in image analysis, speech recognition, target detection, semantic segmentation, face recognition, automatic driving, and other fields due to its excellent algorithm performance. In this research, the neural network is mainly used to simulate robot target localization and visual navigation. Firstly, the data set based on ICP algorithm is constructed, and then, the navigation and positioning of robot are simulated by using neural network. The results show that the combination of ICP algorithm and direct method can effectively solve the problem of pose loss and expand the indoor range of data collection. The method using artificial neural network is effective and has better robustness and stability than the method based on frame matching. From the perspective of vision, positioning and navigation based on a single RGB image are feasible, and the processing time is relatively short, which can meet the requirements of real time and has higher practical value in general indoor scenes.


---

## Body

## 1. Introduction

In recent years, due to the efficiency of algorithms, deep neural networks have been widely used in image analysis, speech recognition, research purposes, semantic division, facial recognition, automatic navigation, etc. The reason why the deep neural network has become so successful is because its content is to simulate the training of the human brain. By increasing the number of layers, the machine can learn higher functions from the data. Currently, the depth of the network is hundreds or thousands of layers, and the design of network connections makes it difficult to implement in a timely manner. The development of deep neural network algorithms based on multiple capabilities in computer applications to reduce neural network training time has gradually become a hotspot in research [1].The network architecture (redistribution algorithm) of BP neural network structure is multilayered, which is usually a way of optimizing the localization of gradient viruses and interfering with the treatment of latent errors in the network is heavy. The multilayered structure of the BP neural network leads to higher output standards, but the BP neural network still has some shortcomings [2]. For nonspecific problems such as XOR, BP neural network may have the lowest local cost, which makes it difficult to find a solution globally, and MSE is too large for large data cooperation. The AdaBoost algorithm trained and calculated the error rate and weight of the first BP model and took the weight as the weight parameter of the next BP network and then carried out iterative calculation, in which a single hidden layer of the traditional BP network adopts a two-layer structure. When this method is applied to short-term sales forecast, the average prediction error is 18%. Compared with the 53.23% accuracy of the traditional BP network, the accuracy rate is significantly improved. However, this model has a large error in the case of a large time span of sample data and can effectively predict recent sales changes only with 5 days of sample data [3]. See Figure 1.Figure 1
Flowchart of BP neural network model.With the development of robot technology, the application fields of robots are also expanding, driving the transformation of all industries to intelligent technology for mobile intelligent robots; autonomous positioning and navigation is one of the keys to achieve intelligent. Without autonomous positioning and navigation, the robot cannot perceive the surrounding environment and understand and analyze the scene information and move safely, and any interactive behavior based on this cannot be mentioned. Therefore, the realization of autonomous positioning and navigation of the robot is the core technology to achieve intelligence [4].The development of computer vision technology has brought a new opportunity for the research of autonomous robot positioning and navigation technology, namely, visual positioning and navigation technology. Humans can quickly and accurately capture and integrate a large amount of element information in the target scene by using their eyes, which is a developed visual system. However, for robots, the target scene is rich in information due to the complexity of visual problems Due to the complexity of computation, the present robot vision system is still difficult to achieve the cognitive recognition ability of human eyes [5, 6]. For a robot to the development of the intelligent visual perception system is an important part of the robot, which is one of the main sources of robot perception surrounding environment, whether the rapid and effective use of visual information will directly affect the interaction of the robot, in the environment of the variability, and randomness is particularly important.As far as the current development of robot positioning and navigation technology is concerned, it is far from the established goal and lacks the ability to face diverse environments. No matter in theoretical or applied studies, most of them are aimed at small, simple, or even single indoor scenes with poor application effect, as shown in Figure2. However, in practical applications, robots are faced with uncertain scenarios that are not predictable in scale or complexity. At the same time, in the pursuit of accuracy, real time, and stability, it is difficult to achieve by relying on a single method and sensor; therefore, multisensor fusion and multimethod coordination are the development trend to solve the robot function problems [7].Figure 2
Robot target positioning method.


## 2. Literature Review

Robot positioning and navigation technology has been extensively computer-related for many years. The robot simply has to answer three questions: where am I, where am I going, and how am I going? Job is the answer to the question of where I live and especially where robots are the determinants of robotics in the world of governance office. The navigation process is often associated with the latter two, the main issues being the design, route planning, and vehicle management.In recent years, with the rapid development of computer vision technology, vision-based positioning and navigation techniques have been widely studied and used. There are researches on positioning only from the perspective of images. An image retrieval and location method based on database is proposed [8]. In this method, the query image is matched with the image database annotated with location information (such as geographic location) to obtain the location of the current query image. While these methods can scale to very large environments, they typically provide only rough estimates of camera positions and are highly database dependent.The main idea of scene coordinate regression framework proposed by Tschernia is to map image blocks to corresponding points in 3D scene space, namely, scene coordinates [9]. This step can be learned from limited data because the local block appearance is relatively stable, and the random sampling consistency algorithm can be used to estimate the camera pose and align the image with the predicted scene coordinates. Based on the idea of this framework, Nakidkina proposes a differentiable RANSAC method for camera positioning in the network. The method is called DSAC (differentiable RANSAC). The main idea is to use a class VGG style convolutional neural network to find the mapping between image blocks and corresponding points in scene space, that is, to obtain the predicted scene coordinates [10]. Then, a random subset of scene coordinates was used to create a camera pose hypothesis pool, and then, a scoring CNN was used to score each hypothesis pose in the hypothesis pool, as shown in Figure 3.Figure 3
Visual composition of robot.Assuming that the principles behind neurons are found, the initial function has been taken as an important tool for counting neurons, reasoning needs to be expressed as computation, and neural networks and M-P models were planned, starting to create neural networks (ANN) [11]. Liu, in his book “Society of Behavior,” reported on Hebb synapse and Hebb law education, which laid the theoretical basis for the development of neural network algorithms [12]. Mayandi developed the perceptron, the first body-building, science-capable neural network based on the JMP standard [13]. In Arya’s Perceptrons: An Introduction to Computational Geometry published, he proposed that Rosenblatt’s single-layer perceptron could only learn linearly separable patterns, but could not deal with linear nonseparable problems such as XOR [14]. Hopfield’s neural network (HNN) was introduced for the first time. Since then, Hopfield’s understanding of neural network-based dynamic behavior has played a key role in data processing and engineering. The backpropagation neural network (BPNN) was later proposed to address multilayer neural network problems, but the BP network still had some shortcomings, such as poor local shrinkage, slow integration, and difficult to write large files [15]. According to the model network requested by Arutyunyan, the BP algorithm is used to train and design the lenet-5 model of the convolutional neural network (CNN) [16]. The DeepBelief Network (DBN) was developed by Guidara [17] approved. In recent years, neural devices have become a hot topic in many fields, with a wide range of achievements in imaging, medical biology, and more (Figure 4).Figure 4
Basic neural network structure.


## 3. Method

### 3.1. Data Set Construction Based on ICP Algorithm

Perception of depth information is the premise of stereo vision. These depth data can obtain a group of discrete 3D points through reprojection, and a certain number of 3D points constitute the so-called point cloud. Although the depth data is very attractive, the depth information still has inherent noise, and the fluctuation of depth measurement often leads to the failure of reading information of some pixels, which is represented as holes in the depth image, indicating that there is no depth information. In order to make up the original shortages of depth transducer, as shown in KinectFusion algorithm, by obtaining a continuous depth image, the depth view merges with the new perspective to fill in the holes and fill in the missing depth information as much as possible [18]. Compared with other data representations, point cloud data achieves accurate topological structure and geometric structure of scene or object with lower storage cost, so it has certain advantages in 3D problem processing. Based on current technology, ICP algorithm is the most commonly used algorithm to process point cloud data, which has simple idea and high precision. ICP algorithm is also the main location method involved in the data set construction process in this paper, so this algorithm will be introduced in detail.The basic idea of the ICP algorithm is for two point sets, the unique closed solution can be obtained by the relative transformation of the two point sets according to the constraints of a certain number of matching points on the corresponding relationship by searching for the correct corresponding matching points of the sampling points. Therefore, ICP algorithm is essentially a two-point set registration process for two three-dimensional data point sets from different coordinate systems. For example, this paper involves the world coordinate system and the camera coordinate system, by finding two 3D point set space, relative transformation relationship to the unified under the same coordinate system (usually refers to the world coordinate system); the purpose is to find in the global coordinate system to obtain the current view of the relative position of the camera and the direction, his appearance, makes the intersection area completely overlap between the two, the process said for registration. In the calculation process, registration is to find the44 rigid transformation matrix T that makes the intersection area between the two points converge completely coincide and to calculate the optimal rigid body transformation by repeatedly selecting the corresponding point pairs until the accuracy requirements of convergence are met [5, 6, 8]. The rigid transformation matrix T mainly includes the aforementioned translation vector T, rotation matrix R, perspective transformation vector V, and scale factor S, because point cloud data is obtained according to a certain number of continuous pictures. Therefore, there is only rotation and translation, but no deformation. Therefore, the perspective transformation vector V is set as zero vector, and the scale factor S is 1 [19]. See Figure 5.Figure 5
Basic idea of ICP algorithm.As shown,(1)T=R11R12R13txR21R22R23tyR31R32R33tzvxvyvzs⟶T=RtVs⟶T=Rt01.The matching of the ICP algorithm is a process of continuous iteration until convergence. Two continuous depth images are abstracted into two point sets as input. The iterative steps of the standard ICP algorithm are as follows:(1)
According to the point sampling strategy, a certain number of sampling points are selected from the target point setP for matching. Common sampling strategies include uniform sampling, random sampling, and normal vector sampling(2)
The point-to-point principle is used to find the corresponding matching point set in the source point setQ, find all matching point pairs in the two point sets, and form two new point sets(3)
The above transformation matrixT is obtained by calculating the pose difference between the centers of gravity of two new point sets, which minimizes the error function, as shown in Equation (1)(4)
The transformation matrix obtained in step 3 is used to carry out rotation and translation transformation for the target point set, and a new corresponding point setP′ is obtained(5)
Calculate the average distanced between the new point set P′ and the source point set Q(6)
When the distanced is less than the set threshold or the number of iterations exceeds the set maximum number of iterations, the iteration process is stopped. Otherwise, steps 2~6 are repeated until the requirements are metCalculate the pixel coordinates of the new point setP obtained by the transformation matrix of the 3D point coordinate pi in the target point set p′, where T represents the obtained transformation matrix and K represents the camera internal parameter matrix. ud,vd represents the coordinates of pi in p′, n represents the scale of point set, pi′ represents pixels in point set P′, and qi represents pixels in source point set Q.As shown,(2)fud,vd,1=KTpi.As shown,(3)d=1n∑i=1npi′−qi2,wherepi and qi are the corresponding points of the two point sets found through the nearest neighbor principle, respectively, n represents the scale of the target point set, and fR,t represents the conversion error between the two points, so the problem is transformed into a mathematical solution with the minimum error value R and t, as shown in Figures 6 and 7.Figure 6
Nearest-neighbor heuristic.Figure 7
Nearest neighbor point method in normal vector direction.As shown,(4)fR,t=1n∑i=1nRpi+t−qi2.In conclusion, the purpose of the ICP algorithm is to find the nearest point of the objective and the terms below certain constraints and to calculate the optimal agreement of the switching matrix and the switching vector does not work to minimize errors.As shown,(5)E=∑i=1nRpi+t−qi⋅ni2.Compared with the original classic ICP algorithm, the accuracy and speed of localization have been greatly improved by the above improvements. In particular, KinectFusion algorithm uses frame-to-model registration form instead of image frame-to-frame, which reduces cumulative error to a certain extent. Meanwhile, the highly parallel processing on GPU improves the timeliness of the algorithm unprecedentedly [20].As shown,(6)E=Eicp+WiteEite.Eicp is the error function value of ICP algorithm, Eite is the error function value of direct method, and Wite is the weight value of direct method. The combination of the two methods makes the result of each iteration optimization more accurate and the stability has been greatly improved [21].


### 3.2. Navigation and Positioning Based on Neural Network

Neurons are the main functional components of neural network devices. Typically, it is an element with multiple inputs and one output and creates one type.xi represents the input signal. jij represents the input signal thiabi and the signal density of the neurons j, bj represents the differentiation of the neuron, and yj represents the output of the neuron. The relationship between signal input and output values is shown in the equation below.As shown,(7)yi=fbj+∑i=1nxi×wij.f· is the activation function, generally available Sigmoid function, ReLU function, TANHX function radial basis function, and other commonly used neural networks with multilayer perceptron limit Boltzmann machine radial basis neural network RBF, etc. [22]. See Figure 8.Figure 8
Neuronal model diagram.Commonly used operating values in neural networks include square values, cross-entropy, and logarithmic probability function. The square value and the cross-entropy function are defined, wherex is the model, n is the total model, y is the output value, and a is the output value. Compared with the quadratic function, the cross-entropy function combines fast and easy global optimization functions. When Softmax is used as a function of function, the logarithmic probability function is usually used as a function value, with ak being the output value of the K-nerve cell and yk being the value. Actual relative to K-nerve cell is 0 or 1 [23].As shown,(8)C=12n∑xyx−ax2.As shown,(9)C=−1n∑xylna+1−yln1−a.As shown,(10)C=−∑kyklogak.Optimization algorithms are required to address operating costs in deep neural networks, and most commonly used algorithms include data gradient conjugate gradient methods such as LBGFS. Currently, the most commonly used optimization algorithm is the gradient loss algorithm, and the main goal of the simple process is to reduce operational goals. At each iteration, the value of the differential gradient of each variable is adjusted in the direction returned to the different gradient according to the working objective. Among these, parametric performance speed determines the number of iterations when a function reaches its minimum value. There are three differences in fall gradient: random light gradient drop and small gradient drop [24]. For BGD, this can ensure that the process converges to the best international or that the operations are not convex to the best local, but fast because all updates should be addressed on all records. This method is not available even with large files in memory, and the model cannot be modified online. It solves only one sample gradient in the file of each update, which makes it efficient and allows for online learning. However, compared to BGD, SGD tends to fall locally to a minimum, and the integration process is less stable. MBGD provides the advantages of two options for solving configuration problems including N models for each update, making the integration process more stable, which is usually the preferred algorithm for training neural networks [25].


## 3.1. Data Set Construction Based on ICP Algorithm

Perception of depth information is the premise of stereo vision. These depth data can obtain a group of discrete 3D points through reprojection, and a certain number of 3D points constitute the so-called point cloud. Although the depth data is very attractive, the depth information still has inherent noise, and the fluctuation of depth measurement often leads to the failure of reading information of some pixels, which is represented as holes in the depth image, indicating that there is no depth information. In order to make up the original shortages of depth transducer, as shown in KinectFusion algorithm, by obtaining a continuous depth image, the depth view merges with the new perspective to fill in the holes and fill in the missing depth information as much as possible [18]. Compared with other data representations, point cloud data achieves accurate topological structure and geometric structure of scene or object with lower storage cost, so it has certain advantages in 3D problem processing. Based on current technology, ICP algorithm is the most commonly used algorithm to process point cloud data, which has simple idea and high precision. ICP algorithm is also the main location method involved in the data set construction process in this paper, so this algorithm will be introduced in detail.The basic idea of the ICP algorithm is for two point sets, the unique closed solution can be obtained by the relative transformation of the two point sets according to the constraints of a certain number of matching points on the corresponding relationship by searching for the correct corresponding matching points of the sampling points. Therefore, ICP algorithm is essentially a two-point set registration process for two three-dimensional data point sets from different coordinate systems. For example, this paper involves the world coordinate system and the camera coordinate system, by finding two 3D point set space, relative transformation relationship to the unified under the same coordinate system (usually refers to the world coordinate system); the purpose is to find in the global coordinate system to obtain the current view of the relative position of the camera and the direction, his appearance, makes the intersection area completely overlap between the two, the process said for registration. In the calculation process, registration is to find the44 rigid transformation matrix T that makes the intersection area between the two points converge completely coincide and to calculate the optimal rigid body transformation by repeatedly selecting the corresponding point pairs until the accuracy requirements of convergence are met [5, 6, 8]. The rigid transformation matrix T mainly includes the aforementioned translation vector T, rotation matrix R, perspective transformation vector V, and scale factor S, because point cloud data is obtained according to a certain number of continuous pictures. Therefore, there is only rotation and translation, but no deformation. Therefore, the perspective transformation vector V is set as zero vector, and the scale factor S is 1 [19]. See Figure 5.Figure 5
Basic idea of ICP algorithm.As shown,(1)T=R11R12R13txR21R22R23tyR31R32R33tzvxvyvzs⟶T=RtVs⟶T=Rt01.The matching of the ICP algorithm is a process of continuous iteration until convergence. Two continuous depth images are abstracted into two point sets as input. The iterative steps of the standard ICP algorithm are as follows:(1)
According to the point sampling strategy, a certain number of sampling points are selected from the target point setP for matching. Common sampling strategies include uniform sampling, random sampling, and normal vector sampling(2)
The point-to-point principle is used to find the corresponding matching point set in the source point setQ, find all matching point pairs in the two point sets, and form two new point sets(3)
The above transformation matrixT is obtained by calculating the pose difference between the centers of gravity of two new point sets, which minimizes the error function, as shown in Equation (1)(4)
The transformation matrix obtained in step 3 is used to carry out rotation and translation transformation for the target point set, and a new corresponding point setP′ is obtained(5)
Calculate the average distanced between the new point set P′ and the source point set Q(6)
When the distanced is less than the set threshold or the number of iterations exceeds the set maximum number of iterations, the iteration process is stopped. Otherwise, steps 2~6 are repeated until the requirements are metCalculate the pixel coordinates of the new point setP obtained by the transformation matrix of the 3D point coordinate pi in the target point set p′, where T represents the obtained transformation matrix and K represents the camera internal parameter matrix. ud,vd represents the coordinates of pi in p′, n represents the scale of point set, pi′ represents pixels in point set P′, and qi represents pixels in source point set Q.As shown,(2)fud,vd,1=KTpi.As shown,(3)d=1n∑i=1npi′−qi2,wherepi and qi are the corresponding points of the two point sets found through the nearest neighbor principle, respectively, n represents the scale of the target point set, and fR,t represents the conversion error between the two points, so the problem is transformed into a mathematical solution with the minimum error value R and t, as shown in Figures 6 and 7.Figure 6
Nearest-neighbor heuristic.Figure 7
Nearest neighbor point method in normal vector direction.As shown,(4)fR,t=1n∑i=1nRpi+t−qi2.In conclusion, the purpose of the ICP algorithm is to find the nearest point of the objective and the terms below certain constraints and to calculate the optimal agreement of the switching matrix and the switching vector does not work to minimize errors.As shown,(5)E=∑i=1nRpi+t−qi⋅ni2.Compared with the original classic ICP algorithm, the accuracy and speed of localization have been greatly improved by the above improvements. In particular, KinectFusion algorithm uses frame-to-model registration form instead of image frame-to-frame, which reduces cumulative error to a certain extent. Meanwhile, the highly parallel processing on GPU improves the timeliness of the algorithm unprecedentedly [20].As shown,(6)E=Eicp+WiteEite.Eicp is the error function value of ICP algorithm, Eite is the error function value of direct method, and Wite is the weight value of direct method. The combination of the two methods makes the result of each iteration optimization more accurate and the stability has been greatly improved [21].


## 3.2. Navigation and Positioning Based on Neural Network

Neurons are the main functional components of neural network devices. Typically, it is an element with multiple inputs and one output and creates one type.xi represents the input signal. jij represents the input signal thiabi and the signal density of the neurons j, bj represents the differentiation of the neuron, and yj represents the output of the neuron. The relationship between signal input and output values is shown in the equation below.As shown,(7)yi=fbj+∑i=1nxi×wij.f· is the activation function, generally available Sigmoid function, ReLU function, TANHX function radial basis function, and other commonly used neural networks with multilayer perceptron limit Boltzmann machine radial basis neural network RBF, etc. [22]. See Figure 8.Figure 8
Neuronal model diagram.Commonly used operating values in neural networks include square values, cross-entropy, and logarithmic probability function. The square value and the cross-entropy function are defined, wherex is the model, n is the total model, y is the output value, and a is the output value. Compared with the quadratic function, the cross-entropy function combines fast and easy global optimization functions. When Softmax is used as a function of function, the logarithmic probability function is usually used as a function value, with ak being the output value of the K-nerve cell and yk being the value. Actual relative to K-nerve cell is 0 or 1 [23].As shown,(8)C=12n∑xyx−ax2.As shown,(9)C=−1n∑xylna+1−yln1−a.As shown,(10)C=−∑kyklogak.Optimization algorithms are required to address operating costs in deep neural networks, and most commonly used algorithms include data gradient conjugate gradient methods such as LBGFS. Currently, the most commonly used optimization algorithm is the gradient loss algorithm, and the main goal of the simple process is to reduce operational goals. At each iteration, the value of the differential gradient of each variable is adjusted in the direction returned to the different gradient according to the working objective. Among these, parametric performance speed determines the number of iterations when a function reaches its minimum value. There are three differences in fall gradient: random light gradient drop and small gradient drop [24]. For BGD, this can ensure that the process converges to the best international or that the operations are not convex to the best local, but fast because all updates should be addressed on all records. This method is not available even with large files in memory, and the model cannot be modified online. It solves only one sample gradient in the file of each update, which makes it efficient and allows for online learning. However, compared to BGD, SGD tends to fall locally to a minimum, and the integration process is less stable. MBGD provides the advantages of two options for solving configuration problems including N models for each update, making the integration process more stable, which is usually the preferred algorithm for training neural networks [25].


## 4. Experimental Results and Discussion

The corresponding training test set was formed with the introduced data set to generate positioning model for each indoor scene. This section will introduce the loss change and accuracy in the training process from the perspective of three-stage training of scene coordinate initialization, reprojection error optimization, and end-to-end optimization.It, respectively, represents the loss reduction of the data set corresponding to the multistation scene under strong light, the multistation scene under weak light, the half-room scene, and the unmanned supermarket scene in the training process. Similarly, the same test data set is used to test the training loss decline and accuracy information corresponding to mirror scene and window scene one by one for the three training stages, and the positioning accuracy is obtained within different error thresholds (5°10 cm means that the rotation angle error is 5°, and the translation error is within 10 cm). The maximum error threshold is about one-third of the radius of the robot base and gradually decreases with an interval of 1 cm.As can be seen from the above, with the iteration update, the loss decreases continuously, and with the deepening of the training, the loss value remains stable and converges in the final end-to-end training. Accordingly, it can be concluded that for different indoor scenes, the positioning accuracy can reach more than 80% within the allowable error range of the robot. For the positioning target with smaller and more accurate error, the positioning accuracy can also be guaranteed by more than 60%. Among them, according to the average error value, it can be inferred that similar or repeated texture structure has a great influence on the positioning accuracy and has good robustness for other influence factors. Meanwhile, in all data set scenarios, positioning accuracy improved gradually with the deepening of training, proving that the three-stage training method is effective, as shown in Figure9.Figure 9
Loss visualization.Firstly, the experimental environment of the robot positioning and navigation system based on visual positioning is introduced, including the hardware equipment, software kit and operating system used by each part, and the parameter settings of each module are explained. Then, from the experimental point of view, the positioning accuracy of each indoor scene in the data set was tested under different error thresholds. Finally, Tiago robot was used to conduct navigation tasks with the positioning results, and the feasibility and practicability of the system were verified.The results of the experiment show that (1) the combination of ICP algorithm with direct method can solve the problem of loss and internal expansion of the data stored. (2) The process designed neural network positioning method is more efficient and robust and stable than the modification method. The operating time is shorter, which can meet the needs of the actual operation and be more cost-effective for all internal situations.


## 5. Conclusion

This paper proposes a robot visual navigation algorithm based on neural network and the target localization method from the visual angle, using the neural networks to locate, based on the idea of image frames to match a small amount of position and image information used to locate the initialization and training of neural network model, a small amount of data and information can effectively avoid posture loss and drift. Use of limited training data set information to generate an indoor scene of positioning model, based on the idea of scene coordinate regression, implementation does not depend on the depth information, by using a single RGB image positioning of the function of indoor positioning model can generate independent offline, so in the process of the system using the direct call the positioning model, without the calculation of a large number of real-time positioning letter to meet the task of system accuracy and real-time requirements.Combined with the advantages of the current mainstream method, a positioning and navigation system with high precision, high efficiency, and strong stability is realized by using a variety of sensors. Among them, the method based on neural network makes up for the shortcomings of the method based on image frame matching, which is easy to produce location failure, accumulation error, and even drift. Meanwhile, the method based on image frame matching creates conditions for the initialization of the location neural network model. By obtaining a large amount of environmental and structural information, the visual sensor makes up for the deficiency that the laser radar can only obtain the plane information of its own location. At the same time, the laser radar improves the accuracy of visual positioning and navigation, and the combination of the two can effectively expand the detection range and improve the accuracy of information.Some limitations of the system need to be improved in the future: in the stage of data set construction, although the combination of ICP algorithm and direct method has expanded the scale of experimental scenes, there is still the problem of failure for the larger scene environment. The training time of neural network is long, and the training time of each scene is measured in hours, so the time cost is high. The navigation process does not take into account the use of semantic information, only using geometric methods, with lack of effective robot interaction function.



---

*Source: 6761879-2022-07-14.xml*