{"title":"基于回溯的强化学习优化路径规划","authors":"Morteza Kiadi, Qing Tan, J. Villar","doi":"10.32474/CTCSA.2019.01.000116","DOIUrl":null,"url":null,"abstract":"There exist many solutions to the maze pathfinding problem\nfor more than three decays. The problem is referred to as maze\npathfinding, maze navigation, micro mouse and indoor robot\npathfinding","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimized Path Planning in Reinforcement Learning by Backtracking\",\"authors\":\"Morteza Kiadi, Qing Tan, J. Villar\",\"doi\":\"10.32474/CTCSA.2019.01.000116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There exist many solutions to the maze pathfinding problem\\nfor more than three decays. The problem is referred to as maze\\npathfinding, maze navigation, micro mouse and indoor robot\\npathfinding\",\"PeriodicalId\":303860,\"journal\":{\"name\":\"Current Trends in Computer Sciences & Applications\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Current Trends in Computer Sciences & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.32474/CTCSA.2019.01.000116\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Current Trends in Computer Sciences & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32474/CTCSA.2019.01.000116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimized Path Planning in Reinforcement Learning by Backtracking
There exist many solutions to the maze pathfinding problem
for more than three decays. The problem is referred to as maze
pathfinding, maze navigation, micro mouse and indoor robot
pathfinding
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
