Abstract
In order to provide an effective tool allowing to implement validated agents behaviours, this paper first presents a Goal Decomposition Tree (GDT), a model to specify behaviours both in procedural and declarative ways. A GDT allows the designer to verify the specified behaviour. This model is then used to generate a behaviour automaton using automata composition patterns associated to operators used in the tree. This process allows to obtain a finite expression representing all valid behaviours of agents of a MAS. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Simon, G., & Flouret, M. (2006). Implementing validated agents behaviours with automata based on goal decomposition trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3950 LNCS, pp. 124–138). Springer Verlag. https://doi.org/10.1007/11752660_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
