Model-Free Reinforcement Learning for Stochastic Games with Linear Temporal Logic Objectives
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914443686838272 |
|---|---|
| author | Bozkurt, Alper Kamil Wang, Yu Zavlanos, Michael Pajic, Miroslav |
| author_facet | Bozkurt, Alper Kamil Wang, Yu Zavlanos, Michael Pajic, Miroslav |
| contents | We study the problem of synthesizing control strategies for Linear Temporal Logic (LTL) objectives in unknown environments. We model this problem as a turn-based zero-sum stochastic game between the controller and the environment, where the transition probabilities and the model topology are fully unknown. The winning condition for the controller in this game is the satisfaction of the given LTL specification, which can be captured by the acceptance condition of a deterministic Rabin automaton (DRA) directly derived from the LTL specification. We introduce a model-free reinforcement learning (RL) methodology to find a strategy that maximizes the probability of satisfying a given LTL specification when the Rabin condition of the derived DRA has a single accepting pair. We then generalize this approach to LTL formulas for which the Rabin condition has a larger number of accepting pairs, providing a lower bound on the satisfaction probability. Finally, we illustrate applicability of our RL method on two motion planning case studies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2010_01050 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Model-Free Reinforcement Learning for Stochastic Games with Linear Temporal Logic Objectives Bozkurt, Alper Kamil Wang, Yu Zavlanos, Michael Pajic, Miroslav Robotics Logic in Computer Science We study the problem of synthesizing control strategies for Linear Temporal Logic (LTL) objectives in unknown environments. We model this problem as a turn-based zero-sum stochastic game between the controller and the environment, where the transition probabilities and the model topology are fully unknown. The winning condition for the controller in this game is the satisfaction of the given LTL specification, which can be captured by the acceptance condition of a deterministic Rabin automaton (DRA) directly derived from the LTL specification. We introduce a model-free reinforcement learning (RL) methodology to find a strategy that maximizes the probability of satisfying a given LTL specification when the Rabin condition of the derived DRA has a single accepting pair. We then generalize this approach to LTL formulas for which the Rabin condition has a larger number of accepting pairs, providing a lower bound on the satisfaction probability. Finally, we illustrate applicability of our RL method on two motion planning case studies. |
| title | Model-Free Reinforcement Learning for Stochastic Games with Linear Temporal Logic Objectives |
| topic | Robotics Logic in Computer Science |
| url | https://arxiv.org/abs/2010.01050 |