2 papers
quant-ph2025
Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem
Haoqian Pan, Hang Yuan, Yang Liu +3
Recent advancements in quantum computing have spurred substantial research into the application of quantum algorithms to combinatorial optimization problems. Among these challenges…
cs.AI2025
Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding
Shiyue Wang, Haozheng Xu, Yuhan Zhang +4
Multi-Agent Path Finding (MAPF) is a fundamental problem in artificial intelligence and robotics, requiring the computation of collision-free paths for multiple agents navigating f…