Revisiting Classical Dynamic Controllability: A Tighter Complexity Analysis
2015 (English)In: Agents and Artificial Intelligence: 6th International Conference, ICAART 2014, Angers, France, March 6–8, 2014, Revised Selected Papers / [ed] Béatrice Duval; Jaap van den Herik; Stephane Loiseau; Joaquim Filipe, Springer, 2015, Vol. 8946, 243-261 p.Conference paper (Refereed)
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(n4) which makes it still useful. We also discuss a change reducing the amount of work performed by the algorithm.
Place, publisher, year, edition, pages
Springer, 2015. Vol. 8946, 243-261 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 8946
Temporal Networks, Classical Algorithm
IdentifiersURN: urn:nbn:se:liu:diva-121695DOI: 10.1007/978-3-319-25210-0_15ISBN: 978-3-319-25209-4 (print)ISBN: 978-3-319-25210-0 (online)OAI: oai:DiVA.org:liu-121695DiVA: diva2:858385
6th International Conference, ICAART 2014, Angers, France, March 6-8, 2014
FunderSwedish Research Council, CADICSeLLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsSwedish Foundation for Strategic Research , CUASEU, FP7, Seventh Framework Programme, SHERPAVINNOVA, 2013-01206CUGS (National Graduate School in Computer Science)