AINeutralarXiv – CS AI · 3h ago6/10
🧠
GONDOR to the Rescue: Satisficing Planning with Low Memory
Researchers introduce GONDOR, a memory-efficient extension of Greedy Best-First Search that enables planning algorithms to operate under strict memory constraints by compressing search trees while retaining sparse anchor states. The algorithm reconstructs paths through re-searching between these states, with experiments showing consistent improvements in coverage on low-memory devices compared to standard approaches.