Making a Complete Mess and Getting Away With It: Traveling Salesperson Problems With Circle Placement Variants

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F24%3A00376738" target="_blank" >RIV/68407700:21730/24:00376738 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1109/LRA.2024.3445817" target="_blank" >https://doi.org/10.1109/LRA.2024.3445817</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Making a Complete Mess and Getting Away With It: Traveling Salesperson Problems With Circle Placement Variants

Popis výsledku v původním jazyce

This letter explores a variation of the Traveling Salesperson Problem, where the agent places a circular obstacle next to each node once it visits it. Referred to as the Traveling Salesperson Problem with Circle Placement (TSP-CP), the aim is to maximize the obstacle radius for which a valid closed tour exists and then minimize the tour cost. The TSP-CP finds relevance in various real-world applications, such as harvesting, quarrying, and open-pit mining. We propose several novel solvers to address the TSP-CP, its variant tailored for Dubins vehicles, and a crucial subproblem known as the Traveling Salesperson Problem on self-deleting graphs (TSP-SD). Our extensive experimental results show that the proposed solvers outperform the current state-of-the-art on related problems in solution quality.

Název v anglickém jazyce

Making a Complete Mess and Getting Away With It: Traveling Salesperson Problems With Circle Placement Variants

Popis výsledku anglicky

This letter explores a variation of the Traveling Salesperson Problem, where the agent places a circular obstacle next to each node once it visits it. Referred to as the Traveling Salesperson Problem with Circle Placement (TSP-CP), the aim is to maximize the obstacle radius for which a valid closed tour exists and then minimize the tour cost. The TSP-CP finds relevance in various real-world applications, such as harvesting, quarrying, and open-pit mining. We propose several novel solvers to address the TSP-CP, its variant tailored for Dubins vehicles, and a crucial subproblem known as the Traveling Salesperson Problem on self-deleting graphs (TSP-SD). Our extensive experimental results show that the proposed solvers outperform the current state-of-the-art on related problems in solution quality.

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

<a href="/cs/project/EH22_008%2F0004590" target="_blank" >EH22_008/0004590: Robotika a pokročilá průmyslová výroba</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2024

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

IEEE Robotics and Automation Letters

ISSN

2377-3766

e-ISSN

2377-3766

Svazek periodika

9

Číslo periodika v rámci svazku

10

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

8

Strana od-do

8555-8562

Kód UT WoS článku

001303441600006

EID výsledku v databázi Scopus

2-s2.0-85201784076