loading
  • Login
  • Sign-Up

Research.Publish.Connect.

Paper

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

Affiliation: Linköping University, Sweden

ISBN: 978-989-758-015-4

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.

PDF ImageFull Text

Download
Sign In Guest: Register as new SCITEPRESS user or Join INSTICC now for free.

Sign In SCITEPRESS user: please login.

Sign In INSTICC Members: please login. If not a member yet, Join INSTICC now for free.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.80.247.158. INSTICC members have higher download limits (free membership now)

In the current month:
Recent papers: 1 available of 1 total
2+ years older papers: 2 available of 2 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 IntelligenceISBN 978-989-758-015-4, 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},
year={2014},
pages={130-141},
doi={10.5220/0004815801300141},
isbn={978-989-758-015-4},
}

TY - CONF

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

Sorted by: Show papers

Note: The preferred Subjects/Areas/Topics, listed below for each paper, are those that match the selected paper topics and their ontology superclasses.
More...

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.

Show authors

Note: The preferred Subjects/Areas/Topics, listed below for each author, are those that more frequently used in the author's papers.
More...