Nilsson, Mikael Kvarnström, Jonas Doherty, Patrick 2013 (English)In: Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS), AAAI Press, 2013Conference paper (Refereed)
Simple Temporal Networks with Uncertainty (STNUs) allow the representation of temporal problems where some durations are determined by nature, as is often the case for actions in planning. As such networks are generated it is essential to verify that they are dynamically controllable – executable regardless of the outcomes of uncontrollable durations – and to convert them to a dispatchable form. The previously published FastIDC algorithm achieves this incrementally and can therefore be used efficiently during plan construction. In this paper we show that FastIDC is not sound when new constraints are added, sometimes labeling networks as dynamically controllable when they are not. We analyze the algorithm, pinpoint the cause, and show how the algorithm can be modified to correctly detect uncontrollable networks.
National CategoryComputer Science
Identifiersurn:nbn:se:liu:diva-88634 (URN)978-1-57735-609-7 (ISBN)oai:DiVA.org:liu-88634 (OAI)diva2:605388 (DiVA)
23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), 10-14 June 2013, Rom, Italy