: A Faster Incremental Dynamic Controllability Algorithm
Nilsson, Mikael Kvarnström, Jonas Doherty, Patrick 2014 (English)In: Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS), 2014, 199-207Conference 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 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.
Temporal Networks, Dynamic Controllability, Incremental Algorithm
National CategoryComputer Science
Identifiersurn:nbn:se:liu:diva-103012 (URN)ISBN:978-1-57735-660-8 (ISBN)oai:DiVA.org:liu-103012 (OAI)diva2:685363 (DiVA)
24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 21-26 June 2014, Portsmouth, USA
Swedish Research CouncileLLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsSwedish Foundation for Strategic Research EU, FP7, Seventh Framework ProgrammeVinnova