Correlation Complexity of Classical Planning Domains

IJCAI, pp. 3242-3250, 2016.

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

Abstract:

We analyze how complex a heuristic function must be to directly guide a state-space search algorithm towards the goal. As a case study, we examine functions that evaluate states with a weighted sum of state features. We measure the complexity of a domain by the complexity of the required features. We analyze conditions under which the sea...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments