\MAWA^\ast—A Memory-Bounded Anytime Heuristic-Search Algorithm.

This paper presents a heuristic-search algorithm called Memory-bounded Anytime Window \A^\ast\ (\MAWA^\ast), which is complete, anytime, and memory bounded. \MAWA^\ast uses the window-bounded anytime-search methodology of \AWA^\ast as the basic framework and combines it with the memory-bounded \A^\ast-like approach to handle restricted memory situations. Simple and efficient versions of \MAWA^\ast targeted for tree search have also been presented. Experimental results of the sliding-tile puzzle problem and the traveling-salesman problem show the significant advantages of the proposed algorithm over existing methods. [ABSTRACT FROM AUTHOR]