Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Cybernetics and Information Technologies
Volume 24 (2024): Issue 3 (September 2024)
Open Access
A Systematic Review of Rapidly Exploring Random Tree RRT Algorithm for Single and Multiple Robots
Dena Kadhim Muhsen
Dena Kadhim Muhsen
Computer Science Department, University of Technology – Iraq
Baghdad, Iraq
Search for this author on
Sciendo
|
Google Scholar
Muhsen, Dena Kadhim
,
Firas Abdulrazzaq Raheem
Firas Abdulrazzaq Raheem
Control and Systems Engineering Department, University of Technology
Iraq
Search for this author on
Sciendo
|
Google Scholar
Raheem, Firas Abdulrazzaq
and
Ahmed T. Sadiq
Ahmed T. Sadiq
Computer Science Department, University of Technology – Iraq
Baghdad, Iraq
Search for this author on
Sciendo
|
Google Scholar
Sadiq, Ahmed T.
Sep 19, 2024
Cybernetics and Information Technologies
Volume 24 (2024): Issue 3 (September 2024)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Sep 19, 2024
Page range:
78 - 101
Received:
Mar 20, 2024
Accepted:
Aug 13, 2024
DOI:
https://doi.org/10.2478/cait-2024-0026
Keywords
Algorithm
,
Evolution
,
Multiple robots
,
Path planning
,
Robotics
© 2024 Dena Kadhim Muhsen et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
