Name
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 trade-offs 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 lower cost solution than the centralized SCA. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ICRA.2012.6224588 | 2012 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA) |
Keywords | Field | DocType |
greedy algorithms,stochastic processes,clustering algorithms,statistical analysis,csa,greedy algorithm,annealing,resource management,task analysis,gibbs sampler,robot kinematics,iterative methods,resource manager,multi agent systems,resource allocation,commerce | Mathematical optimization,Iterative method,Computer science,Stochastic process,Greedy algorithm,Multi-agent system,Common value auction,Resource allocation,Cluster analysis,Gibbs sampling | Conference |
Volume | Issue | ISSN |
2012 | 1 | 1050-4729 |
Citations | PageRank | References |
4 | 0.41 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kai Zhang | 1 | 57 | 3.00 |
| Emmanuel G. Collins Jr. | 2 | 41 | 8.39 |
| Adrian Barbu | 3 | 768 | 58.59 |