Sciweavers

32 search results - page 1 / 7
» Automatic generation of temporal planning domains for e-lear...
Sort
View
SCHEDULING
2010
72views more  SCHEDULING 2010»
14 years 7 months ago
Automatic generation of temporal planning domains for e-learning problems
Luis A. Castillo, Lluvia Morales, Arturo Gonz&aacu...
IJCAI
2001
14 years 10 months ago
Planning as Model Checking for Extended Goals in Non-deterministic Domains
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
Marco Pistore, Paolo Traverso
AIPS
2006
14 years 10 months ago
Safe LTL Assumption-Based Planning
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
Alexandre Albore, Piergiorgio Bertoli
IJCAI
2007
14 years 10 months ago
A Heuristic Search Approach to Planning with Temporally Extended Preferences
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlrait...
83
Voted
AIPS
2010
14 years 9 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger