Abstract
Cleanliness is a mandatory requirement to help prevent virus spread. The cleaning process can be done automatically by humans or robotic devices. If a robot does this process, it is a must that the robot is able to explore the room autonomously. The robot movement in room tracking should reach all points without obstructions and return to its initial position. This study simulated the movement of a room explorer robot using the imperfect maze method, as well as searching a room that has not been explored using the A* algorithm. The A* algorithm was also used to find the shortest path to reach the initial place of the robot when the room exploration was completed. The results of the simulation showed that the imperfect maze could be used to explore the room well, and A* algorithm is quite optimal to be used for searching both the unexplored room and the path to return to its initial position
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
