Cost Sensitive Reachability Heuristics for Handling State Uncertainty
Abstract
While POMDPs provide a general platform for non-deterministic conditional planning under a variety of quality metrics they have limited scalability. On the other hand, non-deterministic conditional planners scale very well, but many lack the ability to optimize plan quality metrics. We present a novel generalization of planning graph based heuristics that helps conditional planners both scale and generate high quality plans when using actions with non-uniform costs. We make empirical comparisons with two state of the art planners to show the benefit of our techniques.
Cite
Text
Bryce and Kambhampati. "Cost Sensitive Reachability Heuristics for Handling State Uncertainty." Conference on Uncertainty in Artificial Intelligence, 2005.Markdown
[Bryce and Kambhampati. "Cost Sensitive Reachability Heuristics for Handling State Uncertainty." Conference on Uncertainty in Artificial Intelligence, 2005.](https://mlanthology.org/uai/2005/bryce2005uai-cost/)BibTeX
@inproceedings{bryce2005uai-cost,
title = {{Cost Sensitive Reachability Heuristics for Handling State Uncertainty}},
author = {Bryce, Daniel and Kambhampati, Subbarao},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2005},
pages = {60-68},
url = {https://mlanthology.org/uai/2005/bryce2005uai-cost/}
}