Buch, Englisch, 317 Seiten, Format (B × H): 155 mm x 235 mm
Buch, Englisch, 317 Seiten, Format (B × H): 155 mm x 235 mm
Reihe: Communications and Control Engineering
ISBN: 978-3-032-40401-5
Verlag: Springer
The book is written from the perspective of the optimal feedback control of dynamic systems that evolve in either continuous- or discrete-time domains with emphasis on deterministic problem formulations over the corresponding stochastic problem formulations. Bellman's dynamic programming—optimal feedback control—in continuous- and discrete-time domains forms the mathematical foundations of this book. In a simple and clear manner, this book relates the relation of one of the main techniques of the reinforcement learning approach in computer science, so-called Q-learning, to the Bellman dynamic programming functional difference equation.
contains several exercises, homework problems, and design projects (most using MATLAB® and Simulink® and some using Python) for real physical engineering systems. The book is a valuable reference for all researchers and practitioners interested in an engineering approach to reinforcement learning because it covers many essential results in a systematic manner. The book also presents and defines several future interesting and challenging research problems by providing a deeper physical and mathematical understanding of the optimal control Hamiltonians from the reinforcement learning point of view.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Maschinelles Lernen
- Technische Wissenschaften Elektronik | Nachrichtentechnik Nachrichten- und Kommunikationstechnik Regelungstechnik
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Kybernetik, Systemtheorie, Komplexe Systeme
Weitere Infos & Material
Introduction.- Dynamic Programming in Continuous Time.- Dynamic Programming (DP) in Discrete Time.- Hamiltonians and Their Physical and Mathematical Meanings.- Approximate Dynamic Programming (ADP) in Continuous Time.- Approximate Dynamic Programming (ADP) in Discrete Time.- Dynamic Programming for Zero-Sum Differential Games.- Dynamic Programming for Nash Differential Games.- ADP for Zero-Sum Dynamic Games.- ADP for Non-Zero Sum Nash Dynamic Games.- RL for Other Types of Differential Games.- Markov Decision Processes and Stochastic Dynamic Programming.- Reinforcement Learning Design Projects.- Conclusions and Future Work.- Appendix.




