Iterative bounding LAO^*

DOI10.3233/978-1-60750-606-5-341MaRDI QIDQ2999156zbMATH OpenOpenAlexFDO

Authors Håkan Warnquist, Jonas Kvarnström, Patrick Doherty

Publication date 11 May 2011

Full work available at URL https://aaaipress.org/Papers/AIPS/2002/AIPS02-011.pdf

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• LAO*: A heuristic search algorithm that finds solutions with loops
• scientific article; zbMATH DE number 2243416
• scientific article; zbMATH DE number 2086969
• Probably bounded suboptimal heuristic search
• Probabilistic planning via heuristic forward search and weighted model counting

Cited in

(3)

• Probably bounded suboptimal heuristic search
• LAO*: A heuristic search algorithm that finds solutions with loops
• Efficient constraint generation for stochastic shortest path problems

This page was built for publication: Iterative bounding \(\text{LAO}^*\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999156)