FAGV is a kind of heavy equipment in the storage environment. Its path needs to be simple and smooth and should be able to avoid sudden obstacles in the process of driving. According to the environmental characteristics of intelligent storage and the task requirements of FAGV, this paper proposed a hybrid dynamic path planning algorithm for FAGV based on improved A* and improved DWA. The improved A* algorithm can plan the global optimal path more suitable for FAGV. The improved evaluation function of DWA can ensure that the local path of FAGV is closer to the global path. DWA combines the rolling window method for local path planning to avoid sudden unknown static and dynamic obstacles. In addition, this paper verifies the effectiveness of the algorithm through simulation. The simulation results show that the algorithm can avoid obstacles dynamically without being far away from the global optimal path.

The efficiency of the rapidly exploring random tree (RRT) falls short when efficiently guiding targets through constricted-passage environments, presenting issues such as sluggish convergence speed and elevated path costs. To overcome these algorithmic limitations, we propose a narrow-channel path-finding algorithm (named NCB-RRT) based on Bi-RRT with the addition of our proposed research failure rate threshold (RFRT) concept. Firstly, a three-stage search strategy is employed to generate sampling points guided by real-time sampling failure rates. By means of the balance strategy, two randomly growing trees are established to perform searching, which improves the success rate of the algorithm in narrow channel environments, accelerating the convergence speed and reducing the number of iterations required. Secondly, the parent node re-selection and path pruning strategy are integrated. This shortens the path length and greatly reduces the number of redundant nodes and inflection points. Finally, the path is optimized by utilizing segmented quadratic Bezier curves to achieve a smooth trajectory. This research shows that the NCB-RRT algorithm is better able to adapt to the complex narrow channel environment, and the performance is also greatly improved in terms of the path length and the number of inflection points. Compared with the RRT, RRT* and Bi-RRT algorithms, the success rate is increased by 2400%, 1900% and 11.11%, respectively.

In warehouses with vast quantities of heavy goods, heavy-duty forklift Automated Guided Vehicles (AGVs) play a key role in facilitating efficient warehouse automation. Due to their large load capacity and high inertia, heavy-duty forklift AGVs struggle to automatically navigate optimized routes. Additionally, rapid acceleration and deceleration can pose safety hazards. This paper proposes a velocity-adaptive model predictive control (MPC)-based path tracking method for heavy-duty forklift AGVs. The movement of heavy-duty forklift-type AGVs is categorized into straight-line and curve-turning motions, corresponding to the straight and curved sections of the reference path, respectively. These sections are segmented based on their curvature. The best driving speeds for straight and curved sections were 1.5 m/s and 0.3 m/s, respectively, while the optimal acceleration rates were 0.2 m/s² for acceleration and −0.2 m/s² for deceleration in straight paths and 0.3 m/s² for acceleration with −0.15 m/s² for deceleration in curves. Moreover, preferred sampling times, prediction domain, and control domain were determined through simulations at various speeds. Four path tracking methods, including pure tracking, Linear Quadratic Regulator (LQR), MPC, and the velocity-adaptive MPC, were simulated and evaluated under straight-line, turning, and complex double lane change conditions. Field experiments conducted in a warehouse environment demonstrated the effectiveness of the proposed path tracking method. Findings have implications for advancing path tracking control in narrow aisles.