Memory bounded heuristic search:
•To reduce memory- Iterative deepening to the heuristic search.
•2 memory bounded algorithm:
1) RBFS (recursive best-first search).
2) MA* (Memory-bounded A*) and
SMA*(simplified memory MA*)
RBFS:
•It attempts to mimic the operation of BFS.
•It replaces the f-value of each node along the path with the best f-value of its children.
•Suffers from using too little memory.
•Even if more memory were available , RBFS has no way to make use of it.
SMA*
•Proceeds life A*,expands best leaf until memory is full.
•Cannot add new node without dropping an old one. (always drops worst one)
•Expands the best leaf and deletes the worst leaf.
•If all have same f-value-selects same node for expansion and deletion.
•SMA* is complete if any reachable solution.
Save water:
Espure Water Solution Pvt Ltd
Chennai,India.
Mobile: 9944116631 / 9841005335
Effluent Treatment Plant Manufacturer in Chennai
This comment has been removed by the author.
ReplyDelete