An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty

Carlo Combi, Luke Hunsberger, Roberto Posenato

Abstract

A Simple Temporal Network with Uncertainty (STNU) is a framework for representing and reasoning about temporal problems involving actions whose durations are bounded but uncontrollable. A dynamically controllable STNU is one for which there exists a strategy for executing its time-points that guarantees that all of the temporal constraints in the network will be satisfied no matter how the uncontrollable durations turn out. A Conditional Simple Temporal Network with Uncertainty (CSTNU) augments an STNU to include observation nodes, where the execution of each observation node provides, in real time, the truth value of an associated proposition. Recent work has generalized the notion of dynamic controllability to cover CSTNUs. This paper presents an algorithm—called a DC-checking algorithm—for determining whether arbitrary CSTNUs are dynamically controllable. The algorithm, which is proven to be sound, is the first such algorithm to be presented in the literature. The algorithm extends edge-generation/constraint-propagation rules from an existing STNU algorithm to accommodate propositional labels, while adding new rules required to deal with the observation nodes. The paper also discusses implementation issues associated with the management of propositional labels.

References

  1. Combi, C. and Posenato, R. (2010). Towards temporal controllabilities for workflow schemata. In (Markey and Wijsen, 2010), pages 129-136.
  2. Conrad, P. R. and Williams, B. C. (2011). Drake: An efficient executive for temporal plans with choice. Journal of Artificial Intelligence Research (JAIR), 42:607-659.
  3. Dechter, R., Meiri, I., and Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49(1-3):61-95.
  4. Hunsberger, L. (2009). Fixing the semantics for dynamic controllability and providing a more practical characterization of dynamic execution strategies. In Lutz, C. and Raskin, J.-F., editors, The 16th International Symposium on Temporal Representation and Reasoning (TIME-2009), pages 155-162. IEEE.
  5. Hunsberger, L. (2010). A fast incremental algorithm for managing the execution of dynamically controllable temporal networks. In (Markey and Wijsen, 2010), pages 121-128.
  6. Hunsberger, L. (2013). Magic loops in simple temporal networks with uncertainty. In Fifth International Conference on Agents and Artificial Intelligence (ICAART2013). SciTePress.
  7. Hunsberger, L., Posenato, R., and Combi, C. (2012). The Dynamic Controllability of Conditional STNs with Uncertainty. In Workshop on Planning and Plan Execution for Real-World Systems: Principles and Practices (PlanEx) @ ICAPS-2012, pages 1-8, Atibaia.
  8. Markey, N. and Wijsen, J., editors (2010). The Seventeenth International Symposium on Temporal Representation and Reasoning (TIME-2010). IEEE.
  9. Morris, P. (2006). A structural characterization of temporal dynamic controllability. In Benhamou, F., editor, Principles and Practice of Constraint Programming, volume 4204 of LNCS, pages 375-389. Springer.
  10. Morris, P. H. and Muscettola, N. (2005). Temporal dynamic controllability revisited. In Veloso, M. M. and Kambhampati, S., editors, The Twentieth National Conference on Artificial Intelligence (AAAI-05), pages 1193- 1198. AAAI Press.
  11. Morris, P. H., Muscettola, N., and Vidal, T. (2001). Dynamic control of plans with temporal uncertainty. In Nebel, B., editor, The Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), pages 494-502. Morgan Kaufmann.
  12. Tsamardinos, I., Vidal, T., and Pollack, M. E. (2003). CTP: A new constraint-based formalism for conditional, temporal planning. Constraints, 8:365-388.
Download


Paper Citation


in Harvard Style

Combi C., Hunsberger L. and Posenato R. (2013). An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8565-39-6, pages 144-156. DOI: 10.5220/0004256101440156


in Bibtex Style

@conference{icaart13,
author={Carlo Combi and Luke Hunsberger and Roberto Posenato},
title={An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2013},
pages={144-156},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004256101440156},
isbn={978-989-8565-39-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty
SN - 978-989-8565-39-6
AU - Combi C.
AU - Hunsberger L.
AU - Posenato R.
PY - 2013
SP - 144
EP - 156
DO - 10.5220/0004256101440156