Showing cs.MAShow all
3 papers · 1 filter
cs.MA2026
Relaxing Constraints in Anonymous Multi Agent Path Finding for Large Agents
Stepan Dergachev, Dmitry Avdeev
The study addressed the problem of Anonymous Multi-Agent Path-finding (AMAPF). Unlike the classical formulation, where the assignment of agents to goals is fixed, in the anonymous…
cs.MA2024
Decentralized Unlabeled Multi-agent Pathfinding Via Target And Priority Swapping (With Supplementary)
Stepan Dergachev, Konstantin Yakovlev
In this paper we study a challenging variant of the multi-agent pathfinding problem (MAPF), when a set of agents must reach a set of goal locations, but it does not matter which ag…
cs.MA2022
Towards A Complete Multi-Agent Pathfinding Algorithm For Large Agents
Stepan Dergachev, Konstantin Yakovlev
Multi-agent pathfinding (MAPF) is a challenging problem which is hard to solve optimally even when simplifying assumptions are adopted, e.g. planar graphs (typically -- grids), dis…