Introduction to algorithms
Artificial Intelligence - Special issue on knowledge representation
Remote Agent: to boldly go where no AI system has gone before
Artificial Intelligence - Special issue: artificial intelligence 40 years later
Dynamic control of plans with temporal uncertainty
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Exploration of the robustness of plans
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Controllability in Temporal Conceptual Workflow Schemata
BPM '09 Proceedings of the 7th International Conference on Business Process Management
On the partial observability of temporal uncertainty
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
Generalizing temporal controllability
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A precedence constraint posting approach for the RCPSP with time lags and variable durations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Flexible timeline-based plan verification
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Analyzing Flexible Timeline-based Plans
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
TGA-based controllers for flexible plan execution
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
A structural characterization of temporal dynamic controllability
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Modelling temporal, data-centric medical processes
Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium
On the complexity of temporal controllabilities for workflow schemata
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Flexible Plan Verification: Feasibility Results
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Robust local search for solving RCPSP/max with durational uncertainty
Journal of Artificial Intelligence Research
Distributed reasoning for multiagent simple temporal problems
Journal of Artificial Intelligence Research
Automating the evaluation of planning systems
AI Communications
| Hi-index | 0.00 |
An important issue for temporal planners is the ability to handle temporal uncertainty. We revisit the question of how to determine whether a given set of temporal requirements are feasible in the light of uncertain durations of some processes. In particular, we consider how best to determine whether a network is Dynamically Controllable, i.e., whether a dynamic strategy exisls for executing the network that is guaranteed to satisfy the requirements. Previous work has shown the existence of a pseudo-polynomial algorithm for testing Dynamic Controllability. Here, we simplify the previous framework, and present a strongly polynomial algorithm with a termination criterion based on the structure of the network.