Multi-Agent Path Finding for Robots in Large-Scale Warehouses

ABOUT THE PROJECT

The Multi-Agent Pathfinding (MAPF) is a crucial problem of warehouse mobile robots to find collision free path to the target position. In this paper, we explore MAPF algorithms that produce an optimal and suboptimal path for a fixed number of robots to navigate in a warehouse environment. In addition, this paper also elaborates on the comparative analysis of the studied algorithms, with increasing environmental complexity and increasing number of agents. The compared parameters are the total cost, flowtime and makespan of each algorithm.

BALL BALANCING ROBOT