CABINS - A FRAMEWORK OF KNOWLEDGE ACQUISITION AND ITERATIVE REVISION FOR SCHEDULE IMPROVEMENT AND REACTIVE REPAIR

被引:29
作者
MIYASHITA, K [1 ]
SYCARA, K [1 ]
机构
[1] CARNEGIE MELLON UNIV,INST ROBOT,PITTSBURGH,PA 15213
关键词
D O I
10.1016/0004-3702(94)00089-J
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Practical scheduling problems generally require allocation of resources in the presence of a large, diverse and typically conflicting set of constraints and optimization criteria. The ill-structuredness of both the solution space and the desired objectives make scheduling problems difficult to formalize. This paper describes a case-based learning method for acquiring context-dependent user optimization preferences and tradeoffs and using them to incrementally improve schedule quality in predictive scheduling and reactive schedule management in response to unexpected execution events. The approach, implemented in the CABINS system, uses acquired user preferences to dynamically modify search control to guide schedule improvement. During iterative repair, cases are exploited for: (1) repair action selection, (2) evaluation of intermediate repair results and (3) recovery from revision failures. The method allows the system to dynamically switch between repair heuristic actions, each of which operates with respect to a particular local view of the problem and offers selective repair advantages. Application of a repair action tunes the search procedure to the characteristics of the local repair problem. This is achieved by dynamic modification of the search control bias. There is no a priori characterization of the amount of modification that may be required by repair actions. However, initial experimental results show that the approach is able to (a) capture and effectively utilize user scheduling preferences that were not present in the scheduling model, (b) produce schedules with high quality, without unduly sacrificing efficiency in predictive schedule generation and reactive response to unpredictable execution events along a variety of criteria that have been recognized as important in real operating environments.
引用
收藏
页码:377 / 426
页数:50
相关论文
共 54 条
[1]   THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].
ADAMS, J ;
BALAS, E ;
ZAWACK, D .
MANAGEMENT SCIENCE, 1988, 34 (03) :391-401
[2]   INSTANCE-BASED LEARNING ALGORITHMS [J].
AHA, DW ;
KIBLER, D ;
ALBERT, MK .
MACHINE LEARNING, 1991, 6 (01) :37-66
[3]  
ASHLEY KD, 1987, THESIS U MASACHUSETT
[4]  
Baker K., 1974, INTRO SEQUENCING SCH
[5]  
Bareiss R., 1989, EXEMPLAR BASED KNOWL
[6]  
Biefeld E., 1991, P 12 INT JOINT C ART, P218
[7]   ACQUIRING IMPLICIT KNOWLEDGE IN A COMPLEX-DOMAIN [J].
CHATURVEDI, AR .
EXPERT SYSTEMS WITH APPLICATIONS, 1993, 6 (01) :23-35
[8]  
CHEESEMAN P, 1991, P IJCAI 91 SYDNEY
[9]   TRADING MIPS AND MEMORY FOR KNOWLEDGE ENGINEERING [J].
CREECY, RH ;
MASAND, BM ;
SMITH, SJ ;
WALTZ, DL .
COMMUNICATIONS OF THE ACM, 1992, 35 (08) :48-64
[10]  
Dasarathy B. V., 1990, NEAREST NEIGHBOR NN