520 search results - page 2 / 104 » New Complexity Results for Classical Planning Benchmarks |
AIPS
2000
13 years 6 months ago
2000
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...
AAAI
2012
11 years 7 months ago
2012
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
AIPS
2007
13 years 7 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
JAIR
2008
13 years 5 months ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
DAGSTUHL
2007
13 years 7 months ago
2007
BiCEP is a new project being started at the University of Coimbra to benchmark Complex Event Processing systems (CEP). Although BiCEP is still in the early stages, we list here som...