AbstractDynamic programming is a general problem-solving technique that has been widely used in various fields such as control theory, operations research, biology and computer science. In many applications dynamic programming problems satisfy additional conditions of convexity, concavity and sparsity. This paper presents a classification of dynamic programming problems and surveys efficient algorithms based on the three conditions
Dynamic programming is a mathematical technique for solving certain types of sequential decision pro...
This paper reviews a variety of ways to use trajectory optimization to accelerate dynamic programmin...
The calculus of variations is the theoretical method for finding the extremum of functionals such as...
AbstractDynamic programming is a general problem-solving technique that has been widely used in vari...
Dynamic programming is a mathematical technique which provides a systematic procedure for determinin...
This paper is a survey of dynamic programming algorithms for problems in computer science. For each ...
The fundamental goal, in preparing this thesis, is two-fold. First, the author shows the systematic ...
frobertcmeyerpsteffengtechfakunibielefeldde Abstract Dynamic programming is a classic programming t...
Convexity, though extremely important in mathematical programming, has not drawn enough attention in...
This paper explores sufficient conditions for a continuous stationary Markov optimal policy and a co...
Abstract—The idea of dynamic programming is general and very simple, but the “curse of dimensionalit...
Introduction to Dynamic Programming provides information pertinent to the fundamental aspects of dyn...
AbstractThis paper presents a method for obtaining closed form solutions to serial and nonserial dyn...
Convex programming is the simplest and best processed area of nonlinear programming. Many propertie...
2017-07-19Dynamic programming has become a common method in practice in solving optimization problem...
Dynamic programming is a mathematical technique for solving certain types of sequential decision pro...
This paper reviews a variety of ways to use trajectory optimization to accelerate dynamic programmin...
The calculus of variations is the theoretical method for finding the extremum of functionals such as...
AbstractDynamic programming is a general problem-solving technique that has been widely used in vari...
Dynamic programming is a mathematical technique which provides a systematic procedure for determinin...
This paper is a survey of dynamic programming algorithms for problems in computer science. For each ...
The fundamental goal, in preparing this thesis, is two-fold. First, the author shows the systematic ...
frobertcmeyerpsteffengtechfakunibielefeldde Abstract Dynamic programming is a classic programming t...
Convexity, though extremely important in mathematical programming, has not drawn enough attention in...
This paper explores sufficient conditions for a continuous stationary Markov optimal policy and a co...
Abstract—The idea of dynamic programming is general and very simple, but the “curse of dimensionalit...
Introduction to Dynamic Programming provides information pertinent to the fundamental aspects of dyn...
AbstractThis paper presents a method for obtaining closed form solutions to serial and nonserial dyn...
Convex programming is the simplest and best processed area of nonlinear programming. Many propertie...
2017-07-19Dynamic programming has become a common method in practice in solving optimization problem...
Dynamic programming is a mathematical technique for solving certain types of sequential decision pro...
This paper reviews a variety of ways to use trajectory optimization to accelerate dynamic programmin...
The calculus of variations is the theoretical method for finding the extremum of functionals such as...
DOI
Add to ORKG