We consider the problem of synthesizing an agent protocol satisfying LTL specifications for multiple, partially-observable environments. We present a sound and complete procedure for solving the synthesis problem in this setting and show it is computationally optimal from a theoretical complexity standpoint. While this produces perfect-recall, hence unbounded, strategies we show how to transform these into agent protocols with bounded number of states. Copyright © 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Synthesizing agent protocols from LTL specifications against multiple partially-observable environments / Felli, Paolo; DE GIACOMO, Giuseppe; Alessio, Lomuscio. - STAMPA. - (2012), pp. 457-466. (Intervento presentato al convegno 13th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2012 tenutosi a Rome nel 10 June 2012 through 14 June 2012).
Synthesizing agent protocols from LTL specifications against multiple partially-observable environments
FELLI, PAOLO;DE GIACOMO, Giuseppe;
2012
Abstract
We consider the problem of synthesizing an agent protocol satisfying LTL specifications for multiple, partially-observable environments. We present a sound and complete procedure for solving the synthesis problem in this setting and show it is computationally optimal from a theoretical complexity standpoint. While this produces perfect-recall, hence unbounded, strategies we show how to transform these into agent protocols with bounded number of states. Copyright © 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2012_11573-484816.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
698.8 kB
Formato
Adobe PDF
|
698.8 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
