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
Parents
22
Reach-avoid problems with time-varying dynamics, targets and constraints
Jaime F. Fisac, Mo Chen, Claire J. Tomlin et al. · 2015 · 214 citations
1–5 of 22
34
5
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 34
21
University of California, Berkeley
Berkeley, United States
6 h-index
16 publications
1.7K citations
Stanford University
Stanford, United States
5 h-index
8 publications
441 citations
Tsinghua University
Beijing, China
4 h-index
12 publications
1.2K citations
ETH Zurich
Zurich, Switzerland
2 h-index
4 publications
518 citations

Johns Hopkins University Applied Physics Laboratory
North Laurel, United States
2 h-index
3 publications
39 citations
University of California, Los Angeles
Los Angeles, United States
1 h-index
1 publications
22 citations
The University of Texas at Austin
Austin, United States
1 h-index
2 publications
142 citations
Dynamic Systems (United States)
Austin, United States
1 h-index
1 publications
98 citations
1–8 of 21
3 publications · 428 citations
3
h-index
2 publications · 214 citations
2
h-index
2 publications · 196 citations
2
h-index
1 publications · 98 citations
1
h-index
1 publications · 100 citations
1
h-index
1–5