{"title":"一种改进的跳跃点搜索算法用于家庭服务机器人路径规划","authors":"Li Ma, Xiang Gao, Yingxun Fu, Dongchao Ma","doi":"10.1109/CCDC.2019.8833422","DOIUrl":null,"url":null,"abstract":"When the jump point search algorithm is applied to robot path planning, there are problems such as many redundant path points, large cumulative turning angle and the robot incapable of adjusting its posture at the path point. This paper proposes an improved jump point search algorithm, which checks the connectivity between the previous point and the last point of each original point. It also uses vector cross product to identify the direction of the next path point relative to the current path point. The vector dot product is adopted to calculate the rotation angle of the current path point. Three evaluation indicators, such as the number of path points, the total path length and the cumulative turning angle, are formulated to judge the merits and demerits of the optimized algorithm. The experimental results show that on the map of scene 1, improved jump point search algorithm reduces the path points from 9 to 7, with total path length decreased by about 12%, and cumulative turning angle decreased by about 27%. The improved jump point search algorithm is designed to obtain a shorter final path, a smaller cumulative turning angle, and to able robot to adjust posture at the path point.","PeriodicalId":254705,"journal":{"name":"2019 Chinese Control And Decision Conference (CCDC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"An Improved Jump Point Search Algorithm for Home Service Robot Path Planning\",\"authors\":\"Li Ma, Xiang Gao, Yingxun Fu, Dongchao Ma\",\"doi\":\"10.1109/CCDC.2019.8833422\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When the jump point search algorithm is applied to robot path planning, there are problems such as many redundant path points, large cumulative turning angle and the robot incapable of adjusting its posture at the path point. This paper proposes an improved jump point search algorithm, which checks the connectivity between the previous point and the last point of each original point. It also uses vector cross product to identify the direction of the next path point relative to the current path point. The vector dot product is adopted to calculate the rotation angle of the current path point. Three evaluation indicators, such as the number of path points, the total path length and the cumulative turning angle, are formulated to judge the merits and demerits of the optimized algorithm. The experimental results show that on the map of scene 1, improved jump point search algorithm reduces the path points from 9 to 7, with total path length decreased by about 12%, and cumulative turning angle decreased by about 27%. The improved jump point search algorithm is designed to obtain a shorter final path, a smaller cumulative turning angle, and to able robot to adjust posture at the path point.\",\"PeriodicalId\":254705,\"journal\":{\"name\":\"2019 Chinese Control And Decision Conference (CCDC)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Chinese Control And Decision Conference (CCDC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCDC.2019.8833422\",\"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 Chinese Control And Decision Conference (CCDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC.2019.8833422","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Improved Jump Point Search Algorithm for Home Service Robot Path Planning
When the jump point search algorithm is applied to robot path planning, there are problems such as many redundant path points, large cumulative turning angle and the robot incapable of adjusting its posture at the path point. This paper proposes an improved jump point search algorithm, which checks the connectivity between the previous point and the last point of each original point. It also uses vector cross product to identify the direction of the next path point relative to the current path point. The vector dot product is adopted to calculate the rotation angle of the current path point. Three evaluation indicators, such as the number of path points, the total path length and the cumulative turning angle, are formulated to judge the merits and demerits of the optimized algorithm. The experimental results show that on the map of scene 1, improved jump point search algorithm reduces the path points from 9 to 7, with total path length decreased by about 12%, and cumulative turning angle decreased by about 27%. The improved jump point search algorithm is designed to obtain a shorter final path, a smaller cumulative turning angle, and to able robot to adjust posture at the path point.