TY - GEN
T1 - LAO*, RLAO*, or BLAO*?
AU - Dai, Peng
AU - Goldsmith, Judy
PY - 2006
Y1 - 2006
N2 - In 2003, Bhuma and Goldsmith introduced a bidirectional variant of Hansen and Zilberstein's LAO* algorithm called BLAO* for solving goal-based MDPs. BLAO* consistently ran faster than LAO* on the race-track examples used in Hansen and Zilberstein's paper. In this paper, we analyze the performance of BLAO* in comparison with both LAO* and our newly proposed algorithm, RLAO*, the reverse LAO* search, to understand what makes the bidirectional search work well.
AB - In 2003, Bhuma and Goldsmith introduced a bidirectional variant of Hansen and Zilberstein's LAO* algorithm called BLAO* for solving goal-based MDPs. BLAO* consistently ran faster than LAO* on the race-track examples used in Hansen and Zilberstein's paper. In this paper, we analyze the performance of BLAO* in comparison with both LAO* and our newly proposed algorithm, RLAO*, the reverse LAO* search, to understand what makes the bidirectional search work well.
UR - https://www.scopus.com/pages/publications/33846024090
UR - https://www.scopus.com/pages/publications/33846024090#tab=citedBy
M3 - Conference contribution
AN - SCOPUS:33846024090
SN - 1577352904
SN - 9781577352907
T3 - AAAI Workshop - Technical Report
SP - 59
EP - 64
BT - Heuristic Search, Memory-Based Heuristics and their Applications - Papers from the AAAI Workshop, Technical Report
T2 - 2006 AAAI Workshop
Y2 - 16 July 2006 through 20 July 2006
ER -