loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Mikael Nilsson ; Jonas Kvarnström and Patrick Doherty

Affiliation: Linköping University, Sweden

Keyword(s): Temporal Networks, Dynamic Controllability.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Constraint Satisfaction ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Planning and Scheduling ; Simulation and Modeling ; Symbolic Systems ; Uncertainty in AI

Abstract: 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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 13.59.127.63

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Nilsson, M.; Kvarnström, J. and Doherty, P. (2014). Classical Dynamic Controllability Revisited - A Tighter Bound on the Classical Algorithm. In Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-015-4; ISSN 2184-433X, SciTePress, pages 130-141. DOI: 10.5220/0004815801300141

@conference{icaart14,
author={Mikael Nilsson. and Jonas Kvarnström. and Patrick Doherty.},
title={Classical Dynamic Controllability Revisited - A Tighter Bound on the Classical Algorithm},
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2014},
pages={130-141},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004815801300141},
isbn={978-989-758-015-4},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Classical Dynamic Controllability Revisited - A Tighter Bound on the Classical Algorithm
SN - 978-989-758-015-4
IS - 2184-433X
AU - Nilsson, M.
AU - Kvarnström, J.
AU - Doherty, P.
PY - 2014
SP - 130
EP - 141
DO - 10.5220/0004815801300141
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic