Temporal Planning with Continuous Change
Abstract
We present zeno, a least commitment planner that handles actions occurring over extended intervals of time. Deadline goals, metric preconditions, metric effects, and continuous change are supported. Simultaneous actions are allowed when their effects do not interfere. Unlike most planners that deal with complex languages, the zeno planning algorithm is sound and complete. The running code is a complete implementation of the formal algorithm, capable of solving simple problems (i.e., those involving less than a dozen steps). Introduction We have built a least commitment planner, zeno, that handles actions occuring over extended intervals of time and whose preconditions and effects can be temporally quantified. These capabilities enable zeno to reason about deadline goals, piecewise-linear continuous change, external events and to a limited extent, simultaneous actions. While other planners exist with some of these features, zeno is different because it is both sound and complete. As a...
Cite
Text
Penberthy and Weld. "Temporal Planning with Continuous Change." AAAI Conference on Artificial Intelligence, 1994.Markdown
[Penberthy and Weld. "Temporal Planning with Continuous Change." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/penberthy1994aaai-temporal/)BibTeX
@inproceedings{penberthy1994aaai-temporal,
title = {{Temporal Planning with Continuous Change}},
author = {Penberthy, J. Scott and Weld, Daniel S.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1994},
pages = {1010-1015},
url = {https://mlanthology.org/aaai/1994/penberthy1994aaai-temporal/}
}