EfficientIDC: A Faster Incremental Dynamic Controllability Algorithm
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems
Linköping University, The Institute of Technology
Conference paper (Refereed)
Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS)
24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 21-26 June 2014, Portsmouth, USA
Temporal Networks, Dynamic Controllability, Incremental Algorithm
CUAS, CADICS, NFFP6, Sherpa, ELLIIT
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 verification algorithm. This algorithm, thought to be pseudo-polynomial and subsumed by an O(n5) algorithm and later an O(n4) algorithm, is in fact O(n4) given a small modification. This makes the algorithm attractive once again, given its basis in a less complex and more intuitive theory. Finally, we discuss a change reducing the amount of work performed by the algorithm.
Accepted for Publication.
Swedish Research Council, CADICS
eLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Swedish Foundation for Strategic Research , CUAS
EU, FP7, Seventh Framework Programme, SHERPA