Admissibility Over Winning: A New Approach to Reactive Synthesis in Robotics
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914969548750848 |
|---|---|
| author | Muvvala, Karan Lahijanian, Morteza |
| author_facet | Muvvala, Karan Lahijanian, Morteza |
| contents | Reactive synthesis is a framework for modeling and automatically synthesizing strategies in robotics, typically through computing a \emph{winning} strategy in a 2-player game between the robot and the environment. Winning strategies, however, do not always exist, even in some simple cases. In such situations, it is still desirable for the robot to attempt its task rather than "giving up". In this work, we explore the notion of admissibility to define strategies beyond winning, tailored specifically for robotic systems. We introduce an ordering of admissible strategies and define \emph{admissibly rational strategies}, which aim to be winning and cooperative when possible, and non-violating and hopeful when necessary. We present an efficient synthesis algorithm and demonstrate that admissibly rational strategies produce desirable behaviors through case studies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_04573 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Admissibility Over Winning: A New Approach to Reactive Synthesis in Robotics Muvvala, Karan Lahijanian, Morteza Robotics Formal Languages and Automata Theory Computer Science and Game Theory Reactive synthesis is a framework for modeling and automatically synthesizing strategies in robotics, typically through computing a \emph{winning} strategy in a 2-player game between the robot and the environment. Winning strategies, however, do not always exist, even in some simple cases. In such situations, it is still desirable for the robot to attempt its task rather than "giving up". In this work, we explore the notion of admissibility to define strategies beyond winning, tailored specifically for robotic systems. We introduce an ordering of admissible strategies and define \emph{admissibly rational strategies}, which aim to be winning and cooperative when possible, and non-violating and hopeful when necessary. We present an efficient synthesis algorithm and demonstrate that admissibly rational strategies produce desirable behaviors through case studies. |
| title | Admissibility Over Winning: A New Approach to Reactive Synthesis in Robotics |
| topic | Robotics Formal Languages and Automata Theory Computer Science and Game Theory |
| url | https://arxiv.org/abs/2410.04573 |