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

Benoit Landry et al. (2018)

> Home

Details and statistics

DOI: 10.1109/IROS.2018.8594078

access: closed

type: Conference or Workshop Paper

metadata version: 2022-12-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iros/LandryCHP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iros/LandryCHP18
Benoit Landry, Mo Chen, Scott Hemley, Marco Pavone:
Reach-Avoid Problems via Sum-or-Squares Optimization and Dynamic Programming. IROS 2018: 4325-4332

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.