Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F22%3A00344445" target="_blank" >RIV/68407700:21730/22:00344445 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1111/itor.12794" target="_blank" >https://doi.org/10.1111/itor.12794</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1111/itor.12794" target="_blank" >10.1111/itor.12794</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND

Popis výsledku v původním jazyce

The paper addresses the problem of multi-robot search for a stationary object in a priori known environment. Two variants of the problem are studied given the working environment represented by a graph. The first one is an extension of the Traveling Deliveryman Problem for multiple vehicles, while the second one is a generalization of the Graph Search Problem. A novel algorithm is presented to solve both these problems, which is based on a combination of Greedy Randomized Adaptive Search Procedure with Variable Neighborhood Descent. A set of experimental evaluations was conducted over the benchmark instances derived from the TSPLIB library. The results obtained show that the proposed approach outperforms state of the art approaches in quality of results for both problems. Moreover, computational times for problems with the size of few hundreds of vertices allow using the approach for on-line decision making in search and rescue scenarios.

Název v anglickém jazyce

Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND

Popis výsledku anglicky

The paper addresses the problem of multi-robot search for a stationary object in a priori known environment. Two variants of the problem are studied given the working environment represented by a graph. The first one is an extension of the Traveling Deliveryman Problem for multiple vehicles, while the second one is a generalization of the Graph Search Problem. A novel algorithm is presented to solve both these problems, which is based on a combination of Greedy Randomized Adaptive Search Procedure with Variable Neighborhood Descent. A set of experimental evaluations was conducted over the benchmark instances derived from the TSPLIB library. The results obtained show that the proposed approach outperforms state of the art approaches in quality of results for both problems. Moreover, computational times for problems with the size of few hundreds of vertices allow using the approach for on-line decision making in search and rescue scenarios.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2022

Kód důvěrnosti údajů

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

Název periodika

International Transactions in Operational Research

ISSN

0969-6016

e-ISSN

1475-3995

Svazek periodika

29

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

32

Strana od-do

805-836

Kód UT WoS článku

000557257800001

EID výsledku v databázi Scopus

2-s2.0-85083046498