Sciweavers

703 search results - page 13 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
AAAI
2008
13 years 10 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
13 years 6 months ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake
ATAL
2010
Springer
13 years 8 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
AIPS
2006
13 years 9 months ago
Durative Planning in HTNs
This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that canno...
Robert P. Goldman
AI
2000
Springer
13 years 7 months ago
Using temporal logics to express search control knowledge for planning
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
Fahiem Bacchus, Froduald Kabanza