Sciweavers

1146 search results - page 31 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
AIPS
2006
13 years 9 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith
JAIR
2006
110views more  JAIR 2006»
13 years 7 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
AIPS
2007
13 years 10 months ago
Transformational Planning for Everyday Activity
We propose an approach to transformational planning and learning of everyday activity. This approach is targeted at autonomous robots that are to perform complex activities such a...
Armin Müller, Alexandra Kirsch, Michael Beetz
AIPS
2007
13 years 10 months ago
Structural Patterns of Tractable Sequentially-Optimal Planning
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 ...
Michael Katz, Carmel Domshlak
JAIR
2007
127views more  JAIR 2007»
13 years 7 months ago
Learning Symbolic Models of Stochastic Domains
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a a new probabilistic planning rule representation to compactly ...
Hanna M. Pasula, Luke S. Zettlemoyer, Leslie Pack ...