22
A Computationally Efficient Solution to the SLAM Problem in Houses of Mirrors
Dr. Dexter “The Kalman Man” Robotnik1
1 Department of Carnival Robotics, Cranberry-Lemon University, Pittsburgh, PA, USA
Abstract
Every day, people are dying because there is no method for a robot to navigate in a house of mirrors. The Simultaneous Localization and Mapping (SLAM) algorithm has been theoretically developed and optimized for computational efficiency in most environments where robots may need to navigate[1]. The SLAM algorithm works by estimating the location of nearby features, usually visually, and then estimating the position of the robot in relation to those features. The map is often in two dimensions and sometimes three. It provides an incredibly ...
Get Et al. now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
