Dynamic Multi-Robot Path Planning in Narrow-Lane Environments with One-Way Constraint

With the rapid development of the logistics industry, the path planning problem for automated guided vehicles (AGVs) in warehousing systems has become a prominent research topic. Traditional multi-robot path planning algorithms often perform poorly in narrow-lane environments found in warehouses. This paper proposes an improved dynamic multi-robot path planning algorithm specifically tailored for narrow-lane environments. By constraining the traversal directions within narrow lanes and dynamically determining the optimal directions, this algorithm achieves efficient multi-robot path planning and enhances the quality of robot paths. The effectiveness of the algorithm is theoretically proven in this paper. Extensive simulation data demonstrates that our algorithm efficiently generates high-quality paths in high-density narrow-lane warehouse environments.