Publication Date:
2019-07-13
Description:
An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynamically Controllable, i.e., whether the temporal requirements are feasible in the light of uncertain durations of some processes. We present a fast algorithm for Dynamic Controllability. We also note a correspondence between the reduction steps in the algorithm and the operations involved in converting the projections to dispatchable form. This has implications for the complexity for sparse networks.
Keywords:
Computer Systems; Mathematical and Computer Sciences (General)
Type:
ARC-E-DAA-TN13382
,
International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming; May 19, 2014 - May 23, 2014; Cork; Ireland
Format:
application/pdf
Permalink
