Abstract
Distributed Constraint Satisfaction Problems (DCSP) provide a formalism for representing, in a simple and efficient way, distributed problems. Different agents collaborate with each other in order to find a global solution subject to constraints. In general, researchers evaluate DCSP algorithms on graph coloring problems or uniform random binary DCSP. In this paper, we propose to compare DCSP algorithms on a multi-agent exploration problem. This problem is a particular case of multi-agent coordination problems and the evaluation of DCSP algorithms on this problem is difficult. In order to measure different aspects of this multi-agent exploration problem, we use six different criteria: classical criteria from DCSP benchmarks and specific criteria for this problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of a distributed system. ACM Transactions on Computer Systems 3, 63–75 (1985)
Doniec, A., Bouraqadi, N., Defoort, M., Le, V.T., Stinckwich, S.: Distributed constraint reasoning applied to multi-robot exploration. In: 21st International Conference on Tools with Artificial Intelligence (ICTAI), New Jersey, USA (2009)
Ezzahir, R., Bessière, C., Wahbi, M., Benelallam, I., Bouyakhf, E.H.: Asynchronous inter-level forward-checking for discsps. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 304–318. Springer, Heidelberg (2009)
Fernández, C., Béjar, R., Krishnamachari, B., Gomes, C.: Communication and computation in distributed CSP algorithms. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 664. Springer, Heidelberg (2002)
Monier, P., Doniec, A., Piechowiak, S., Mandiau, R.: Metrics for the evaluation of discsp: Some experiments of multi-robot exploration. In: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, Toronto, Canada, pp. 370–373 (2010)
Monier, P., Piechowiak, S., Mandiau, R.: A complete algorithm for discsp: Distributed backtracking with sessions (dbs). In: Workshop OptMas, Autonomous and Multi-Agent Systems (AAMAS 2009), Budapest, Hungary, Mai (2009)
Omomowo, B., Arana, I., Ahriz, H.: DynABT: Dynamic asynchronous backtracking for dynamic disCSPs. In: Dochev, D., Pistore, M., Traverso, P. (eds.) AIMSA 2008. LNCS (LNAI), vol. 5253, pp. 285–296. Springer, Heidelberg (2008)
Pepin, N., Simonin, O., Charpillet, F.: Intelligent tiles: Putting situated multi-agents models in real world. In: International Conference on Agents and Artificial Intelligence (2009)
Sempere, M., Aznar, F., Pujol, M., Rizo, R.: On cooperative swarm foraging for simple, non explicitly connected, agents. In: Practical Applications of Agents and Multi-Agent Systems, pp. 581–589. Springer, Salamanca (2010)
Vazquez, J., Malcolm, C.: Distribute multirobot exploration maintaining a mobile network. In: 2nd international IEEE Conference on Intelligent Systems (2004)
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
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monier, P., Doniec, A., Piechowiak, S., Mandiau, R. (2011). Comparison of DCSP Algorithms: A Case Study for Multi-agent Exploration. In: Demazeau, Y., Pěchoucěk, M., Corchado, J.M., Pérez, J.B. (eds) Advances on Practical Applications of Agents and Multiagent Systems. Advances in Intelligent and Soft Computing, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19875-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-19875-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19874-8
Online ISBN: 978-3-642-19875-5
eBook Packages: EngineeringEngineering (R0)