AIPS
2010
13 years 10 months ago
2010
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
AIPS
2010
13 years 10 months ago
2010
The problem of effectively combining multiple heuristic estimators has been studied extensively in the context of optimal planning, but not in the context of satisficing planning....
AIPS
2010
13 years 10 months ago
2010
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
AIPS
2010
13 years 10 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
AIPS
2010
13 years 10 months ago
2010
We present a hierarchical planning system and its application to robotic manipulation. The novel features of the system are: 1) it finds high-quality kinematic solutions to task-l...
AIPS
2010
13 years 10 months ago
2010
We present Shopper, a plan execution engine that facilitates experimental evaluation of plans and makes it easier for planning researchers to incorporate replanning. Shopper inter...
AIPS
2010
13 years 10 months ago
2010
Recently, `determinization in hindsight' has enjoyed surprising success in on-line probabilistic planning. This technique evaluates the actions available in the current state...
AIPS
2010
13 years 10 months ago
2010
AIPS
2010
13 years 10 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
1
posts
with
486
views
486
views
Homepage