A Robot-Oriented Competitive Algorithm for Path Planning Research

In warehouse environments, due to complex terrains and the numerous task points that robots need to execute, it is essential to reasonably arrange the robots' movement paths during actual operations. This approach can effectively enhance the robots' execution speed and operational efficiency while reducing collision risks, thereby ensuring collision-free navigation and optimal path planning for the robots in the warehouse. It also significantly reduces energy and time costs, making warehouse management more efficient and intelligent. The novel algorithm this paper introduces draws on the interactions and relationships between competitors and winners in competitive systems, applying these principles to robot path planning. Experiments were designed to compare its performance with other algorithms. The simulation results demonstrate that the proposed algorithm outperforms most existing algorithms regarding solution quality.