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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Revisiting Classical Dynamic Controllability: A Tighter Complexity Analysis
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering. (KPLAB)ORCID iD: 0000-0002-2849-3316
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering. (KPLAB)ORCID iD: 0000-0002-5500-8494
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering. (KPLAB)
2015 (English)In: Agents and Artificial Intelligence: 6th International Conference, ICAART 2014, Angers, France, March 6–8, 2014, Revised Selected Papers / [ed] Béatrice Duval; Jaap van den Herik; Stephane Loiseau; Joaquim Filipe, Springer, 2015, Vol. 8946, p. 243-261Conference 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, classical, verification algorithm. This algorithm is the entry level algorithm for DC verification, based on a less complex and more intuitive theory than subsequent algorithms. We show that with a small modification the algorithm is transformed from pseudo-polynomial to O(n4) which makes it still useful.  We also discuss a change reducing the amount of work performed by the algorithm.

Place, publisher, year, edition, pages
Springer, 2015. Vol. 8946, p. 243-261
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 8946
Keywords [en]
Temporal Networks, Classical Algorithm
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-121695DOI: 10.1007/978-3-319-25210-0_15ISI: 000366298500015ISBN: 978-3-319-25209-4 (print)ISBN: 978-3-319-25210-0 (print)OAI: oai:DiVA.org:liu-121695DiVA, id: diva2:858385
Conference
6th International Conference, ICAART 2014, Angers, France, March 6-8, 2014
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-01206CUGS (National Graduate School in Computer Science)Available from: 2015-10-02 Created: 2015-10-01 Last updated: 2018-02-20Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Nilsson, MikaelKvarnström, JonasDoherty, Patrick

Search in DiVA

By author/editor
Nilsson, MikaelKvarnström, JonasDoherty, Patrick
By organisation
Artificial Intelligence and Integrated Computer SystemsFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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