Solving Time-Dependent Planning Problems
Abstract
We are interested in constructing solutions to time-dependent planning problems: problems in which time spent planning affects the utility of the system''s performance. In a previous paper, we define a fraomework for constructing solutions to time-dependent planning problems called expectation-driven iterative refinement. In this paper, we analyze and solve a moderately complex time-dependent planning problem involving path planning for a mobile robot, as a way of exploring a methodology for applying expectation-driven iterative refinement.
Cite
Text
Boddy and Dean. "Solving Time-Dependent Planning Problems." International Joint Conference on Artificial Intelligence, 1989.Markdown
[Boddy and Dean. "Solving Time-Dependent Planning Problems." International Joint Conference on Artificial Intelligence, 1989.](https://mlanthology.org/ijcai/1989/boddy1989ijcai-solving/)BibTeX
@inproceedings{boddy1989ijcai-solving,
title = {{Solving Time-Dependent Planning Problems}},
author = {Boddy, Mark S. and Dean, Thomas L.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1989},
pages = {979-984},
url = {https://mlanthology.org/ijcai/1989/boddy1989ijcai-solving/}
}