Heuristic Search under Quality and Time Bounds
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 2854-2854.
Abstract
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, quality or ones which bound the time used directly. In my dissertation, I present and analyze algorithms for the following settings: quality bounded heuristic search and time bounded heuristic search. The central theme of my doctoral work will be that taking advantage of additional information can improve the performance of heuristic search algorithms.
@inproceedings{ijcai2011p499,
title = {Heuristic Search under Quality and Time Bounds},
author = {Thayer, Jordan Tyler},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {2854--2854},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-499},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-499},
}
TY - CPAPER TI - Heuristic Search under Quality and Time Bounds AU - Thayer, Jordan Tyler T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 2854 EP - 2854 DO - 10.5591/978-1-57735-516-8/IJCAI11-499 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-499 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
