Performance Analysis of Deterministic and Probabilistic Path Planning Algorithms in Complex Environments

Basit Öğe Kaydı
dc.contributor.authorAksoy, Necati
dc.contributor.authorÇakil, Fatih
dc.contributor.authorTekdemir, Ibrahim Gürsu
dc.date.accessioned2026-02-08T15:11:01Z
dc.date.available2026-02-08T15:11:01Z
dc.date.issued2024
dc.departmentBursa Teknik Üniversitesi
dc.description2024 Innovations in Intelligent Systems and Applications Conference, ASYU 2024 -- 2024-10-16 through 2024-10-18 -- Ankara -- 204562
dc.description.abstractPath planning, in an other saying navigation, algorithms are vital in assorted applications, including robotics, autonomous vehicles, and drones. These algorithms can be broadly categorized into deterministic and probabilistic methods along with other branches. This study focuses and examines two classical deterministic path planning algorithms, A-star (A*) and Dijkstra's algorithm, alongside two prominent probabilistic path planning algorithms, Rapidly-exploring Random Trees Star (RRT*) and Probabilistic Roadmap (PRM). In the paper, with creating multi-level building interior floor maps and testing the performance of these four algorithms are performed on each level. Performance metrics included execution time, CPU usage, memory usage, and path distance. The results, presented in comparative tables, provide a comprehensive analysis of the efficiency and resource demands of each algorithm. Furthermore, this research offers valuable insights for selecting appropriate path planning algorithms in various autonomous navigation applications, guiding future implementations in robotics, autonomous electric vehicles, and drone technology. © 2024 IEEE.
dc.description.sponsorshipIEEE SMC; IEEE Turkiye Section
dc.identifier.doi10.1109/ASYU62119.2024.10757028
dc.identifier.isbn9798350379433
dc.identifier.scopus2-s2.0-85213390458
dc.identifier.scopusqualityN/A
dc.identifier.urihttps://doi.org/10.1109/ASYU62119.2024.10757028
dc.identifier.urihttps://hdl.handle.net/20.500.12885/5162
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzScopus_KA_20260207
dc.subjectA-star
dc.subjectnavigation
dc.subjectPath planning
dc.subjectPRM
dc.subjectrobotics
dc.subjectRRT
dc.titlePerformance Analysis of Deterministic and Probabilistic Path Planning Algorithms in Complex Environments
dc.typeConference Object

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu