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

Direct link
Classical Dynamic Controllability Revisited : A Tighter Bound on the Classical Algorithm
2014 (English)In: Proceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART), 2014, 130-141Conference paper (Refereed)
Abstract [en]

Simple Temporal Networks with Uncertainty (STNUs) allow the representation of temporal problems wheresome durations are uncontrollable (determined by nature), as is often the case for actions in planning. It is essentialto verify that such networks are dynamically controllable (DC) – executable regardless of the outcomesof uncontrollable durations – and to convert them to an executable form. We use insights from incrementalDC verification algorithms to re-analyze the original verification algorithm. This algorithm, thought to bepseudo-polynomial and subsumed by an O(n5) algorithm and later an O(n4) algorithm, is in fact O(n4) givena small modification. This makes the algorithm attractive once again, given its basis in a less complex andmore intuitive theory. Finally, we discuss a change reducing the amount of work performed by the algorithm.

Keyword [en]
Temporal Networks, Dynamic Controllability
National Category
Computer Science
URN: urn:nbn:se:liu:diva-102963DOI: 10.5220/0004815801300141OAI: diva2:685353
6th International Conference on Agents and Artificial Intelligence (ICAART 2014), 6-8 March 2014, Angers, France
Swedish Research CouncileLLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsSwedish Foundation for Strategic Research EU, FP7, Seventh Framework ProgrammeVinnova
Available from2014-01-09 Created:2014-01-09 Last updated:2014-03-20

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Nilsson, MikaelKvarnström, JonasDoherty, Patrick
By organisation
Artificial Intelligence and Intergrated Computer systemsThe Institute of Technology
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

Altmetric score

Total: 56 hits
ReferencesLink to record
Permanent link

Direct link