title: MAWA∗-a memory-bounded anytime heuristic-search algorithm.
abstract: 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.
authors.affiliation: Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India. satya@cse.iitkgp.ernet.in
authors.forename: Satya Gautam
authors.initials: SG
authors.lastname: Vadlamudi
authors.forename: Sandip
authors.initials: S
authors.lastname: Aine
authors.forename: Partha Pratim
authors.initials: PP
authors.lastname: Chakrabarti
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D003661:Decision Support Techniques; D008962:Models, Theoretical; D010363:Pattern Recognition, Automated / Q000379:methods*