Skip navigation
Skip navigation

Optimising Bounds in Simple Temporal Networks with Uncertainty under Dynamic Controllability Constraints

Cui, Jing; Yu, Peng; Haslum, Patrik; Williams, Brian C.

Description

Dynamically controllable simple temporal networks with uncertainty (STNU) are widely used to represent temporal plans or schedules with uncertainty and execution flexibility. While the problem of testing an STNU for dynamic controllability is well studied, many use cases — for example, problem relaxation or schedule robustness analysis — require optimising a function over STNU time bounds subject to the constraint that the network is dynamically controllable. We present a disjunctive linear...[Show more]

CollectionsANU Research Publications
Date published: 2015
Type: Conference paper
URI: http://hdl.handle.net/1885/103803
Source: Proceedings International Conference on Automated Planning and Scheduling, ICAPS

Download

File Description SizeFormat Image
01_Cui_Optimising_Bounds_in_Simple_2015.pdf466.47 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator