Minimizing Response Times in Real Time Planning and Search
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Real-time and High Performance. Pages 238-241.
Abstract
Real time artificial intelligence (AI) systems are required to respond within a given deadline, or have optimal response times. While some researchers have addressed the issue of planning under deadline constraints, there has been very little research towards optimizing the response time of problem-solving methods. The costs for a response consists of the cost to plan for a solution and the cost of executing the chosen solution. There is an intimate trade-off between these two costs. This paper presents an algorithm for providing near optimal response times by formalizing the trade-offs between planning and execution costs. We provide a proof of correctness and describe an implementation of the algorithm in a real time application of query planning. We also provide a model for considering response times in the context of the A • heuristic search algorithm.
@inproceedings{ijcai1989p38,
title = {Minimizing Response Times in Real Time Planning and Search},
author = {Shekhar, Shashi and Dutta, Soumitra},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {238--241},
year = {1989},
month = {8},
note = {Real-time and High Performance},
url = {https://ijcai.org/proceedings/1989/38},
}
TY - CPAPER TI - Minimizing Response Times in Real Time Planning and Search AU - Shekhar, Shashi AU - Dutta, Soumitra T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 238 EP - 241 UR - https://ijcai.org/proceedings/1989/38 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
