基于最小夹击的移动机器人全局轨迹优化

Bowen Zhang, Jiayong He, Dongbin Pei
{"title":"基于最小夹击的移动机器人全局轨迹优化","authors":"Bowen Zhang, Jiayong He, Dongbin Pei","doi":"10.1109/ITOEC53115.2022.9734396","DOIUrl":null,"url":null,"abstract":"Since the path planned by the traditional A * algorithm consists of a series of discrete spatial points and does not contain time and control quantities, it cannot be directly used for trajectory tracking of mobile robots. To address this problem, this paper uses the Minimum Snap method to transform the traditional path planning algorithm and the planned path into a continuous smooth trajectory containing both time, velocity and acceleration information. The trajectory is optimized by introducing the trajectory shape constraint and velocity and acceleration constraint, so as to generate a global trajectory suitable for the path tracking of mobile robots, while the generated trajectory differs too much from the original path shape and the robot motion trajectory is not smooth due to the robot's own physical constraints are not considered. Finally, the effectiveness of the proposed method is verified by simulation experiments, and the method is applied to a robot autonomous navigation system under ROS (Robot Operating System) to confirm the practicality and reliability of the method.","PeriodicalId":127300,"journal":{"name":"2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Global trajectory optimization of mobile robot based on Minimum Snap\",\"authors\":\"Bowen Zhang, Jiayong He, Dongbin Pei\",\"doi\":\"10.1109/ITOEC53115.2022.9734396\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since the path planned by the traditional A * algorithm consists of a series of discrete spatial points and does not contain time and control quantities, it cannot be directly used for trajectory tracking of mobile robots. To address this problem, this paper uses the Minimum Snap method to transform the traditional path planning algorithm and the planned path into a continuous smooth trajectory containing both time, velocity and acceleration information. The trajectory is optimized by introducing the trajectory shape constraint and velocity and acceleration constraint, so as to generate a global trajectory suitable for the path tracking of mobile robots, while the generated trajectory differs too much from the original path shape and the robot motion trajectory is not smooth due to the robot's own physical constraints are not considered. Finally, the effectiveness of the proposed method is verified by simulation experiments, and the method is applied to a robot autonomous navigation system under ROS (Robot Operating System) to confirm the practicality and reliability of the method.\",\"PeriodicalId\":127300,\"journal\":{\"name\":\"2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC)\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITOEC53115.2022.9734396\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITOEC53115.2022.9734396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于传统A *算法规划的路径由一系列离散的空间点组成,不包含时间和控制量,不能直接用于移动机器人的轨迹跟踪。为了解决这一问题,本文采用最小Snap方法将传统的路径规划算法和规划的路径转化为包含时间、速度和加速度信息的连续光滑轨迹。通过引入轨迹形状约束和速度、加速度约束对轨迹进行优化,生成适合移动机器人路径跟踪的全局轨迹,但生成的轨迹与原始轨迹形状差异较大,且未考虑机器人自身物理约束导致的机器人运动轨迹不光滑。最后,通过仿真实验验证了所提方法的有效性,并将该方法应用于ROS (robot Operating system)下的机器人自主导航系统,验证了该方法的实用性和可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Global trajectory optimization of mobile robot based on Minimum Snap
Since the path planned by the traditional A * algorithm consists of a series of discrete spatial points and does not contain time and control quantities, it cannot be directly used for trajectory tracking of mobile robots. To address this problem, this paper uses the Minimum Snap method to transform the traditional path planning algorithm and the planned path into a continuous smooth trajectory containing both time, velocity and acceleration information. The trajectory is optimized by introducing the trajectory shape constraint and velocity and acceleration constraint, so as to generate a global trajectory suitable for the path tracking of mobile robots, while the generated trajectory differs too much from the original path shape and the robot motion trajectory is not smooth due to the robot's own physical constraints are not considered. Finally, the effectiveness of the proposed method is verified by simulation experiments, and the method is applied to a robot autonomous navigation system under ROS (Robot Operating System) to confirm the practicality and reliability of the method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信