19 citations · 54 across the 20 of their papers we have counts for
3 papers · 2 filters
Decentralized Monte Carlo Tree Search for Partially Observable Multi-agent Pathfinding
Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev +1
The Multi-Agent Pathfinding (MAPF) problem involves finding a set of conflict-free paths for a group of agents confined to a graph. In typical MAPF scenarios, the graph and the age…
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…