Heuristic search in restricted memory

Chakrabarti, P. P. ; Ghose, S. ; Acharya, A. ; De Sarkar, S. C. (1989) Heuristic search in restricted memory Artificial Intelligence, 41 (2). pp. 197-221. ISSN 0004-3702

Full text not available from this repository.

Official URL: http://linkinghub.elsevier.com/retrieve/pii/000437...

Related URL: http://dx.doi.org/10.1016/0004-3702(89)90010-6


This paper presents heuristic search algorithms which work within memory constraints. These algorithms, MA* (for ordinary graphs) and MAO* (for AND/OR graphs) guarantee admissible solutions within specified memory limitations (above the minimum required). The memory versus node expansions tradeoff is analyzed for the worst case. In the case of ordinary graphs, some experiments using the Fifteen Puzzle problem are carried out under various pruning conditions. These parameterized algorithms are found to encompass a wide class of best first search algorithms.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:5908
Deposited On:19 Oct 2010 10:15
Last Modified:20 May 2011 09:52

Repository Staff Only: item control page