Abstract
Domain independent planning engines accept a planning task description in a language such as PDDL and return a solution plan. Performance of planning engines can be improved by gathering additional knowledge about a class of planning tasks. In this paper we present Outer Entanglements, relations between planning operators and predicates, that are used to restrict the number of operator instances. Outer Entanglements can be encoded within a planning task description, effectively reformulating it. We provide an in depth analysis and evaluation of outer entanglements illustrating the effectiveness of using them as generic heuristics for improving the efficiency of planning engines.
Original language | English |
---|---|
Pages (from-to) | 831-856 |
Number of pages | 26 |
Journal | Journal of Experimental and Theoretical Artificial Intelligence |
Volume | 30 |
Issue number | 6 |
Early online date | 23 Aug 2018 |
DOIs | |
Publication status | Published - 2018 |