liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Revisiting Classical Dynamic Controllability: A Tighter Complexity Analysis
Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten. (KPLAB)ORCID-id: 0000-0002-2849-3316
Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten. (KPLAB)ORCID-id: 0000-0002-5500-8494
Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten. (KPLAB)
2015 (engelsk)Inngår i: 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, 243-261 s.Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
Springer, 2015. Vol. 8946, 243-261 s.
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 8946
Emneord [en]
Temporal Networks, Classical Algorithm
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-121695DOI: 10.1007/978-3-319-25210-0_15ISI: 000366298500015ISBN: 978-3-319-25209-4 (tryckt)ISBN: 978-3-319-25210-0 (tryckt)OAI: oai:DiVA.org:liu-121695DiVA: diva2:858385
Konferanse
6th International Conference, ICAART 2014, Angers, France, March 6-8, 2014
Forskningsfinansiär
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)
Tilgjengelig fra: 2015-10-02 Laget: 2015-10-01 Sist oppdatert: 2017-02-21bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler

Andre lenker

Forlagets fulltekst

Søk i DiVA

Av forfatter/redaktør
Nilsson, MikaelKvarnström, JonasDoherty, Patrick
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

Altmetric

Totalt: 135 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf