Lab Course Parallel Computing for Mobile Robots
n this lab, students gain hands-on experience with parallel computing principles and the CUDA framework. Starting off with simple, introductory examples and then moving on to a common motion planning task, a parallelized version of shortest path finding with the A* algorithm in a Visibility Graph will be implemented using C++ in small groups of two or three students. More details on the topics and the requirements will be presented at the first introductory meeting.
Prerequisites: C++, Linux
Contents: CUDA computing, Shortest path planning, Collision Checking, Visibility Graph, A*