Skip to main content

Asynchronous Constraint-Based Approach: New Solution for any Constraint Problem

  • Chapter
Rational, Robust, and Secure Negotiations in Multi-Agent Systems

Part of the book series: Studies in Computational Intelligence ((SCI,volume 89))

  • 1487 Accesses

This paper is organized as follows. In Sect. 2, we present the proposed dual based asynchronous solving approach. In Sect. 3, we discuss the termination and complexity properties. In Sect. 4, we give some preliminary experimental results. Finally, Sect. 5 concludes the paper.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BenHassine, A., Ghedira, K.: How to Establish Arc-Consistency by Reactive Agents. In Proceedings of the 15th ECAI-02. (2002) 156–160

    Google Scholar 

  2. Bessiere, C., Freuder, E., Regin, J-C.: Using Constraint Metaknowledge to Reduce Arc Consistency Computation. Artificial Intelligence 107 (1999) 125–148

    Article  MATH  MathSciNet  Google Scholar 

  3. Briot, J.P. Actalk: A Framework for Object-Oriented Concurrent Programming – Design and Experience. In Proceedings of the Second France-Japan Workshop (OBPDC-97). (1997) 23

    Google Scholar 

  4. Cheesman P., Kanefsky B., Taylor, W.: Where the Really Hard Problems are. In Proceedings of the 12th International Joint Conference on AI. (1991) 331–337

    Google Scholar 

  5. Conry S.E., Kuwabara K., Lesser V.R., Meyer, R.A.: Multistage Negotiation for Distributed Constraint Satisfaction. IEEE Transactions on Systems, Man and Cybernetics 21(6) (1991) 1462–1477

    Article  MATH  Google Scholar 

  6. Dechter R. and Pearl, J.: Tree-Clustering Schemes for Constraint-Processing. In Proceedings of the AAAI-88. (1988) 150–154

    Google Scholar 

  7. Hamadi Y., Bessiere C., Quinqueton, J.: Backtracking in Distributed Constraint Networks. In Proceedings of ECAI. (1998) 219–223

    Google Scholar 

  8. Huhns M.N., Bridgeland, D.M.: Multiagent Truth Maintenance. IEEE Transactions on Systems, Man and Cybernetics 21(6) (1991) 1437–1445

    Article  Google Scholar 

  9. Lamport, L. Chandy, K.M.: Distributed Snapshots: Determining Global States of Distributed Systems. TOCS 3(1) (1985) 63–75

    Article  Google Scholar 

  10. Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8 (1977) 99–118

    Article  MATH  Google Scholar 

  11. Maestre A., Bessiere, C.: Improving Asynchronous Backtracking for Dealing with Complex Local Problems. In Proceedings of the International Conference(ECAI). (2004) 206–210

    Google Scholar 

  12. Montanari, U.: Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Sciences 7 (1974) 95–132

    Article  MathSciNet  Google Scholar 

  13. Regin, J.C.: A Filtering Algorithm for Constraints of Difference in CSPs. In Proceedings of the International Conference on AAAI. (1994) 362–367

    Google Scholar 

  14. Silaghi, M.-C., Sam-Haroud D., Faltings, B.V.: Asynchronous Search with Aggregations. In Proceedings of the 17th National Conference on Artificial Intelligence AAAI. (2000) 917–922

    Google Scholar 

  15. Sycara, K.P., Roth, S., Sadeh, N., Fox, M.S.: Distributed Constrained Heuristic Search. IEEE Transactions on Systems, Man and Cybernetics 21(6) (1991) 1446–1461

    Article  Google Scholar 

  16. Yokoo, M.: Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems. In Proceedings of the Constraint Programming. (1995) 88–102

    Google Scholar 

  17. Yokoo, M., Hirayama, K.: Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems. In Proceedings of the International Conference on ICMAS. (1996) 401–408

    Google Scholar 

  18. Yokoo, M., Ishida, T., Kuwabara, K.: Distributed Constraint Satisfaction for DAI Problems. In Proceedings of the tenth International Workshop on Distributed Artificial Intelligence. (1990)

    Google Scholar 

  19. Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed Constraint Satisfaction Formalizing Distributed Problem Solving. In Proceedings of the DCS. (1992) 614–621

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hassine, A.B., Ho, T.B. (2008). Asynchronous Constraint-Based Approach: New Solution for any Constraint Problem. In: Ito, T., Hattori, H., Zhang, M., Matsuo, T. (eds) Rational, Robust, and Secure Negotiations in Multi-Agent Systems. Studies in Computational Intelligence, vol 89. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76282-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76282-9_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76281-2

  • Online ISBN: 978-3-540-76282-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics