14 citations · 30 across the 12 of their papers we have counts for
Showing 2025 · cs.AIShow all
2 papers · 2 filters
cs.AI2025★ 8 cited
A-MHA*: Anytime Multi-Heuristic A*
Ramkumar Natarajan, Muhammad Suhail Saleem, William Xiao +3
Designing good heuristic functions for graph search requires adequate domain knowledge. It is often easy to design heuristics that perform well and correlate with the underlying tr…
cs.AI2025
Anytime Single-Step MAPF Planning with Anytime PIBT
Nayesha Gandotra, Rishi Veerapaneni, Muhammad Suhail Saleem +3
PIBT is a popular Multi-Agent Path Finding (MAPF) method at the core of many state-of-the-art MAPF methods including LaCAM, CS-PIBT, and WPPL. The main utility of PIBT is that it i…