Bridging the Gap Between LTL Synthesis and Automated Planning. Camacho, A., Baier, J., Muise, C., & McIlraith, S. A. In Workshop on Generalized Planning (GenPlan'17), 2017.
Bridging the Gap Between LTL Synthesis and Automated Planning [pdf]Paper  abstract   bibtex   8 downloads  
Linear Temporal Logic (LTL) synthesis can be understood as the problem of building a controller that defines a winning strategy, for a two-player game against the environment, where the objective is to satisfy a given LTL formula. It is an important problem with applications in software synthesis, including controller synthesis. Recent work has explored the close connection between automated planning and LTL synthesis but has not provided a full mapping between the two problems nor have its practical implications been explored. In this paper we establish the correspondence between LTL synthesis and fully observable non-deterministic (FOND) planning. We also provide the first explicit compilation that translates an LTL synthesis problem to a FOND problem. Experiments with state-of-the-art LTL FOND and synthesis solvers show automated planning to be a viable and effective tool for highly structured LTL synthesis problems.

Downloads: 8