Classical Dynamic Controllability Revisited - A Tighter Bound on the Classical Algorithm

Mikael Nilsson, Jonas Kvarnström, Patrick Doherty
2014 Proceedings of the 6th International Conference on Agents and Artificial Intelligence  
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
more » ... rithm. This algorithm, thought to be pseudo-polynomial and subsumed by an O(n 5 ) algorithm and later an O(n 4 ) algorithm, is in fact O(n 4 ) 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.
doi:10.5220/0004815801300141 dblp:conf/icaart/NilssonKD14 fatcat:noswjqxnwjgjrad6a6z7ahjgem