[Path-Planner] Composite-Units

[Elscha]

After several concept meetings, we came up with a decision to realize Composite-Modules in the sense of the path planning algorithm.

Key Properties

1. Contained modules (Nano-Modules / Composite-Modules) are selected via competencies (pre- & post-conditions)
   • As a consequence, there must exist a valid path via the nested elements from the pre-condition of the Composite to its post-condition.
2. Optional: The content can be restricted by a Selector, e.g.
   • Only content of the group
   • Only content from lecturer X
   • Extreme: Only from the following modules (so that no more choice is possible)
3. Based on this approch, there is no longer a distinction between Composite and Courses needed (with regard to the algorithm). A Compositecan be defined in the same way as a course (competencies, optional sequence, selectors, ...). Consequently, a course (Composite) can also be nested in another course.
4. The algorithm should first determine a path from Nano-Modules and Composites and then recursively determine the path within all Composites.
5. A Composite should be preferred over the elements it contains (if all are required). If less Nano-Modules are needed, than these should be preferred.
   • Thus: Composites receive a small bonus in the cost function (e.g. 0.9 * Σ cost(NMi)).

Prerequisites

• Implemented revision of #17
• Definition of #21

Meeting Notes (German)

• Selflearn Protokoll - 2024-05-30.docx

[Elscha]

@kschmid please check / add comments