Abstract: Multi-agent Pathfinding (MAPF) problems typically involve multiple agents finding a set of conflict-free paths, and are usually solved in a centralized manner. In this work, we explore ...

Abstract: This study focuses on reformulating the shortest path problem in undirected weighted graphs into a QUBO problem, leveraging the D-Wave quantum annealing hybrid solver for execution. While A ...