Risk-Sensitive Planning with Probabilistic Decision Graphs

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 e ects of actions, actions with di erent costs resource consumption, and goal states with di erent rewards. We show the use of probabilistic decision graphs for nding optimal plans for risk-sensitive agents in a stochastic blocksworld domain.

• Type: Conference
• Year: 1994
• Where: KR
• Authors: Sven Koenig, Reid G. Simmons
• Keywords: AI Planning Methods, Automated Reasoning, KR 1994, Planning Problems, Probabilistic Decision Graphs