Improving Planning Performance Using Low-Conflict Relaxed Plans

The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisficing planning and is used by many state-of-the-art heuristic-search planners. However, it may sometimes provide quite inaccurate information, since its relaxation strategy, which ignores the delete effects of actions, may oversimplify a problem's structure. In this paper, we propose a novel algorithm for computing relaxed plans which

• Type: Conference
• Year: 2009
• Where: AIPS
• Authors: Jorge A. Baier, Adi Botea
• Keywords: AIPS 2009, Artificial Intelligence, FF Relaxed Plan, Relaxed Plans, State-of-the-art Heuristic-search Planners