$hbox{MAWA}^{ast}$—A Memory-Bounded Anytime Heuristic-Search Algorithm

Authors:
S. G. Vadlamudi;S. Aine;P. P. Chakrabarti
Affiliations:
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Kharagpur, Kharagpur, India;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2011

Citing 0
Cited 3

Anytime algorithms for biobjective heuristic search

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Anytime column search

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Anytime algorithms for mining groups with maximum coverage

AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134

Quantified Score

Hi-index	0.00

Visualization

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.