Abstract: In multi-agent applications such as surveillance and logistics, fleets of mobile agents are often expected to coordinate and safely visit a large number of goal locations as efficiently as ...
Abstract: Multi-agent path finding (MAPF), i.e., finding collision-free paths for multiple agents on graphs, is widely applied to domains such as warehouse automation, robotic manufacturing, and ...
We conducted several experiments to evaluate the different MAPF algorithms. Furthermore, we trained algorithm selection models, based on XGBoost and VGG-16. The relevant code and data can be found at ...
This software is based on the latest MAPF-LNS implementation from [1] and Anytime Multi-Agent Path Finding from [2]. Adaptive Delay-based Destroy-and-Repair Enhanced with Success-based Self-Learning ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback