A Distributed Algorithm for the Multi-Robot Task Allocation Problem
In this work we address the Multi-Robot Task Allocation Problem (MRTA). We assume that the decision making environment is decentralized with as many decision makers (agents) as the robots in the system. To solve this problem, we developed a distributed version of the Hungarian Method for the assignment problem. The robots autonomously perform different substeps of the Hungarian algorithm on the base of the individual and the information received through the messages from the other robots in the system. It is assumed that each robot agent has an information regarding its distance from the targets in the environment. The inter-robot communication is performed over a connected dynamic communication network and the solution to the assignment problem is reached without any common coordinator or a shared memory of the system. The algorithm comes up with a global optimum solution in O(n 3) cumulative time (O(n 2) for each robot), with O(n 3) number of messages exchanged among the n robots.
KeywordsMulti robot task allocation assignment problem distributed algorithm
Unable to display preview. Download preview PDF.
- Bertsekas, D.P.: Auction algorithms for network flow problems: A tutorial introduction. Computational Optimization and Applications 1(1) (1992)Google Scholar
- Bertsekas, D.P., Castanon, D.A., Eckstein, J., Zenios, S.: Parallel computing in network optimization. In: Network Models - Handbooks in Operations Research and Management Science, vol. 7, pp. 330–399. Elsevier, Amsterdam (1995)Google Scholar
- Burkard, R.E., Çela, E.: Linear assignment problems and extensions. Handbook of Combinatorial Optimization 4(1), 221–300 (1999)Google Scholar
- Gerkey, B.P., Mataric, M.J.: A framework for studying multi-robot task allocation. In: Shultz, A.C., et al. (eds.) Multi-Robot Systems: From Swarms to Intelligent Automata, The Netherlands, vol. 2, pp. 15–26. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
- Giordani, S., Lujak, M., Martinelli, F.: A Decentralized Scheduling Policy for a Dynamically Reconfigurable Production System. In: Mařík, V., Strasser, T., Zoitl, A. (eds.) Holonic and Multi-Agent Systems for Manufacturing. LNCS (LNAI), vol. 5696, pp. 102–113. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston (1976)Google Scholar
- Lueth, T.C., Laengle, T.: Task description, decomposition and allocation in a distributed autonomous multi-agent robot system. In: IEEE/RSJ IROS, pp. 1516–1523 (1994)Google Scholar
- Smith, S.L., Bullo, F.: Target assignment for robotic networks: Asymptotic performance under limited communication. In: American Control Conference, ACC’07, pp. 1155–1160 (2007)Google Scholar
- Wooldridge, M.: Introduction to Multi-Agent Systems. John Wiley and Sons, Chichester (2002)Google Scholar
- Zavlanos, M.M., Spesivtsev, L., Pappas, G.J.: A distributed auction algorithm for the assignment problem. In: Proc. of 47th IEEE Conf. on Decision and Control, Cancun, Mexico, pp. 1212–1217 (2008)Google Scholar