Bundling Policies for Sequential Stochastic Tasks in Multi-robot Systems

  • Changjoo NamEmail author
  • Dylan A. Shell
Part of the Springer Proceedings in Advanced Robotics book series (SPAR, volume 6)


This paper studies multi-robot task allocation in settings where tasks are revealed sequentially for an infinite or indefinite time horizon, and where robots may execute bundles of tasks. The tasks are assumed to be synergistic so efficiency gains accrue from performing more tasks together. Since there is a tension between the performance cost (e.g., fuel per task) and the task completion time, a robot needs to decide when to stop collecting tasks and to begin executing its whole bundle. This paper explores the problem of optimizing bundle size with respect to the two objectives and their trade-off. Based on qualitative properties of any multi-robot system that bundles sequential stochastic tasks, we introduce and explore an assortment of simple bundling policies. Our experiments examine how these policies perform in a warehouse automation scenario, showing that they are efficient compared to baseline policies where robots do not bundle tasks strategically.



This work was supported in part by NSF awards IIS-1302393 and IIS-1453652.


  1. 1.
    Amador, S., Okamoto, S., Zivan, R.: Dynamic multi-agent task allocation with spatial and temporal constraints. In: International Conference on Autonomous Agents and Multi-agent Systems, pp. 1495–1496 (2014)Google Scholar
  2. 2.
    Bullo, F., Frazzoli, E., Pavone, M., Savla, K., Smith, S.: Dynamic vehicle routing for robotic systems. Proc. IEEE 99, 1482–1504 (2011)CrossRefGoogle Scholar
  3. 3.
    Dias, M., Stentz, A:. A market approach to multirobot coordination. Technical report, Carnegie Mellon University, 2000Google Scholar
  4. 4.
    Gerkey, B., Matarić, M.: Sold!: auction methods for multi-robot coordination. IEEE Trans. Robot. 18, 758–768 (2002)CrossRefGoogle Scholar
  5. 5.
    Gerkey, B., Matarić, M.: A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 23, 939–954 (2004)CrossRefGoogle Scholar
  6. 6.
    Heap, B.: Sequential single-cluster auctions for multi-robot task allocation. Ph.D. thesis, The University of New South Wales, 2013Google Scholar
  7. 7.
    Kleinrock, L.: Queuing Systems. Wiley, New York (1975)Google Scholar
  8. 8.
    Koenig, S., Tovey, C., Zheng, X., Sungur, I.: Sequential bundle-bid single-sale auction algorithms for decentralized control. In: Proceedings of International Joint Conference on Artificial intelligence, pp. 1359–1365 (2007)Google Scholar
  9. 9.
    Lee, J., Choi, M.: Optimization by multicanonical annealing and the traveling salesman problem. Phys. Rev. E 50, R651 (1994)CrossRefGoogle Scholar
  10. 10.
    Meir, R., Chen, Y., Feldman, M.: Efficient parking allocation as online bipartite matching with posted prices. In: International Conference on Autonomous Agents and Multi-agent Systems, pp. 303–310 (2013)Google Scholar
  11. 11.
    Nam, C., Shell, D.: An empirical study of task bundling for sequential stochastic tasks in multi-robot task allocation. Technical Report TAMU-CSE-16-7-1, CSE Department, Texas A&M University, 2016Google Scholar
  12. 12.
    Stein, D.: An asymptotic, probabilistic analysis of a routing problem. Math. Oper. Res. 3, 89–101 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Zheng, X., Koenig, S., Tovey, C.: Improving sequential single-item auctions. In: Proceedings of IEEE/RSJ International Conference on Intelligent Robots and System, pp. 2238–2244 (2006)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Robotics InstituteCarnegie Mellon UniversityPittsburghUSA
  2. 2.Department of Computer Science and EngineeringTexas A&M UniversityCollege StationUSA

Personalised recommendations