Sciweavers

703 search results - page 2 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
FLAIRS
2007
13 years 7 months ago
Case-Based Recommendation of Node Ordering in Planning
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
Tomás de la Rosa, Angel García Olaya...
FUIN
2010
102views more  FUIN 2010»
13 years 2 months ago
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
Alfonso Gerevini, Ivan Serina
ICCBR
2009
Springer
13 years 11 months ago
Improving Reinforcement Learning by Using Case Based Heuristics
This work presents a new approach that allows the use of cases in a case base as heuristics to speed up Reinforcement Learning algorithms, combining Case Based Reasoning (CBR) and ...
Reinaldo A. C. Bianchi, Raquel Ros, Ramon Ló...
IJCAI
1997
13 years 6 months ago
Scaling the Dynamic Approach to Autonomous Path Planning: Planning Horizon Dynamics
In the dynamical systems approach to robot path planning both sensed and remembered information contribute to shape a nonlinear vector eld that governs the behavior of an autonomo...
Edward W. Large, Henrik I. Christensen, Ruzena Baj...
AI
2011
Springer
12 years 11 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...