{"title":"应用自适应迭代学习算法进行自主机器人吸尘器路径规划","authors":"Ying-Wen Bai, Ming-Feng Hsueh","doi":"10.1109/GCCE.2012.6379640","DOIUrl":null,"url":null,"abstract":"In this paper we propose the design of an autonomous robotic vacuum cleaner by using three-dimensional vector coordinates to guide its path. Our design is fully adapted to planning an effective mode for completing the cleaning task in an unknown environment. In addition we propose a dynamic return path for recharging, including the relative coordinates of the record starting point and the current position. The cleaner calculates the distance from the location of the base and then plans the return path.","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Using an adaptive iterative learning algorithm for planning of the path of an autonomous robotic vacuum cleaner\",\"authors\":\"Ying-Wen Bai, Ming-Feng Hsueh\",\"doi\":\"10.1109/GCCE.2012.6379640\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose the design of an autonomous robotic vacuum cleaner by using three-dimensional vector coordinates to guide its path. Our design is fully adapted to planning an effective mode for completing the cleaning task in an unknown environment. In addition we propose a dynamic return path for recharging, including the relative coordinates of the record starting point and the current position. The cleaner calculates the distance from the location of the base and then plans the return path.\",\"PeriodicalId\":299732,\"journal\":{\"name\":\"The 1st IEEE Global Conference on Consumer Electronics 2012\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 1st IEEE Global Conference on Consumer Electronics 2012\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCCE.2012.6379640\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 1st IEEE Global Conference on Consumer Electronics 2012","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCCE.2012.6379640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Using an adaptive iterative learning algorithm for planning of the path of an autonomous robotic vacuum cleaner
In this paper we propose the design of an autonomous robotic vacuum cleaner by using three-dimensional vector coordinates to guide its path. Our design is fully adapted to planning an effective mode for completing the cleaning task in an unknown environment. In addition we propose a dynamic return path for recharging, including the relative coordinates of the record starting point and the current position. The cleaner calculates the distance from the location of the base and then plans the return path.