The authors introduce lazy versions of RTDP-Bel and LAO* that defer expensive belief transition computations in POMDP planning, achieving large speedups in robotics domains at small cost increases.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions
The authors introduce lazy versions of RTDP-Bel and LAO* that defer expensive belief transition computations in POMDP planning, achieving large speedups in robotics domains at small cost increases.