most citedReach-Avoid Problems via Sum-of-Squares Optimization and Dynamic Programming

5 citations · 5 across the 1 of their papers we have counts for

collaborators

1 paper

eess.SY2018★ 5 cited

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

Benoit Landry, Mo Chen, Scott Hemley +1

Reach-avoid problems involve driving a system to a set of desirable configurations while keeping it away from undesirable ones. Providing mathematical guarantees for such scenarios…