loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Andreas Lanz 1 ; Roberto Posenato 2 ; Carlo Combi 2 and Manfred Reichert 3

Affiliations: 1 University of Ulm, Germany ; 2 University of Verona, Italy ; 3 Ulm University, Germany

ISBN: 978-989-758-074-1

Keyword(s): Simple Temporal Constraint Network with Uncertainty, STNU, Controllability, Guarded Constraints.

Related Ontology Subjects/Areas/Topics: Agents ; 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 ; Task Planning and Execution

Abstract: The Simple Temporal Network with Uncertainty (STNU) model focuses on the representation and evaluation of temporal constraints on time-point variables (timepoints), of which some (i.e., contingent timepoints) cannot be assigned (i.e., executed by the system), but only be observed. Moreover, a temporal constraint is expressed as an admissible range of delays between two timepoints. Regarding the STNU model, it is interesting to determine whether it is possible to execute all the timepoints under the control of the system, while still satisfying all given constraints, no matter when the contingent timepoints happen within the given time ranges (controllability check). Existing approaches assume that the original contingent time range cannot be modified during execution. In real world, however, the allowed time range may change within certain boundaries, but cannot be completely shrunk. To represent such possibility more properly, we propose Simple Temporal Network with Partially Shrinka ble Uncertainty (STNPSU) as an extension of STNU. In particular, STNPSUs allow representing a contingent range in a way that can be shrunk during run time as long as shrinking does not go beyond a given threshold. We further show that STNPSUs allow representing STNUs as a special case, while maintaining the same efficiency for both controllability checks and execution. (More)

PDF ImageFull Text

Download
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.231.226.211

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:
Lanz, A.; Posenato, R.; Combi, C. and Reichert, M. (2015). Simple Temporal Networks with Partially Shrinkable Uncertainty.In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-074-1, pages 370-381. DOI: 10.5220/0005200903700381

@conference{icaart15,
author={Andreas Lanz. and Roberto Posenato. and Carlo Combi. and Manfred Reichert.},
title={Simple Temporal Networks with Partially Shrinkable Uncertainty},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2015},
pages={370-381},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005200903700381},
isbn={978-989-758-074-1},
}

TY - CONF

JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Simple Temporal Networks with Partially Shrinkable Uncertainty
SN - 978-989-758-074-1
AU - Lanz, A.
AU - Posenato, R.
AU - Combi, C.
AU - Reichert, M.
PY - 2015
SP - 370
EP - 381
DO - 10.5220/0005200903700381

Login or register to post comments.

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