638 search results - page 13 / 128 » A New Approach to Tractable Planning |
IJCAI
2003
13 years 8 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
AIPS
2006
13 years 9 months ago
2006
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
WCRE
1997
IEEE
13 years 11 months ago
1997
IEEE
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...
AAAI
2010
13 years 9 months ago
2010
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...
AIPS
2003
13 years 9 months ago
2003
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...