𝔖 Bobbio Scriptorium
✦   LIBER   ✦

—A Memory-Bounded Anytime Heuristic-Search Algorithm

✍ Scribed by Vadlamudi, S.G.; Aine, S.; Chakrabarti, P.P.

Book ID
117939194
Publisher
IEEE
Year
2011
Tongue
English
Weight
321 KB
Volume
41
Category
Article
ISSN
1083-4419

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic search in restricted memory
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

A heuristic search algorithm with modifi
A heuristic search algorithm with modifiable estimate
✍ László Mérõ 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 646 KB

## This paper describes an improved version of two previously published algorithms in the area: A\* and B. The new approach is based on considering the estimate fz(n ) on node n as a variable rather than as a constant. The new algorithm thus improves the estimate as it goes on, avoiding some usele