Advertisement

A Structural Characterization of Temporal Dynamic Controllability

  • Paul Morris
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4204)

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.

Keywords

Distance Graph Dynamic Strategy Negative Cycle Execution Strategy Case Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)MATHCrossRefGoogle Scholar
  2. 2.
    Vidal, T., Fargier, H.: Handling contingency in temporal constraint networks: from consistency to controllabilities. JETAI 11, 23–45 (1999)MATHCrossRefGoogle Scholar
  3. 3.
    Morris, P., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: Proc. of IJCAI 2001 (2001)Google Scholar
  4. 4.
    Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT press, Cambridge (1990)MATHGoogle Scholar
  5. 5.
    Morris, P., Muscettola, N.: Dynamic controllability revisited. In: Proc. of AAAI 2005 (2005)Google Scholar
  6. 6.
    Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Paul Morris
    • 1
  1. 1.NASA Ames Research CenterMoffett FieldU.S.A.

Personalised recommendations