Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking

Luke Hunsberger

Abstract

A Simple Temporal Network with Uncertainty (STNU) is a structure for representing and reasoning about temporal constraints and uncontrollable-but-bounded temporal intervals called contingent links. An STNU is dynamically controllable (DC) if there exists a strategy for executing its time-points that guarantees that all of the constraints will be satisfied no matter how the durations of the contingent links turn out. The fastest algorithm in the literature for checking the dynamic controllability of arbitrary STNUs is based on an analysis of the graphical structure of STNUs. This paper (1) presents a new method for analyzing the graphical structure of STNUs, (2) determines an upper bound on the complexity of certain structures---the indivisible semi-reducible negative loops; (3) presents an algorithm for generating loops---the magic loops---whose complexity attains this upper bound; and (4) shows how the upper bound can be exploited to speed up the process of DC-checking for certain networks. Theoretically, the paper deepens our understanding of the structure of STNU graphs. Practically, it demonstrates new ways of exploiting graphical structure to speed up DC checking.

References

  1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. (2009). Introduction to Algorithms. MIT Press.
  2. Dechter, R., Meiri, I., and Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49:61-95.
  3. Effinger, R., Williams, B., Kelly, G., and Sheehy, M. (2009). Dynamic controllability of temporally-flexible reactive programs. In Gerevini, A., Howe, A., Cesta, A., and Refanidis, I., editors, Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 09). AAAI Press.
  4. Hunsberger, L. (2010). A fast incremental algorithm for managing the execution of dynamically controllable temporal networks. In Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME-2010), pages 121-128, Los Alamitos, CA, USA. IEEE Computer Society.
  5. Morris, P. (2006). A structural characterization of temporal dynamic controllability. In Principles and Practice of Constraint Programming (CP 2006), volume 4204 of Lecture Notes in Computer Science, pages 375-389. Springer.
  6. Morris, P., Muscettola, N., and Vidal, T. (2001). Dynamic control of plans with temporal uncertainty. In Nebel, B., editor, 17th International Joint Conference on Artificial Intelligence (IJCAI-01), pages 494-499. Morgan Kaufmann.
  7. Morris, R., Morris, P., Khatib, L., and Yorke-Smith, N. (2005). Temporal constraint reasoning with preferences and probabilities. In Brafman, R. and Junker, U., editors, Proceedings of the IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling, pages 150-155.
  8. Rossi, F., Venable, K. B., and Yorke-Smith, N. (2006). Uncertainty in soft temporal constraint problems: A general framework and controllability algorithms for the fuzzy case. Journal of Artificial Intelligence Research, 27:617-674.
  9. Shah, J., Stedl, J., Robertson, P., and Williams, B. C. (2007). A fast incremental algorithm for maintaining dispatchability of partially controllable plans. In Mark Boddy et al., editor, Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007). AAAI Press.
  10. Stedl, J. and Williams, B. C. (2005). A fast incremental dynamic controllability algorithm. In Proceedings of the ICAPS Workshop on Plan Execution: A Reality Check, pages 69-75.
  11. Tsamardinos, I. (2002). A probabilistic approach to robust execution of temporal plans with uncertainty. In Vlahavas, I. P. and Spyropoulos, C. D., editors, Proceedings of the Second Hellenic Conference on AI (SETN 2002), volume 2308 of Lecture Notes in Computer Science, pages 97-108. Springer.
  12. Tsamardinos, I., Pollack, M. E., and Ramakrishnan, S. (2003). Assessing the probability of legal execution of plans with temporal uncertainty. In Proceedings of the ICAPS-03 Workshop on Planning under Uncertainty and Incomplete Information.
  13. Vidal, T. and Ghallab, M. (1996). Dealing with uncertain durations in temporal constraint networks dedicated to planning. In Wahlster, W., editor, 12th European Conference on Artificial Intelligence (ECAI-96)”, pages 48-54. John Wiley and Sons, Chichester.
Download


Paper Citation


in Harvard Style

Hunsberger L. (2013). Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8565-39-6, pages 157-170. DOI: 10.5220/0004260501570170


in Bibtex Style

@conference{icaart13,
author={Luke Hunsberger},
title={Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2013},
pages={157-170},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004260501570170},
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 - Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking
SN - 978-989-8565-39-6
AU - Hunsberger L.
PY - 2013
SP - 157
EP - 170
DO - 10.5220/0004260501570170