"Reach-Avoid Problems via Sum-of-Squares Optimization and Dynamic Programming."

Benoit Landry et al. (2018)
a service of Schloss Dagstuhl - Leibniz Center for Informatics