GONDOR to the Rescue: Satisficing Planning with Low Memory 事件

GONDOR to the Rescue: Satisficing Planning with Low Memory arXiv: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, route finding, navigation, and pathfinding. This is especially true when the memory is tightly constrained, such as planning on edge devices. To alleviate that, we present GONDOR (Greedy Online Navigation with Dynamic Outpost-based Re-sear