Showing cs.AIShow all
3 papers · 1 filter
cs.AI2026
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…
cs.AI2025
Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning
Anton Andreychuk, Konstantin Yakovlev, Aleksandr Panov +1
Multi-agent pathfinding (MAPF) is a common abstraction of multi-robot trajectory planning problems, where multiple homogeneous robots simultaneously move in the shared environment.…
cs.AI2024
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…