Action Selection for MDPs: Anytime AO* vs. UCT

Cited by: 0|Bibtex|Views15
Other Links: arxiv.org

Abstract:

In the presence of non-admissible heuristics, A* and other best-first algorithms can be converted into anytime optimal algorithms over OR graphs, by simply continuing the search after the first solution is found. The same trick, however, does not work for best-first algorithms over AND/OR graphs, that must be able to expand leaf nodes o...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments