Sciweavers

Share
KI
2001
Springer

Theory and Practice of Time-Space Trade-Offs in Memory Limited Search

10 years 4 months ago
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respect to memory limitations. We establish Ç´ÐÓ Òµ minimum-space algorithms that omit both the open and the closed list to determine the shortest path between every two nodes and study the gap in between full memorization in a hash table and the information-theoretic lower bound. The proposed structure of suffix-lists elaborates on a concise binary representation of states by applying bit-state hashing techniques. Significantly more states can be stored while searching and inserting Ò items into suffix lists is still available in Ç´ÒÐÓ Òµ time. Bit-state hashing leads to the new paradigm of partial iterative-deepening heuristic search, in which full exploration is sacrificed for a better detection of duplicates in large search depth. We give first promising results in the application area of co...
Stefan Edelkamp, Ulrich Meyer
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where KI
Authors Stefan Edelkamp, Ulrich Meyer
Comments (0)
books