Abstract
Early researches on Constraints Satisfaction Problems (CSP) in Artificial Intelligence began in the 1970s. The CSP formalism addresses many problems in a simple and efficient way. However, it is not possible to solve some of these problems in a classical and centralized way, for various reasons such as prohibitive computation time or unsafe security data. To solve these naturally distributed problems, the Distributed CSP (DisCSP) have been proposed. In this paper, we present an algorithm called DBS for DisCSP solving and we discuss about the performances obtained with a random DisCSP generator.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bellifemine, F., Giovani, C., Tiziana, T., Rimassa, G.: Jade programmer’s guide. Tech. rep. (2000)
Bessiere, C., Maestre, A., Meseguer, P.: Distributed dynamic backtracking. In: Silaghi, M.C. (ed.) IJCAI 2001 workshop on Distributed Constraint Reasoning, Seattle, WA, pp. 9–16 (2001)
Clair, G., Gleizes, M.P., Kaddoum, E., Picard, G.: Self-Regulation in Self-Organising Multi-Agent Systems for Adaptive and Intelligent Manufacturing Control. In: Second IEEE International Conference on Self-Adaption and Self-Organization (SASO 2008), Venice, Italy. IEEE Computer Society, Los Alamitos (2008)
Dechter, R.: A constraint-network approach to truth maintenance. Tech. rep., Cognitive Systems Laboratory, Computer Science Dept., Univ. of California, Los Angeles (1987)
Doniec, A., Mandiau, R., Piechowiak, S., Espié, S.: Anticipation based on constraint processing in a multi-agent context. Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS) 17, 339–361 (2008)
Doniec, A., Piechowiak, S., Mandiau, R.: A discsp solving algorithm based on sessions. In: Russell, I., Markov, Z. (eds.) FLAIRS 2005: Recent advances in artificial intelligence: Proceedings of the eighteenth International Florida Artificial Intelligence Research Society Conference, pp. 666–670. AAAI Press, Menlo Park (2005)
Hamadi, Y.: Traitement des problèmes de satisfaction de contraintes distribués. Ph.D. thesis, Université de Montpellier II, France (1999)
Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14(3), 263–313 (1980)
Meisels, A., Zivan, R.: Asynchronous forward-checking for discsps. Constraints 12(1), 131 (2007)
Tsuruta, T., Shintani, T.: Scheduling meetings using distributed valued constraint satisfaction algorithm. In: 14th European Conference on Artificial Intelligence (ECAI), pp. 383–387 (2000)
Yokoo, M.: Distributed Constraint Satisfaction: Foundation of Cooperation in Multi-agent Systems. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monier, P., Piechowiak, S., Mandiau, R. (2009). Multi-agent Reasoning Based on Distributed CSP Using Sessions: DBS. In: Demazeau, Y., Pavón, J., Corchado, J.M., Bajo, J. (eds) 7th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2009). Advances in Intelligent and Soft Computing, vol 55. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00487-2_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-00487-2_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00486-5
Online ISBN: 978-3-642-00487-2
eBook Packages: EngineeringEngineering (R0)