Abstract
Stochastic Clustering Auctions (SCAs) constitute a class of cooperative auction methods that enable improvement of the global cost of the task allocations obtained with fast greedy algorithms. Prior research had developed Contracts Sequencing Algorithms (CSAs) that are deterministic and enable transfers, swaps, and other types of contracts between team members. In contrast to CSAs, SCAs use stochastic transfers or swaps between the task clusters assigned to each team member and have algorithm parameters that can enable tradeoffs between optimality and computational and communication requirements. The first SCA was based on a “Gibbs Sampler” and constrained the stochastic cluster reallocations to simple single transfers or swaps; it is applicable to heterogeneous teams. Subsequently, a more efficient SCA was developed, based on the generalized Swendsen-Wang method; it achieves the increased efficiency by connecting tasks that appear to be synergistic and then stochastically reassigning these connected tasks, hence enabling more complex and efficient movements between clusters than the first SCA. However, its application was limited to homogeneous teams. The contribution of this work is to present an efficient SCA for heterogeneous teams; it is based on a modified Swendsen-Wang method. For centralized auctioning and homogeneous teams, extensive numerical experiments were used to provide a comparison in terms of costs and computational and communication requirements of the three SCAs and a baseline CSA. It was seen that the new SCA maintains the efficiency of the second SCA and can yield similar performance to the baseline CSA in far fewer iterations. The same metrics were used to evaluate the performance of the new SCA for heterogeneous teams. A distributed version of the new SCA was also evaluated in numerical experiments. The results show that, as expected, the distributed SCA continually improves the global performance with each iteration, but converges to a higher cost solution than the centralized SCA. The final discussion outlines a systematic procedure to use SCA in various aspects of the application of multi-robot cooperative systems.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Dias, M.B., Zlot, R.M., Kalra, N., Stentz, A.: Market-based multirobot coordination: a survey and analysis. Proc. IEEE 94(7), 1257–1270 (2006)
Zlot, R.M., Stentz, A.: Market-based multirobot coordination for complex tasks. Int. J. Rob. Res. 25(1), 73–101 (2006). Special Issue on the 4th International Conference on Field and Service Robotics
Zhang, K., Collins, E.G., Shi, D., Liu, X., Chuy, O.: A stochastic clustering auction for centralized and distributed task allocation in multi-agent teams. In: Asama, H., Kurokawa, H., Ota, J., Sekiyama, K. (eds.) Distributed Autonomous Robotic Systems 8, pp. 345–354. Tsukuba, Ibaraki, Japan (2008)
Zhang, K., Collins, E., Shi, D.: Centralized and distributed task allocation in multi-robot teams via a stochastic clustering auction. ACM Trans. Aut. Adap. Sys. 7(2), 21:1–21:22 (2012)
Zhang, K., Collins, E., Barbu, A.: A novel stochastic clustering auction for task allocation in multi-robot teams. In: 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2010), pp. 3300–3307. Taipei, Taiwan, 18–22 Oct 2010
Robert, C.P., Casella, G.: Monte Carlo Statistical Methods (Springer Texts in Statistics). Springer-Verlag New York, Inc., Secaucus, NJ, USA (2005)
Kirkpatrick Jr., S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Srivastava, A., Joshi, S.H., Mio, W., Liu, X.: Statistical shape analysis: clustering, learning, and testing. IEEE Trans. Pattern Anal. Mach. Intell. 27(4), 590–602 (2005)
Barbu, A., Zhu, S.: Generalizing swendsen-wang to sampling arbitrary posterior probabilities. IEEE Trans. Pattern Anal. Mach. Intell. 27(8), 1239–1253 (2005)
Sandholm, T.: Contract types for satisficing task allocation: I theoretical results. In: AAAI Spring Symposium: Satisficing Models (1998)
Andersson, M., Sandholm, T.: Contract type sequencing for reallocative negotiation. In: Proceedings of the The 20th International Conference on Distributed Computing Systems (ICDCS 2000), pp. 154–160. IEEE Computer Society, Washington, DC, USA (2000)
Zhang, K., Collins, E., Barbu, A.: An efficient stochastic clustering auction for heterogeneous robot teams. In: 2012 IEEE International Conference on Robotics and Automation, pp. 4806–4813. Saint Paul, MN, 14–18 May 2012
Jarnick, V.: Ojistám problému minimálním. Axta Societatis Natur Moravicae 6, 57–63 (1930)
Prim, R.C.: Shortest connection networks and some generalisations. Bell Syst. Tech. J. 36, 1389–1401 (1957)
Henderson, D., Jacobson, S.H., Johnson, A.W.: Handbook of Metaheuristics. In: Chapter The Theory and Practice of Simulated Annealing, vol. 57, pp. 287–319. Kluwer Academic Publishers, Boston, MA (2003)
Lagoudakis, M., Keskinocak, P., Kleywegt, A., Koenig, S.: Auctions with performance guarantees for multi-robot task allocation. In: 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2004), pp. 1957–1962. Sendai, Japan, 28 Sept – 2 Oct 2004
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087–1092 (1953)
Dias, M.B., Stentz, A.: Opportunistic optimization for market-based multirobot control. In: Proceedings of the 2002 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS ’02), vol. 3, pp. 2714–2720 (2002)
Koenig, S., Tovey, C.A., Lagoudakis, M.G., Markakis, V., Kempe, D., Keskinocak, P., Kleywegt, A.J., Meyerson, A., Jain, S.: The power of sequential single-item auctions for agent coordination. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1625–1629. AAAI Press (2006)
Zheng, X., Koenig, S.: K-swaps: cooperative negotiation for solving task-allocation problems. In: Boutilier, C. (ed.) In: International Joint Conference on Artificial Intelligence, pp. 373–379 (2009)
Gerkey, B.P., Mataric, M.J.: A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Rob. Res. 23(9), 939–954 (2004)
Gerkey, B.P., Mataric, M.J.: Sold!: auction methods for multirobot coordination. IEEE Trans. Robot. Autom. 18(5), 758–768 (2002)
Koenig, S., Tovey, C.A., Zheng, X., Sungur, I.: Sequential bundle-bid single-sale auction algorithms for decentralized control. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1359–1365 (2007)
Albert, R., Barabási, A.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)
Gong, J., Huang, W., Xiong, G., Man, Y.: Genetic algorithm based combinatorial auction method for multi-robot task allocation. J. Beijing Inst. Technol. 16(2), 151–156 (2007)
Zuo, Y., Peng, Z., Liu, X.: Task allocation of multiple uavs and targets using improved genetic algorithm. In: The 2nd International Conference on Intelligent Control and Information Processing, pp. 1030–1034, 25–28 July 2011
Chen, J., Yang, Y., Wu, Y.: Multi-robot task allocation based on robotic utility value and genetic algorithm. In: 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, pp. 256–260, 20–22 Nov 2009
Gao, P., Cai, Z., Yu, L.: Evolutionary computation approach to decentralized multi-robot task allocation. In: 5th International Conference on Natural Computation, pp. 415–419, 14–16 Aug 2009
Ma, X., Zhang, Q., Li, Y.: Genetic algorithm-based multi-robot cooperative exploration. In: 2007 IEEE International Conference on Control and Automation, 30 May – 1 June 2007
Khuntia, A., Choudhury, B., Biswal, B., Dash, K.: A heuristics based multi-robot task allocation. In: 2011 IEEE Recent Advances in Intelligent Computational Systems, pp. 407–410, 22–24 Sept 2011
Jones, E., Dias, M., Stentz, T.: Time-extended multi-robot coordination for domains with intra-path constraints. In: Robotics: Science and Systems (RSS) (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, K., Collins, E.G. & Barbu, A. An Efficient Stochastic Clustering Auction for Heterogeneous Robotic Collaborative Teams. J Intell Robot Syst 72, 541–558 (2013). https://doi.org/10.1007/s10846-012-9800-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10846-012-9800-8