Bucket Elimination Algorithm for Dynamic Controllability Checking of Simple Temporal Networks with Uncertainty
Name
bucket_elimination_for_dc_checking.pdf
Size
743.5 KB
Format
Adobe PDF
Checksum (MD5)
d5d613d907a4188b3f5bbdfe7919a5f8
Author(s)
Zhang, Yuening
Date Issued
March 2, 2021
Abstract
Simple Temporal Networks with Uncertainty (STNU) can represent temporal problems where duration between events may be uncontrollable, e.g. when the event is caused by nature. An STNU is dynamically controllable (DC) if it can be successfully scheduled online. In this paper, we introduce a novel usage of bucket elimination algorithms for DC checking that matches the state of the art in achieving O(n^3) performance. Bucket elimination algorithms exist for STNs (path consistency and Fourier algorithms), but adapting it to STNUs is non-trivial. As a result, consistency checking becomes a special case of our algorithm. Due to the familiarity to bucket elimination algorithms, the final algorithm is easier to understand and implement. Additionally, conflict extraction is also easily supported in this framework.
Subjects
temporal networks
dynamic controllability
bucket elimination
scheduling with uncertainty
Terms of Use
CC0 1.0 Universal
Persistent DSpace Link
