This paper proposes an improved Soft Actor–Critic Long Short-Term Memory (SAC-LSTM) algorithm for fast path planning of mobile robots in dynamic environments. To achieve continuous motion and better decision making by incorporating historical and current states, a long short-term memory network (LSTM) with memory was integrated into the SAC algorithm. To mitigate the memory depreciation issue caused by resetting the LSTM’s hidden states to zero during training, a burn-in training method was adopted to boost the performance. Moreover, a prioritized experience replay mechanism was implemented to enhance sampling efficiency and speed up convergence. Based on the SAC-LSTM framework, a motion model for the Turtlebot3 mobile robot was established by designing the state space, action space, reward function, and overall planning process. Three simulation experiments were conducted in obstacle-free, static obstacle, and dynamic obstacle environments using the ROS platform and Gazebo9 software. The results were compared with the SAC algorithm. In all scenarios, the SAC-LSTM algorithm demonstrated a faster convergence rate and a higher path planning success rate, registering a significant 10.5 percentage point improvement in the success rate of reaching the target point in the dynamic obstacle environment. Additionally, the time taken for path planning was shorter, and the planned paths were more concise.

Electro-hydraulic actuators (EHAs) are key linear drive components in various industrial applications. This paper addresses the challenge of achieving precise displacement tracking control for EHAs with only noisy displacement measurements. We propose a novel control approach, which consists of a Kalman extended state observer (KESO) with an adaptive sliding mode controller (ASMC). First, compared to the conventional high-gain design for the extended state observer (ESO), the Kalman filtering technique is utilized to tune the ESO feedback gain, effectively mitigating observation failures caused by measurement noise. Second, to ensure stability and minimize tracking errors in sliding mode control, a switching-gain adaptation is designed based on the desired switching gain via the derivative of the sliding variable. To validate the effectiveness of the proposed approach, simulation experiments are conducted in the Amesim simulation software. The results conclusively demonstrate that the proposed KESO-ASMC achieves significantly improved trajectory tracking performance, even in the presence of measurement noise and unknown disturbances.

With the increasing frequency of autonomous driving, more and more attention is paid to personalized path planning. However, the path selection preferences of users will change with internal or external factors. Therefore, this paper proposes a personalized path recommendation strategy that can track and study user’s path preference. First, we collect the data of the system, establish the relationship with the user preference factor, and get the user’s initial preference weight vector by dichotomizing the K‐means algorithm. The system then determines whether user preferences change based on a set threshold, and when the user’s preference changes, the current preference weight vector can be obtained by redefining the preference factor or calling difference perception. Finally, the road network is quantized separately according to the user preference weight vector, and the optimal path is obtained by using Tabu search algorithm. The simulation results of two scenarios show that the proposed strategy can meet the requirements of autopilot even when user preferences change.

Vehicle navigation is widely used in path planning of self driving travel, and it plays an increasing important role in people's daily trips. Therefore, path planning algorithms have attracted substantial attention. However, most path planning methods are based on public data, aiming at different driver groups rather than a specific user. Hence, this study proposes a personalized path decision algorithm that is based on user habits. First, the categories of driving characteristics are obtained through the investigation of public users, and the clustering results corresponding to the category space are obtained by log fuzzy C-means clustering algorithm (LFCM) based on the driving information contained in the log trajectories. Then, the road performance personalized quantization algorithm evaluation is proposed to evaluate roads from the user’s field of vision. Finally, adaptive ant colony algorithm is improved and used to validate the path planning based on the road performance personalized values. Results show that the algorithm can meet the personalized requirements of the user path selection in the path decision.

Visual ranging technology holds great promise in various fields such as unmanned driving and robot navigation. However, complex dynamic environments pose significant challenges to its accuracy and robustness. Existing monocular visual ranging methods are susceptible to scale uncertainty, while binocular visual ranging is sensitive to changes in lighting and texture. To overcome the limitations of single visual ranging, this paper proposes a fusion method for monocular and binocular visual ranging based on an adaptive Unscented Kalman Filter (AUKF). The proposed method first utilizes a monocular camera to estimate the initial distance based on the pixel size, and then employs the triangulation principle with a binocular camera to obtain accurate depth. Building upon this foundation, a probabilistic fusion framework is constructed to dynamically fuse monocular and binocular ranging using the AUKF. The AUKF employs nonlinear recursive filtering to estimate the optimal distance and its uncertainty, and introduces an adaptive noise-adjustment mechanism to dynamically update the observation noise based on fusion residuals, thus suppressing outlier interference. Additionally, an adaptive fusion strategy based on depth hypothesis propagation is designed to autonomously adjust the noise prior of the AUKF by combining current environmental features and historical measurement information, further enhancing the algorithm’s adaptability to complex scenes. To validate the effectiveness of the proposed method, comprehensive evaluations were conducted on large-scale public datasets such as KITTI and complex scene data collected in real-world scenarios. The quantitative results demonstrate that the fusion method significantly improves the overall accuracy and stability of visual ranging, reducing the average relative error within an 8 m range by 43.1% and 40.9% compared to monocular and binocular ranging, respectively. Compared to traditional methods, the proposed method significantly enhances ranging accuracy and exhibits stronger robustness against factors such as lighting changes and dynamic targets. The sensitivity analysis further confirmed the effectiveness of the AUKF framework and adaptive noise strategy. In summary, the proposed fusion method effectively combines the advantages of monocular and binocular vision, significantly expanding the application range of visual ranging technology in intelligent driving, robotics, and other fields while ensuring accuracy, robustness, and real-time performance.