Solving Time-Dependent Planning Problems
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Planning, Scheduling, Reasoning About Actions. Pages 979-983.
Abstract
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance . In [Dean and Boddy, 1988], we define a framework 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 . The fact that we construct a solution to the proposed problem without appealing to luck or extraordinary inspiration provides evidence that expectation-driven iterative refinement is an appropriate framework for solving time-dependent planning problems.
@inproceedings{ijcai1989p157,
title = {Solving Time-Dependent Planning Problems},
author = {Boddy, Mark S. and Dean, Thomas L.},
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 = {979--983},
year = {1989},
month = {8},
note = {Planning, Scheduling, Reasoning About Actions},
url = {https://ijcai.org/proceedings/1989/157},
}
TY - CPAPER TI - Solving Time-Dependent Planning Problems AU - Boddy, Mark S. AU - Dean, Thomas L. T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 979 EP - 983 UR - https://ijcai.org/proceedings/1989/157 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
