Skip to main content
SpringerLink
Log in

Min-domain retroactive ordering for Asynchronous Backtracking

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the Min-domain property (Haralick and Elliott, Artif Intel 14:263–313, 1980; Bessiere and Regin, Mac and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In Proc. CP 96, pp. 61–75, Cambridge, MA, 1996; Smith and Grant, Trying harder to fail first. In European Conference on Artificial Intelligence, pp. 249–253, 1998; Dechter, Constraint Processing. Morgan Kaufman, 2003). Ordering heuristics have been introduced recently to asynchronous backtracking (ABT), for distributed constraints satisfaction (DisCSP) (Zivan and Meisels, Dynamic ordering for asynchronous backtracking on discsps. In CP-2005, pp. 32–46, Sigtes (Barcelona), Spain, 2005). However, the pioneering study of dynamically ordered ABT, ABT_DO, has shown that a straightforward implementation of the Min-domain heuristic does not produce the expected improvement over a static ordering. The present paper proposes an asynchronous dynamic ordering which does not follow the standard restrictions on the position of reordered agents in ABT_DO. Agents can be moved to a position that is higher than that of the target of the backtrack. Combining the Nogood-triggered heuristic and the Min-domain property in this new class of heuristics results in the best performing version of ABT_DO. The new version of retroactively ordered ABT is faster by a large factor than the best form of ABT.

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

Access this article

Log in via an institution

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. Baker, A. B. (1994). The hazards of fancy backtracking. In Proceedings of the 12th national conference on artificial intelligence (AAAI ’94) (Vol. 1, pp. 288–293). Seattle, WA, USA: AAAI Press July 31–August 4.

    Google Scholar 

  2. Bessiere, C., & Regin, J. C. (1996). Mac and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proc. CP 96 (pp. 61–75). Cambridge, MA.

  3. Bessiere, C., Maestre, A., & Messeguer, P. (2001). Distributed dynamic backtracking. In Proc. workshop on distributed constraint of IJCAI01.

  4. Bessiere, C., Maestre, A., Brito, I., & Meseguer, P. (2005). Asynchronous backtracking without adding links: A new member in the abt family. Artificial Intelligence, 161(1–2), 7–24, January.

    Article  MATH  MathSciNet  Google Scholar 

  5. Brito, I., & Meseguer, P. (2004). Synchronous,asnchronous and hybrid algorithms for discsp. In Workshop on distributed constraints reasoning (DCR-04) CP-2004. Toronto, September.

  6. Dechter, R. (2003). Constraint processing. Morgan Kaufman.

  7. Gent, I. P., & Walsh, T. (1999). Csplib: A benchmark library for constraints. Technical report, Technical report APES-09-1999. Available from http://csplib.cs.strath.ac.uk/. A shorter version appears in the Proceedings of the 5th international conference on principles and practices of constraint programming (CP-99).

  8. Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25–46.

    MATH  Google Scholar 

  9. Hamadi, Y. (2001). Distributed interleaved parallel and cooperative search in constraint satisfaction networks. In Proc. intelligent agent technology, 2001 (IAT-01). Singappore.

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

    Article  Google Scholar 

  11. Lamport, L. (1978). Time, clocks, and the ordering of events in distributed system. Communication of the ACM, 2, 95–114, April.

    MathSciNet  Google Scholar 

  12. Lynch, N. A. (1997). Distributed algorithms. Morgan Kaufmann Series.

  13. Meisels, A., & Zivan, R. (2007). Asynchronous forward-checking for DisCSPs. Constraints, 12(1), 131–150.

    Article  MATH  MathSciNet  Google Scholar 

  14. Meisels, A., Razgon, I., Kaplansky, E., & Zivan R. (2002). Comparing performance of distributed constraints processing algorithms. In Proc. AAMAS-2002 workshop on distributed constraint reasoning DCR (pp. 86–93). Bologna, July.

  15. Nguyen, T., Sam-Hroud, D., & Faltings, B. (2004). Dynamic distributed backjumping. In Proc. 5th workshop on distributed constraints reasoning DCR-04. Toronto, September.

  16. Prosser, P. (1996). An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81, 81–109.

    Article  MathSciNet  Google Scholar 

  17. Silaghi, M. C., & Faltings, B. (2005). Asynchronous aggregation and consistency in distributed constraint satisfaction. Artificial Intelligence, 161(1–2), 25–54, January.

    Article  MATH  MathSciNet  Google Scholar 

  18. Silaghi, M. C., Sam-Haroud, D., & Faltings, B. (2001). Hybridizing abt and awc into a polynomial space, complete protocol with reordering. Technical Report, 01/#364, EPFL, May.

  19. Silaghi, M. C. (2006). Generalized dynamic ordering for asynchronous backtracking on discsps. In AAMAS 2006, DCR workshop. Hakodate, Japan.

  20. Smith, B. M., & Grant, S. A. (1998). Trying harder to fail first. In European conference on artificial intelligence (pp. 249–253).

  21. Smith, B. M. (1996). Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 155–181.

    Article  MathSciNet  Google Scholar 

  22. Solotorevsky, G., Gudes, E., & Meisels, A. (1996). Modeling and solving distributed constraint satisfaction problems (dcsps). In Constraint Processing-96 (short paper) (pp. 561–2). Cambridge, Massachusetts, USA, October.

  23. Yokoo, M., & Hirayama, K. (2000). Algorithms for distributed constraint satisfaction problems: A review. Autonomous Agents & Multi-Agent System, 3, 198–212.

    Google Scholar 

  24. Yokoo, M., Durfee, E. H., Ishida, T., & Kuwabara, K. (1998). Distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Data and Knowledge Engineering, 10, 673–685.

    Article  Google Scholar 

  25. Yokoo, M. (1995). Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In Proceedings of the 1st international conference on constraint programming (pp. 88–102). France: Cassis.

    Google Scholar 

  26. Yokoo, M. (2000). Distributed constraint satisfaction: Foundation and cooperation in multi agent systems. Springer.

  27. Zivan, R., & Meisels, A. (2003). Synchronous vs asynchronous search on discsps. In Proc. 1st European workshop on multi agent system, EUMAS. Oxford, December.

  28. Zivan, R., & Meisels, A. (2005). Dynamic ordering for asynchronous backtracking on DisCSPs. In CP-2005 (pp. 32–46). Sigtes (Barcelona), Spain.

  29. Zivan, R., & Meisels, A. (2006a). Dynamic ordering for asynchronous backtracking on DisCSPs. Constraints, 11(2,3), 179–197.

    Article  MATH  MathSciNet  Google Scholar 

  30. Zivan, R., & Meisels, A. (2006b). Message delay and asynchronous discsp search. Archives of Control Sciences, 16(2), 221–242.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel

    Roie Zivan, Moshe Zazone & Amnon Meisels

Authors
  1. Roie Zivan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moshe Zazone
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amnon Meisels
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roie Zivan.

Additional information

Supported by the Lynn and William Frankel center for Computer Sciences and the Paul Ivanier Center for Robotics and Production Management.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zivan, R., Zazone, M. & Meisels, A. Min-domain retroactive ordering for Asynchronous Backtracking. Constraints 14, 177–198 (2009). https://doi.org/10.1007/s10601-008-9046-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-008-9046-z

Keywords

Search

Navigation