The Robotics Institute

Carnegie Mellon Robotics Institute

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensitive agents into equivalent ones for risk-neutral agents provided that exponential utility functions are used. The transformed planning problems can then be solved with these existing AI planning methods. To demonstrate our ideas, we use a probabilistic planning framework ("probabilistic decision graphs") that can easily be mapped into Markov decision problems. It allows one to describe probabilistic effects of actions, actions with different costs (resource consumption), and goal states with different rewards. We show the use of probabilistic decision graphs for finding optimal plans for risk-sensitive agents in a stochastic blocks-world domain.

Notes

Text Reference

Sven Koenig and Reid Simmons, "Risk-Sensitive Planning with Probabilistic Decision Graphs," Proceedings of the Fourth International Conference on Principles of Knowledge Representationand Reasoning (KR), 1994, pp. 363 - 373.

BibTeX Reference

@inproceedings{Koenig_1994_3002,
   author = "Sven Koenig and Reid Simmons",
   title = "Risk-Sensitive Planning with Probabilistic Decision Graphs",
   booktitle = "Proceedings of the Fourth International Conference on Principles of Knowledge Representationand Reasoning (KR)",
   pages = "363 - 373",
   year = "1994",
}

The Robotics Institute

Menu