Constraint satisfaction techniques in planning and scheduling

被引:0
作者
Roman Barták
Miguel A. Salido
Francesca Rossi
机构
[1] Charles University,
[2] Universidad Politécnica de Valencia,undefined
[3] University of Padova,undefined
来源
Journal of Intelligent Manufacturing | 2010年 / 21卷
关键词
Constraint satisfaction; Planning; Scheduling;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:10
相关论文
共 33 条
[1]  
Bitner J.R.(1975)Backtracking programming techniques Communications of the ACM 18 651-655
[2]  
Reingold E.M.(1997)Fast planning through planning graph analysis Artificial Intelligence 90 281-300
[3]  
Blum A.(1991)Temporal constraint network Artificial Intelligence 49 61-95
[4]  
Furst M.(2006)An approach to temporal planning and scheduling in domains with predictable exogenous events Journal of Artificial Intelligence Research 25 187-231
[5]  
Dechter R.(1979)Optimization and approximation in deterministic sequencing and scheduling: A survey Annals of Discrete Mathematics 5 287-326
[6]  
Meiri I.(1980)Increasing tree efficiency for constraint satisfaction problems Artificial Intelligence 14 263-314
[7]  
Pearl J.(2003)Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results Artificial Intelligence 143 151-188
[8]  
Gerevini A.(1998)Remote agent: To boldly go where no AI system has gone before Artificial Intelligence 103 5-47
[9]  
Saetti A.(1993)Hybrid algorithm for the constraint satisfaction problem Computational Intelligence 9 268-299
[10]  
Serina I.(1998)Constraint satisfaction—A survey CWI Quarterly 11 123-162