Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment (Q4556337)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment |
scientific article; zbMATH DE number 6979962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment |
scientific article; zbMATH DE number 6979962 |
Statements
Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment (English)
0 references
15 November 2018
0 references
corner cutting problem
0 references
hyperplane arrangement
0 references
mixed-integer programming (MIP)
0 references
model predictive control (MPC)
0 references
multiobstacle avoidance
0 references
0.8394992
0 references
0.83625287
0 references
0.83530366
0 references
0.8328211
0 references
0.8328211
0 references
0.83079195
0 references
0.82326823
0 references
0.82320356
0 references
0.82090735
0 references
