Robustness and stability in dynamic constraint satisfaction problems

Many real life problems come from uncertain and dynamic environments and therefore, the original problems, and consequently their associated Constraint Satisfaction Problem (CSP) models, may evolve over the time. In such situations, a solution that holds for the original problem can become invalid after changes occur. There exist two main approaches for dealing with these situations: reactive and proactive. Using reactive approaches entails re-solving the CSP after a solution is no longer a solution, which is time consuming. For this reason, such as mentioned in the Verfaillie and Jussien (2005) survey, a desirable objective is: “limit as much as possible the need for successive online problem solvings.”

[1]  Yongping Ran.  Approaches to Find a Near-minimal Change Solution for Dynamic CSPs , 2002 .

[2]  Thomas Schiex,et al.  Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..

[3]  Thomas Schiex,et al.  Maintaining Reversible DAC for Max-CSP , 1999, Artif. Intell..

[4]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[5]  Erica Jen,et al.  Stable or robust? What's the difference? , 2003, Complex..

[6]  Thomas Schiex,et al.  Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.

[7]  Rommert Dekker,et al.  Hybrid Meta-Heuristics for Robust Scheduling , 2006 .

[8]  Thomas Schiex,et al.  Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[9]  Jan Van Damme,et al.  Project scheduling under uncertainty survey and research potentials , 2002 .

[10]  Carmen Gervet,et al.  Certainty closure: Reliable constraint reasoning with incomplete or erroneous data , 2006, TOCL.

[11]  B. Schröder.  Ordered Sets: An Introduction , 2012 .

[12]  Toby Walsh,et al.  Search in a Small World , 1999, IJCAI.

[13]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

[14]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[15]  Jamila Sam.  Constraint consistency techniques for continuous domains , 1995 .

[16]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[17]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[18]  Christophe Lecoutre,et al.  Constraint Networks: Techniques and Algorithms , 2009 .

[19]  Richard J. Wallace,et al.  Problem-Structure vs . Solution-Based Methods for Solving Dynamic Constraint Satisfaction Problems , 2010 .

[20]  B. J. Winer,et al.  Statistical Principles in Experimental Design, 2nd Edition. , 1973 .

[21]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[22]  Eugene C. Freuder,et al.  Stable Solutions for Dynamic Constraint Satisfaction Problems , 1998, CP.

[23]  Hans J. Herrmann,et al.  Onion-like network topology enhances robustness against malicious attacks , 2011 .

[24]  Peter van Beek,et al.  On Universal Restart Strategies for Backtracking Search , 2007, CP.

[25]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[26]  Barry O'Sullivan,et al.  Distance Constraints in Constraint Satisfaction , 2007, IJCAI.

[27]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[28]  Richard J. Wallace,et al.  Uncertainty in dynamic constraint satisfaction problems , 2016, AI Commun..

[29]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[30]  H. Kitano.  Towards a theory of biological robustness , 2007, Molecular systems biology.

[31]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

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

[33]  MSc PhD Ian Miguel BSC.  Dynamic Flexible Constraint Satisfaction and its Application to AI Planning , 2004, Distinguished Dissertations.

[34]  Olivier Lhomme,et al.  Consistency Techniques for Numeric CSPs , 1993, IJCAI.

[35]  Gérard Verfaillie,et al.  Constraint Solving in Uncertain and Dynamic Environments: A Survey , 2005, Constraints.

[36]  Alan K. Mackworth.  On Reading Sketch Maps , 1977, IJCAI.

[37]  Toby Walsh,et al.  Stochastic Constraint Programming , 2002, ECAI.

[38]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[39]  William F. Basener.  Topology and its applications , 2006 .

[40]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.