Planning and scheduling in an e-learning environment. A constraint-programming-based approach

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 a planning process and its main components aimed at finding which tasks must be done and when. This paper focuses on planning learning routes under a very expressive constraint programming approach for planning. After presenting the 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, multi-criteria optimisation, breaking symmetry problems and designing particular heuristics. Finally, we also present a simple example (modelled by means of an authoring tool that we are currently implementing) which shows the applicability of this model, the use of different optimisation metrics, heuristics and how the resulting learning routes can be easily generated.