Showing cs.AIShow all
2 papers · 1 filter
cs.AI2025
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…
cs.AI2024
Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic
Thomy Phan, Benran Zhang, Shao-Hung Chan +1
Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in multi-agent systems. MAPF-LNS, based on Large Neighborhood Search (LNS), is the cur…