@inproceedings {icaps16-78,
    track    = {​Main Track},
    title    = {Heuristic Guidance for Forward-Chaining Planning with Numeric Uncertainty},
    url      = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13186},
    author   = {Liana E. Marinescu and  Andrew Coles},
    abstract = {Uncertainty hinders many interesting applications of planning -- it may come in the form of sensor noise, unpredictable environments, or known limitations in problem models. In this paper we explore heuristic guidance for forward-chaining planning with continuous random variables, while ensuring a probability of plan success. We extend the Metric Relaxed Planning Graph heuristic to capture a model of uncertainty, providing better guidance in terms of heuristic estimates and dead-end detection. By tracking the accumulated error on numeric values, our heuristic is able to check if preconditions in the planning graph are achievable with a sufficient degree of confidence; it is also able to consider acting to reduce the accumulated error. Results indicate that our approach offers improvements in performance compared to prior work where a less-informed relaxation was used.},
    keywords = {Classical planning,Probabilistic planning; MDPs and POMDPs,Planning under (non-probabilistic) uncertainty}
}

{"_id":"SuE4Du7NjNFFKctKM","bibbaseid":"marinescu-coles-heuristicguidanceforforwardchainingplanningwithnumericuncertainty","downloads":0,"creationDate":"2016-03-09T03:08:50.184Z","title":"Heuristic Guidance for Forward-Chaining Planning with Numeric Uncertainty","author_short":["Marinescu, L. E.","Coles, A."],"year":null,"bibtype":"inproceedings","biburl":"icaps16.icaps-conference.org/papers.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","track":"​Main Track","title":"Heuristic Guidance for Forward-Chaining Planning with Numeric Uncertainty","url":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13186","author":[{"firstnames":["Liana","E."],"propositions":[],"lastnames":["Marinescu"],"suffixes":[]},{"firstnames":["Andrew"],"propositions":[],"lastnames":["Coles"],"suffixes":[]}],"abstract":"Uncertainty hinders many interesting applications of planning – it may come in the form of sensor noise, unpredictable environments, or known limitations in problem models. In this paper we explore heuristic guidance for forward-chaining planning with continuous random variables, while ensuring a probability of plan success. We extend the Metric Relaxed Planning Graph heuristic to capture a model of uncertainty, providing better guidance in terms of heuristic estimates and dead-end detection. By tracking the accumulated error on numeric values, our heuristic is able to check if preconditions in the planning graph are achievable with a sufficient degree of confidence; it is also able to consider acting to reduce the accumulated error. Results indicate that our approach offers improvements in performance compared to prior work where a less-informed relaxation was used.","keywords":"Classical planning,Probabilistic planning; MDPs and POMDPs,Planning under (non-probabilistic) uncertainty","bibtex":"@inproceedings {icaps16-78,\r\n track = {​Main Track},\r\n title = {Heuristic Guidance for Forward-Chaining Planning with Numeric Uncertainty},\r\n url = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13186},\r\n author = {Liana E. Marinescu and Andrew Coles},\r\n abstract = {Uncertainty hinders many interesting applications of planning -- it may come in the form of sensor noise, unpredictable environments, or known limitations in problem models. In this paper we explore heuristic guidance for forward-chaining planning with continuous random variables, while ensuring a probability of plan success. We extend the Metric Relaxed Planning Graph heuristic to capture a model of uncertainty, providing better guidance in terms of heuristic estimates and dead-end detection. By tracking the accumulated error on numeric values, our heuristic is able to check if preconditions in the planning graph are achievable with a sufficient degree of confidence; it is also able to consider acting to reduce the accumulated error. Results indicate that our approach offers improvements in performance compared to prior work where a less-informed relaxation was used.},\r\n keywords = {Classical planning,Probabilistic planning; MDPs and POMDPs,Planning under (non-probabilistic) uncertainty}\r\n}\r\n\r\n","author_short":["Marinescu, L. E.","Coles, A."],"key":"icaps16-78","id":"icaps16-78","bibbaseid":"marinescu-coles-heuristicguidanceforforwardchainingplanningwithnumericuncertainty","role":"author","urls":{"Paper":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13186"},"keyword":["Classical planning","Probabilistic planning; MDPs and POMDPs","Planning under (non-probabilistic) uncertainty"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["heuristic","guidance","forward","chaining","planning","numeric","uncertainty","marinescu","coles"],"keywords":["classical planning","probabilistic planning; mdps and pomdps","planning under (non-probabilistic) uncertainty"],"authorIDs":[],"dataSources":["iMkx859KiXcegwsin","EZtZjCTnxcdTTyeij"]}