Comparing Path Planning Algorithms for Multiple Mobile Robots

Basit Öğe Kaydı
dc.authoridKocamaz, Adnan Fatih/0000-0002-7729-8322;
dc.authorwosidKocamaz, Adnan Fatih/C-2820-2014
dc.authorwosidOkumuş, Fatih/GWQ-5368-2022
dc.authorwosidOkumuş, Fatih/IZE-0001-2023
dc.authorwosidOkumuş, Fatih/AAK-1249-2020
dc.contributor.authorOkumus, Fatih
dc.contributor.authorKocamaz, Adnan Fatih
dc.date.accessioned2024-08-04T20:45:47Z
dc.date.available2024-08-04T20:45:47Z
dc.date.issued2018
dc.departmentİnönü Üniversitesien_US
dc.descriptionInternational Conference on Artificial Intelligence and Data Processing (IDAP) -- SEP 28-30, 2018 -- Inonu Univ, Malatya, TURKEYen_US
dc.description.abstractThe use of mobile robots in industrial applications is increasing day by day. As a result of this increase, efficiency in the use of mobile robots has also become important. In particular, path planning is a significant area of research to improve efficiency in mobile robot navigation. In path planning, it is aimed to find optimum and obstacle free paths to the starting and ending points to fulfill multiple tasks. In this paper, A *, D * and PSO algorithms, frequently used to optimize the path multiple robots reach targets in an environment with obstacles, have been compared. In addition, a mobile robot simulation software has been developed to measure the performance of algorithms. At the end of the study, the performance of the algorithms was showed by measuring the path lengths and the process time of algorithms.en_US
dc.description.sponsorshipInonu Univ, Comp Sci Dept,IEEE Turkey Sect,Anatolian Scien_US
dc.identifier.isbn978-1-5386-6878-8
dc.identifier.scopus2-s2.0-85062528376en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://hdl.handle.net/11616/98695
dc.identifier.wosWOS:000458717400063en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIeeeen_US
dc.relation.ispartof2018 International Conference on Artificial Intelligence and Data Processing (Idap)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectMobile robotsen_US
dc.subjectpath planningen_US
dc.subjectnavigationen_US
dc.subjectobstacle avoidanceen_US
dc.titleComparing Path Planning Algorithms for Multiple Mobile Robotsen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu