Dynamic Programming and Optimal Control, Vol. I, 4th Edition / Dimitri Bertsekas
| List Price: | |
Our Price: $84.55 | |
|
For Bulk orders
| |
|
Used Book Price: $41.08 | |
| Dynamic Programming and Optimal Control, Vol. I, 4th Edition / Dimitri Bertsekas | |
| Publisher: Athena Scientific | |
| Availability:Usually ships in 24 hours | |
| Sales Rank: 131753 | |
|
This 4th edition is a major revision of Vol. I of the leading two-volume dynamic programming textbook by Bertsekas, and contains a substantial amount of new material, particularly on approximate DP in Chapter 6. This chapter was thoroughly reorganized and rewritten, to bring it in line, both with the contents of Vol. II, whose latest edition appeared in 2012, and with recent developments, which have propelled approximate DP to the forefront of attention.
Some of the highlights of the revision of Chapter 6 are an increased emphasis on one-step and multistep lookahead methods, parametric approximation architectures, neural networks, rollout, and Monte Carlo tree search. Among other applications, these methods have been instrumental in the recent spectacular success of computer Go programs. The material on approximate DP also provides an introduction and some perspective for the more analytically oriented treatment of Vol. II.
The book includes a substantial number of examples, and exercises, detailed solutions of many of which are posted on the internet. It was developed through teaching graduate courses at M.I.T., and is supported by a large amount of educational material, such as slides and videos, posted at the MIT Open Courseware, the author's, and the publisher's web sites.
Contents: 1. The Dynamic Programming Algorithm. 2. Deterministic Systems and the Shortest Path
Problem. 3. Problems with Perfect State Information. 4. Problems with Imperfect State Information. 5. Introduction to Infinite Horizon Problems. 6. Approximate Dynamic Programming. 7. Deterministic Continuous-Time Optimal Control.
Now you can buy Books online in USA,UK, India and more than 100 countries.
*Terms and Conditions apply
Disclaimer: All product data on this page belongs to
.
No guarantees are made as to accuracy of prices and information.
Some of the highlights of the revision of Chapter 6 are an increased emphasis on one-step and multistep lookahead methods, parametric approximation architectures, neural networks, rollout, and Monte Carlo tree search. Among other applications, these methods have been instrumental in the recent spectacular success of computer Go programs. The material on approximate DP also provides an introduction and some perspective for the more analytically oriented treatment of Vol. II.
The book includes a substantial number of examples, and exercises, detailed solutions of many of which are posted on the internet. It was developed through teaching graduate courses at M.I.T., and is supported by a large amount of educational material, such as slides and videos, posted at the MIT Open Courseware, the author's, and the publisher's web sites.
Contents: 1. The Dynamic Programming Algorithm. 2. Deterministic Systems and the Shortest Path
Problem. 3. Problems with Perfect State Information. 4. Problems with Imperfect State Information. 5. Introduction to Infinite Horizon Problems. 6. Approximate Dynamic Programming. 7. Deterministic Continuous-Time Optimal Control.
Now you can buy Books online in USA,UK, India and more than 100 countries.
*Terms and Conditions apply
Disclaimer: All product data on this page belongs to
.No guarantees are made as to accuracy of prices and information.
