Heuristic search under quality and time bounds
IJCAI, pp. 2854-2855, 2011.
Heuristic search is a central component of many important applications in AI including automated planning. While we can find optimal solutions to heuristic search problems, doing so may take hours or days. For practical applications, this is unacceptably slow, and we must rely on algorithms which find solutions of high, but not optimal, q...More
PPT (Upload PPT)