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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient IDC: A Faster Incremental Dynamic Controllability Algorithm
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-2849-3316
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-5500-8494
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, The Institute of Technology.
2014 (English)In: Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS), AAAI Press, 2014, p. 199-207Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
AAAI Press, 2014. p. 199-207
Keywords [en]
Temporal Networks, Dynamic Controllability, Incremental Algorithm
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-103012ISBN: 978-1-57735-660-8 (print)OAI: oai:DiVA.org:liu-103012DiVA, id: diva2:685363
Conference
24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 21-26 June 2014, Portsmouth, USA
Projects
CUASCADICSNFFP6SherpaELLIIT
Funder
Swedish Research Council, CADICSELLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsSwedish Foundation for Strategic Research , CUASEU, FP7, Seventh Framework Programme, SHERPAVinnova, 2013-01206Available from: 2014-01-09 Created: 2014-01-09 Last updated: 2019-07-04

Open Access in DiVA

No full text in DiVA

Authority records

Nilsson, MikaelKvarnström, JonasDoherty, Patrick

Search in DiVA

By author/editor
Nilsson, MikaelKvarnström, JonasDoherty, Patrick
By organisation
Artificial Intelligence and Integrated Computer SystemsThe Institute of Technology
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 233 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf