Research Article
Optimizing the Algorithm Localization Mobile Robot Using Triangulation Map
@INPROCEEDINGS{10.1007/978-3-319-56357-2_7, author={Dao Nam and Nguyen Huy}, title={Optimizing the Algorithm Localization Mobile Robot Using Triangulation Map}, proceedings={Context-Aware Systems and Applications. 5th International Conference, ICCASA 2016, Thu Dau Mot, Vietnam, November 24-25, 2016, Proceedings}, proceedings_a={ICCASA}, year={2017}, month={6}, keywords={Computational geometry Robotics Robot localization Overlay polygon Algorithm complexity Approximation algorithm Polygon triangulation}, doi={10.1007/978-3-319-56357-2_7} }- Dao Nam
Nguyen Huy
Year: 2017
Optimizing the Algorithm Localization Mobile Robot Using Triangulation Map
ICCASA
Springer
DOI: 10.1007/978-3-319-56357-2_7
Abstract
The problem of minimum distance localization in environments that may contain self-similarities is addressed. A mobile robot is placed at an unknown location inside a 2 self-similar polygonal environment . The robot has a map of and can compute visibility data through sensing. However, the self-similarities in the environment mean that the same visibility data may correspond to several different locations. The goal, therefore, is to determine the robot’s true initial location while minimizing the distance traveled by the robot. We consider approximation algorithm for the robot localization problem. The algorithm is based on triangulation of a simple polygon representing a map. Based on the basis of the implemented program, we conducted experimental studies of this algorithm. The numerical results and their interpretation are better than others.