Street cleaning robot algorithm

Abstract

This thesis presents a street cleaning robot algorithm that efficiently plans the shortest path between points while considering dynamic obstacles. The proposed algorithm is designed to update the planned path in real-time based on the latest sensor data. The simulation and prototype demonstrate the effectiveness of the algorithm in navigating through a complex environment while avoiding obstacles. The results show that the proposed algorithm can work in outdoor environments in Mongolian different climates. The simulation and prototype results confirm the effectiveness of the algorithm. Furthermore, since these types of devices have not been used in Mongolia before, this research presents a new possibility for their application in the region.