{"title":"Adaptive Dynamic Programming: An Introduction","authors":"Fei-Yue Wang, Huaguang Zhang, Derong Liu","doi":"10.1109/MCI.2009.932261","DOIUrl":null,"url":null,"abstract":"In this article, we introduce some recent research trends within the field of adaptive/approximate dynamic programming (ADP), including the variations on the structure of ADP schemes, the development of ADP algorithms and applications of ADP schemes. For ADP algorithms, the point of focus is that iterative algorithms of ADP can be sorted into two classes: one class is the iterative algorithm with initial stable policy; the other is the one without the requirement of initial stable policy. It is generally believed that the latter one has less computation at the cost of missing the guarantee of system stability during iteration process. In addition, many recent papers have provided convergence analysis associated with the algorithms developed. Furthermore, we point out some topics for future studies.","PeriodicalId":55027,"journal":{"name":"IEEE Computational Intelligence Magazine","volume":"45 1","pages":""},"PeriodicalIF":7.7000,"publicationDate":"2009-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/MCI.2009.932261","citationCount":"761","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Computational Intelligence Magazine","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/MCI.2009.932261","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 761
Abstract
In this article, we introduce some recent research trends within the field of adaptive/approximate dynamic programming (ADP), including the variations on the structure of ADP schemes, the development of ADP algorithms and applications of ADP schemes. For ADP algorithms, the point of focus is that iterative algorithms of ADP can be sorted into two classes: one class is the iterative algorithm with initial stable policy; the other is the one without the requirement of initial stable policy. It is generally believed that the latter one has less computation at the cost of missing the guarantee of system stability during iteration process. In addition, many recent papers have provided convergence analysis associated with the algorithms developed. Furthermore, we point out some topics for future studies.
期刊介绍:
The IEEE Computational Intelligence Magazine (CIM) is a peer-reviewed publication that focuses on computational intelligence design and applications. It aims to present emerging novel discoveries, important insights, and tutorial surveys in this field. CIM serves as a means of communication between the governing body and members of the IEEE Computational Intelligence Society (IEEE/CIS).
The magazine encourages authors to submit papers on various topics, including applications oriented developments, successful industrial implementations, design tools, technology reviews, computational intelligence education, and applied research. Contributions should contain novel and previously unpublished material. The novelty can be in the form of original concepts, results, techniques, observations, hardware/software implementations, or applications. Syntheses or new insights into previously reported research are also welcomed. Surveys and expository submissions are highly encouraged.
Generally, material that has been previously copyrighted, published, or accepted for publication will not be considered for publication in CIM. However, prior preliminary or abbreviated publication of the material will not necessarily preclude publication in this journal.