{"title":"基于有限时速障碍法的最优运动规划与避障算法","authors":"Sepehr Samavati, M. Zarei, M. T. Masouleh","doi":"10.1109/AISP.2017.8324091","DOIUrl":null,"url":null,"abstract":"This paper addresses a collision-free motion planning algorithm of mobile robots based on the synergy of discrete motion planning and optimal Finite-time Velocity Obstacle (FVO). The proposed approach is employed for motion planning of a mobile robot to the end of passing through an unknown environment. In this regard, predicated on the non-convex nature of the FVO constraints, they are approximated by a parabolic function and the approximated function is used to calculate the optimal next step velocity of the mobile robot in order to ensure the collision free motion. The reported results reveal that by considering the maximum velocity of the mobile robot, obtained computation time is less than 0.00015 seconds in each stage for single mobile robot scenarios which can be considered fast enough for robot motion planning tasks for the mobile robot under study.","PeriodicalId":386952,"journal":{"name":"2017 Artificial Intelligence and Signal Processing Conference (AISP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"An optimal motion planning and obstacle avoidance algorithm based on the finite time velocity obstacle approach\",\"authors\":\"Sepehr Samavati, M. Zarei, M. T. Masouleh\",\"doi\":\"10.1109/AISP.2017.8324091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses a collision-free motion planning algorithm of mobile robots based on the synergy of discrete motion planning and optimal Finite-time Velocity Obstacle (FVO). The proposed approach is employed for motion planning of a mobile robot to the end of passing through an unknown environment. In this regard, predicated on the non-convex nature of the FVO constraints, they are approximated by a parabolic function and the approximated function is used to calculate the optimal next step velocity of the mobile robot in order to ensure the collision free motion. The reported results reveal that by considering the maximum velocity of the mobile robot, obtained computation time is less than 0.00015 seconds in each stage for single mobile robot scenarios which can be considered fast enough for robot motion planning tasks for the mobile robot under study.\",\"PeriodicalId\":386952,\"journal\":{\"name\":\"2017 Artificial Intelligence and Signal Processing Conference (AISP)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Artificial Intelligence and Signal Processing Conference (AISP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AISP.2017.8324091\",\"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 Artificial Intelligence and Signal Processing Conference (AISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISP.2017.8324091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An optimal motion planning and obstacle avoidance algorithm based on the finite time velocity obstacle approach
This paper addresses a collision-free motion planning algorithm of mobile robots based on the synergy of discrete motion planning and optimal Finite-time Velocity Obstacle (FVO). The proposed approach is employed for motion planning of a mobile robot to the end of passing through an unknown environment. In this regard, predicated on the non-convex nature of the FVO constraints, they are approximated by a parabolic function and the approximated function is used to calculate the optimal next step velocity of the mobile robot in order to ensure the collision free motion. The reported results reveal that by considering the maximum velocity of the mobile robot, obtained computation time is less than 0.00015 seconds in each stage for single mobile robot scenarios which can be considered fast enough for robot motion planning tasks for the mobile robot under study.