5 citations · 11 across the 12 of their papers we have counts for
3 papers · 1 filter
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…
Gradual Optimization Learning for Conformational Energy Minimization
Artem Tsypin, Leonid Ugadiarov, Kuzma Khrabrov +7
Molecular conformation optimization is crucial to computer-aided drug discovery and materials design. Traditional energy minimization techniques rely on iterative optimization meth…
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.…