LAO*, RLAO*, or BLAO*?

Peng Dai, Judy Goldsmith

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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.

Original languageEnglish
Title of host publicationHeuristic Search, Memory-Based Heuristics and their Applications - Papers from the AAAI Workshop, Technical Report
Number of pages6
StatePublished - 2006
Event2006 AAAI Workshop - Boston, MA, United States
Duration: Jul 16 2006Jul 20 2006

Publication series

NameAAAI Workshop - Technical Report


Conference2006 AAAI Workshop
Country/TerritoryUnited States
CityBoston, MA

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'LAO*, RLAO*, or BLAO*?'. Together they form a unique fingerprint.

Cite this