An Approach for Distributed Constraint Optimization Problems in Rescue Simulation

  • Yuki Miyamoto
  • Taishun Kusaka
  • Yuki Okado
  • Kazunori IwataEmail author
  • Nobuhiro Ito
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11531)


The “task assignment problem” of RoboCupRescue Simulation (RRS) can be regarded as a Distributed Constraint Optimization Problem (DCOP). However, it is difficult to apply the DCOP algorithm to the problem on the current simulator. In this paper, we propose an extension on RRS-ADF for the difficulty. We introduce a new communication system that agents can use to communicate repeatedly within each step of this extension. Furthermore, we also describe an example that applies a DCOP algorithm and then discuss its effectiveness. The results confirmed that our extension is effective.


  1. 1.
    Fioretto, F., Pontelli, E., Yeoh, W.: Distributed constraint optimization problems and applications: a survey. J. Aritf. Intell. Res. 61, 623–698 (2018)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Kleiner, A., Farinelli, A., Ramchurn, S., Shi, B., Maffioletti, F., Reffato, R.: RMASBench: benchmarking dynamic multi-agent coordination in urban search and rescue. In: Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems, AAMAS 2013, pp. 1195–1196. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2013).
  3. 3.
    Pujol-Gonzalez, M., Cerquides, J., Farinelli, A., Meseguer, P., Rodríguez-Aguilar, J.A.: Binary max-sum for multi-team task allocation in RoboCup Rescue. In: Optimisation in Multi-Agent Systems and Distributed Constraint Reasoning (OptMAS-DCR), Paris, France (2014)Google Scholar
  4. 4.
    Ramchurn, S.D., Farinelli, A., Macarthur, K.S., Jennings, N.R.: Decentralized coordination in RoboCup Rescue. Comput. J. 53, 1447–1461 (2010)CrossRefGoogle Scholar
  5. 5.
    Tarlow, D., Givoni, I.E., Zemel, R.S.: HOP-MAP: efficient message passing with high order potentials. In: AISTATS (2010)Google Scholar
  6. 6.
    Weiss, Y., Freeman, W.T.: On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Trans. Inf. Theory 47, 736–744 (2001)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Zhang, W., Wang, G., Wittenburg, L.: Distributed stochastic search for constraint satisfaction and optimization: parallelism, phase transitions and performance. In: Proceedings AAAI 2002 Workshop on Probabilistic Approaches in Search, January 2002Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Yuki Miyamoto
    • 1
  • Taishun Kusaka
    • 1
  • Yuki Okado
    • 1
  • Kazunori Iwata
    • 2
    Email author
  • Nobuhiro Ito
    • 1
  1. 1.Department of Information ScienceAichi Institute of TechnologyToyotaJapan
  2. 2.Department of Business AdministrationAichi UniversityNagoyaJapan

Personalised recommendations