An Extended Abstract: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems

The work described in this paper was inspired by a surprisingly effective neural network developed for scheduling astronomical observations on the Hubble Space Telescope. Our heuristic constraint satisfaction problem (CSP) method was distilled from an analysis of the network. In the process of carrying out the analysis, we discovered that the effectiveness of the network has little to do with its connectionist implementation. Furthermore, the ideas employed in the network can be implemented very efficiently within a symbolic CSP framework. The symbolic implementation is extremely simple. It also has the advantage that several different search strategies can be employed, although we have found that hill-climbing methods are particularly well-suited for the applications that we have investigated. We begin the paper with a brief review of the neural network. Following this, we describe our symbolic method for heuristic repair.

[1]  Gerald Jay Sussman,et al.  A Computer Model of Skill Acquisition , 1975 .

[2]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[3]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  Kristian J. Hammond,et al.  Case-based planning: an integrated theory of planning, learning and memory , 1986 .

[7]  Janice M. Stone,et al.  Efficient Search Techniques - An Empirical Study of the N-Queens Problem , 1987, IBM J. Res. Dev..

[8]  Reid G. Simmons,et al.  A Theory of Debugging Plans and Interpretations , 1988, AAAI.

[9]  Gilles Brassard,et al.  Algorithmics - theory and practice , 1988 .

[10]  M. Johnston.  Automated telescope scheduling , 1988 .

[11]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[12]  Stephen F. Smith,et al.  Generating Space Telescope Observation Schedules , 1989 .

[13]  Norman M. Sadeh,et al.  Constrained Heuristic Search , 1989, IJCAI.

[14]  Monte Zweben,et al.  Learning Search Control for Constraint-Based Scheduling , 1990, AAAI.

[15]  Mark D. Johnston,et al.  A discrete stochastic neural network algorithm for constraint satisfaction problems , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[16]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[17]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[18]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[19]  Subbarao Kambhampati,et al.  Supporting Flexible Plan Reuse , 1993 .