一种加速路径规划方法

E. Ahmed, Hossam E. Abd El Munim, Hassan M. Shehata Bedour
{"title":"一种加速路径规划方法","authors":"E. Ahmed, Hossam E. Abd El Munim, Hassan M. Shehata Bedour","doi":"10.1109/ICCES.2018.8639491","DOIUrl":null,"url":null,"abstract":"Path planning is critical in robotics as well as autonomous driving applications. This research provides a modified path planning algorithm by enhancing the performance of the probabilistic roadmap (PRM) approach. The proposed technique is based on dividing the domain of motion and solves the relative path in each division. Our results on synthetic maps show a dramatic reduction on processing time compared with the conventional algorithm.","PeriodicalId":113848,"journal":{"name":"2018 13th International Conference on Computer Engineering and Systems (ICCES)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Accelerated Path Planning Approach\",\"authors\":\"E. Ahmed, Hossam E. Abd El Munim, Hassan M. Shehata Bedour\",\"doi\":\"10.1109/ICCES.2018.8639491\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Path planning is critical in robotics as well as autonomous driving applications. This research provides a modified path planning algorithm by enhancing the performance of the probabilistic roadmap (PRM) approach. The proposed technique is based on dividing the domain of motion and solves the relative path in each division. Our results on synthetic maps show a dramatic reduction on processing time compared with the conventional algorithm.\",\"PeriodicalId\":113848,\"journal\":{\"name\":\"2018 13th International Conference on Computer Engineering and Systems (ICCES)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 13th International Conference on Computer Engineering and Systems (ICCES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCES.2018.8639491\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 13th International Conference on Computer Engineering and Systems (ICCES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2018.8639491","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

路径规划在机器人和自动驾驶应用中至关重要。本文提出了一种改进的路径规划算法,提高了概率路线图(PRM)方法的性能。该方法基于对运动区域的划分,求解每次划分的相对路径。我们在合成地图上的结果显示,与传统算法相比,处理时间大大减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Accelerated Path Planning Approach
Path planning is critical in robotics as well as autonomous driving applications. This research provides a modified path planning algorithm by enhancing the performance of the probabilistic roadmap (PRM) approach. The proposed technique is based on dividing the domain of motion and solves the relative path in each division. Our results on synthetic maps show a dramatic reduction on processing time compared with the conventional algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信