This New Decomposition Framework Makes Multi-Agent Pathfinding More Scalable
:::info Authors: Zhuo Yao Wei Wang ::: Table Of Links ABSTRACT I. INTRODUCTION II. RELATED WORKS III. PRELIMINARIES IV. METHODOLOGY V. RESULTS OF DECOMPOSITION VI. RESULTS OF DECOMPOSITION’S APPLICATION VII. CONCLUSION, ACKNOWLEDGMENTS AND REFERENCES ABSTRACT Generally, the calculation and memory space required for multi-agent path finding (MAPF) grows exponentially as the number of agents increases. This often results in some MAPF instances being unsolvable under limited computational resources and memory space, thereby limiting the application of MAPF in […]