Reach-Avoid Problems via Sum-or-Squares Optimization and Dynamic Programming. - Benoit Landry; Mo Chen 001; Scott Hemley; Marco Pavone 001 (IROS, 2018)

Reach-Avoid Problems via Sum-of-Squares Optimization and Dynamic Programming. - Benoit Landry; Mo Chen 001; Scott Hemley; Marco Pavone 001 (CoRR, 2018)