Abstract
An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynamically Controllable, i.e., whether the temporal requirements are feasible in the light of uncertain durations of some processes. Previous work has presented an O(N 5) algorithm for testing this property. Here, we introduce a new analysis of temporal cycles that leads to an O(N 4) algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Muscettola, N., Nayak, P., Pell, B., Williams, B.: Remote agent: to boldly go where no AI system has gone before. Artificial Intelligence 103(1-2), 5–48 (1998)
Vidal, T., Fargier, H.: Handling contingency in temporal constraint networks: from consistency to controllabilities. JETAI 11, 23–45 (1999)
Morris, P., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: Proc. of IJCAI 2001 (2001)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT press, Cambridge (1990)
Morris, P., Muscettola, N.: Dynamic controllability revisited. In: Proc. of AAAI 2005 (2005)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Vidal, T.: Controllability characterization and checking in contingent temporal constraint networks. In: Proc. of Seventh Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000) (2000)
Tsamardinos, I., Muscettola, N., Morris, P.: Fast transformation of temporal plans for efficient execution. In: Proc. of Fifteenth Nat. Conf. on Artificial Intelligence (AAAI 1998) (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morris, P. (2006). A Structural Characterization of Temporal Dynamic Controllability. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_28
Download citation
DOI: https://doi.org/10.1007/11889205_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)