3 papers
cs.AI2025
Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics
Shahaf S. Shperberg, Natalie Morad, Lior Siag +2
Recent advancements in bidirectional heuristic search have yielded significant theoretical insights and novel algorithms. While most previous work has concentrated on optimal searc…
cs.AI2019
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Roni Stern, Nathan Sturtevant, Ariel Felner +9
The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently witho…
cs.AI2019
Multi-Agent Pathfinding with Continuous Time
Anton Andreychuk, Konstantin Yakovlev, Dor Atzmon +1
Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. Most prior work on MAPF was…