GONDOR to the Rescue: Satisficing Planning with Low Memory
DGX agentarXiv:2605.28454v1 Announce Type: new Abstract: Greedy Best-First Search (GBFS) is the dominant approach for solving search problems where the goal can be estimated with a heuristic, such as planning,