Heuristic search in restricted memory
β
P.P. Chakrabarti; S. Ghose; A. Acharya; S.C. de Sarkar
π
Article
π
1989
π
Elsevier Science
π
English
β 979 KB
Thts paper presents heurlsttc search algortthms whtch work wtthm memory constramts These algortthms, MA\* (for ordinary graphs) and MAO\* (for AND~OR graphs) guarantee admtsstble soluttons wlthm spectfied memory hmltattons (above the rnmtmum requtred) The memory versus node expanstons tradeoff ts an