Reach-avoid Games

Reach-Avoid Games is a subclass of dynamic games in which the fundamental objective is for one set of players to steer the system state into a target set while avoiding an adversarial set, distinguished from other dynamic games by the asymmetric and confluent temporal logic specifications governing reachability and safety objectives.

22

Publications

1.6K

Citations

34

Authors

21

Institutions

Publications per year

2017–2026

14

Authors

34

  1. CJ
    Claire J. Tomlin

    University of California, Berkeley, United States

    5 publications · 441 citations

    5

    h-index

  2. YZ
    Yisheng Zhong

    Tsinghua University, China

    4 publications · 311 citations

    4

    h-index

  3. ZS
    Zongying Shi

    Tsinghua University, China

    4 publications · 311 citations

    4

    h-index

  4. MC
    Mo Chen

    University of California, Berkeley, United States

    4 publications · 357 citations

    4

    h-index

  5. RY
    Rui Yan

    Tsinghua University, China

    4 publications · 311 citations

    4

    h-index

1–5 of 34

Venues

  1. IEEE Transactions on Automatic Control

    3 publications · 428 citations

    3

    h-index

  2. IEEE Transactions on Cybernetics

    2 publications · 214 citations

    2

    h-index

  3. IEEE Robotics and Automation Letters

    2 publications · 196 citations

    2

    h-index

  4. Automatica

    1 publications · 98 citations

    1

    h-index

  5. IEEE Transactions on Robotics

    1 publications · 100 citations

    1

    h-index

1–5