Polynomial based optimal trajectory planning and obstacle avoidance for an omni-directional robot

Fatemeh Tohfeh, A. Fakharian
{"title":"Polynomial based optimal trajectory planning and obstacle avoidance for an omni-directional robot","authors":"Fatemeh Tohfeh, A. Fakharian","doi":"10.1109/RIOS.2015.7270731","DOIUrl":null,"url":null,"abstract":"An obstacle avoidance trajectory planning for an omni-directional robot is investigated in this paper where obstacles moves with velocity and acceleration constraints. The key issue is an optimized solution for the problem with respect to a cost function which is related to the states and energy consumption. Moreover, the trajectory functions are considered as polynomial functions to obtain desired trajectory. Consequently, this converts the optimal control problem into a small size parameter optimization problem. The low computational cost make this method ideal for trajectory planning in Dynamic environments. The proposed method is simulated and results show its effectiveness in avoidance of collisions with moving obstacles.","PeriodicalId":437944,"journal":{"name":"2015 AI & Robotics (IRANOPEN)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 AI & Robotics (IRANOPEN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIOS.2015.7270731","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

An obstacle avoidance trajectory planning for an omni-directional robot is investigated in this paper where obstacles moves with velocity and acceleration constraints. The key issue is an optimized solution for the problem with respect to a cost function which is related to the states and energy consumption. Moreover, the trajectory functions are considered as polynomial functions to obtain desired trajectory. Consequently, this converts the optimal control problem into a small size parameter optimization problem. The low computational cost make this method ideal for trajectory planning in Dynamic environments. The proposed method is simulated and results show its effectiveness in avoidance of collisions with moving obstacles.
基于多项式的全向机器人最优轨迹规划与避障
研究了具有速度和加速度约束的全向机器人避障轨迹规划问题。问题的关键是关于与状态和能耗相关的成本函数的问题的优化解。此外,将轨迹函数视为多项式函数,以获得期望的轨迹。因此,这将最优控制问题转化为一个小尺寸参数优化问题。该方法计算成本低,适用于动态环境下的轨迹规划。仿真结果表明,该方法能够有效地避免与移动障碍物的碰撞。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信