2 citations · 4 across the 3 of their papers we have counts for
3 papers
Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and Learning
Alexey Skrynnik, Anton Andreychuk, Maria Nesterova +2
Multi-agent Pathfinding (MAPF) problem generally asks to find a set of conflict-free paths for a set of agents confined to a graph and is typically solved in a centralized fashion.…
Monte-Carlo Tree Search for Multi-Agent Pathfinding: Preliminary Results
Yelisey Pitanov, Alexey Skrynnik, Anton Andreychuk +2
In this work we study a well-known and challenging problem of Multi-agent Pathfinding, when a set of agents is confined to a graph, each agent is assigned a unique start and goal v…
Resolving Spatial-Time Conflicts In A Set Of Any-angle Or Angle-constrained Grid Paths
Konstantin Yakovlev, Anton Andreychuk
We study the multi-agent path finding problem (MAPF) for a group of agents which are allowed to move into arbitrary directions on a 2D square grid. We focus on centralized conflict…