Rioza, Hansen Ade (2024) Navigasi Multi-Robot Menggunakan Greedy Heuristic Algorithm Berbasis ACO Algorithm. Other thesis, Institut Teknologi Sepuluh Nopember.
![[thumbnail of 5024201030_Undergraduate_Thesis.pdf]](http://repository.its.ac.id/style/images/fileicons/text.png) |
Text
5024201030_Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 October 2026. Download (5MB) | Request a copy |
Abstract
Pada penelitian ini kami mengajukan judul ”Navigasi Multi-Robot Menggunakan Greedy Heuristic Berbasis Algoritma ACO, membahas pengembangan sistem navigasi multi-robot canggih dan implementasi algoritma Greedy Heuristic berdasarkan Optimisasi Koloni Semut (ACO) untuk mengoptimalkan perencanaan jalur dan navigasi beberapa robot dalam lingkungan dinamis. Penelitian ini berfokus pada peningkatan efisiensi robot ini dengan meningkatkan kemampuan robot untuk menavigasi melalui rintangan statis dan dinamis, menghindari tabrakan, dan mencegah situasi kebuntuan. Dengan mengintegrasikan algoritma Greedy Heuristic dengan ACO, penelitian ini bertujuan untuk menyempurnakan strategi perencanaan jalur, memastikan navigasi multi-robot yang lebih lancar dan efektif. Penelitian ini memberikan kontribusi pada bidang robotika, menawarkan wawasan tentang potensi kombinasi algoritma heuristik dengan ACO untuk navigasi yang lebih baik dalam sistem multi-robot.
========================================================================================================
This research proposes the title "Multi-Robot Navigation Using Greedy Heuristic Based on ACO Algorithm", discussing the development of a sophisticated multi-robot navigation system and the implementation of a Greedy Heuristic algorithm based on Ant Colony Optimization (ACO) to optimize path planning and navigation for multiple robots in dynamic environments. This research focuses on improving the efficiency of these robots by enhancing their ability to navigate through static and dynamic obstacles, avoid collisions, and prevent deadlock situations. By integrating the Greedy Heuristic algorithm with ACO, this research aims to refine path planning strategies, ensuring smoother and more effective multi-robot navigation. This research contributes to the field of robotics, offering insights into the potential of combining heuristic algorithms with ACO for better navigation in multi-robot systems.
| Item Type: | Thesis (Other) |
|---|---|
| Uncontrolled Keywords: | Navigasi Multi-Robot, Algoritma Greedy Heuristic, Ant Colony Optimization (ACO), Multi-Robot Navigation, Greedy Heuristic Algorithm, Ant Colony Optimization (ACO). |
| Subjects: | T Technology > T Technology (General) > T57.62 Simulation T Technology > T Technology (General) > T57.84 Heuristic algorithms. T Technology > TJ Mechanical engineering and machinery > TJ211 Robotics. T Technology > TJ Mechanical engineering and machinery > TJ211.415 Mobile robots |
| Divisions: | Faculty of Electrical Technology > Computer Engineering > 90243-(S1) Undergraduate Thesis |
| Depositing User: | Hansen Ade Rioza |
| Date Deposited: | 09 Aug 2024 06:29 |
| Last Modified: | 09 Aug 2024 06:29 |
| URI: | http://repository.its.ac.id/id/eprint/111583 |
Actions (login required)
 |
View Item |