Stochastic Constraint Programming by Neuroevolution with Filtering
Stochastic Constraint Programming is an extension of Constraint Programming for modelling and solving combinatorial problems involving uncertainty. A solution to such a problem is a policy tree that specifies decision variable assignments in each scenario. Several complete solution methods have been proposed, but the authors recently showed that an incomplete approach based on neuroevolution is more scalable. In this paper we hybridise neuroevolution with constraint filtering on hard constraints, and show both theoretically and empirically that the hybrid can learn more complex policies more quickly.
Unable to display preview. Download preview PDF.
- 1.Majercik, S.M.: Stochastic Boolean Satisfiability. In: Handbook of Satisfiability, ch. 27, pp. 887–925. IOS Press, Amsterdam (2009)Google Scholar
- 2.Minsky, M., Papert, S.: Perceptrons: An Introduction to Computational Geometry. The MIT Press, Cambridge (1972)Google Scholar
- 5.Régin, J.-C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: 12th National Conference on Artificial Intelligence, pp. 362–367. AAAI Press, Menlo Park (1994)Google Scholar
- 7.Walsh, T.: Stochastic Constraint Programming. In: 15th European Conference on Artificial Intelligence (2002)Google Scholar