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

Engineering Applications of Artificial Intelligence

Volumn 21, Issue 5, 2008, Pages 733-743

  Garrido, Antonio ^a   Onaindia, Eva ^a   Sapena, Oscar ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Constraint programming; e Learning; Learning routes; Optimisation; Planning; Scheduling

Indexed keywords

CONSTRAINED OPTIMIZATION; HEURISTIC ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

BREAKING SYMMETRY PROBLEMS; CONSTRAINT PROGRAMMING; LEARNING ROUTES;

E-LEARNING;

EID: 44749087139     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2008.03.009     Document Type: Article

References (24)

1. Atolagbe T.A. E-learning: the use of components technologies and artificial intelligence for management and delivery of instruction. Proceedings of the 24th International Conference on Information Technology Interfaces (ITI-2002) (2002) 121-128
2. Bacchus F., and van Beek P. On the conversion between non-binary and binary constraint satisfaction problems. Proceedings of the 15th National Conference on Artificial Intelligence (1998), Madison, Wisconsin
3. Bonet B., and Geffner H. Planning as heuristic search. Artificial Intelligence 129 (2001) 5-33
4. Do M.B., and Kambhampati S. Sapa: a domain-independent heuristic metric temporal planner. In: Cesta A., and Borrajo D. (Eds). Proceedings of the European Conference on Planning (ECP-2001) (2001) 109-120
5. Felder R.M., and Silverman L.K. Learning and teaching styles in engineering education. Engineering Education 78 7 (1988) 674-681
6. Garrido A., Onaindía E., and Arangu M. Using constraint programming to model complex plans in an integrated approach for planning and scheduling. Proceedings of the 25th UK Planning and Scheduling SIG Workshop (2006) 137-144
7. Gerevini A., and Long D. Plan constraints and preferences in PDDL3. Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS-2006)-International Planning Competition (2006) 7-13
8. Haslum P. Improving heuristics through relaxed search-an analysis of TP4 and HSP*a in the 2004 planning competition. Journal of Artificial Intelligence Research 25 (2006) 233-267
9. Hoffmann J., and Nebel B. The FF planning system: fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14 (2001) 253-302
10. Kambhampati S. Planning graph as (dynamic) CSP: exploiting EBL, DDB and other CSP techniques in Graphplan. Journal of Artificial Intelligence Research 12 (2000) 1-34
11. Long D., and Fox M. Encoding temporal planning domains and validating temporal plans. Proceedings of the 20th UK Planning and Scheduling SIG Workshop (2001) 167-180
12. Manouselis, M., Sampson, D., 2002. Dynamic knowledge route selection for personalised learning environments using multiple criteria. In: Proceedings of the Intelligence and Technology in Educational Applications Workshop (ITEA-2002), Innsbruck, Austria.
13. Mittal S., and Falkenhainer B. Dynamic constraint satisfaction problems. Proceedings of the National Conference on Artificial Intelligence (1990) 25-32
14. Onaindía E., Sapena O., and Garrido A. An AI planning-based approach for automated design of learning routes. Proceedings of the 6th European Conference on e-Learning (ECEL-2007) (2007) 453-461
15. Peachy D.R., and McCalla G.I. Using planning techniques in intelligent systems. International Journal of Man-Machine Studies 24 (1986) 77-98
16. Penberthy J., and Weld D.S. UCPOP: a sound, complete, partial-order planner for ADL. Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (1992), Kaufmann, Los Altos, CA 103-114
17. Smith P.L., and Ragan T.J. Instructional Design. third ed. (2005), Wiley, New York
18. Ullrich C. Course generation based on HTN planning. Proceedings of the 13th Annual Workshop of the SIG Adaptivity and User Modeling in Interactive Systems (2005) 74-79
19. van Marcke K. Instructional expertise. Proceedings of the 2nd International Conference on Intelligent Tutoring Systems vol. 608 (1992), Springer, Berlin 234-243
20. Vassileva J. Dynamic course generation. Communication and Information Technologies 5 2 (1997) 87-102
21. Vidal V., and Geffner H. Branching and pruning: an optimal temporal POCL planner based on constraint programming. Artificial Intelligence 170 (2006) 298-335
22. Vrakas, D., Tsoumakas, G., Kokkoras, F., Bassiliades, N., Vlahavas, I., Anagnostopoulos, D., 2007. PASER: a curricula synthesis system based on automated problem solving. International Journal on Teaching and Case Studies, Special Issue on "Information Systems: The New Research Agenda, the Emerging Curriculum and the New Teaching Paradigm". 1 (1/2), 159-170.
23. Weld D. An introduction to least commitment planning. AI Magazine 15 4 (1994) 93-123
24. Zimmerman T., and Kambhampati S. Exploiting symmetry in the planning-graph via explanation-guided search. Proceedings of the National Conference on Artificial Intelligence (1999)