2023
DOI: 10.1109/tac.2022.3195431
|View full text |Cite
|
Sign up to set email alerts
|

Reactive Symbolic Planning and Control in Dynamic Adversarial Environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 54 publications
0
1
0
Order By: Relevance
“…HJ methods [6] intrinsically can deal with general obstacle environments, but they require the state space discretization (thus suffer from loss of accuracy), and are limited to systems up to about five states in practice [5]. The same scalability issue exists when approximating the game as a finite-state model and then synthesizing the strategies using LTL algorithms [32]. Efficient algorithms have been proposed with restrictions, such as discrete-time dynamics and linear-quadratic approximations [1].…”
Section: Introductionmentioning
confidence: 99%
“…HJ methods [6] intrinsically can deal with general obstacle environments, but they require the state space discretization (thus suffer from loss of accuracy), and are limited to systems up to about five states in practice [5]. The same scalability issue exists when approximating the game as a finite-state model and then synthesizing the strategies using LTL algorithms [32]. Efficient algorithms have been proposed with restrictions, such as discrete-time dynamics and linear-quadratic approximations [1].…”
Section: Introductionmentioning
confidence: 99%