Abstract
The article is devoted to the problem of reactive navigation of a mobile robot with limited information about the environment. An algorithm for finding a path from source to the target with a minimum number of turns is described. The idea of the algorithm is based on the bug family of algorithms for reactive navigation. The mobile robot remembers the boundaries of obstacles and calculates the angle of rotation depending on the surrounding situation. The difference from bug algorithms is that the robot does not move “along the obstacle”, but turns only in a limited number of cases. The results of testing the algorithm on simulated polygons are presented. Models of fallen trees, stumps and swamps were considered as obstacles. The performance of the algorithm is evaluated by comparing the minimum possible number of turns with the number of turns in the path obtained using the algorithm.
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 callMore From: Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes
Disclaimer: 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.
