{"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}
引用次数: 1
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.