loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Author: Luke Hunsberger

Affiliation: Vassar College, United States

Keyword(s): Temporal Networks, Dynamic Controllability.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Planning and Scheduling ; Simulation and Modeling ; Symbolic Systems ; Task Planning and Execution

Abstract: A Simple Temporal Network with Uncertainty (STNU) is a structure for representing and reasoning about temporal constraints and uncontrollable-but-bounded temporal intervals called contingent links. An STNU is dynamically controllable (DC) if there exists a strategy for executing its time-points that guarantees that all of the constraints will be satisfied no matter how the durations of the contingent links turn out. The fastest algorithm in the literature for checking the dynamic controllability of arbitrary STNUs is based on an analysis of the graphical structure of STNUs. This paper (1) presents a new method for analyzing the graphical structure of STNUs, (2) determines an upper bound on the complexity of certain structures---the indivisible semi-reducible negative loops; (3) presents an algorithm for generating loops---the magic loops---whose complexity attains this upper bound; and (4) shows how the upper bound can be exploited to speed up the process of DC-checking for certai n networks. Theoretically, the paper deepens our understanding of the structure of STNU graphs. Practically, it demonstrates new ways of exploiting graphical structure to speed up DC checking. (More)

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 18.221.146.223

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:
Hunsberger, L. (2013). Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking. In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-8565-39-6; ISSN 2184-433X, SciTePress, pages 157-170. DOI: 10.5220/0004260501570170

@conference{icaart13,
author={Luke Hunsberger.},
title={Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2013},
pages={157-170},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004260501570170},
isbn={978-989-8565-39-6},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking
SN - 978-989-8565-39-6
IS - 2184-433X
AU - Hunsberger, L.
PY - 2013
SP - 157
EP - 170
DO - 10.5220/0004260501570170
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