Vadlamudi Satya Gautam, Aine Sandip, Chakrabarti Partha Pratim
Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India.
IEEE Trans Syst Man Cybern B Cybern. 2011 Jun;41(3):725-35. doi: 10.1109/TSMCB.2010.2089619. Epub 2010 Nov 18.
This paper presents a heuristic-search algorithm called Memory-bounded Anytime Window A∗ (MAWA∗), which is complete, anytime, and memory bounded. MAWA∗ uses the window-bounded anytime-search methodology of AWA∗ as the basic framework and combines it with the memory-bounded A∗ -like approach to handle restricted memory situations. Simple and efficient versions of MAWA∗ 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.
本文提出了一种名为内存受限随时窗口A*（MAWA*）的启发式搜索算法，该算法具有完备性、随时性且内存受限。MAWA采用AWA的窗口受限随时搜索方法作为基本框架，并将其与类似内存受限A的方法相结合，以处理内存受限的情况。还提出了针对树搜索的简单高效的MAWA版本。滑动拼图问题和旅行商问题的实验结果表明，该算法相对于现有方法具有显著优势。
