Sciweavers

213 search results - page 12 / 43
» Heuristics for Planning with Action Costs
Sort
View
AAAI
2008
14 years 12 months ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
AIPS
2000
14 years 11 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
69
Voted
CDC
2009
IEEE
162views Control Systems» more  CDC 2009»
15 years 2 months ago
Distributed optimal planning: an approach by weighted automata calculus
— We consider a distributed system modeled as a possibly large network of automata. Planning in this system consists in selecting and organizing actions in order to reach a goal ...
Eric Fabre, Loig Jezequel
IAT
2010
IEEE
14 years 7 months ago
Intention Recognition with Event Calculus Graphs
Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detec...
Fariba Sadri
JAIR
2006
179views more  JAIR 2006»
14 years 9 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert