Constraint satisfaction techniques in planning and scheduling

被引:60
作者
Bartak, Roman [2 ]
Salido, Miguel A. [1 ]
Rossi, Francesca [3 ]
机构
[1] Univ Politecn Valencia, E-46071 Valencia, Spain
[2] Charles Univ Prague, Prague, Czech Republic
[3] Univ Padua, Padua, Italy
关键词
Constraint satisfaction; Planning; Scheduling;
D O I
10.1007/s10845-008-0203-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Over the last few years constraint satisfaction, planning, and scheduling have received increased attention, and substantial effort has been invested in exploiting constraint satisfaction techniques when solving real life planning and scheduling problems. Constraint satisfaction is the process of finding a solution to a set of constraints. Planning is the process of finding a sequence of actions that transfer the world from some initial state to a desired state. Scheduling is the problem of assigning a set of tasks to a set of resources subject to a set of constraints. In this paper, we introduce the main definitions and techniques of constraint satisfaction, planning and scheduling from the Artificial Intelligence point of view.
引用
收藏
页码:5 / 15
页数:11
相关论文
共 52 条
[1]  
[Anonymous], 2008, Proceedings of the Eighteenth International Conference on International Conference on Automated Planning and Scheduling
[2]  
[Anonymous], P AAAI SIGMAN WORKSH
[3]  
[Anonymous], P 13 INT JOINT C ART
[4]  
[Anonymous], CMURITR9305
[5]  
[Anonymous], 2004, Handbook of Scheduling: Algorithms, Models, and Performance Analysis
[6]  
[Anonymous], P 15 WORKSH UK PLANN
[7]  
Apt K., 2003, Principles of Constraint Programming
[8]  
Baptiste P., 2001, Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems
[9]  
Baptiste P, 2006, FOUND ARTIF INTELL, P761
[10]  
BARTAK R, 2000, P CPDC 00 WORKSH INV