TY - JOUR
T1 - A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
AU - Eder, Michael
AU - Skibinski, Sebastian
AU - Ulbrich, Michael
N1 - Publisher Copyright:
© 2022, The Author(s).
PY - 2023/6
Y1 - 2023/6
N2 - We derive a generic system that constructs an optimization model for an emergency stop scenario on the highway, based on map data from high definition maps that are used in Advanced Driver Assistance Systems (ADAS) and in Highly Automated Driving (HAD). New additional situative and scenario-based information is computed by applying a global maximization approach to the model. For this purpose, we develop two new rigorous and deterministic branch-and-bound algorithms that both determine the certified global optimal value up to a predefined tolerance. The underlying interval optimization algorithm, which uses first-order techniques, is enhanced by one of two second-order methods that are applied for specifically selected intervals. We investigate two approaches that either compute a concave overestimator for the objective function or approximate the function with a quadratic polynomial using Taylor expansion. We show the limits of interval arithmetic in our problem, especially for the interval versions of the derivatives, and present a local linearization of the curve data that improves the results significantly. The presented novel method for deriving secondary information is compared to state of the art methods on two exemplary and for the automotive context representative scenarios to show the advantages of our approach.
AB - We derive a generic system that constructs an optimization model for an emergency stop scenario on the highway, based on map data from high definition maps that are used in Advanced Driver Assistance Systems (ADAS) and in Highly Automated Driving (HAD). New additional situative and scenario-based information is computed by applying a global maximization approach to the model. For this purpose, we develop two new rigorous and deterministic branch-and-bound algorithms that both determine the certified global optimal value up to a predefined tolerance. The underlying interval optimization algorithm, which uses first-order techniques, is enhanced by one of two second-order methods that are applied for specifically selected intervals. We investigate two approaches that either compute a concave overestimator for the objective function or approximate the function with a quadratic polynomial using Taylor expansion. We show the limits of interval arithmetic in our problem, especially for the interval versions of the derivatives, and present a local linearization of the curve data that improves the results significantly. The presented novel method for deriving secondary information is compared to state of the art methods on two exemplary and for the automotive context representative scenarios to show the advantages of our approach.
KW - Automated driving
KW - B-spline curves
KW - Deterministic global optimization
KW - Gaussian kernel
KW - High definition map data
KW - Interval arithmetic
UR - http://www.scopus.com/inward/record.url?scp=85142911841&partnerID=8YFLogxK
U2 - 10.1007/s11081-022-09729-0
DO - 10.1007/s11081-022-09729-0
M3 - Article
AN - SCOPUS:85142911841
SN - 1389-4420
VL - 24
SP - 1225
EP - 1265
JO - Optimization and Engineering
JF - Optimization and Engineering
IS - 2
ER -