A convex optimization method, based on a probabilistic reformulation of control inputs, computes and iteratively enlarges controlled reach-avoid sets for discrete-time polynomial systems.
The MIT Press (2015)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization
A convex optimization method, based on a probabilistic reformulation of control inputs, computes and iteratively enlarges controlled reach-avoid sets for discrete-time polynomial systems.