Rancang Bangun Mobile Robot Micromouse Untuk Pencarian Rute Terpendek Menggunakan Algoritma Flood Fill

Article Sidebar

PDF
Published Mar 20, 2017
DOI https://doi.org/10.25077/jitce.1.01.8-16.2017

Main Article Content

Werman Kasoep
Universitas Andalas

Abstract

Mobile Robot is one robot that much used to help out man. Micromouse mobile robot is one robot that made to can find the route shortest in a maze. Flood fill algorithm is one way to find the route shortest by doing maze mapping, where the robot will compare the value of each cell and moving toward the smallest cell. In the research, the micromouse mobile robot was designed using Ultrasonic PING sensor to detect obstacles and Arduino Uno that will control the movement of DC motor. The robot will search a route shortest based on maze mapping that it has passed. The robot was tested on three mazes, where each maze was tested 10 times and obtained success level on the first maze of 80%, the second maze of 70% and the third maze of 70%.

Downloads

Download data is not yet available.

Article Details

How to Cite
Kasoep, W. (2017, March 20). Rancang Bangun Mobile Robot Micromouse Untuk Pencarian Rute Terpendek Menggunakan Algoritma Flood Fill. JITCE (Journal of Information Technology and Computer Engineering), 1(01), 8-16. https://doi.org/https://doi.org/10.25077/jitce.1.01.8-16.2017
Issue
Vol 1 No 01 (2017): Journal of Information Technology and Computer Engineering
Section
Articles

1. License

Creative Commons License

 

The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. 

2. Author(s)’ Warranties

The author(s) warrants that the article is original, written by stated author(s), has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary permissions to quote from other sources have been obtained by the author(s).

3. User Rights

JITCE adopts the spirit of open access and open science, which disseminates articles published as free as possible under the Creative Commons license. JITCE permits users to copy, distribute, display, and perform the work for non-commercial purposes only. Users will also need to attribute authors and JITCE on distributing works in the journal.

4. Rights of Authors

Authors retain the following rights:

  • Copyright, and other proprietary rights relating to the article, such as patent rights,
  • the right to use the substance of the article in future own works, including lectures and books,
  • the right to reproduce the article for own purposes, 
  • the right to self-archive the article.
  • the right to enter into separate, additional contractual arrangements for the non-exclusive distribution of the article's published version (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal (Journal of Information Technology and Computer Engineering).

5. Co-Authorship

If the article was jointly prepared by other authors; upon submitting the article, the author is agreed on this form and warrants that he/she has been authorized by all co-authors on their behalf, and agrees to inform his/her co-authors. JITCE will be freed on any disputes that will occur regarding this issue. 

7. Royalties

By submitting the articles, the authors agreed that no fees are payable from JITCE.

 

8. Miscellaneous

JITCE will publish the article (or have it published) in the journal if the article’s editorial process is successfully completed and JITCE or its sublicensee has become obligated to have the article published. JITCE may adjust the article to a style of punctuation, spelling, capitalization, referencing and usage that it deems appropriate. The author acknowledges that the article may be published so that it will be publicly accessible and such access will be free of charge for the readers. 

References

[1] Rusmini. 2011. Pencarian Rute Terpendek Untuk Robot Micromouse Dengan Menggunakan Algoritma Backtracking. URL : http://repo.eepis-its.edu/1459/1/[A%2DD206%2D9]_pp.41%2D48_Pencarian_Rute_Terpendek_Untuk_Robot_Micromouse_Dengan.pdf. Diakses pada tanggal 20 Februari 2015, pukul 15.30 WIB.
[2] Anggoro, Beni. 2013. Desain Pemodelan Kinematik dan Dinamik Humanoid Robot. URL: http://eprints.undip.ac.id/41644/3/BAB_2.pdf. Diakses pada tanggal 10 Maret 2015, pukul 15.30 WIB.
[3] Rahmawan, A. 2013. Optimasi Gripper Dua Lengan dengan Menggunakan Metode Genetic Algorithm pada Simulator Arm Robot 5 DOF (Degree of Freedom). URL: http://eprints.undip.ac.id/41662/8/BAB_2.pdf. Diakses pada tanggal 13 Maret 2015, pukul 10.56 WIB.
[4] Firdaus, Ahmad Riyad. 2005. MicroMouse ELIND’BOT I. URL: http://www.jurnal.lipi.go.id/publikasi.cgi?tampilpublikasi2&1074192018&Indonesia&vol=24&1083846229