LiU Electronic Press
Full-text not available in DiVA
Author:
Nilsson, Mikael (Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems) (Linköping University, The Institute of Technology)
Kvarnström, Jonas (Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems) (Linköping University, The Institute of Technology)
Doherty, Patrick (Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems) (Linköping University, The Institute of Technology)
Title:
EfficientIDC: A Faster Incremental Dynamic Controllability Algorithm
Department:
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS)
Conference:
24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 21-26 June 2014, Portsmouth, USA
Year of publ.:
2014
URI:
urn:nbn:se:liu:diva-103012
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-103012
Subject category:
Computer Science
Keywords(en) :
Temporal Networks, Dynamic Controllability, Incremental Algorithm
Project:
CUAS, CADICS, NFFP6, Sherpa, ELLIIT
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.

Note:

Accepted for Publication.

Research funder:
Swedish Research Council, CADICS
Research funder:
eLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Research funder:
Swedish Foundation for Strategic Research , CUAS
Research funder:
EU, FP7, Seventh Framework Programme, SHERPA
Research funder:
Vinnova, 2013-01206
Available from:
2014-01-09
Created:
2014-01-09
Last updated:
2014-02-20
Statistics:
23 hits