Lab Course Parallel Computing for Mobile Robots
In 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*
Semester:
WSYear:
2024Course Number:
MA-INF 4226Course Start Date:
15.10.2024Course End Date:
TBAResponsible HRL Lecturers:
Important dates
The introductory meeting for all interested participants will take place on Tuesday, 15.10.2024 in room 2.044. In the introductory meeting, we will talk about the topics of the lab in more detail, give a short introduction to CUDA computing, and answer questions.
Schedule
| Tuesday, 15.10.2024, 15:00-16:00 | Introductory meeting in room 2.044 |
| Thursday, 25.04.2024 | Registration deadline in BASIS |
| TBA | Oral exams |
After the first lab meeting, the participants can arrange their working schedule individually after consultation with their supervisor.