Optimising Bounds in Simple Temporal Networks with Uncertainty under Dynamic Controllability Constraints
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]
|Collections||ANU Research Publications|
|Source:||Proceedings International Conference on Automated Planning and Scheduling, ICAPS|
|Access Rights:||Open Access|
|01_Cui_Optimising_Bounds_in_Simple_2015.pdf||466.47 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.