Skip to Main Content
This article provides a broad perspective of the potential applicability of graphical processing units (GPUs) computing power in robotics, specifically in the well-known problem of two-dimensional (2-D) robotic mapping. There are three possible ways of exploiting these massively parallel devices: 1) parallelizing existing algorithms, 2) integrating already existing parallelized general purpose software, and 3) use of its high-computational capabilities in the inception of new algorithms. This article presents examples for all three options: parallelizing a popular implementation of the gridmapping algorithm, using a GPU open-source linear sparse system solver to address the problem of linear least squares graph minimization, and developing a novel method that can be efficiently parallelized and executed in a GPU for handling overlapping grid maps in a mapping with local maps algorithm. Large speedups are shown in the experiments, highlighting the importance of this technology in robotic software development in the near future, as is already the case in many other areas.