Showing 2025Show all
2 papers · 1 filter
cs.MA2025
Empirical Hardness in Multi-Agent Pathfinding: Research Challenges and Opportunities
Jingyao Ren, Eric Ewing, T. K. Satish Kumar +2
Multi-agent pathfinding (MAPF) is the problem of finding collision-free paths for a team of agents on a map. Although MAPF is NP-hard, the hardness of solving individual instances…
cs.AI2025
A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives
Yaron Halle, Ariel Felner, Sven Koenig +1
The bi-objective shortest-path (BOSP) problem seeks to find paths between start and target vertices of a graph while optimizing two conflicting objective functions. We consider the…