|
Volumn , Issue , 2011, Pages 1983-1990
|
Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in optimal planning
|
Author keywords
[No Author keywords available]
|
Indexed keywords
BENCHMARK DOMAINS;
BISIMULATIONS;
GENERAL APPROACH;
HEURISTIC DESIGNS;
INFORMATION LOSS;
OPTIMAL PLANNING;
POLYNOMIAL-TIME;
STATE OF THE ART;
ABSTRACTING;
ALGORITHMS;
ARTIFICIAL INTELLIGENCE;
PLANNING;
POLYNOMIAL APPROXIMATION;
FAULT TOLERANCE;
|
EID: 84863985223
PISSN: 10450823
EISSN: None
Source Type: Conference Proceeding
DOI: 10.5591/978-1-57735-516-8/IJCAI11-331 Document Type: Conference Paper |
Times cited : (49)
|
References (9)
|