-
Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width
Conformant planning is the problem of finding a sequence of actions for ...
01/15/2014 ∙ by Hector Palacios, et al. ∙
0
∙
share
read it
-
Let CONAN tell you a story: Procedural quest generation
This work proposes an engine for the Creation Of Novel Adventure Narrati...
08/19/2018 ∙ by Vincent Breault, et al. ∙
0
∙
share
read it
-
Solving Multiagent Planning Problems with Concurrent Conditional Effects
In this work we present a novel approach to solving concurrent multiagen...
06/19/2019 ∙ by Daniel Furelos-Blanco, et al. ∙
0
∙
share
read it
-
Replanning in Domains with Partial Information and Sensing Actions
Replanning via determinization is a recent, popular approach for online ...
01/23/2014 ∙ by Ronen I. Brafman, et al. ∙
0
∙
share
read it
-
Flexible FOND Planning with Explicit Fairness Assumptions
We consider the problem of reaching a propositional goal condition in fu...
03/15/2021 ∙ by Ivan D. Rodriguez, et al. ∙
0
∙
share
read it
-
Generating Sentence Planning Variations for Story Telling
There has been a recent explosion in applications for dialogue interacti...
08/29/2017 ∙ by Stephanie M. Lukin, et al. ∙
0
∙
share
read it
-
Narrative Planning: Balancing Plot and Character
Narrative, and in particular storytelling, is an important part of the h...
01/16/2014 ∙ by Mark Owen Riedl, et al. ∙
0
∙
share
read it
Narrative Planning: Compilations to Classical Planning
01/23/2014 ∙ by Patrik Haslum, et al. ∙
0
∙
share
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.
READ FULL TEXT
Comments
There are no comments yet.