Please use this identifier to cite or link to this item: https://repository.uksw.edu//handle/123456789/11340
Title: Perancangan Sistem dan Algoritma Penyelamatan Boneka Bayi pada Kontes Robot Pemadam Api Indonesia 2016
Authors: Pamerdi, Tyas Bani
Issue Date: 2016
Publisher: Program Studi Teknik Elektro FTEK-UKSW
Abstract: Tujuan utama robot pemadam api untuk level 3 adalah untuk menyelamatkan korban kebakaran yang dilambangkan dengan boneka bayi baik dan benar. Robot harus mampu menemukan serta mengangkat baby cradle menggunakan lengan penjepit, kemudian membawa bayi ke tempat aman, pertama di primary safe zone yang terletak di ruang start robot di area A. Kedua di secondary safe zone yang berada di balik dinding yang terdapat target khusus. Diperlukan algoritma yang baik dalam menemukan baby cradle, mengangkat baby cradle, serta menemukan target secondary safe zone dan meletakan baby cradle ke balik dinding. Robot mempunyai dua algoritma, algoritma pertama algoritma pencarian baby cradle dan mengangkat baby cradle. Algoritma kedua, ketika robot telah membawa baby cradle dan melakukan pencarian target secondary safe zone. Setelah menemukan target, maka robot akan meletakan baby cradle dibalik dinding yang bertarget dan tugas robot selesai. Pengujian untuk algoritma pertama dilakukan pada setiap ruang di area B dengan total jumlah pengujian masing-masing 40 kali. Robot berhasil menemukan baby cradle dengan benar sebanyak 34 kali sehingga presentasenya adalah 85%. Dalam mengangkat baby cradle robot berhasil sebanyak 31 kali sehingga presentasenya adalah 77,5%. Pengujian untuk algoritma kedua menemukan target safe zone kemudian meletakan baby cradle dilakukan total 55 kali pengujian. Robot berhasil sebanyak 47 kali, sehingga presentase keberhasilannya adalah 85,45%.
The aim of the level 3 fire robot is to save a fire victim, that is represented by a doll of a baby, due to the rescue procedure. The robot would identify the blue LED that is stick to the doll. The robot would carry the baby cradle with a pair of tweezers, then take it to a save area. The first safe area is the primary safe zone that is located in the starting point in the area A. The second safe area is the secondary safe zone behind the wall where a specified target is located. Therefore, the right algorithm to find the baby cradle, carry it, and find the secondary safe zone then put the baby cradle behind the wall. The first algorithm is the algorithm to find the baby cradle and to carry it. Meanwhile, the second algorithm works as a program to find the secondary safe zone while carrying the baby cradle. After finding the target, the robot would put the baby behind the wall where the target is located then the mission is accomplished. The first algorithm, examined 40 times for each program. The robot is able to find the baby cradle 34 times that is calculated as 85%. In carrying the baby cradle, the robot accomplishes the mission for 31 times that is calculated as 77.5%. The second algorithm, examined 55 times. The robot accomplishes the mission for 47 times, so it is calculated as 85.45%.
URI: http://repository.uksw.edu/handle/123456789/11340
Appears in Collections:T1 - Electrical Engineering

Files in This Item:
File Description SizeFormat 
T1_612011028_BAB I.pdfBAB I193.65 kBAdobe PDFView/Open
T1_612011028_BAB II.pdfBAB II1.46 MBAdobe PDFView/Open
T1_612011028_BAB III.pdfBAB III1.31 MBAdobe PDFView/Open
T1_612011028_BAB IV.pdfBAB IV388.26 kBAdobe PDFView/Open
T1_612011028_BAB V.pdfBAB V117.73 kBAdobe PDFView/Open
T1_612011028_Daftar Pustaka.pdfDaftar Pustaka122.03 kBAdobe PDFView/Open
T1_612011028_Judul.pdfHalaman Judul1.19 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.