Sciweavers

196 search results - page 16 / 40
» Incremental Markov-Model Planning
Sort
View
AAAI
2007
13 years 9 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre
ECAI
2008
Springer
13 years 9 months ago
Learning in Planning with Temporally Extended Goals and Uncontrollable Events
Recent contributions to advancing planning from the classical model to more realistic problems include using temporal logic such as LTL to express desired properties of a solution ...
André A. Ciré, Adi Botea
ICML
2006
IEEE
14 years 8 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
FLAIRS
2003
13 years 8 months ago
Alternate Strategies for Retrieval in State-Spaces
In our previous research, we investigated the properties of case-based plan recognition with incomplete plan libraries. Incremental construction of plan libraries along with retri...
Boris Kerkez, Michael T. Cox
ICTAI
1994
IEEE
13 years 11 months ago
Iterative Strengthening: An Algorithm for Generating Anytime Optimal Plans
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
Randall J. Calistri-Yeh