Bounded suboptimal search: a direct approach using inadmissible estimates

IJCAI, pp.674-679, (2011)

Cited by: 69|Views6
EI

Abstract:

Bounded suboptimal search algorithms offer shorter solving times by sacrificing optimality and instead guaranteeing solution costs within a desired factor of optimal. Typically these algorithms use a single admissible heuristic both for guiding search and bounding solution cost. In this paper, we present a new approach to bounded suboptim...More

Code:

Data:

ZH
Your rating :
0

 

Tags
Comments