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...
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...
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ó...
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...
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...