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 - although still relaxed - aim at respecting much of the...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling|
|01_Baier_Improving_Planning_Performance_2009.pdf||147.35 kB||Adobe PDF||Request a copy|
|02_Baier_Improving_Planning_Performance_2009.pdf||51.79 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.