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

A criterion for assessing obstacle-induced environmental complexity in multi-robot coverage exploration

Author

Listed:
  • Khalil Al-rahman Youssefi Darmian
  • Reza Abbaszadeh Darban
  • Gregor Kastner
  • Wilfried Elmenreich

Abstract

In many applications, such as coverage exploration and search and rescue missions, accurately assessing environmental complexity is valuable for performance evaluation and algorithm adjustments. Despite this, in the context of multi-robot systems, quantifying environmental complexity caused by obstacles when using autonomous ground robots presents significant challenges. This research proposes a criterion for measuring environments’ obstacle-induced complexity in the context of autonomous multi-robot coverage exploration. The criterion rates the environment’s complexity numerically, where 0 denotes obstacle-free setups, and the value increases with obstacle-related effects, reaching a maximum of 1, representing the highest measurable complexity for the criterion. The proposed criterion is independent of robot hardware specifications and algorithm-specific aspects. Furthermore, it is independent of the environment’s size and the ratio of the area occupied by obstacles, enabling comparisons across various environments. Statistical analysis shows the metric performs well both on average and in single-case comparisons.

Suggested Citation

  • Khalil Al-rahman Youssefi Darmian & Reza Abbaszadeh Darban & Gregor Kastner & Wilfried Elmenreich, 2025. "A criterion for assessing obstacle-induced environmental complexity in multi-robot coverage exploration," PLOS ONE, Public Library of Science, vol. 20(5), pages 1-16, May.
    • Handle: RePEc:plo:pone00:0323112
    DOI: 10.1371/journal.pone.0323112
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0323112
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0323112&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0323112?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:0323112. 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.