Best-first branch and bound search method for map based localization


To know the pose of the robot is one of the central requirements in many applications. A localization algorithm should be robust, it should give the estimate of unreliability and it should be able to recover from errors. The above requirements are often trade offs with the computational complexity. This paper presents a global localization algorithm that… (More)
DOI: 10.1109/IROS.2011.6094720


11 Figures and Tables