Iterative Dynamic Programming
Dynamic programming is a powerful method for solving optimization problems, but has a number of drawbacks that limit its use to solving problems of very low dimension. To overcome these limitations, author Rein Luus suggested using it in an iterative fashion. Although this method required vast computer resources, modifications to his original scheme have made the computational procedure feasible.
With iteration, dynamic programming becomes an effective optimization procedure for very high-dimensional optimal control problems and has demonstrated applicability to singular control problems. Recently, iterative dynamic programming (IDP) has been refined to handle inequality state constraints and noncontinuous functions.
Iterative Dynamic Programming offers a comprehensive presentation of this powerful tool. It brings together the results of work carried out by the author and others - previously available only in scattered journal articles - along with the insight that led to its development. The author provides the necessary background, examines the effects of the parameters involved, and clearly illustrates IDP's advantages.
1101428198
With iteration, dynamic programming becomes an effective optimization procedure for very high-dimensional optimal control problems and has demonstrated applicability to singular control problems. Recently, iterative dynamic programming (IDP) has been refined to handle inequality state constraints and noncontinuous functions.
Iterative Dynamic Programming offers a comprehensive presentation of this powerful tool. It brings together the results of work carried out by the author and others - previously available only in scattered journal articles - along with the insight that led to its development. The author provides the necessary background, examines the effects of the parameters involved, and clearly illustrates IDP's advantages.
Iterative Dynamic Programming
Dynamic programming is a powerful method for solving optimization problems, but has a number of drawbacks that limit its use to solving problems of very low dimension. To overcome these limitations, author Rein Luus suggested using it in an iterative fashion. Although this method required vast computer resources, modifications to his original scheme have made the computational procedure feasible.
With iteration, dynamic programming becomes an effective optimization procedure for very high-dimensional optimal control problems and has demonstrated applicability to singular control problems. Recently, iterative dynamic programming (IDP) has been refined to handle inequality state constraints and noncontinuous functions.
Iterative Dynamic Programming offers a comprehensive presentation of this powerful tool. It brings together the results of work carried out by the author and others - previously available only in scattered journal articles - along with the insight that led to its development. The author provides the necessary background, examines the effects of the parameters involved, and clearly illustrates IDP's advantages.
With iteration, dynamic programming becomes an effective optimization procedure for very high-dimensional optimal control problems and has demonstrated applicability to singular control problems. Recently, iterative dynamic programming (IDP) has been refined to handle inequality state constraints and noncontinuous functions.
Iterative Dynamic Programming offers a comprehensive presentation of this powerful tool. It brings together the results of work carried out by the author and others - previously available only in scattered journal articles - along with the insight that led to its development. The author provides the necessary background, examines the effects of the parameters involved, and clearly illustrates IDP's advantages.
240.0
In Stock
5
1

Iterative Dynamic Programming
342
Iterative Dynamic Programming
342
240.0
In Stock
Product Details
ISBN-13: | 9781584881483 |
---|---|
Publisher: | Taylor & Francis |
Publication date: | 01/27/2000 |
Series: | Monographs and Surveys in Pure and Applied Mathematics , #110 |
Pages: | 342 |
Product dimensions: | 6.12(w) x 9.19(h) x (d) |
From the B&N Reads Blog