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

Benoit Landry, Mo Chen, Scott Hemley, Marco Pavone

Browse the full IROS paper archive.