Abstract
Simple Temporal Networks with Uncertainty (STNUs) allow the representation of temporal problems where some durations are uncontrollable (determined by nature), as is often the case for actions in planning. It is essential to verify that such networks are dynamically controllable (DC) – executable regardless of the outcomes of uncontrollable durations – and to convert them to an executable form. We use insights from incremental DC verification algorithms to re-analyze the original, classical, verification algorithm. This algorithm is the entry level algorithm for DC verification, based on a less complex and more intuitive theory than subsequent algorithms. We show that with a small modification the algorithm is transformed from pseudo-polynomial to \(O(n^4)\) which makes it still useful. We also discuss a change reducing the amount of work performed by the algorithm.
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
References
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49(1–3), 61–95 (1991)
Vidal, T., Ghallab, M.: Dealing with uncertain durations in temporal constraint networks dedicated to planning. In: Proceedings of ECAI (1996)
Muscettola, N., Morris, P., Tsamardinos, I.: Reformulating temporal plans for efficient execution. In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR) (1998)
Morris, P., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: Proceedings of IJCAI (2001)
Morris, P., Muscettola, N.: Temporal dynamic controllability revisited. In: Proceedings of AAAI (2005)
Morris, P.: A structural characterization of temporal dynamic controllability. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 375–389. Springer, Heidelberg (2006)
Morris, P.: Dynamic controllability and dispatchability relationships. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 464–479. Springer, Heidelberg (2014)
Stedl, J., Williams, B.: A fast incremental dynamic controllability algorithm. In: Proceedings of ICAPS Workshop on Plan Execution (2005)
Shah, J.A., Stedl, J., Williams, B.C., Robertson, P.: A fast incremental algorithm for maintaining dispatchability of partially controllable plans. In: Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS) (2007). http://dblp.uni-trier.de/db/conf/aips/icaps2007.html#ShahSWR07
Nilsson, M., Kvarnström, J., Doherty, P.: Incremental dynamic controllability revisited. In: Proceedings of ICAPS (2013)
Nilsson, M., Kvarnström, J., Doherty, P.: Classical dynamic controllability revisited: a tighter bound on the classical algorithm. In: Proceedings of ICAART (2014)
Stedl, J.L.: Managing temporal uncertainty under limited communication: a formal model of tight and loose team coordination. Master’s thesis, Massachusetts Institute of Technology (2004)
Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education, Boston (2001)
Cimatti, A., Hunsberger, L., Micheli, A., Roveri, M.: Using timed game automata to synthesize execution strategies for simple temporal networks with uncertainty. In: Proceedings of AAAI (2014)
Cesta, A., Finzi, A., Fratini, S., Orlandini, A., Tronci, E.: Analyzing flexible timeline-based plans. In: Proceedings of ECAI (2010)
Nilsson, M., Kvarnström, J., Doherty, P.: EfficientIDC: a faster incremental dynamic controllability algorithm. In: Proceedings of ICAPS (2014)
Hunsberger, L.: A fast incremental algorithm for managing the execution of dynamically controllable temporal networks. In: Proceedings of TIME (2010)
Hunsberger, L.: A faster execution algorithm for dynamically controllable STNUs. In: Proceedings of TIME, pp. 26–33. IEEE (2013)
Acknowledgements
This work is partially supported by the Swedish Research Council (VR) Linnaeus Center CADICS, the ELLIIT network organization for Information and Communication Technology, the Swedish Foundation for Strategic Research (CUAS Project), the EU FP7 project SHERPA (grant agreement 600958), and Vinnova NFFP6 Project 2013-01206.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Nilsson, M., Kvarnström, J., Doherty, P. (2015). Revisiting Classical Dynamic Controllability: A Tighter Complexity Analysis. In: Duval, B., van den Herik, J., Loiseau, S., Filipe, J. (eds) Agents and Artificial Intelligence. ICAART 2014. Lecture Notes in Computer Science(), vol 8946. Springer, Cham. https://doi.org/10.1007/978-3-319-25210-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-25210-0_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25209-4
Online ISBN: 978-3-319-25210-0
eBook Packages: Computer ScienceComputer Science (R0)