A globally optimal algorithm for TTD-MDPs

In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distribution of trajectories through a state space—as a general agent-coordination framework. We present several advances to previous work on TTD-MDPs. We improve on the existing algorithm for solving TTD-MDPs by deriving a greedy algorithm that finds a policy that provably minimizes the global KL-divergence from the target distribution. We test the new algorithm by applying TTD-MDPs to drama management, where a system must coordinate the behavior of many agents to ensure that a game follows a coherent storyline, is in keeping with the author’s desires, and offers a high degree of replayability. Although we show that suboptimal greedy strategies will fail in some cases, we validate previous work that suggests that they can work well in practice. We also show that our new algorithm provides guaranteed accuracy e...

• Type: Conference
• Year: 2007
• Where: ATAL
• Authors: Sooraj Bhat, David L. Roberts, Mark J. Nelson, Charles L. Isbell, Michael Mateas
• Keywords: ATAL 2007, Markov Decision, Suboptimal Greedy Strategies, Trajectory Distribution Markov