All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On multi-robot search for a stationary object

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F17%3A00319120" target="_blank" >RIV/68407700:21730/17:00319120 - isvavai.cz</a>

  • Result on the web

    <a href="http://ieeexplore.ieee.org/document/8098696/" target="_blank" >http://ieeexplore.ieee.org/document/8098696/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ECMR.2017.8098696" target="_blank" >10.1109/ECMR.2017.8098696</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On multi-robot search for a stationary object

  • Original language description

    Two variants of multi-robot search for a stationary object in a priori known environment represented by a graph are studied in the paper. The first one is generalization of the Traveling Deliveryman Problem where more than one deliveryman is allowed to be used in a solution. Similarly, the second variant is generalization of the Graph Search Problem. A novel heuristics suitable for both problems is proposed which is furthermore integrated into a cluster-first route second approach. A set of computational experiments was conducted over the benchmark instances derived from the TSPLIB library. The results obtained show that even a standalone heuristics significantly outperforms the standard solution based on k- means clustering in quality of results as well as computational time. The integrated approach furthermore improves solutions found by a standalone heuristics by up to 15% at the expense of higher computational complexity.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    R - Projekt Ramcoveho programu EK

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of ECMR 2017

  • ISBN

    978-1-5386-1096-1

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

  • Publisher name

    IEEE

  • Place of publication

    Marseille

  • Event location

    Paris

  • Event date

    Sep 6, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000426455100043