Skip to main content
Log in

Branching Constraint Satisfaction Problems and Markov Decision Problems Compared

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Branching Constraint Satisfaction Problems (BCSPs) model a class of uncertain dynamic resource allocation problems. We describe the features of BCSPs, and show that the associated decision problem is NP-complete. Markov Decision Problems could be used in place of BCSPs, but we show analytically and empirically that, for the class of problems in question, the BCSP algorithms are more efficient than the related MDP algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.E. Bellman, Dynamic Programming (Princeton University Press, Princeton, NJ, 1957).

    Google Scholar 

  2. C. Boutilier, T. Dean and S. Hanks, Decision-theoretic planning: structural assumptions and computation leverage, Journal of Artificial Intelligence Research 1 (1999) 1–93.

    Google Scholar 

  3. C. Boutillier, R. Dearden and M. Goldszmidt, Exploiting structure in policy construction, in: Proceedings of IJCAI-95 (1995).

  4. J.A. Boyan and A.W. Moore, Learning evaluation functions for large acyclic domains, in: Machine Learning: Proceedings of the Thirteenth International Conference, ed. L. Saitta (1996) pp. 63–70.

  5. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990).

    Google Scholar 

  6. R. Dechter and A. Dechter, Belief maintenance in dynamic constraint networks. in: Proceedings of AAAI-88 (1988) pp. 37–43.

  7. H. Fargier, J. Lang and T. Schiex, Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge, in: Proceedings of AAAI-96, Portland, OR (1996).

  8. D.W. Fowler and K.N. Brown, Branching constraint satisfaction problems for solutions robust under likely changes, in: Proceedings of CP2000, Singapore (2000) pp. 500–504.

  9. D.W. Fowler and K.N. Brown, Modelling and solving problems with probable changes, in: ECAI 2000 Workshop on Modelling and Solving Problems with Constraints, Berlin (2000) pp. E:1–9.

  10. M.L. Ginsberg, A.J. Parkes and A. Roy, Supermodels and robustness, in: AAAI-98 (1998) pp. 334–339.

  11. M. Haralick and G.L. Elliott, Increasing tree-search efficiency for constraint satisfaction problems, Artificial Intelligence 14 (1980) 263–313.

    Google Scholar 

  12. P.V. Hentenryck, Y. Deville and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence 57 (1992) 291–321.

    Google Scholar 

  13. R.A. Howard, Dynamic Programming and Markov Processes (MIT Press/ Wiley, 1960).

  14. G. Kondrak and P. van Beek, A theoretical evaluation of selected backtracking algorithms, Artificial Intelligence 89 (1997) 365–387.

    Google Scholar 

  15. M.L. Littman, Initial experiments in stochastic satisfiability, in: Proceedings of AAAI-99 (1999) pp. 667–672.

  16. M.L. Littman, T.L. Dean and L.P. Kaelbling, On the complexity of solvingMarkov decision problems, in: 11th Annual Conference on Uncertainty in Artificial Intelligence (UAI-1995) (1995).

  17. P. Prosser, Hybrid algorithms for the constraint satisfaction problem, Computational Intelligence 9(3) (1993) 268–299.

    Google Scholar 

  18. M.L. Puterman, Markov Decision Processes (Wiley, New York, 1994).

    Google Scholar 

  19. G. Verfaillie and T. Schiex, Solution reuse in dynamic constraint satisfaction problems, in: Proceedings of AAAI-94, Seattle, WA, USA (1994) pp. 307–312.

  20. R.J. Wallace and E.C. Freuder, Stable solutions for dynamic constraint satisfaction problems, in: Workshop on the Theory and Practice of Dynamic Constraint Satisfaction, Salzburg, Austria (1997).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fowler, D.W., Brown, K.N. Branching Constraint Satisfaction Problems and Markov Decision Problems Compared. Annals of Operations Research 118, 85–100 (2003). https://doi.org/10.1023/A:1021853506616

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021853506616

Navigation