Abstract
In Temporal Planning a typical assumption is that the agent controls the execution time of all events such as starting and ending actions. In real domains however, this assumption is commonly violated and certain events are beyond the direct control of the plan’s executive. Previous work on reasoning with uncontrollable events (Simple Temporal Problem with Uncertainty) assumes that we can bound the occurrence of each uncontrollable within a time interval. In principle however, there is no such bounding interval since there is always a non-zero probability the event will occur outside the bounds. Here we develop a new more general formalism called the Probabilistic Simple Temporal Problem (PSTP) following a probabilistic approach. We present a method for scheduling a PSTP maximizing the probability of correct execution. Subsequently, we use this method to solve the problem of finding an optimal execution strategy, i.e. a dynamic schedule where scheduling decisions can be made on-line.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Weld, D.S., An Introduction to Least Commitment Planning. AI Magazine, 1994. 15(4): p. 27–61.
Jonsson, A., et al. Planning in interplanetary space: theory and practice. in Artificial Intelligence Planning and Scheduling (AIPS-00). 2000.
Ghallab, M. and H.e. Laruelle, Representation and Control in IxTeT, a Temporal Planner, in Proceedings of the Second International Conference on Artificial Intelligence Planning Systems (AIPS-94). 1994. p. 61–67.
Dechter, R., I. Meiri, and J. Pearl, Temporal constraint networks. Artificial Intelligence, 1991. 49: p. 61–95.
Vidal, T. and P. Morris. Dynamic Control of Plans with Temporal Uncertainty. in IJCAI-2001 (to appear). 2001.
Chleq, N. Efficient Algorithms for Networks of Quantitative Temporal Constraints. in Constraints’95. 1995.
Vidal, T. and H. Fragier, Handling consistency in temporal constraint networks: from consistency to controllabilities. Journal of Experimental and Theoretical Artificial Intelligence, 1999. 11: p. 23–45.
Hock, W. and K. Schittowski, A comparative performance evaluation of 27 nonlinear programming codes. Computing, 1983. 30: p. 335.
White, D.J., Markov Decision Processes. 1993: John Wiley and Sons.
Zhang, N.L. Probabilistic Inference in Influence Diagrams. in Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98). 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsamardinos, I. (2002). A Probabilistic Approach to Robust Execution of Temporal Plans with Uncertainty. In: Vlahavas, I.P., Spyropoulos, C.D. (eds) Methods and Applications of Artificial Intelligence. SETN 2002. Lecture Notes in Computer Science(), vol 2308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46014-4_10
Download citation
DOI: https://doi.org/10.1007/3-540-46014-4_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43472-6
Online ISBN: 978-3-540-46014-5
eBook Packages: Springer Book Archive