5 citations · 7 across the 10 of their papers we have counts for
6 papers · 1 filter
MAPF-GPT: Imitation Learning for Multi-Agent Pathfinding at Scale
Anton Andreychuk, Konstantin Yakovlev, Aleksandr Panov +1
Multi-agent pathfinding (MAPF) is a problem that generally requires finding collision-free paths for multiple agents in a shared environment. Solving MAPF optimally, even under res…
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…
Safe Policy Exploration Improvement via Subgoals
Brian Angulo, Gregory Gorbov, Aleksandr Panov +1
Reinforcement learning is a widely used approach to autonomous navigation, showing potential in various tasks and robotic setups. Still, it often struggles to reach distant goals w…
POGEMA: A Benchmark Platform for Cooperative Multi-Agent Pathfinding
Alexey Skrynnik, Anton Andreychuk, Anatolii Borzilov +3
Multi-agent reinforcement learning (MARL) has recently excelled in solving challenging cooperative and competitive multi-agent problems in various environments, typically involving…
Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding
Konstantin Yakovlev, Anton Andreychuk, Roni Stern
Multi-agent pathfinding (MAPF) is the problem of finding a set of conflict-free paths for a set of agents. Typically, the agents' moves are limited to a pre-defined graph of possib…
Improved Anonymous Multi-Agent Path Finding Algorithm
Zain Alabedeen Ali, Konstantin Yakovlev
We consider an Anonymous Multi-Agent Path-Finding (AMAPF) problem where the set of agents is confined to a graph, a set of goal vertices is given and each of these vertices has to…