MAZE SOLVING RETURN TRIP FOR MOBILE ROBOT USING DEEP FIRST SEARCH METHODE

  • Richa Watiasih Universitas Bhayangkara Surabaya
  • Kuspijani . Universitas Bhayangkara Surabaya
  • Prihastono . Universitas Bhayangkara Surabaya
  • Ramadhana . Universitas Bhayangkara Surabaya
Keywords: mobile robot, Deep First Search, return trip

Abstract

This paper is the result of research on wheeled robot strategy in completing task by using deep first search (DFS) method for return trip. This DFS method serves to map the path through which the robot and process it as a return trip route. By this method the robot is able to recognize the intersection, obstacle, and field door conditions. So that the robot can know the way that has traveled through the robot from the point of departure (home) to the room (R1-R4) where the target is located. The results obtained are robots capable of completing tasks in less than 60 seconds.

Published
2017-08-29
Section
Articles