Melola Discovery

← Melola Discovery

Jurnal SINTA 2

IMPLEMENTASI ALGORITMA BREADTH FIRST SEARCH DAN OBSTACLE DETECTION DALAM PENELUSURAN LABIRIN DINAMIS MENGGUNAKAN ROBOT LEGO

Jurnal Ilmu Komputer dan Informasi (JIKI) · Vol. 4 No. 1 (2012) · pp. 15–22

DOI
10.21609/jiki.v4i1.153
ISSN
2502-9274, 2088-7051
Published
2012-05-29
Publisher
Faculty of Computer Science - Universitas Indonesia
Language
eng

Abstract

Dewasa ini perkembangan teknologi di dunia robot edukasi berkembang pesat. Robot-robot edukasi ini sering digunakan dalam riset penelitian karena kemudahan-kemudahan yang diberikannya dari segi perangkat keras. Salah satu contoh robot edukasi adalah robot LEGO Mindstorms NXT. Pada penelitian ini robot LEGO dibangun dalam bentuk robot line follower. Robot ini mampu menelusuri dan mencari jalan keluar dari labirin dinamis. Dalam menelusuri dan mencari jalan keluar, robot LEGO menggunakan algoritma Breadth First Search dan Manhattan Distance dalam memutuskan jalan mana yang harus diambil. Ketika menemui objek halangan, robot LEGO akan mengenali dan menghindari objek halangan tersebut dengan algoritma Obstacle Detection yang dimilikinya. Hasil implementasi membuktikan bahwa algoritma penelusuran labirin dinamis ini dapat diimplementasikan pada robot LEGO meskipun terdapat banyak keterbatasan dalam robot LEGO. Nowadays, the development of technology in educational robots is rapidly evolving. Educational robots are often used in research studies because they provide convenience in terms of hardware. One example is the educational robot LEGO Mindstorms NXT robot. In this research, LEGO robots built in the form of line follower robot. Robot is able to browse and find a way out of the dynamic labyrinth. In track and find a way out, LEGO robot uses an algorithm Breadth First Search and Manhattan Distance in deciding which path to take. When encountering an obstacle object, LEGO robot will recognize and avoid that obstacle objects with Obstacle Detection algorithm. The results prove that the implementation of a dynamic maze search algorithm can be implemented on a LEGO robot even though there are many limitations in LEGO robot.

Keywords

Collaboration network of the authors

14 authors · 27 co-authorship links · 17 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Indonesia
  • Diponegoro University
  • University of Edinburgh
  • Politeknik Negeri Malang
  • Nagoya University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Muhammad Febrian RachmadiUniversity of Edinburgh2
Muhammad Syaeful FajarUniversity of Indonesia1
Fadhlurrahman AfifUniversity of Indonesia1
Muhammad Anwar Ma’SumUniversity of Indonesia1
Dwi Marhaendro Jati PurnomoUniversity of Indonesia1
Arie Rachmad SyulistyoPoliteknik Negeri Malang1
Indra WaspadaDiponegoro University1
Noel Segura MerazNagoya University1
Kusworo AdiDiponegoro University1
Naufal BudimanAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jiki.cs.ui.ac.id/index.php/jiki/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">IMPLEMENTASI ALGORITMA BREADTH FIRST SEARCH DAN OBSTACLE DETECTION DALAM PENELUSURAN LABIRIN DINAMIS MENGGUNAKAN ROBOT LEGO</dc:title>
	<dc:creator>Wibowo, Adi</dc:creator>
	<dc:creator>., Budianto</dc:creator>
	<dc:creator>., Lasguido</dc:creator>
	<dc:creator>Fathurrahman, Fahry</dc:creator>
	<dc:subject xml:lang="en-US">breadth first search</dc:subject>
	<dc:subject xml:lang="en-US">labirin dinamis</dc:subject>
	<dc:subject xml:lang="en-US">LEGO mindstroms NXT</dc:subject>
	<dc:subject xml:lang="en-US">line following</dc:subject>
	<dc:subject xml:lang="en-US">obstacle detection</dc:subject>
	<dc:description xml:lang="en-US">Dewasa ini perkembangan teknologi di dunia robot edukasi berkembang pesat. Robot-robot edukasi ini sering digunakan dalam riset penelitian karena kemudahan-kemudahan yang diberikannya dari segi perangkat keras. Salah satu contoh robot edukasi adalah robot LEGO Mindstorms NXT. Pada penelitian ini robot LEGO dibangun dalam bentuk robot line follower. Robot ini mampu menelusuri dan mencari jalan keluar dari labirin dinamis. Dalam menelusuri dan mencari jalan keluar, robot LEGO menggunakan algoritma Breadth First Search dan Manhattan Distance dalam memutuskan jalan mana yang harus diambil. Ketika menemui objek halangan, robot LEGO akan mengenali dan menghindari objek halangan tersebut dengan algoritma Obstacle Detection yang dimilikinya. Hasil implementasi membuktikan bahwa algoritma penelusuran labirin dinamis ini dapat diimplementasikan pada robot LEGO meskipun terdapat banyak keterbatasan dalam robot LEGO.

Nowadays, the development of technology in educational robots is rapidly evolving. Educational robots are often used in research studies because they provide convenience in terms of hardware. One example is the educational robot LEGO Mindstorms NXT robot. In this research, LEGO robots built in the form of line follower robot. Robot is able to browse and find a way out of the dynamic labyrinth. In track and find a way out, LEGO robot uses an algorithm Breadth First Search and Manhattan Distance in deciding which path to take. When encountering an obstacle object, LEGO robot will recognize and avoid that obstacle objects with Obstacle Detection algorithm. The results prove that the implementation of a dynamic maze search algorithm can be implemented on a LEGO robot even though there are many limitations in LEGO robot.</dc:description>
	<dc:publisher xml:lang="en-US">Faculty of Computer Science  - Universitas Indonesia</dc:publisher>
	<dc:date>2012-05-29</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/153</dc:identifier>
	<dc:identifier>10.21609/jiki.v4i1.153</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Ilmu Komputer dan Informasi; Vol. 4 No. 1 (2011): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information); 15-22</dc:source>
	<dc:source>2502-9274</dc:source>
	<dc:source>2088-7051</dc:source>
	<dc:source>10.21609/jiki.v4i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/153/269</dc:relation>
</oai_dc:dc>