Resumen
The improved Dijkstra algorithm proposed herein can be effectively applied to rail-mounted robots to distribute goods in large workshops, especially in ultra-clean semiconductor chip production workshops. The algorithm can plan the shortest route for the robots to distribute goods, adjust to conflicts in real time, and complete multiple distribution tasks for multiple robots.