Skip to main content
SpringerLink
Log in

A performance-impact based multi-task distributed scheduling algorithm with task removal inference and deadlock avoidance

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

Abstract

Multi-task distributed scheduling (MTDS) remains a challenging problem for multi-agent systems used for uncertain and dynamic real-world tasks such as search-and-rescue. The Performance Impact (PI) algorithm is an excellent solution for MTDS, but it suffers from the problem of non-convergence that it may fall into an infinite cycle of exchanging the same task. In this paper, we improve the PI algorithm through the integration of a task removal inference strategy and a deadlock avoidance mechanism. Specifically, the task removal inference strategy results in better exploration performance than the original PI, improving the suboptimal solutions caused by the heuristics for local task selection as done in PI. In addition, we design a deadlock avoidance mechanism that limits the number of times of removing the same task and isolating consecutive inclusions of the same task. Therefore, it guarantees the convergence of the MTDS algorithm. We demonstrate the advantage of the proposed algorithm over the original PI algorithm through Monte Carlo simulation of the search-and-rescue task. The results show that the proposed algorithm can obtain a lower average time cost and the highest total allocation number.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Gao, Y., et al. (2019). Weighted area coverage of maritime joint search and rescue based on multi-agent reinforcement learning. In 2019 IEEE 3rd advanced information management, communicates, electronic and automation control conference (IMCEC), IEEE.

  2. Pallin, M., Rashid, J., & ögren, P. (2021). A decentralized asynchronous collaborative genetic algorithm for heterogeneous multi-agent search and rescue problems. In 2021 IEEE international symposium on safety, security, and rescue robotics (SSRR), pp. 1-8. https://doi.org/10.1109/SSRR53300.2021.9597856.

  3. Pallin, M., Rashid, J., & ögren, P. (2021). Formulation and solution of the multi-agent concurrent search and rescue problem. In 2021 IEEE international symposium on safety, security, and rescue robotics (SSRR), pp. 27–33. https://doi.org/10.1109/SSRR53300.2021.9597685.

  4. Bruno, J., Coffman, E. G., & Sethi, R. (1974). Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17(7), 382–387.

    Article  MathSciNet  Google Scholar 

  5. Jing, L. (2012). The research on firefighting and rescue cooperation algorithm based on multi-agent. In 2012 Fifth International Symposium on Computational Intelligence and Design. Hangzhou, China, pp. 89–92. https://doi.org/10.1109/ISCID.2012.31

  6. Kolar, P. (2020). Coupling consensus based tasks with subsumption architecture for UAS swarm based intelligence surveillance and reconnaissance operations. In 2020 IEEE/AIAA 39th digital avionics systems conference (DASC). IEEE.

  7. Cho, J., et al. (2020). Towards persistent surveillance and reconnaissance using a connected swarm of multiple UAVs. IEEE Access, 99, 1.

    Google Scholar 

  8. Braquet, M. & Bakolas, E., (2021). Greedy decentralized auction-based task allocation for multi-agent systems. IFAC-PapersOnLine, 54(20), 675–680. https://doi.org/10.1016/j.ifacol.2021.11.249.

  9. Choudhury, S., et al. (2020). Dynamic multi-robot task allocation under uncertainty and temporal constraints. Autonomous Robots, 46(1), 231–247.

  10. Li, F., et al. (2022). VLSs: A local search algorithm for distributed constraint optimization problems. International Journal of Pattern Recognition and Artificial Intelligence, 36, 3.

    Google Scholar 

  11. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to NP-completeness. W. H. Freeman.

    Google Scholar 

  12. Lenstra, J. K., & Kan, A. (2010). Complexity of vehicle routing and scheduling problems. Networks, 11(2), 221–227.

    Article  Google Scholar 

  13. Wang, X., Yang, S., Guo, Z., Lian, M., & Huang, T. (2022). A distributed dynamical system for optimal resource allocation over state-dependent networks. In IEEE transactions on network science and engineering. https://doi.org/10.1109/TNSE.2022.3174098.

  14. Geng, N., et al. (2019). How good are distributed allocation algorithms for solving urban search and rescue problems? A comparative study with centralized algorithms. IEEE Transactions on Automation Science and engineering, 16(1), 478–485.

    Article  Google Scholar 

  15. Whitbrook, A., Meng, Q., & Chung, P. (2015). A novel distributed scheduling algorithm for time-critical multi-agent systems. In: IEEE/RSJ international conference on intelligent robots & systems. IEEE.

  16. Korsah, G. A., Stentz, A., & Dias, M. B. (2013). A comprehensive taxonomy for multi-robot task allocation. International Journal of Robotics Research, 32(12), 1495–1512.

    Article  Google Scholar 

  17. Segui-Gasco, P., et al. (2014). A combinatorial auction framework for decentralised task allocation. In Globecom 2014 Wi-UAV Workshop IEEE.

  18. Bechon, P., et al. (2018). Integrating planning and execution for a team of heterogeneous robots with time and communication constraints. In 2018 IEEE international conference on robotics and automation (ICRA) IEEE.

  19. Bandyopadhyay, S., Chung, S. J., & Hadaegh F. Y., (2017). Probabilistic and distributed control of a large-scale swarm of autonomous agents. In IEEE Transactions on Robotics, 33(5), 1103–1123. https://doi.org/10.1109/TRO.2017.2705044.

  20. Omidshafiei, S., et al. (2017). Decentralized control of multi-robot partially observable Markov decision processes using belief space macro-actions. International Journal of Robotics Research, 36(2), 231–258.

    Article  Google Scholar 

  21. Shima, T., & Rasmussen, S.J. (2009). Eds., UAV cooperative decision and control: challenges and practical approaches. In Advances in design and control (18 ed). Philadelphia: Society for Industrial and Applied Mathematics.

  22. Bogyrbayeva, A., Takalloo, M., Charkhgard, H., & Kwon, C. (2021). An iterative combinatorial auction design for fractional ownership of autonomous vehicles. International Transactions in Operational Research, 28(4), 1681–1705. https://doi.org/10.1111/itor.12903

    Article  MathSciNet  Google Scholar 

  23. Liu, L., Wang, C., Wang, J.-J., & Crespo, A. M. F. (2022). An iterative auction for resource-constrained surgical scheduling. Journal of the Operational Research Society. https://doi.org/10.1080/01605682.2022.2083988

    Article  Google Scholar 

  24. Aguilar, C. O., & Gharesifard, B. (2017). Almost equitable partitions and new necessary conditions for network controllability. Automatica, 80, 25–31.

    Article  MathSciNet  Google Scholar 

  25. Testa, A., Rucco, A., & Notarstefano, G. (2019). Distributed mixed-integer linear programming via cut generation and constraint exchange. IEEE Transactions on Automatic Control, 65, 1456–1467.

    Article  MathSciNet  Google Scholar 

  26. Camisa, A., Notarnicola, I., & Notarstefano, G. (2021). Distributed primal decomposition for large-scale MILPS. IEEE Transactions on Automatic Control, 67, 413–420.

    Article  MathSciNet  Google Scholar 

  27. Mudrova, L., & Hawes, N. (2015). Task scheduling for mobile robots using interval algebra. In Proceedings of the 2015 IEEE international conference on robotics and automation (ICRA), (pp. 383-388). Seattle, WA, USA.

  28. Buckman, N., Choi, H. -L. & How, J. P. (2019). Partial replanning for decentralized dynamic task allocation. In Proceedings of the AIAA Scitech 2019 Forum, San Diego, CA, USA, (pp. 0915).

  29. Choi, H. L., Brunet, L., & How, J. P. (2009). Consensus-based decentralized auctions for robust task allocation. IEEE Transactions on Robotics, 25(4), 912–926.

    Article  Google Scholar 

  30. Zhao, W., Meng, Q., & Chung, P. (2015). A heuristic distributed task allocation method for multivehicle multitask problems and its application to search and rescue scenario. IEEE Transactions on Cybernetics, 46, 4.

    Google Scholar 

  31. Whitbrook, A., Meng, Q., & Chung, P. (2017). Reliable, distributed scheduling and rescheduling for time-critical, multiagent systems. IEEE Transactions on Automation Science & Engineering, 99, 1–16.

    Google Scholar 

  32. Turner, J., et al. (2017). Distributed task rescheduling with time constraints for the optimization of total task allocations in a multirobot system. IEEE Transactions on Cybernetics, 99, 1–15.

    Google Scholar 

Download references

Acknowledgements

This work was supported by the Science and Technology Innovation 2030-Key Project of “New Generation Artificial Intelligence” under Grant 2020AAA0108200.

Author information

Author notes

  1. Runfeng Chen and Chang Wang have contributed equally to this work.

Authors and Affiliations

  1. College of Intelligence Science and Technology, National University of Defense Technology, Deya Road, Changsha, 410073, Hunan Province, China

    Jie Li, Runfeng Chen, Chang Wang, Yiting Chen, Yuchong Huang & Xiangke Wang

Authors
  1. Jie Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Runfeng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yiting Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yuchong Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Xiangke Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jie Li.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, J., Chen, R., Wang, C. et al. A performance-impact based multi-task distributed scheduling algorithm with task removal inference and deadlock avoidance. Auton Agent Multi-Agent Syst 37, 30 (2023). https://doi.org/10.1007/s10458-023-09611-y

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10458-023-09611-y

Keywords

Search

Navigation