Heuristic Search in Cyclic AND/OR Graphs
Abstract
Heuristic search algorithms can find solutions that take the form of a simple path (A*), a tree or acyclic graph (AO*). We present a novel generaliza-tion of heuristic search (called LAO*) that can find solutions with loops, that is, solutions that take the form of a cyclic graph. We show that it can be used to solve Markov decision problems without evaluat-ing the entire state space, giving it an advantage over dynamic-programming al orithms such as policy iter-ation and value iteration as an approach to stochastic planning.
Cite
Text
Hansen and Zilberstein. "Heuristic Search in Cyclic AND/OR Graphs." AAAI Conference on Artificial Intelligence, 1998.Markdown
[Hansen and Zilberstein. "Heuristic Search in Cyclic AND/OR Graphs." AAAI Conference on Artificial Intelligence, 1998.](https://mlanthology.org/aaai/1998/hansen1998aaai-heuristic/)BibTeX
@inproceedings{hansen1998aaai-heuristic,
title = {{Heuristic Search in Cyclic AND/OR Graphs}},
author = {Hansen, Eric A. and Zilberstein, Shlomo},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1998},
pages = {412-418},
url = {https://mlanthology.org/aaai/1998/hansen1998aaai-heuristic/}
}