Mapping Temporal Planning Constraints into Timed Automata
TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Temporal dynamic controllability revisited
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Flexible timeline-based plan verification
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
TGA-based controllers for flexible plan execution
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Flexible Plan Verification: Feasibility Results
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
| Hi-index | 0.00 |
Timeline-based planners have been shown quite successful in addressing real world problems. Nevertheless they are considered as a niche technology in AI P&S research as an application synthesis with such techniques is still considered a sort of “black art”. Authors are currently developing a knowledge engineering tool around a timeline-based problem solving environment; in this framework we aim at integrating verification and validation methods. This work presents a verification process suitable for a timeline-based planner. It shows how a problem of flexible temporal plan verification can be cast as model-checking on timed game automata. Additionally it provides formal properties and checks the effectiveness of the proposed approach with a detailed experimental analysis.