Improving delete relaxation heuristics through explicitly represented conjunctions
Keyder, Emil; Hoffmann, Jorg; Haslum, Patrik
Description
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 |
---|---|
Date published: | 2014 |
Type: | Journal article |
URI: | http://hdl.handle.net/1885/75484 |
Source: | Journal of Artificial Intelligence Research |
Access Rights: | Open Access |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
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.
Updated: 19 May 2020/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator