Skip to main content
Log in

A Sequential Task Addition Distributed Assignment Algorithm for Multi-Robot Systems

  • Regular paper
  • Published:
Journal of Intelligent & Robotic Systems Aims and scope Submit manuscript

Abstract

In this paper, we present a novel distributed task-allocation algorithm, namely the Sequential Task Addition Distributed Assignment Algorithm (STADAA), for autonomous multi-robot systems. The proposed STADAA can implemented in applications such as search and rescue, mobile-target tracking, and Intelligence, Surveillance, and Reconnaissance (ISR) missions. The proposed STADAA is developed by modifying an algorithm (i.e., the Task Oriented Distributed Assignment Algorithm (TODAA)) we previously developed based on the Hungarian algorithm. The STADAA employs a conflict-resolution mechanism that utilizes a slack variable, sequentially adding new admissible tasks to an admissible task list when there exists conflict in an assignment. The STADAA aims to minimize the resulting cost of the task assignments. We compare the STADAA with the Consensus-Based Auction Algorithm (CBAA), the Distributed Hungarian Based Algorithm (DHBA), and the TODAA in terms of the computational time, optimality, the number of steps to converge, and algorithmic complexity. The results show that the STADAA outperforms the CBAA and the TODAA in optimality and outperforms the DHBA in computational time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Data Availability

The supporting data of the information presented in this manuscript is available from the corresponding author, Nathan Lindsay, upon reasonable request.

References

  1. Abdallah, S., Lesser, V.: Learning the task allocation game. In: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, pp. 850–857 (2006)

  2. Bellingham, J., Tillerson, M., Richards, A., How, J. P.: Multi-task allocation and path planning for cooperating uavs. In: Cooperative control: models, applications and algorithms, pp. 23–41. Springer (2003)

  3. Bertsekas, D.P.: Auction algorithms for network flow problems: A tutorial introduction. Comput. Optim. Appl. 1(1), 7–66 (1992)

    Article  MathSciNet  Google Scholar 

  4. Binetti, G., Davoudi, A., Naso, D., Turchiano, B., Lewis, F.L.: A distributed auction-based algorithm for the nonconvex economic dispatch problem. IEEE Trans. Ind. Inf. 10(2), 1124–1132 (2013)

    Article  Google Scholar 

  5. Burkard, R. E., Derigs, U.: Assignment and matching problems: solution methods with FORTRAN-programs, vol. 184. Springer Science & Business Media, Berlin (2013)

    Google Scholar 

  6. Choi, H. L., Brunet, L., How, J. P.: Consensus-based decentralized auctions for robust task allocation. IEEE Trans. Robot. 25(4), 912–926 (2009)

    Article  Google Scholar 

  7. Chopra, S., Notarstefano, G., Rice, M., Egerstedt, M.: A distributed version of the hungarian method for multirobot assignment. IEEE Trans. Robot. 33(4), 932–947 (2017)

    Article  Google Scholar 

  8. Choudhury, S., Gupta, J. K., Kochenderfer, M. J., Sadigh, D., Bohg, J.: Dynamic multi-robot task allocation under uncertainty and temporal constraints. arXiv:2005.13109 (2020)

  9. Dames, P. M.: Distributed multi-target search and tracking using the phd filter. Auton. Robot., 1–17 (2019)

  10. Farmani, N., Sun, L., Pack, D. J.: A scalable multitarget tracking system for cooperative unmanned aerial vehicles. IEEE Trans. Aerosp. Electron. Syst. 53(4), 1947–1961 (2017)

    Article  Google Scholar 

  11. Hu, J., Yang, J.: Application of distributed auction to multi-uav task assignment in agriculture. Int. J. Precision Agricultural Aviation 1(1) (2018)

  12. Ismail, S., Sun, L.: Decentralized hungarian-based approach for fast and scalable task allocation. In: 2017 International Conference on Unmanned Aircraft Systems (ICUAS), pp. 23–28. IEEE (2017)

  13. Johnson, L., Ponda, S., Choi, H. L., How, J.: Asynchronous decentralized task allocation for dynamic environments. In: Infotech@ Aerospace 2011, p. 1441 (2011)

  14. Kuhn, H. W.: The hungarian method for the assignment problem. Naval Res. Logist. Q. 2(1-2), 83–97 (1955)

    Article  MathSciNet  Google Scholar 

  15. Lerman, K., Jones, C., Galstyan, A., Matarić, M. J.: Analysis of dynamic task allocation in multi-robot systems. Int. J. Robot. Res. 25(3), 225–241 (2006)

    Article  Google Scholar 

  16. Lin, C.: Online connectivity-aware dynamic distribution for heterogeneous multi-robot systems. Ph.D. thesis, Carnegie Mellon University Pittsburgh, PA (2020)

  17. Lindsay, N., Sun, L.: A task-oriented distributed assignment algorithm for collaborative unmanned aerial systems. In: Proc. of 2020 IEEE International Conference on Unmanned Aircraft Systems, Athens, Greece, September 2020, accepted (2020)

  18. Makkapati, V. R., Tsiotras, P.: Apollonius allocation algorithm for heterogeneous pursuers to capture multiple evaders. arXiv:2006.10253 (2020)

  19. Mills-Tettey, G.A., Stentz, A., Dias, M.B.: The dynamic hungarian algorithm for the assignment problem with changing costs. Robotics Institute, Pittsburgh, PA, Tech. Rep. CMU-RI-TR-07-27 (2007)

  20. Muhuri, P.K., Rauniyar, A.: Immigrants based adaptive genetic algorithms for task allocation in multi-robot systems. Int. J. Comput. Intell. Appl. 16(04), 1750025 (2017)

    Article  Google Scholar 

  21. Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32–38 (1957)

    Article  MathSciNet  Google Scholar 

  22. Naparstek, O., Leshem, A.: Fully distributed auction algorithm for spectrum sharing in unlicensed bands. In: 2011 4th IEEE International Workshop On Computational Advances In Multi-Sensor Adaptive Processing (CAMSAP), pp. 233–236. IEEE (2011)

  23. Narayanan, A., Nagarathnam, B.B., Meyyappan, M., Mongkolsri, S.: Experimental comparison of hungarian and auction algorithms to solve the assignment problem. https://chalamy.tripod.com/Report.pdf. Accessed 04 October 2020 (2000)

  24. Omara, F. A., Arafa, M. M.: Genetic algorithms for task scheduling problem. In: Foundations of Computational Intelligence Volume 3, pp. 479–507. Springer (2009)

  25. Pang, Y., Liu, R.: Trust aware emergency response for a resilient human-swarm cooperative system. arXiv:2006.15466 (2020)

  26. Papadimitriou, C. H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Courier Corporation, Chelmsford (1998)

    MATH  Google Scholar 

  27. Samiei, A., Ismail, S., Sun, L.: Cluster-based hungarian approach to task allocation for unmanned aerial vehicles. In: 2019 IEEE National Aerospace and Electronics Conference (NAECON), pp. 148–154. IEEE (2019)

  28. Samiei, A., Sun, L.: Distributed recursive hungarian-based approaches to fast task allocation for unmanned aircraft systems. In: AIAA Scitech 2020 Forum, pp. 0658 (2020)

  29. Schwartz, R., Tokekar, P.: Robust multi-agent task assignment in failure-prone and adversarial environments. arXiv:2007.00100 (2020)

  30. Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artif. Intell. 101(1-2), 165–200 (1998)

    Article  MathSciNet  Google Scholar 

  31. Sokol, V.: On some nonlinear assignment problems. Ph.D. thesis, Applied Sciences, School of Computing Science (2018)

  32. Song, T., Yan, X., Liang, A., Chen, K., Guan, H.: A distributed bidirectional auction algorithm for multirobot coordination. In: 2009 International Conference on Research Challenges in Computer Science, pp. 145–148. IEEE (2009)

  33. Sun, X., Qi, N., Yao, W.: Boolean networks-based auction algorithm for task assignment of multiple uavs. Math. Probl. Eng. 2015 (2015)

  34. Suslova, E., Fazli, P.: Decentralized multi-robot task allocation with time window and ordering constraints. https://pooyanfazli.com/publications/Suslova_RSS2020W.pdf. Accessed 08 January 2021 (2017)

  35. Zahedi, Z., Sengupta, S., Kambhampati, S.: Why not give this work to them?’explaining ai-moderated task-allocation outcomes using negotiation trees. arXiv:2002.01640 (2020)

  36. Zavlanos, M. M., Spesivtsev, L., Pappas, G. J.: A distributed auction algorithm for the assignment problem. In: 2008 47th IEEE Conference on Decision and Control, pp. 1212–1217. IEEE (2008)

Download references

Funding

This work was supported by the New Mexico Space Grant Consortium and the Laboratory Directed Research and Development program at Sandia National Laboratories. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology Engineering Solutions of Sandia, LLC, a wholly-owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. The views expressed in the article do not necessarily represent the views of the U.S. Department of Energy or the United States Government.

Author information

Authors and Affiliations

Authors

Contributions

The first author, Nathan Lindsay, developed the algorithm proposed (Sequential Task Addition Distributed Assignment Algorithm - STADAA) in this paper and developed the code for the STADAA, the Consensus Based Auction Algorithm, and the Task Oriented Distributed Assignment Algorithm, which were all used in testing. Also, he wrote the first draft of this manuscript, analyzing the test results and providing insight into the algorithm’s performance. The second author, Russell Buehling, developed the code for the Distributed Hungarian Based Algorithm that was used in testing, developed the testing environment and ran the tests that generated the results displayed in this paper. The third author, Liang Sun, as the research advisor of the first and second authors, initiated the research work presented in the paper, developed the research plan for methodologies, simulations, experiments, analysis, and data collection, provided guidance for research discussions. All authors read and approved the revised manuscript.

Corresponding author

Correspondence to Nathan Lindsay.

Ethics declarations

Ethics approval

We deemed no ethical approval was necessary.

Consent for Publication

All authors confirm that: - The research done in this paper has not been published before. - This is not considered for publication anywhere else. - All coauthors approve the publication of this information.

All authors willfully consent to having their information being published in the Journal of Intelligent and Robotic Systems. We understand that the test results and images published in this article will be published on an open access basis and will be freely available on the internet and may be seen by the general public. We reserve the right to revoke our consent for publication at any time prior to publication, but we acknowledge that once the information has been committed to publication, revocation of our consent is no longer possible.

Competing interests

All authors affirm that there is no known conflict of interest pertaining to the information presented in this manuscript.

Additional information

Consent to Participate

All mentioned authors voluntarily agreed to participate in this research topic.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Previous paper “A Task-Oriented Distributed Assignment Algorithm for Collaborative Unmanned Aerial Systems” in proceedings of the 2020 International Conference on Unmanned Aircraft Systems (ICUAS’20), Athens, Greece

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lindsay, N., Buehling, R.K. & Sun, L. A Sequential Task Addition Distributed Assignment Algorithm for Multi-Robot Systems. J Intell Robot Syst 102, 51 (2021). https://doi.org/10.1007/s10846-021-01394-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10846-021-01394-2

Keywords

Navigation