Perancangan Robot Maze Solving Berbasis Arduino

Rahmad Doni, Muhammad Reza Fahlevi, Elvin Syahrin

Abstract


The maze solving robot is the development of the line follower robot. Where the robot can trace a path that has an intersection, in tracing a maze, apart from finding a way out / finish, it will be more efficient if the robot can find a shorter path through the maze. From the maze samples made, the robot can explore a maze and find the shortest path. When the mapping process is carried out, the robot traces 12 path codes; after the path simplification process is carried out, the robot can shorten the path it takes to 6.

Full Text:

PDF

References


Fajar, Y. H., Syauqy, D., & Maulana, R. (2019). Implementasi Maze Mapping pada Robot Line Follower untuk menentukan Shortest Path. Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer e-ISSN, 2548, 964X.

Maarif, A. (2014). Perancangan Line Maze Solving Robot Dengan Algoritma Short Path Finder.

Prayudha, J., Saripurna, D., & Nugroho, N. B. (2017). Implementasi Backpropagation Untuk Pengenalan Warna Garis Lintasan Robot Maze Solving Berbasis Arduino. Jurnal SAINTIKOM, 16(2).

Nurmalasari, M., Triyanto, D., & Brianorman, Y. (2015). Implementasi Algoritma Maze Solving Pada Robot Line Follower. Coding Jurnal Komputer dan Aplikasi, 3(2).

Anshori, Y., Dodu, A. E., & Kurniawan, F. (2019). Perancangan Robot Penelusur Menggunakan Algoritma Dijkstra dan Metode Maze Solver. Techno. Com, 18(2), 166-177.




DOI: http://dx.doi.org/10.30645/j-sakti.v4i2.242

Refbacks

  • There are currently no refbacks.


J-SAKTI (Jurnal Sains Komputer & Informatika)
Published Papers Indexed/Abstracted By:

Jumlah Kunjungan :

View My Stats