{"title":"基于改进概率路线图法的室内机器人路径规划","authors":"Jinfeng Lv, Jianwei Ma, Xiaojing Li","doi":"10.1145/3375998.3376010","DOIUrl":null,"url":null,"abstract":"Aiming at indoor robot path planning, an improved probabilistic road map method is proposed to decide feasible routes for robots. Firstly, the proposed method sets nodes around the obstacles on the map randomly. By connecting starting point, nodes, and ending point, multi alternative practical routes which are not in collision with obstacles can be acquired. Secondly, this paper tries to optimize a route by eliminating unnecessary nodes and repositioning the nodes between starting point and ending point. Finally, the route with the shortest distance and the minimum number of inflection points is chosen as the best route. Experimental results show that, compared with other path planning methods, the improved probabilistic road map method can generate high quality routes rapidly and stably.","PeriodicalId":395773,"journal":{"name":"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Indoor Robot Path Planning Based on an Improved Probabilistic Road Map Method\",\"authors\":\"Jinfeng Lv, Jianwei Ma, Xiaojing Li\",\"doi\":\"10.1145/3375998.3376010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at indoor robot path planning, an improved probabilistic road map method is proposed to decide feasible routes for robots. Firstly, the proposed method sets nodes around the obstacles on the map randomly. By connecting starting point, nodes, and ending point, multi alternative practical routes which are not in collision with obstacles can be acquired. Secondly, this paper tries to optimize a route by eliminating unnecessary nodes and repositioning the nodes between starting point and ending point. Finally, the route with the shortest distance and the minimum number of inflection points is chosen as the best route. Experimental results show that, compared with other path planning methods, the improved probabilistic road map method can generate high quality routes rapidly and stably.\",\"PeriodicalId\":395773,\"journal\":{\"name\":\"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3375998.3376010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3375998.3376010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Indoor Robot Path Planning Based on an Improved Probabilistic Road Map Method
Aiming at indoor robot path planning, an improved probabilistic road map method is proposed to decide feasible routes for robots. Firstly, the proposed method sets nodes around the obstacles on the map randomly. By connecting starting point, nodes, and ending point, multi alternative practical routes which are not in collision with obstacles can be acquired. Secondly, this paper tries to optimize a route by eliminating unnecessary nodes and repositioning the nodes between starting point and ending point. Finally, the route with the shortest distance and the minimum number of inflection points is chosen as the best route. Experimental results show that, compared with other path planning methods, the improved probabilistic road map method can generate high quality routes rapidly and stably.