activity
20102023
most citedPRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning

425 citations · 982 across the 23 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

cs.AI2022

The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems

Sumedh Pendurkar, Taoan Huang, Sven Koenig +1

The A* algorithm is commonly used to solve NP-hard combinatorial optimization problems. When provided with a completely informed heuristic function, A* solves many NP-hard minimum-…