liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Incremental Dynamic Controllability Revisited
2013 (English)In: Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS), AAAI Press, 2013Conference paper (Refereed)
Abstract [en]

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 Category
Computer Science
URN: urn:nbn:se:liu:diva-88634ISBN: 978-1-57735-609-7OAI: diva2:605388
23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), 10-14 June 2013, Rom, Italy
Available from2013-02-14 Created:2013-02-14 Last updated:2014-03-26

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Nilsson, MikaelKvarnström, JonasDoherty, Patrick
By organisation
Artificial Intelligence and Intergrated Computer systemsThe Institute of TechnologyKPLAB - Knowledge Processing LabUASTECH - Autonomous Unmanned Aircraft Systems Technologies
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 52 hits
ReferencesLink to record
Permanent link

Direct link