On smooth relaxations of obstacle sets
- 229 Downloads
We consider the problem of avoiding obstacle sets described by finitely many smooth convex inequality constraints, as it frequently occurs in, for example, trajectory or location planning. We present and discuss a general method to relax such sets by the upper level set of a single smooth convex function, covering different smoothing approaches like hyperbolic and entropic smoothing.
Based on error bounds and Lipschitz continuity, special attention is paid to the computations of the maximal geometric approximation error and of a guaranteed safety margin. Our results thus allow to safely avoid the obstacle by obeying a single nonconvex smooth constraint. Numerical results indicate that our technique gives rise to smoothing methods which perform well even for smoothing parameters very close to zero.
KeywordsRelaxation Error bound Lipschitz continuity Hyperbolic smoothing Entropic smoothing Obstacle problem
We thank two anonymous referees for their precise and substantial remarks which helped to significantly improve this paper. The first author also wishes to thank Adil Bagirov and Diethard Klatte for bringing the references (Li and Fang 1997) and (Klatte 1998; Klatte and Thiere 1996), respectively, to his attention.
- Birbil SI, Fang S-C, Frenk JBG, Zhang S (2003) Recursive approximation of the high dimensional max function. Report No. ERS-2003-003-LIS, Erasmus Research Institute of Management, Erasmus Universiteit Rotterdam Google Scholar
- Klatte D (1998) Hoffman’s error bound for systems of convex inequalities. In: Fiacco AV (ed) Mathematical programming with data perturbations. Marcel Dekker, New York, pp 185–199 Google Scholar
- Smale S (1987) Algorithms for solving equations. In: Proceedings of the international congress of mathematicians. AMS, Providence, pp 172–195 Google Scholar
- Steuermann P (2012) NLPSOLVER ver. 0.0.1-0002. http://kop.ior.kit.edu/downloads.php