Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Robot Localization
C++ Racket D
branch: master

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.
Debug
IITRPR
src
.cproject
.gitignore
.project
Office.txt
Office_Simple.txt
Office_anti.txt
README.md
Scenario1.txt
Scenario2.txt
Scenario3.txt
Scenario4.txt
Scenario5.txt
Scenario6.txt

README.md

Robot Localization Problem


In this project we explore the various algorithms for the Robot Local- ization Problem and build a simulator to visualize the results on vari- ous 2D maps. Robot localization is an important problem in robotics. Simply put, the robot localization problem is as follows. A robot is placed at an unknown point inside a simple polygon P . The robot has a map of P and can compute visibility polygon from its current location. The robot must determine its correct location inside the polygon P at a minimum cost of travel distance. We implement an approximation algorithm as given by Apurva Mudgal [2006]. The pa- per gives an O(log3 n) factor approximation algorithm however our main emphasis is to show the practicality of the algorithm. In this project we are simulating it on different maps without taking time complexity in consideration. Computational Geometry Algorithms Library CGAL has been used for the various computational geometry algorithms.

Something went wrong with that request. Please try again.