Narrative planning: compilations to classical planning

From MaRDI portal



Abstract: A model of story generation recently proposed by Riedl and Young casts it as planning, with the additional condition that story characters behave intentionally. This means that characters have perceivable motivation for the actions they take. I show that this condition can be compiled away (in more ways than one) to produce a classical planning problem that can be solved by an off-the-shelf classical planner, more efficiently than by Riedl and Youngs specialised planner.


Planning the event structure of a story and synthesizing actions for the acting characters is a capability required by many computer programs that need to flexibly interact with humans, e.g. games or tutoring programs. The author shows that this so-called narrative planning proplem can be formulated as a classical problem, in which actions have deterministic effects and the planning system has complete information about the world. In contrast to previous results where it has been claimed that narrative planning requires specific planning algorithms that take into account the intentions of the actions, the author shows how these intentions can be ``compiled-away such that the narrative planning problem can be solved using existing state-of-the-art classical planners.











This page was built for publication: Narrative planning: compilations to classical planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2905387)