Motion PlanningModule description #41049 / Version 1
- 6 CP
- Written exam
- Graded
- English
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v4)
| Module / Version | #41049 / #1 |
|---|---|
| Validity | Summer semester 2022 – Winter semester 2022/23 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Hönig, Wolfgang |
| Grading | Graded |
| Exam format | Written exam |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Technische Informatik und Mikroelektronik |
| Academic chair | 34342100 FG Intelligent Systems |
Contact
| Office | MAR 4-5 |
|---|---|
| Contact person | Hönig, Wolfgang |
| E-mail address | hoenig@tu-berlin.de |
| Website | https://imrclab.github.io/teaching.html |
Learning outcomes
Motion planning is a fundamental building block for autonomous systems, with applications in robotics, industrial automation, and autonomous driving.
After completion of the course, students will have a detailed understanding of:
• Formalization of geometric, kinodynamic, and optimal motion planning;
• Sampling-based approaches: Rapidly-exploring random trees (RRT) and probabilistic roadmaps (PRM);
• Search-based approaches: State-lattice based A*;
• Optimization-based approaches: Sequential convex programming;
• The theoretical properties relevant to these algorithms (completeness, optimality, and complexity).
Students will be able to:
• Decide (theoretically and empirically) which algorithm(s) to use for a given problem;
• Implement (basic versions) of the algorithms themselves;
• Use current academic and industrial tools such as the Open Motion Planning Library (OMPL).
After completion of the course, students will have a detailed understanding of:
• Formalization of geometric, kinodynamic, and optimal motion planning;
• Sampling-based approaches: Rapidly-exploring random trees (RRT) and probabilistic roadmaps (PRM);
• Search-based approaches: State-lattice based A*;
• Optimization-based approaches: Sequential convex programming;
• The theoretical properties relevant to these algorithms (completeness, optimality, and complexity).
Students will be able to:
• Decide (theoretically and empirically) which algorithm(s) to use for a given problem;
• Implement (basic versions) of the algorithms themselves;
• Use current academic and industrial tools such as the Open Motion Planning Library (OMPL).
Content
This course is jointly developed and held by Dr. Andreas Orthey (Realtime Robotics) and Dr. Wolfgang Hönig (TU Berlin). It provides a unified perspective on motion planning and includes topics from different research and industry communities. The goal is not only to learn the foundations and theory of currently used approaches, but also to be able to pick and compare the different methods for specific motion planning needs.
Part 1: Foundations
• Introduction, Motivation, and Problem Formulation
• Configuration space, Transformations, Angular representations, Metrics
• Efficient collision checking
Part 2: Search-Based
• A* and relevant variants with their theoretical properties
• Motion primitives, state-lattice-based planning
Part 3: Sampling-Based
• Sampling theory (dispersion, discrepancy)
• Tree-based planner: RRT, EST
• Roadmap-based planner: PRM
• Asymptotically-optimal sampling planner: RRT*; PRM*
• Open Motion Planning Library (OMPL)
Part 4: Optimization-Based
• Overview of continuous constrained optimization formulations
• Mathematical encoding of motion planning problems
Part 5: Current and Advanced Topics
• Realtime motion planning
• Hybrid search-, sampling-, or optimization-based motion planning
• Machine learning-based motion planning
• Multi-robot motion planning: dRRT, M*
Part 1: Foundations
• Introduction, Motivation, and Problem Formulation
• Configuration space, Transformations, Angular representations, Metrics
• Efficient collision checking
Part 2: Search-Based
• A* and relevant variants with their theoretical properties
• Motion primitives, state-lattice-based planning
Part 3: Sampling-Based
• Sampling theory (dispersion, discrepancy)
• Tree-based planner: RRT, EST
• Roadmap-based planner: PRM
• Asymptotically-optimal sampling planner: RRT*; PRM*
• Open Motion Planning Library (OMPL)
Part 4: Optimization-Based
• Overview of continuous constrained optimization formulations
• Mathematical encoding of motion planning problems
Part 5: Current and Advanced Topics
• Realtime motion planning
• Hybrid search-, sampling-, or optimization-based motion planning
• Machine learning-based motion planning
• Multi-robot motion planning: dRRT, M*
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Motion Planning | Integrated course | Irregular | [en] | 4 | ISIS |
Workload and credit points
Motion Planning (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 4 h | 60 h |
| Pre/post processing | 15 | 8 h | 120 h |
| 180 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
Weekly lectures and homework assignments
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Ability to program in C++ and Python
Mandatory requirements for the module examination registration:
The examination requirements could not be retrieved.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | English |
| Duration/Extent | 120 min |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Not specified.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Current information in the associated ISIS course.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
unavailable
Recommended literature
- Steven M. LaValle, Planning Algorithms, Cambridge University Press, 2006. Available for free at http://lavalle.pl/planning/.
Assigned programs
This module is not used in any program.
Miscellaneous
Suitable for MS and PhD students in fields that consider autonomous systems, including but not limited to computer science, electrical engineering, mechanical engineering, and aerospace engineering.