179 search results - page 30 / 36 » Using Classical Planners to Solve Nondeterministic Planning ... |
137
click to vote
IJCAI
1989
15 years 3 months ago
1989
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par tially ordered plan is an operator precondition that is not yet achieved; operators,...
109
click to vote
AUSAI
2004
Springer
15 years 7 months ago
2004
Springer
The Belief-Desire-Intention (BDI) model of agency is an architecture based on Bratman’s theory of practical reasoning. Hierarchical Task Network (HTN) decomposition on the other ...
141
Voted
JAIR
2006
15 years 1 months ago
2006
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
109
click to vote
ICIDS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. AI planning has featured in a number of Interactive Storytelling prototypes: since narratives can be naturally modelled as a sequence of actions it has been possible to e...
124
click to vote
ICTAI
2000
IEEE
15 years 5 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...