Issue No. 03 - May/June (2006 vol. 26)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCG.2006.55
Mark J. Nelson , Georgia Institute of Technology
Michael Mateas , Georgia Institute of Technology
David L. Roberts , Georgia Institute of Technology
Charles L. Isbell Jr. , Georgia Institute of Technology
A drama manager guides a player through a story experience by modifying the experience in reaction to the player's actions. Declarative optimization-based drama management (DODM) casts the drama-management problem as an optimization problem: the author declaratively specifies a set of plot points in a story, a set of actions the drama manager can take, and an evaluation function that rates a particular story. The drama manager then takes the actions in a way that attempts to maximize story quality. Peter Weyhrauch reported good results using a variant of game-tree search to optimize the use of drama-manager actions. The authors attempt to replicate these results on another story, Anchorhead, and show that search does not perform well in general, especially on larger and more complex stories. However, they believe that this is a problem with the specific optimization method, not the general approach, and report some results demonstrating the plausibility of applying reinforcement-learning techniques to compute a policy instead of search.
interactive drama, computer gaming, drama management, game-tree search, reinforcement learning
M. J. Nelson, M. Mateas, C. L. Isbell Jr. and D. L. Roberts, "Declarative Optimization-Based Drama Management in Interactive Fiction," in IEEE Computer Graphics and Applications, vol. 26, no. , pp. 32-41, 2006.