基于有限时速障碍法的最优运动规划与避障算法

Sepehr Samavati, M. Zarei, M. T. Masouleh
{"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}
引用次数: 9

摘要

本文研究了一种基于离散运动规划和最优有限时间速度障碍(FVO)协同作用的移动机器人无碰撞运动规划算法。将该方法用于移动机器人的运动规划,直至通过未知环境。因此,基于FVO约束的非凸性,用抛物线函数逼近FVO约束,并利用逼近函数计算移动机器人下一步的最优速度,以保证移动机器人的无碰撞运动。研究结果表明,在考虑移动机器人最大速度的情况下,得到的单个移动机器人场景各阶段的计算时间小于0.00015秒,对于所研究的移动机器人的机器人运动规划任务来说已经足够快了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信