84 search results - page 5 / 17 » Exploiting State Constraints in Heuristic State-Space Planni... |
24
Voted
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
AIPS
2008
13 years 9 months ago
2008
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
AIPS
2006
13 years 9 months ago
2006
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...
AIPS
2000
13 years 8 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...