Abstract
This article considers the problem of optimal task allocation for heterogeneous teams, for example, teams of heterogeneous robots or human-robot teams. It is well-known that this problem is NP-hard and hence computationally feasible approaches must develop an approximate solution. Here, we propose a solution via a Stochastic Clustering Auction (SCA) that uses a Markov chain search process along with simulated annealing. This is the first stochastic auction method used in conjunction with global optimization. It is based on stochastic transfer and swap moves between the clusters of tasks assigned to the various robots and considers not only downhill movements, but also uphill movements, which can avoid local minima. A novel feature of this algorithm is that, by tuning the annealing suite and turning the uphill movements on and off, the global team performance after algorithm convergence can slide in the region between the global optimal performance and the performance associated with a random allocation. Extensive numerical experiments are used to evaluate the performance of SCA in terms of costs and computational and communication requirements. For centralized auctioning, the SCA algorithm is compared to fast greedy auction algorithms. Distributed auctioning is then compared with centralized SCA.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, Centralized and distributed task allocation in multi-robot teams via a stochastic clustering auction.
- Aarts, E. H. and Lenstra, J. K., Eds. 1997. Local Search in Combinatorial Optimization. John Wiley and Sons, London. Google Scholar
Digital Library
- Albert, R. and Barabási, A. 2002. Statistical mechanics of complex networks. Rev. Modern Phys. 74, 1, 47--97.Google Scholar
Cross Ref
- Andersson, M. and Sandholm, T. 2000. Contract type sequencing for reallocative negotiation. In Proceedings of the the 20th International Conference on Distributed Computing Systems ( ICDCS'00). IEEE Computer Society, Los Alamitos, CA, 154--160. Google Scholar
Digital Library
- Barbu, A. and Zhu, S. 2005. Generalizing swendsen-wang to sampling arbitrary posterior probabilities. IEEE Trans. Pattern Anal. Mach. Intell. 27, 8, 1239--1253. Google Scholar
Digital Library
- Botelho, S. S. C. and Alami, R. 1999. M+: A scheme for multi-robot cooperation through negotiated task allocation and achievement. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA). 1234--1239.Google Scholar
- Bowling, M. and Veloso, M. 2002. Multiagent learning using a variable learning rate. Artif. Intell. 136, 215--250. Google Scholar
Digital Library
- Brunet, L. 2008. Consensus-based auctions for decentralized tasks assignment. Master thesis, MIT.Google Scholar
- Chao, I.-M., Golden, B. L., and Wasil, E. 1993. A new heuristic for the multidepot vehicle routing problem that improves upon best-known solutions. Amer. J. Math. Manag. Sci. 13, 3-4, 371--406. Google Scholar
Digital Library
- Choi, H., Brunet, L., and How, J. P. 2008. Consensus-Based auction approaches for decentralized task asignment. In Proceedings of the AIAA Guidance, Navigation and Control Conference and Exhibit.Google Scholar
- Choi, H., Brunet, L., and How, J. P. 2009. Consensus-Based decentralized auctions for robust task allocation. IEEE Trans. Robot. 25, 912--926. Google Scholar
Digital Library
- Clark, C. M., Morton, R., and Bekey, G. A. 2008. Altruistic relationships for optimizing task fulfillment in robot communities. In Distributed Autonomous Robotic Systems 8, H. Asama, H. Kurokawa, J. Ota, and K. Sekiyama, Eds., 261--270.Google Scholar
- Cramton, P., Shoham, Y., and Steinberg, R., Eds. 2006. Combinatorial Auctions. MIT Press. Google Scholar
Digital Library
- de Vries, S. and Vohra, R. V. 2003. Combinatorial auctions: A survey. INFORMS J. Comput. 15, 3, 284--309. Google Scholar
Digital Library
- Dias, M. B., Jones, G., Kalra, N. R., Keskinocak, P., Koenig, S., Lagoudakis, M. G., and Zlot, R. 2006a. Tutorial on auction-based agent coordination at AAAI 2006 and AAMAS 2006. http://idm-lab.org/auction-tutorial.html.Google Scholar
- Dias, M. B. and Stentz, A. 2002. Opportunistic optimization for market-based multirobot control. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'02). Vol. 3. 2714--2720.Google Scholar
- Dias, M. B., Zlot, R. M., Kalra, N., and Stentz, A. 2006b. Market-Based multirobot coordination: A survey and analysis. Proc. IEEE 94, 7, 1257--1270.Google Scholar
Cross Ref
- Fredrickson, G. N., Hecht, M. S., and Kim, C. E. 1978. Approximation algorithms for some vehicle routing problems. SIAM J. Comput. 7, 2, 178--193.Google Scholar
Cross Ref
- Gerkey, B. P. and Mataric, M. J. 2002. Sold!: Auction methods for multirobot coordination. IEEE Trans. Robot. Autom. 18, 5, 758--768.Google Scholar
Cross Ref
- Gerkey, B. P. and Mataric, M. J. 2004. A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 23, 9, 939--954.Google Scholar
- Golfarelli, M., Maio, D., and Rizzi, S. 1997. A task-swap negotiation protocol based on the contract net paradigm. Tech. rep. 005-97. CSITE (Research Centre for Informatics and Telecommunication Systems, associated with the University of Bologna, Italy).Google Scholar
- Groth, D. and Skandier, T. 2005. Network + Study Guide 4th Ed. Sybex. Google Scholar
Digital Library
- Hoos, H. and Boutilier, C. 2000. Solving combinatorial auctions using stochastic local search. In Proceedings of the 7th National Conference on Artificial Intelligence (AAAI-00). 22--29. Google Scholar
Digital Library
- Jarnick, V. 1930. Ojistám problému minimálním. Axta Societatis Natur Moravicae 6, 57--63.Google Scholar
- Jones, E., Browning, B., Dias, M. B., Argall, B., Veloso, M., and Stentz, A. 2006. Dynamically formed heterogeneous robot teams performing tightly-coordinated tasks. In Proceedings of the International Conference on Robotics and Automation. 570--575.Google Scholar
- Kirkpatrick, S., C. D. Gelatt, J., and Vecchi, M. P. 1983. Optimization by simulated annealing. Science 220, 4598, 671--680.Google Scholar
- Koenig, S., Tovey, C. A., Lagoudakis, M. G., Markakis, V., Kempe, D., Keskinocak, P., Kleywegt, A. J., Meyerson, A., and Jain, S. 2006. The power of sequential single-item auctions for agent coordination. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI). AAAI Press, 1625--1629. Google Scholar
Digital Library
- Koenig, S., Tovey, C. A., Zheng, X., and Sungur, I. 2007. Sequential bundle-bid single-sale auction algorithms for decentralized control. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). 1359--1365. Google Scholar
Digital Library
- Koes, M., Sycara, K., and Nourbakhsh, I. 2006. A constraint optimization framework for fractured robot teams. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS). 491--493. Google Scholar
Digital Library
- Köse, H., Tatlidede, U., Ç. Meriçli, Kaplan, K., and Akin, H. L. 2004. Q-learning based market-driven multi-agent collaboration in robot soccer. In Proceedings of the Turkish Symposium on Artificial Intelligence and Neural Networks. 219--228.Google Scholar
- Lumezanu, C., Bhola, S., and Astley, M. 2008. Online optimization for latency assignment in distributed real-time systems. In Proceedings of the 28th International Conference on Distributed Computing Systems. IEEE Computer Society, Los Alamitos, CA, 752--759. Google Scholar
Digital Library
- McLurkin, J. and Yamins, D. 2005. Dynamic task assignment in robot swarms. In Robotics: Science and Systems. 129--136.Google Scholar
- Mito, M. and Fujita, S. 2004. On heuristics for solving winner determination problem in combinatorial auctions. J. Heurist. 10, 5, 507--523. Google Scholar
Digital Library
- Parker, L. E. 1998. Alliance: An architecture for fault tolerant multi-robot cooperation. IEEE Trans. Robot. Autom. 14, 2.Google Scholar
Cross Ref
- Powers, R. and Shoham, Y. 2005. New criteria and a new algorithm for learning in multi-agent systems. In Advances in Neural Information Processing Systems 17, L. K. Saul, Y. Weiss, and L. Bottou, Eds., MIT Press, Cambridge, MA, 1089--1096.Google Scholar
- Prim, R. C. 1957. Shortest connection networks and some generalisations. Bell Syst. Techn. J. 36, 1389--1401.Google Scholar
Cross Ref
- Puschini, D., Clermidy, F., Benoit, P., Sassatelli, G., and Torres, L. 2009. Dynamic and distributed frequency assignment for energy and latency constrained MP-SoC. In Proceedings of the Conference on Design Automation and Test in Europe. 1564--1567. Google Scholar
Digital Library
- Robert, C. P. and Casella, G. 2005. Monte Carlo Statistical Methods (Springer Texts in Statistics). Springer. Google Scholar
Digital Library
- Sandholm, T. 1998. Contract types for satisficing task allocation: I theoretical results. In Proceedings of the AAAI Spring Symposium: Satisficing Models.Google Scholar
- Sandholm, T. 2002. Algorithm for optimal winner determination in combinatorial auctions. Artif. Intell. 135, 1-2, 1--54. Google Scholar
Digital Library
- Simmons, R., Singh, S., Heger, F., Hiatt, L. M., Koterba, S. C., Melchior, N., and Sellner, B. P. 2007. Human-Robot teams for large-scale assembly. In Proceedings of the NASA Science Technology Conference (NSTC-07).Google Scholar
- Srivastava, A., Joshi, S. H., Mio, W., and Liu, X. 2005. Statistical shape analysis: Clustering, learning, and testing. IEEE Trans. Pattern Anal. Mach. Intell. 27, 4, 590--602. Google Scholar
Digital Library
- Stroupe, A. 2003. Collaborative execution of exploration and tracking using move value estimation for robot teams (MVERT). Ph.D. thesis, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA. Google Scholar
Digital Library
- Sutton, R. S. and Barto, A. G. 1998. Reinforcement Learning: An Introduction. MIT Press. Google Scholar
Digital Library
- Swendsen, R. H. and Wang, J. S. 1987. Nonuniversal critical dynamics in monte carlo simulations. Phys. Rev. Lett. 58, 2, 86--88.Google Scholar
Cross Ref
- Wagner, A. and Arkin, R. C. 2004. Multi-Robot communication-sensitive reconnaissance. In Proceedings of the IEEE International Conference on Robotics and Automation. 4674--4681.Google Scholar
- Zhang, K., Collins, E. G., Shi, D., Liu, X., and Chuy, O. 2008. A stochastic clustering auction for centralized and distributed task allocation in multi-agent teams. In Distributed Autonomous Robotic Systems 8, H. Asama, H. Kurokawa, J. Ota, and K. Sekiyama, Eds., 345--354.Google Scholar
- Zheng, X. and Koenig, s. 2009. K-swaps: Cooperative negotiation for solving task-allocation problems. In Proceedings of the International Joint Conference on Artificial Intelligence. C. Boutilier, Ed., 373--379. Google Scholar
Digital Library
- Zlot, R. M. and Stentz, A. 2006. Market-Based multirobot coordination for complex tasks. Int. J. Robot. Res. 25, 1, 73--101.Google Scholar
Index Terms
Centralized and distributed task allocation in multi-robot teams via a stochastic clustering auction
Recommendations
An Efficient Stochastic Clustering Auction for Heterogeneous Robotic Collaborative Teams
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 ...
Reliability-Aware Task Allocation in Distributed Computing Systems using Hybrid Simulated Annealing and Tabu Search
HPCC '12: Proceedings of the 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and SystemsReliability is one of the important issues in the design of distributed computing systems (DCSs). This paper deals with the problem of task allocation in heterogeneous DCSs for maximizing system reliability with several resource constraints. Memory ...
Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem
The paper addresses the problem of multi-depot vehicle routing in order to minimize the delivery time of vehicle objective. Three hybrid heuristics are presented to solve the multi-depot vehicle routing problem. Each hybrid heuristic combines elements ...






Comments