We introduce a simple variation of the additive heuristic used in the HSP planner that
combines the benefits of the original additive heuristic, namely its mathematical formulation …

We introduce a non-admissible heuristic for planning with action costs, called the set-
additive heuristic, that combines the benefits of the additive heuristic used in the HSP …

This paper focuses on heuristic cost-based planning. We propose a combination of a
heuristic designed to deal with this planning model together with the usage of look-ahead …

Arvand is a stochastic planner that uses Monte Carlo random walks (MRW) planning to
balance exploration and exploitation in heuristic search. Herein, we focus on the latest …

Undersampled face recognition deals with the problem in which, for each subject to be
recognized, only one or few images are available in the gallery (training) set. Thus, it is very …

FF (ha) is the FF planner but with a different heuristic ha that is sensitive to action costs.
More precisely, the relaxed plans in FF (ha) are computed in a simple manner from the …

This short paper provides a high-level description of the planner CBP (Cost-Based Planner).
CBP performs heuristic search in the state space using several heuristics. On one hand it …

Many cost-based planning heuristics are based on partial or complete delete relaxation.
Definitions of these heuristics are of different nature, which makes it difficult to establish …

This paper describes a reactive planning model which is specifically designed to handle
OWL-S Semantic Web Service Composition problems. This model uses a planning …

Currently a standard technique to compute the heuristic in heuristic planning is to expand a
planning graph on the relaxed problem. This paper presents a new approach to expand the …