State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning

IJCAI, pp. 3161-3169, 2016.

Cited by: 10|Bibtex|Views7
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com

Abstract:

Abstraction heuristics are a popular method to guide optimal search algorithms in classical planning. Cost partitionings allow to sum heuristic estimates admissibly by distributing action costs among the heuristics. We introduce state-dependent cost partitionings which take context information of actions into account, and show that an opt...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments