Sciweavers

169 search results - page 16 / 34
» Tractability of Planning with Loops
Sort
View
WCRE
1997
IEEE
13 years 11 months ago
Program Plan Recognition for Year 2000 Tools
There are many commercial tools that address various aspects of the Year 2000 problem. None of these tools, however, addresses the closely-related leap-year problem. In this paper...
Arie van Deursen, Steven Woods, Alex Quilici
IAT
2009
IEEE
13 years 10 months ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser
EOR
2007
101views more  EOR 2007»
13 years 6 months ago
Using aggregation to optimize long-term production planning at an underground mine
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
Alexandra M. Newman, Mark Kuchta
AAAI
2010
13 years 8 months ago
Integrating Sample-Based Planning and Model-Based Reinforcement Learning
Recent advancements in model-based reinforcement learning have shown that the dynamics of many structured domains (e.g. DBNs) can be learned with tractable sample complexity, desp...
Thomas J. Walsh, Sergiu Goschin, Michael L. Littma...
ECAI
2010
Springer
13 years 7 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...