Max-Sum for Allocation of Changing Cost Tasks

  • James ParkerEmail author
  • Alessandro Farinelli
  • Maria GiniEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 531)


We present a novel decentralized approach to allocate agents to tasks whose costs increase over time. Our model accounts for both the natural growth of the tasks and the effort of the agents at containing such growth. The objective is to minimize the increase in task costs. We show how a distributed coordination algorithm, which is based on max-sum, can be formulated to include costs of tasks that grow over time. Considering growing costs enables our approach to solve a wider range of problems than existing methods. We compare our approach against state-of-the-art methods in both a simple simulation and RoboCup Rescue simulation.


Multi-robot systems Task allocation Binary max-sum 



Work supported in part by NSF-IIP-1439728 and the Graduate School of the University of Minnesota.


  1. 1.
    Amador, S., Okamoto, S., Zivan, R.: Dynamic multi-agent task allocation with spatial and temporal constraints. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1384–1390 (2014)Google Scholar
  2. 2.
    Farinelli, A., Rogers, A., Petcu, A., Jennings, N.R.: Decentralised coordination of low-power embedded devices using the max-sum algorithm. In: International Conference on Autonomous Agents and Multi-Agent Systems, pp. 639–646, May 2008Google Scholar
  3. 3.
    Kitano, H., Tadokoro, S.: RoboCup Rescue: a grand challenge for multiagent and intelligent systems. AI Mag. 22(1), 39–52 (2001)Google Scholar
  4. 4.
    Kleiner, A., Farinelli, A., Ramchurn, S., Shi, B., Maffioletti, F., Reffato, R.: RMASBench: Benchmarking dynamic multi-agent coordination in urban search and rescue. In: International Conference on Autonomous Agents and Multi-Agent Systems, pp. 1195–1196 (2013)Google Scholar
  5. 5.
    Kschischang, F., Frey, B., Loeliger, H.-A.: Factor graphs and the sum-product algorithm. IEEE Trans. Inf. Theory 47(2), 498–519 (2001). FebMathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Melvin, J., Keskinocak, P., Koenig, S., Tovey, C., Ozkaya, B.: Multi-robot routing with rewards and disjoint time windows. In: Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2332–2337, Oct 2007Google Scholar
  7. 7.
    Modi, P.J., Shen, W.-M., Tambe, M., Yokoo, M.: ADOPT: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161, 149–180 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Parker, J., Gini, M.: Tasks with cost growing over time and agent reallocation delays. In: Proceedings of International Conference on Autonomous Agents and Multi-Agent Systems, pp. 381–388 (2014)Google Scholar
  9. 9.
    Parker, J., Gini, M.: Controlling growing tasks with heterogeneous agents. In: Proceedings of International Joint Conference on Artificial Intelligence (2016)Google Scholar
  10. 10.
    Parker, J., Godoy, J., Groves, W., Gini, M.: Issues with methods for scoring competitors in RoboCup Rescue. In: Autonomous Robots and Multirobot Systems at AAMAS (2014)Google Scholar
  11. 11.
    Penya-Alba, T., Vinyals, M., Cerquides, J., Rodriguez-Aguilar, J.A.: A scalable message-passing algorithm for supply chain formation. In: Proceedings of AAAI Conference on Artificial Intelligence, pp. 1436–1442 (2012)Google Scholar
  12. 12.
    Pujol-Gonzalez, M., Cerquides, J., Farinelli, A., Meseguer, P., Rodriguez-Aguilar, J.A.: Efficient inter-team task allocation in RoboCup Rescue. In: Proceedings of International Conference on Autonomous Agents and Multi-Agent Systems, pp. 413–422 (2015)Google Scholar
  13. 13.
    Pujol-Gonzalez, M., Cerquides, J., Meseguer, P., Rodríguez-Aguilar, J.A., Tambe, M.: Engineering the decentralized coordination of UAVs with limited communication range. In: Advances in Artificial Intelligence, pp. 199–208. Springer (2013)Google Scholar
  14. 14.
    Ramchurn, S., Farinelli, A., Macarthur, K., Polukarov, M., Jennings, N.: Decentralised coordination in RoboCup Rescue. Comput. J. 53(9), 1–15 (2010)CrossRefGoogle Scholar
  15. 15.
    Tarlow, D., Givoni, I.E., Zemel, R.S.: Hop-map: efficient message passing with high order potentials. In: Proceedings of International Conference on Artificial Intelligence and Statistics, pp. 812–819 (2010)Google Scholar
  16. 16.
    Zheng, X., Koenig, S.: Reaction functions for task allocation to cooperative agents. In: Proceedings of International Conference Autonomous Agents and Multi-Agent Systems, pp. 559–566 (2008)Google Scholar
  17. 17.
    Zivan, R.: Anytime local search for distributed constraint optimization. In: Proceedings International Conference on Autonomous Agents and Multi-Agent Systems, pp. 1449–1452 (2008)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Computer Science and EngineeringUniversity of MinnesotaMinneapolisUSA
  2. 2.Department of Computer ScienceUniversity of VeronaVeronaItaly

Personalised recommendations