{"title":"机器人路径规划的动态路径优化","authors":"Ying Huang, Yingxu Wang, Omar A. Zatarain","doi":"10.1109/ICCICC46617.2019.9146050","DOIUrl":null,"url":null,"abstract":"Robot is an autonomous system that integrates advances AI technologies. This paper deals with the adaptive path planning and optimization problems for robots in dynamic environments. We propose a novel route planning method based on the maze representation of workplace layouts. We generate a universal path tree by a path optimization algorithm. Then, any given entrances and exits of target nodes can be reduced to a deterministic path searching problem. Our method can quickly determine the optimal path between any pair of entrance/exit nodes. The maze-based method provides an efficient and robust route planning solution for robots in real-time and dynamic workplaces. Experiments have demonstrated the effectiveness of the method beyond traditional heuristic technologies.","PeriodicalId":294902,"journal":{"name":"2019 IEEE 18th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic Path Optimization for Robot Route Planning\",\"authors\":\"Ying Huang, Yingxu Wang, Omar A. Zatarain\",\"doi\":\"10.1109/ICCICC46617.2019.9146050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Robot is an autonomous system that integrates advances AI technologies. This paper deals with the adaptive path planning and optimization problems for robots in dynamic environments. We propose a novel route planning method based on the maze representation of workplace layouts. We generate a universal path tree by a path optimization algorithm. Then, any given entrances and exits of target nodes can be reduced to a deterministic path searching problem. Our method can quickly determine the optimal path between any pair of entrance/exit nodes. The maze-based method provides an efficient and robust route planning solution for robots in real-time and dynamic workplaces. Experiments have demonstrated the effectiveness of the method beyond traditional heuristic technologies.\",\"PeriodicalId\":294902,\"journal\":{\"name\":\"2019 IEEE 18th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 18th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCICC46617.2019.9146050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 18th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCICC46617.2019.9146050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic Path Optimization for Robot Route Planning
Robot is an autonomous system that integrates advances AI technologies. This paper deals with the adaptive path planning and optimization problems for robots in dynamic environments. We propose a novel route planning method based on the maze representation of workplace layouts. We generate a universal path tree by a path optimization algorithm. Then, any given entrances and exits of target nodes can be reduced to a deterministic path searching problem. Our method can quickly determine the optimal path between any pair of entrance/exit nodes. The maze-based method provides an efficient and robust route planning solution for robots in real-time and dynamic workplaces. Experiments have demonstrated the effectiveness of the method beyond traditional heuristic technologies.