5 citations · 11 across the 12 of their papers we have counts for
13 papers
Decentralized Master-Mind: Joint Action Refinement through Iterative Intent Denoising in Multi-Agent Pathfinding
Valeriy Vyaltsev, Anton Andreychuk, Taisia Zlotnikova +3
Decentralized multi-agent path finding (MAPF) with communication requires agents to reach individual goals without collisions under partial observability. Learnable policies traine…
Learning to Communicate Locally for Large-Scale Multi-Agent Pathfinding
Valeriy Vyaltsev, Alsu Sagirova, Anton Andreychuk +5
Multi-agent pathfinding (MAPF) is a widely used abstraction for multi-robot trajectory planning problems, where multiple homogeneous agents move simultaneously within a shared envi…
MARL-GPT: Foundation Model for Multi-Agent Reinforcement Learning
Maria Nesterova, Mikhail Kolosov, Anton Andreychuk +6
Recent advances in multi-agent reinforcement learning (MARL) have demonstrated success in numerous challenging domains and environments, but typically require specialized models fo…
CoRL-MPPI: Enhancing MPPI With Learnable Behaviours For Efficient And Provably-Safe Multi-Robot Collision Avoidance
Stepan Dergachev, Artem Pshenitsyn, Aleksandr Panov +2
Decentralized collision avoidance is a core challenge for scalable multi-robot systems. A promising approach to this problem is Model Predictive Path Integral (MPPI) control - a fr…
CAMAR: Continuous Actions Multi-Agent Routing
Artem Pshenitsyn, Aleksandr Panov, Alexey Skrynnik
Multi-agent reinforcement learning (MARL) is a powerful paradigm for solving cooperative and competitive decision-making problems. While many MARL benchmarks have been proposed, fe…
CrafText Benchmark: Advancing Instruction Following in Complex Multimodal Open-Ended World
Zoya Volovikova, Gregory Gorbov, Petr Kuderov +2
Following instructions in real-world conditions requires the ability to adapt to the world's volatility and entanglement: the environment is dynamic and unpredictable, instructions…
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…
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…
Instruction Following with Goal-Conditioned Reinforcement Learning in Virtual Environments
Zoya Volovikova, Alexey Skrynnik, Petr Kuderov +1
In this study, we address the issue of enabling an artificial intelligence agent to execute complex language instructions within virtual environments. In our framework, we assume t…
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…
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.…