Temporal Planning with extended Timed Automata

Abstract : We consider a system modeled as a set of interacting agents evolving along time according to explicit timing constraints. In this kind of system, the planning task consists in selecting and organizing actions in order to reach a goal state in a limited time and in an optimal manner, assuming actions have a cost. We propose to reformulate the planning problem in terms of model-checking and controller synthesis on interacting agents such that the state to reach is expressed using temporal logic. We have chosen to represent each agent using the formalism of Priced Timed Game Automata (PTGA). PTGA is an extension of Timed Automata that allows the representation of cost on actions and uncontrollable actions. Relying on this domain description, we define a planning algorithm that computes the best strategy to achieve the goal. This algorithm is based on recognized model-checking and synthesis tools from the UPPAAL suite. The expressivity of this approach is evaluated on the classical Transport Domain which is extended in order to include timing constraints, cost values and uncontrollable actions. This work has been implemented and performances evaluated on benchmarks.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

Contributor : Christine Largouet <>
Submitted on : Thursday, November 17, 2016 - 3:51:33 PM
Last modification on : Thursday, June 20, 2019 - 12:04:05 PM
Long-term archiving on : Thursday, March 16, 2017 - 5:42:11 PM


Files produced by the author(s)


  • HAL Id : hal-01398695, version 1


Christine Largouët, Omar Krichen, Yulong Zhao. Temporal Planning with extended Timed Automata. 28th International Conference on Tools with Artificial Intelligence (ICTAI 2016), IEEE, Nov 2016, SAN JOSE, United States. ⟨hal-01398695⟩



Record views


Files downloads