Abstract
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and uncertainty can be defined. We show how three classical notions of controllability (strong, weak and dynamic), which have been developed for uncertain temporal problems, can be generalised to handle also preferences. We then propose algorithms that check the presence of these properties and we prove that, in general, dealing simultaneously with preferences and uncertainty does not increase the complexity beyond that of the separate cases. In particular, we develop a dynamic execution algorithm, of polynomial complexity, that produces plans under uncertainty that are optimal w.r.t. preference.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint solving and optimization. Journal of the ACM 44(2), 201–236 (1997)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Fargier, H., Lang, J., Schiex, T.: Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge. In: AAAI 1996, pp. 175–180 (1996)
Frank, J., Jonsson, A., Morris, R., Smith, D.: Planning and scheduling for fleets of earth observing satelliets. In: Proc. of 6th i-SAIRAS (2001)
Khatib, L., Morris, P., Morris, R.A., Rossi, F.: Temporal constraint reasoning with preferences. In: IJCAI 2001, pp. 322–327 (2001)
Kupferman, O., Madhusudan, P., Thiagarajan, P.S., Vardi, M.Y.: Open systems in reactive environments: Control and synthesis. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, p. 92. Springer, Heidelberg (2000)
Layaida, N., Sabry-Ismail, L., Roisin, C.: Dealing with uncertain durations in synchronized multimedia presentations. Multimedia Tools and Applications 18(3), 213–231 (2002)
Morris, P., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: IJCAI 2001, pp. 494–502 (2001)
Rossi, F., Sperduti, A., Venable, K., Khatib, L., Morris, P., Morris, R.: Learning and solving soft temporal constraints: An experimental study. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 249–263. Springer, Heidelberg (2002)
Schwalb, E., Vila, L.: Temporal constraints: A survey. Constraints 3(2/3), 129–149 (1998)
Tsamardinos, I.: A probabilistic approach to robust execution of temporal plans with uncertainty. In: Vlahavas, I.P., Spyropoulos, C.D. (eds.) SETN 2002. LNCS (LNAI), vol. 2308, pp. 97–108. Springer, Heidelberg (2002)
Vidal, T., Fargier, H.: Handling contingency in temporal constraint networks. J. Experimental and Theoretical Artificial Intelligence 11(1), 23–45 (1999)
Vidal, T., Ghallab, M.: Dealing with uncertain durations in temporal constraint networks dedicated to planning. In: ECAI 1996, pp. 48–52 (1996)
Vila, L., Godo, L.: On fuzzy temporal constraint networks. Mathware and Soft Computing 1(3), 315–334 (1994)
Yorke-Smith, N., Venable, K.B., Rossi, F.: Temporal reasoning with preferences and uncertainty. In: Poster paper in IJCAI 2003, pp. 1385–1386 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rossi, F., Venable, K.B., Yorke-Smith, N. (2004). Controllability of Soft Temporal Constraint Problems. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive