Semi-relaxed plan heuristics
The currently dominant approach to domain-independent planning is planning as heuristic search, with most successful planning heuristics being based on solutions to delete-relaxed versions of planning problems, in which the negative effects of actions are ignored. We introduce a principled, flexible, and practical technique for augmenting delete-relaxed tasks with a limited amount of delete information, by introducing special fluents that explicitly represent conjunctions of fluents in the...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the National Conference on Artificial Intelligence|
|01_Keyder_Semi-relaxed_plan_he_2012.pdf||315.34 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.