Courseware Sequencing Using Heuristic and Local Search

摘要

This paper proposes two intelligent agents for learning object automated sequencing using heuristic and local search. In e-learning initiatives, sequencing problem concerns arranging a particular set of learning units in a suitable succession for a particular learner. Sequencing is usually performed by instructors, who create general and ordered series rather than learner personalized sequences. E-learning standards are promoted in order to ensure interoperability. Competencies are used to define relations between learning objects within a sequence, so that the sequencing problem turns into a permutation problem and AI techniques can be used to solve it. Heuristic and Local Search are two of such techniques. An implementation of the A~* algorithm and Hill Climbing algorithm, for learning object sequencing, are presented and their performance in a real scenario is discussed.