{'fraction_non_alphanumeric': 0.021344717182497332, 'fraction_numerical': 0.0, 'mean_word_length': 5.748201438848921, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Constraint Programming for Planning Routes in an E-learning Environment

AI planning techniques offer very appealing possibilities for their application to e-learning environments. After all, dealing with course designs, learning routes and tasks keeps a strong resemblance with the main planning components. This paper focuses on planning learning routes under a very expressive constraint programming approach. After presenting a general planning formulation based on constraint programming, we adapt it to an e-learning setting. This requires to model learners profiles, learning concepts, how tasks attain concepts at different competence levels, synchronisation constraints for working-group tasks, capacity resource constraints and multi-criteria optimisation. Finally, we also present a simple example that shows the applicability of this model, the use of heuristics and how the resulting learning routes can be easily generated.