Execution of Temporal Plans with Uncertainty
Paul H. Morris, Nicola Muscettola · 2000
Simple Temporal Networks (STNs) have proved useful in ap-plications that involve metric time. However, many applica-tions involve events whose timing is uncertain in the sense that it is not controlled by the execution agent. In this paper we consider execution algorithms for temporal networks that include events of uncertain timing. We present two such al-gorithms. The first retains maximum flexibility, but requires potentially costly updates during execution. The second sur-renders some flexibility in order to obtain a fast execution comparable to that available for ordinary STNs.