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...
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
Raquel Fuentetaja, Daniel Borrajo, Carlos Linares ...
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especi...