89 search results - page 11 / 18 » Stable Function Approximation in Dynamic Programming |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
UAI
1997
13 years 8 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
CDC
2010
IEEE
2010
IEEE
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
13 years 2 months ago
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
ISCAPDCS
2004
13 years 8 months ago
2004
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...