Constraint Programming for Planning Routes in an E-learning Environment
António Garrido, Eva Onaind ́ ia, Óscar Sapena · 2007
AI planning techniques offer very appealing possibilities for their application to e-learning environments. After all, deal-ing 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 ex-pressive constraint programming approach. After present-ing a general planning formulation based on constraint pro-gramming, we adapt it to an e-learning setting. This requires to model learners profiles, learning concepts, how tasks at-tain concepts at different competence levels, synchronisa-tion 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.