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, Uncertainty, 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 (STN) is a structure containing time-points and temporal constraints that an agent can use to manage its activities. A Simple Temporal Network with Uncertainty (STNU) augments an STN to include contingent links that can be used to represent actions with uncertain durations. The most important property of an STNU is whether it is dynamically controllable (DC)—that is, whether there exists a strategy for executing its time-points such that all constraints will necessarily be satisfied no matter how the contingent durations happen to turn out (within their known bounds). The fastest algorithm for checking the dynamic controllability of STNUs reported in the literature so far is the O(N4)-time algorithm due to Morris. This paper presents a new DC-checking algorithm that empirical results confirm is faster than Morris’ algorithm, in many cases showing an order of magnitude speed-up. The algorithm employs two novel techniques. First, new constraints gener ated by propagation are immediately incorporated into the network using a technique called rotating Dijkstra. Second, a heuristic that exploits the nesting structure of certain paths in the STNU graph is used to determine a good order in which to process the contingent links during constraint propagation. (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 3.145.183.137

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. (2014). A Faster Algorithm for Checking the Dynamic Controllability of Simple Temporal Networks with Uncertainty. 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 63-73. DOI: 10.5220/0004758100630073

@conference{icaart14,
author={Luke Hunsberger.},
title={A Faster Algorithm for Checking the Dynamic Controllability of Simple Temporal Networks with Uncertainty},
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2014},
pages={63-73},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004758100630073},
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 - A Faster Algorithm for Checking the Dynamic Controllability of Simple Temporal Networks with Uncertainty
SN - 978-989-758-015-4
IS - 2184-433X
AU - Hunsberger, L.
PY - 2014
SP - 63
EP - 73
DO - 10.5220/0004758100630073
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