1 citations · 3 across the 10 of their papers we have counts for
4 papers · 1 filter
New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding
Shao-Hung Chan, Thomy Phan, Jiaoyang Li +1
Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths, one for each agent in a shared environment. Its objective is to minimize the sum of path co…
Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds
Yimin Tang, Zhenghong Yu, Jiaoyang Li +1
Multi-Agent Path Finding (MAPF) involves finding collision-free paths for multiple agents while minimizing a cost function--an NP-hard problem. Bounded suboptimal methods like Enha…
RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks
Yimin Tang, Xiao Xiong, Jingyi Xi +3
Multi-Agent Path Finding (MAPF), which focuses on finding collision-free paths for multiple robots, is crucial for applications ranging from aerial swarms to warehouse automation.…
Enhancing Lifelong Multi-Agent Path Finding with Cache Mechanism
Yimin Tang, Zhenghong Yu, Yi Zheng +3
Multi-Agent Path Finding (MAPF), which focuses on finding collision-free paths for multiple robots, is crucial in autonomous warehouse operations. Lifelong MAPF (L-MAPF), where age…