IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0267982.html
   My bibliography  Save this article

Task allocation in multi-robot system using resource sharing with dynamic threshold approach

Author

Listed:
  • Nayyer Fazal
  • Muhammad Tahir Khan
  • Shahzad Anwar
  • Javaid Iqbal
  • Shahbaz Khan

Abstract

Task allocation is a fundamental requirement for multi-robot systems working in dynamic environments. An efficient task allocation algorithm allows the robots to adjust their behavior in response to environmental changes such as fault occurrences, or other robots’ actions to increase overall system performance. To address these challenges, this paper presents a Task Allocation technique based on a threshold level which is an accumulative value aggregated by a centralized unit using the Task-Robot ratio and the number of the available resource in the system. The threshold level serves as a reference for task acceptance and the task acceptance occurs despite resource shortage. The deficient resources for the accepted task are acquired through an auction process using objective minimization. Despite resource shortage, task acceptance occurs. The threshold approach and the objective minimization in the auction process reduce the overall completion time and increase the system’s resource utilization up to 96%, which is demonstrated theoretically and validated through simulations and real experimentation.

Suggested Citation

  • Nayyer Fazal & Muhammad Tahir Khan & Shahzad Anwar & Javaid Iqbal & Shahbaz Khan, 2022. "Task allocation in multi-robot system using resource sharing with dynamic threshold approach," PLOS ONE, Public Library of Science, vol. 17(5), pages 1-22, May.
    • Handle: RePEc:plo:pone00:0267982
    DOI: 10.1371/journal.pone.0267982
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0267982
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0267982&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0267982?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0267982. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.