{"title":"基于回溯卡尔曼滤波器的q -学习","authors":"Kei Takahata, T. Miura","doi":"10.1109/IIAI-AAI50415.2020.00063","DOIUrl":null,"url":null,"abstract":"Reinforcement Learning allows us to acquire knowledge without any training data. However, for learning it takes time. We discuss a case in which an agent receives a large negative reward. We assume that the reverse action allows us to improve the current situation. In this work, we propose a method to perform Reverse action by using Retrospective Kalman Filter that estimates the state one step before. We show an experience by a Hunter Prey problem. And discuss the usefulness of our proposed method.","PeriodicalId":188870,"journal":{"name":"2020 9th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Q-Learning using Retrospective Kalman Filters\",\"authors\":\"Kei Takahata, T. Miura\",\"doi\":\"10.1109/IIAI-AAI50415.2020.00063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reinforcement Learning allows us to acquire knowledge without any training data. However, for learning it takes time. We discuss a case in which an agent receives a large negative reward. We assume that the reverse action allows us to improve the current situation. In this work, we propose a method to perform Reverse action by using Retrospective Kalman Filter that estimates the state one step before. We show an experience by a Hunter Prey problem. And discuss the usefulness of our proposed method.\",\"PeriodicalId\":188870,\"journal\":{\"name\":\"2020 9th International Congress on Advanced Applied Informatics (IIAI-AAI)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 9th International Congress on Advanced Applied Informatics (IIAI-AAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIAI-AAI50415.2020.00063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 9th International Congress on Advanced Applied Informatics (IIAI-AAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIAI-AAI50415.2020.00063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reinforcement Learning allows us to acquire knowledge without any training data. However, for learning it takes time. We discuss a case in which an agent receives a large negative reward. We assume that the reverse action allows us to improve the current situation. In this work, we propose a method to perform Reverse action by using Retrospective Kalman Filter that estimates the state one step before. We show an experience by a Hunter Prey problem. And discuss the usefulness of our proposed method.