To enhance the positioning accuracy of autonomous underwater vehicles (AUVs), a new adaptive filtering algorithm (RHAUKF) is proposed. The most widely used filtering algorithm is the traditional Unscented Kalman Filter or the Adaptive Robust UKF (ARUKF). Excessive noise interference may cause a decrease in filtering accuracy and is highly likely to result in divergence by means of the traditional Unscented Kalman Filter, resulting in an increase in uncertainty factors during submersible mission execution. An estimation model for system noise, the adaptive Unscented Kalman Filter (UKF) algorithm was derived in light of the maximum likelihood criterion and optimized by applying the rolling-horizon estimation method, using the Newton–Raphson algorithm for the maximum likelihood estimation of noise statistics, and it was verified by simulation experiments using the Lie group inertial navigation error model. The results indicate that, compared with the UKF algorithm and the ARUKF, the improved algorithm reduces attitude angle errors by 45%, speed errors by 44%, and three-dimensional position errors by 47%. It can better cope with complex underwater environments, effectively address the problems of low filtering accuracy and even divergence, and improve the stability of submersibles.

Since efficient path planning technology is the key to the safe and autonomous navigation of autonomous ground robots, and in the complex and asymmetrically distributed land environment, the existing path planning and obstacle avoidance technologies seem somewhat inadequate. Since efficient path planning technology is key to the safe and autonomous navigation of autonomous ground robots, an advanced double Q-learning algorithm based on self-supervised prediction and curiosity-driven exploration is proposed. The algorithm reduces the risk of overestimation and bootstrapping by adjusting the calculation method of the target Q value and optimizing the network structure. In addition, a priority experience replay is introduced to set the priority for the data in the experience pool, thereby increasing the probability that better data is extracted. Experience pool data with fewer training times can be used more effectively. Adding the curiosity network to the original neural network, each state is given an overall reward when performing diverse actions. This method enhances the exploration of unmanned ground mobile robots and can independently select the shortest path to the endpoint. In complex environments, compared with the Sparrow Search Algorithm, Dung Beetle Optimization Algorithm, and Particle Swarm Optimization Algorithm, the results of the proposed algorithm are reduced by 18.07%, 7.91%, and 5.56%, respectively. Therefore, it could better cope with the challenges brought by complex environments and solve the problem that the algorithm cannot converge in complex environments.