BulDML at Institute of Mathematics and Informatics >
International Book Series Information Science and Computing >
2008 >
Book 1 Algorithmic and Mathematical Foundations of the Artificial Intelligence >

Please use this identifier to cite or link to this item:

Title: Timed Transition Automata as Numerical Planning Domain
Authors: Milani, Alfredo
Suriani, Silvia
Keywords: Timed Transition Automata
Automated Planning
Issue Date: 2008
Publisher: Institute of Information Theories and Applications FOI ITHEA
Abstract: A general technique for transforming a timed finite state automaton into an equivalent automated planning domain based on a numerical parameter model is introduced. Timed transition automata have many applications in control systems and agents models; they are used to describe sequential processes, where actions are labelling by automaton transitions subject to temporal constraints. The language of timed words accepted by a timed automaton, the possible sequences of system or agent behaviour, can be described in term of an appropriate planning domain encapsulating the timed actions patterns and constraints. The time words recognition problem is then posed as a planning problem where the goal is to reach a final state by a sequence of actions, which corresponds to the timed symbols labeling the automaton transitions. The transformation is proved to be correct and complete and it is space/time linear on the automaton size. Experimental results shows that the performance of the planning domain obtained by transformation is scalable for real world applications. A major advantage of the planning based approach, beside of the solving the parsing problem, is to represent in a single automated reasoning framework problems of plan recognitions, plan synthesis and plan optimisation.
ISSN: 1313-0455
Appears in Collections:Book 1 Algorithmic and Mathematical Foundations of the Artificial Intelligence

Files in This Item:

File Description SizeFormat
IBS-01-p03.pdf150.67 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License