IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v36y2018i2d10.1007_s10878-018-0297-3.html
   My bibliography  Save this article

Computing the k-resilience of a synchronized multi-robot system

Author

Listed:
  • Sergey Bereg

    (University of Texas at Dallas)

  • Luis-Evaristo Caraballo

    (University of Seville)

  • José-Miguel Díaz-Báñez

    (University of Seville)

  • Mario A. Lopez

    (University of Denver)

Abstract

We study an optimization problem that arises in the design of covering strategies for multi-robot systems. Consider a team of n cooperating robots traveling along predetermined closed and disjoint trajectories. Each robot needs to periodically communicate information to nearby robots. At places where two trajectories are within range of each other, a communication link is established, allowing two robots to exchange information, provided they are “synchronized”, i.e., they visit the link at the same time. In this setting a communication graph is defined and a system of robots is called synchronized if every pair of neighbors is synchronized. If one or more robots leave the system, then some trajectories are left unattended. To handle such cases in a synchronized system, when a live robot arrives to a communication link and detects the absence of the neighbor, it shifts to the neighboring trajectory to assume the unattended task. If enough robots leave, it may occur that a live robot enters a state of starvation, failing to permanently meet other robots during flight. To measure the tolerance of the system under this phenomenon we define the k-resilience as the minimum number of robots whose removal may cause k surviving robots to enter a state of starvation. We show that the problem of computing the k-resilience is NP-hard if k is part of the input, even if the communication graph is a tree. We propose algorithms to compute the k-resilience for constant values of k in general communication graphs and show more efficient algorithms for systems whose communication graph is a tree.

Suggested Citation

  • Sergey Bereg & Luis-Evaristo Caraballo & José-Miguel Díaz-Báñez & Mario A. Lopez, 2018. "Computing the k-resilience of a synchronized multi-robot system," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 365-391, August.
    • Handle: RePEc:spr:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0297-3
    DOI: 10.1007/s10878-018-0297-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0297-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-018-0297-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Aldana-Galván, I. & Catana-Salazar, J.C. & Díaz-Báñez, J.M. & Duque, F. & Fabila-Monroy, R. & Heredia, M.A. & Ramírez-Vigueras, A. & Urrutia, J., 2020. "On optimal coverage of a tree with multiple robots," European Journal of Operational Research, Elsevier, vol. 285(3), pages 844-852.
    2. Sergey Bereg & Andrew Brunner & Luis-Evaristo Caraballo & José-Miguel Díaz-Báñez & Mario A. Lopez, 2020. "On the robustness of a synchronized multi-robot system," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 988-1016, May.
    3. Caraballo, Luis E. & Díaz-Báñez, José M. & Fabila-Monroy, Ruy & Hidalgo-Toscano, Carlos, 2022. "Stochastic strategies for patrolling a terrain with a synchronized multi-robot system," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1099-1116.

    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:spr:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0297-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.