Alexander Shleyfman
2 indexed papers
Publications per year
Top categories
Frequent co-authors
Research Timeline
The paper introduces GONDOR, a memory-efficient extension of Greedy Best-First Search (GBFS) that enables search continuation under strict memory constraints by periodically compressing the search tree using anchor states.
The paper introduces GONDOR, a memory-efficient extension of Greedy Best-First Search (GBFS) that enables search continuation under strict memory constraints by periodically compressing the search tree using anchor states.
Papers
GONDOR to the Rescue: Satisficing Planning with Low Memory
The paper introduces GONDOR, a memory-efficient extension of Greedy Best-First Search (GBFS) that enables search continuation under strict memory constraints by periodically compressing the search tre…