PUMA publications for /tag/techniques%20programming%20kernelWed Sep 29 14:35:10 CEST 2021IFAC-PapersOnLine9th Vienna International Conference on Mathematical Modelling2307--312Data-driven surrogates of value functions and applications to feedback control for dynamical systems512018Kernel anm approximation, control, dynamic feedback from:britsteiner greedy ians optimal principle, programming techniques Dealing with high-dimensional feedback control problems is a difficult task when the classical dynamic programming principle is applied. Existing techniques restrict the application to relatively low dimensions since the discretizations typically suffer from the curse of dimensionality. In this paper we introduce a novel approximation technique for the value function of an infinite horizon optimal control. The method is based on solving optimal open loop control problems on a finite horizon with a sampling of the global value function along the generated trajectories. For the interpolation we choose a kernel orthogonal greedy strategy, because these methods are able to produce extreme sparse surrogates and enable rapid evaluations in high dimensions. Two numerical examples prove the performance of the approach and show that the method is able to deal with high-dimensional feedback control problems, where the dimensionality prevents the approximation by most existing methods.Wed Sep 29 14:33:27 CEST 2021IFAC-PapersOnLine9th Vienna International Conference on Mathematical Modelling2307--312Data-driven surrogates of value functions and applications to feedback control for dynamical systems512018Kernel anm approximation, control, dynamic feedback greedy ians optimal principle, programming techniques Dealing with high-dimensional feedback control problems is a difficult task when the classical dynamic programming principle is applied. Existing techniques restrict the application to relatively low dimensions since the discretizations typically suffer from the curse of dimensionality. In this paper we introduce a novel approximation technique for the value function of an infinite horizon optimal control. The method is based on solving optimal open loop control problems on a finite horizon with a sampling of the global value function along the generated trajectories. For the interpolation we choose a kernel orthogonal greedy strategy, because these methods are able to produce extreme sparse surrogates and enable rapid evaluations in high dimensions. Two numerical examples prove the performance of the approach and show that the method is able to deal with high-dimensional feedback control problems, where the dimensionality prevents the approximation by most existing methods.techniques programming kernelCommunity for tag(s) techniques programming kernel