{"title":"Risk-RRT *:一种人-机器人共存环境下的机器人运动规划算法","authors":"Wenzheng Chi, M. Meng","doi":"10.1109/ICAR.2017.8023670","DOIUrl":null,"url":null,"abstract":"In the human robot coexisting environment, to reach the goal efficiently and safely is very meaningful for the mobile service robot. In this paper, a Risk based Rapidly-exploring Random Tree for optimal motion planning (Risk-RRT∗) algorithm is proposed by combining the comfort and collision risk (CCR) map with the RRT∗ algorithm, which provides a variant of the RRT∗ algorithm in the dynamic human robot coexisting environment. In the experiments, the time cost in the navigation process and the length of the trajectory are utilized for the evaluation of the proposed algorithm. A comparison with the Risk-RRT algorithm is carried out and experimental results reveal that our proposed algorithm can achieve a better performance than that of the Risk-RRT in both static and dynamic environments.","PeriodicalId":198633,"journal":{"name":"2017 18th International Conference on Advanced Robotics (ICAR)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Risk-RRT∗: A robot motion planning algorithm for the human robot coexisting environment\",\"authors\":\"Wenzheng Chi, M. Meng\",\"doi\":\"10.1109/ICAR.2017.8023670\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the human robot coexisting environment, to reach the goal efficiently and safely is very meaningful for the mobile service robot. In this paper, a Risk based Rapidly-exploring Random Tree for optimal motion planning (Risk-RRT∗) algorithm is proposed by combining the comfort and collision risk (CCR) map with the RRT∗ algorithm, which provides a variant of the RRT∗ algorithm in the dynamic human robot coexisting environment. In the experiments, the time cost in the navigation process and the length of the trajectory are utilized for the evaluation of the proposed algorithm. A comparison with the Risk-RRT algorithm is carried out and experimental results reveal that our proposed algorithm can achieve a better performance than that of the Risk-RRT in both static and dynamic environments.\",\"PeriodicalId\":198633,\"journal\":{\"name\":\"2017 18th International Conference on Advanced Robotics (ICAR)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 18th International Conference on Advanced Robotics (ICAR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAR.2017.8023670\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th International Conference on Advanced Robotics (ICAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAR.2017.8023670","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Risk-RRT∗: A robot motion planning algorithm for the human robot coexisting environment
In the human robot coexisting environment, to reach the goal efficiently and safely is very meaningful for the mobile service robot. In this paper, a Risk based Rapidly-exploring Random Tree for optimal motion planning (Risk-RRT∗) algorithm is proposed by combining the comfort and collision risk (CCR) map with the RRT∗ algorithm, which provides a variant of the RRT∗ algorithm in the dynamic human robot coexisting environment. In the experiments, the time cost in the navigation process and the length of the trajectory are utilized for the evaluation of the proposed algorithm. A comparison with the Risk-RRT algorithm is carried out and experimental results reveal that our proposed algorithm can achieve a better performance than that of the Risk-RRT in both static and dynamic environments.