A novel Stochastic Clustering Auction for task allocation in multi-robot teams

It will be shown that the global cost of the task allocations obtained with fast greedy algorithms can be improved upon by using a class of auction methods called Stochastic Clustering Auctions (SCAs). SCAs use stochastic transfers or swaps between the task clusters assigned to each team member, allow both uphill and downhill cost movements, and rely on simulated annealing. The choice of a key annealing parameter and turning the uphill movements on and off enables the converged solution of a SCA to slide in the region between the global optimal performance and the performance associated with a random allocation. The first SCA, called GSSCA, was based on a Gibbs Sampler, which constrained the stochastic cluster reallocations to simple single transfers or swaps. This paper presents a new and more efficient SCA, called SWSCA, based on the generalized Swendsen-Wang method that enables more complex and efficient movements between clusters by connecting tasks that appear to be synergistic and then stochastically reassigning these connected tasks. For centralized auctioning, extensive numerical experiments are used to compare the performance of SWSCA with GSSCA in terms of costs and computational and communication requirements. Distributed SWSCA is then compared with centralized SWSCA using communication links between robots that were motivated by a generic topology called a “scale free network.”

[1]  James McLurkin,et al.  Dynamic Task Assignment in Robot Swarms , 2005, Robotics: Science and Systems.

[2]  M. Golfarelli,et al.  A Task-Swap Negotiation Protocol Based on the Contract Net Paradigm , 2000 .

[3]  Satoshi Fujita,et al.  On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions , 2004, J. Heuristics.

[4]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[5]  Han-Lim Choi,et al.  Consensus-Based Decentralized Auctions for Robust Task Allocation , 2009, IEEE Transactions on Robotics.

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Michel Gendreau,et al.  Combinatorial auctions , 2007, Ann. Oper. Res..

[8]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[9]  Xiuwen Liu,et al.  A Stochastic Clustering Auction (SCA) for Centralized and Distributed Task Allocation in Multi-agent Teams , 2008, DARS.

[10]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[11]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[12]  Sven Koenig,et al.  K-swaps: cooperative negotiation for solving task-allocation problems , 2009, IJCAI 2009.

[13]  Tuomas Sandholm Contract Types for Satisficing Task Allocation:I Theoretical Results , 2002 .

[14]  Nidhi Kalra,et al.  Market-Based Multirobot Coordination: A Survey and Analysis , 2006, Proceedings of the IEEE.

[15]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.

[16]  Sven Koenig,et al.  Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control , 2007, IJCAI.

[17]  Christian P. Robert,et al.  Monte Carlo Statistical Methods (Springer Texts in Statistics) , 2005 .

[18]  Anthony Stentz,et al.  Opportunistic optimization for market-based multirobot control , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[19]  Luc Brunet,et al.  Consensus-based auctions for decentralized task assignment , 2008 .

[20]  Shirley Dex,et al.  JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .

[21]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[22]  R. Prim Shortest connection networks and some generalizations , 1957 .

[23]  Rachid Alami,et al.  M+: a scheme for multi-robot cooperation through negotiated task allocation and achievement , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[24]  Evangelos Markakis,et al.  The Power of Sequential Single-Item Auctions for Agent Coordination , 2006, AAAI.

[25]  Adrian Barbu,et al.  Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  George A. Bekey,et al.  Altruistic Relationships for Optimizing Task Fulfillment in Robot Communities , 2008, DARS.

[27]  Martin Andersson,et al.  Contract type sequencing for reallocative negotiation , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[28]  Anthony Stentz,et al.  Market-based Multirobot Coordination for Complex Tasks , 2006, Int. J. Robotics Res..