Improving delete relaxation heuristics through explicitly represented conjunctions
Heuristic functions based on the delete relaxation compute upper and lower bounds on the optimal delete-relaxation heuristic h+, and are of paramount importance in both optimal and satisficing planning. Here we introduce a principled and flexible technique for improving h+, by augmenting delete-relaxed planning tasks with a limited amount of delete information. This is done by introducing special fluents that explicitly represent conjunctions of fluents in the original planning task, rendering...[Show more]
|Collections||ANU Research Publications|
|Source:||Journal of Artificial Intelligence Research|
|Access Rights:||Open Access|
|01_Keyder_Improving_delete_relaxation_2014.pdf||782.06 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.