户外移动机器人路径规划研究

IF 1.5 Q3 AUTOMATION & CONTROL SYSTEMS IET Cybersystems and Robotics Pub Date : 2022-07-27 DOI:10.1109/CYBER55403.2022.9907273
Yujing Dong, Shuang Liu, Changzheng Zhang, Qigao Zhou
{"title":"户外移动机器人路径规划研究","authors":"Yujing Dong, Shuang Liu, Changzheng Zhang, Qigao Zhou","doi":"10.1109/CYBER55403.2022.9907273","DOIUrl":null,"url":null,"abstract":"We present an improved A* algorithm based on road boundary constrainted for road scenes such as campuses, communities, and industrial parks. Firstly, the LIDAR scans the surrounding environment and saves it in the point cloud data, pre-processes the point cloud and acquires the road boundary, then translates the acquired road boundary to generate a minimal cost feasible domain, and finally adds the feasible domain to the A* algorithm for path planning. To verify the feasibility of the method, experiments were conducted in both simulated and real environments. The experimental results show that the method can improve the problem of the paths planned by the A* algorithm being too close to the road edges and reduce the influence of road boundaries when the mobile robot is moving outdoors.","PeriodicalId":34110,"journal":{"name":"IET Cybersystems and Robotics","volume":"131 1","pages":"543-547"},"PeriodicalIF":1.5000,"publicationDate":"2022-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Path Planning Research for Outdoor Mobile Robot\",\"authors\":\"Yujing Dong, Shuang Liu, Changzheng Zhang, Qigao Zhou\",\"doi\":\"10.1109/CYBER55403.2022.9907273\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an improved A* algorithm based on road boundary constrainted for road scenes such as campuses, communities, and industrial parks. Firstly, the LIDAR scans the surrounding environment and saves it in the point cloud data, pre-processes the point cloud and acquires the road boundary, then translates the acquired road boundary to generate a minimal cost feasible domain, and finally adds the feasible domain to the A* algorithm for path planning. To verify the feasibility of the method, experiments were conducted in both simulated and real environments. The experimental results show that the method can improve the problem of the paths planned by the A* algorithm being too close to the road edges and reduce the influence of road boundaries when the mobile robot is moving outdoors.\",\"PeriodicalId\":34110,\"journal\":{\"name\":\"IET Cybersystems and Robotics\",\"volume\":\"131 1\",\"pages\":\"543-547\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2022-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Cybersystems and Robotics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBER55403.2022.9907273\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Cybersystems and Robotics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBER55403.2022.9907273","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 2

摘要

针对校园、社区、工业园区等道路场景,提出了一种基于道路边界约束的改进A*算法。首先,激光雷达对周围环境进行扫描并保存到点云数据中,对点云进行预处理,获取道路边界,然后对获取的道路边界进行平移生成最小代价可行域,最后将可行域加入到a *算法中进行路径规划。为了验证该方法的可行性,在模拟环境和真实环境下进行了实验。实验结果表明,该方法可以改善A*算法规划的路径过于靠近道路边缘的问题,减少移动机器人在室外运动时道路边界的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Path Planning Research for Outdoor Mobile Robot
We present an improved A* algorithm based on road boundary constrainted for road scenes such as campuses, communities, and industrial parks. Firstly, the LIDAR scans the surrounding environment and saves it in the point cloud data, pre-processes the point cloud and acquires the road boundary, then translates the acquired road boundary to generate a minimal cost feasible domain, and finally adds the feasible domain to the A* algorithm for path planning. To verify the feasibility of the method, experiments were conducted in both simulated and real environments. The experimental results show that the method can improve the problem of the paths planned by the A* algorithm being too close to the road edges and reduce the influence of road boundaries when the mobile robot is moving outdoors.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Cybersystems and Robotics
IET Cybersystems and Robotics Computer Science-Information Systems
CiteScore
3.70
自引率
0.00%
发文量
31
审稿时长
34 weeks
期刊最新文献
3D-printed biomimetic and bioinspired soft actuators Correction-enabled reversible data hiding with pixel repetition for high embedding rate and quality preservation Anti-sloshing control: Flatness-based trajectory planning and tracking control with an integrated extended state observer Internal and external disturbances aware motion planning and control for quadrotors Multi-feature fusion and memory-based mobile robot target tracking system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1