Finite-state controllers are a compact and effective plan representation for agent widely used in AI. In this paper, we propose a generic framework and related solver for synthesizing bounded finite-state controllers, and show its instantiations to three different applications, including generalized planning, planning programs and service composition under partial observability and controllability. We show that our generic solver is sound and complete, and amenable to heuristics that take into account the structure of the specific target instantiation. Experiments show that instantiations of our solver to the problems above often outperform tailored approaches in the literature. This suggests that our proposal is a promising base point for future research on finite-state controller synthesis. Copyright © 2013, Association for the Advancement of Artificial Intelligence. All rights reserved.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||A generic technique for synthesizing bounded finite-state controllers|
|Data di pubblicazione:||2013|
|Appartiene alla tipologia:||04b Atto di convegno in volume|