Sciweavers

1912 search results - page 44 / 383
» GOAL as a Planning Formalism
Sort
View
ICML
2005
IEEE
16 years 20 days ago
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
H. Brendan McMahan, Maxim Likhachev, Geoffrey J. G...
AIED
2009
Springer
15 years 6 months ago
Toward Scenario Adaptation for Learning
Abstract. This paper presents a methodology for automatically customizing a scenario to suit a learner’s abilities, needs, or goals. Training scenarios are often utilized to give...
James Niehaus, Mark Riedl
CSL
2003
Springer
15 years 5 months ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
ECP
1999
Springer
190views Robotics» more  ECP 1999»
15 years 4 months ago
Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
Avrim Blum, John Langford
AIPS
2006
15 years 1 months ago
Concurrent Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
Iain Little, Sylvie Thiébaux