基于优先级算法的多机器人路径规划

Saksham Sharma, Naman Antony Menezes
{"title":"基于优先级算法的多机器人路径规划","authors":"Saksham Sharma, Naman Antony Menezes","doi":"10.1109/CONECCT55679.2022.9865690","DOIUrl":null,"url":null,"abstract":"In this paper we propose a novel algorithm to plan paths for multiple robots with multiple goal points. The algorithm utilizes D* Algorithm as a backbone with a priority order optimizer. For testing the algorithm, we propose an architecture to direct multiple robots in a centralized manner using Robot Operating System (ROS). Further, four maps have been defined to gauge the performance of the system. The results show a significant advantage over decoupled and coupled path planning algorithm in terms of computation time while still retaining coupled approach’s characteristic of avoiding deadlocking in single corridor cases.","PeriodicalId":380005,"journal":{"name":"2022 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi Robot Path Planning Using Priority Based Algorithm\",\"authors\":\"Saksham Sharma, Naman Antony Menezes\",\"doi\":\"10.1109/CONECCT55679.2022.9865690\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a novel algorithm to plan paths for multiple robots with multiple goal points. The algorithm utilizes D* Algorithm as a backbone with a priority order optimizer. For testing the algorithm, we propose an architecture to direct multiple robots in a centralized manner using Robot Operating System (ROS). Further, four maps have been defined to gauge the performance of the system. The results show a significant advantage over decoupled and coupled path planning algorithm in terms of computation time while still retaining coupled approach’s characteristic of avoiding deadlocking in single corridor cases.\",\"PeriodicalId\":380005,\"journal\":{\"name\":\"2022 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONECCT55679.2022.9865690\",\"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 International Conference on Electronics, Computing and Communication Technologies (CONECCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONECCT55679.2022.9865690","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种新的多目标点机器人路径规划算法。该算法利用D*算法作为主干,并带有优先级优化器。为了测试该算法,我们提出了一个使用机器人操作系统(ROS)以集中方式指挥多个机器人的架构。此外,还定义了四个映射来衡量系统的性能。结果表明,该方法在计算时间上明显优于解耦和耦合路径规划算法,同时保留了耦合方法在单通道情况下避免死锁的特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi Robot Path Planning Using Priority Based Algorithm
In this paper we propose a novel algorithm to plan paths for multiple robots with multiple goal points. The algorithm utilizes D* Algorithm as a backbone with a priority order optimizer. For testing the algorithm, we propose an architecture to direct multiple robots in a centralized manner using Robot Operating System (ROS). Further, four maps have been defined to gauge the performance of the system. The results show a significant advantage over decoupled and coupled path planning algorithm in terms of computation time while still retaining coupled approach’s characteristic of avoiding deadlocking in single corridor cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信