EXPERIMENTAL ANALYSIS OF ALGORITHMS FOR LOCALIZING A MOBILE ROBOT
We consider three approximation algorithms for the robot localization problem. One of them is based on a simple triangulation of a polygon representing a map. On the basis of their program implementation conducted experimental studies of these algorithms. The numerical results and their interpretation.
Authors: Dаo Duy Nam, S. A. Ivanovskiy
Direction: Informatics and Computer Technologies
Keywords: Robotics, robot localization, computational geometry, algorithm complexity, approximation algorithm, polygon triangulation
View full article