{"title":"时序决策过程的改进动态规划算法及其在电力系统经济调度中的应用","authors":"M. Sun","doi":"10.1109/SSST.1993.522757","DOIUrl":null,"url":null,"abstract":"A typical model for problems involving sequential decision processes in a discrete-time setting is considered. Several means to improve the regular dynamic programming method for solving the model problem are proposed. Reducing the sizes of the state and control domains is the key objective for improving efficiency. Theoretical justification of the domain reduction idea is provided.","PeriodicalId":260036,"journal":{"name":"1993 (25th) Southeastern Symposium on System Theory","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Improved dynamic programming algorithms for sequential decision processes with applications to economic dispatches of power systems\",\"authors\":\"M. Sun\",\"doi\":\"10.1109/SSST.1993.522757\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A typical model for problems involving sequential decision processes in a discrete-time setting is considered. Several means to improve the regular dynamic programming method for solving the model problem are proposed. Reducing the sizes of the state and control domains is the key objective for improving efficiency. Theoretical justification of the domain reduction idea is provided.\",\"PeriodicalId\":260036,\"journal\":{\"name\":\"1993 (25th) Southeastern Symposium on System Theory\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 (25th) Southeastern Symposium on System Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSST.1993.522757\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 (25th) Southeastern Symposium on System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1993.522757","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improved dynamic programming algorithms for sequential decision processes with applications to economic dispatches of power systems
A typical model for problems involving sequential decision processes in a discrete-time setting is considered. Several means to improve the regular dynamic programming method for solving the model problem are proposed. Reducing the sizes of the state and control domains is the key objective for improving efficiency. Theoretical justification of the domain reduction idea is provided.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
