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 sampling based methods for the Dubins Traveling Salesman Problem with Neighborhoods

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00237136" target="_blank" >RIV/68407700:21230/15:00237136 - isvavai.cz</a>

  • Result on the web

    <a href="https://ojs.cvut.cz/ojs/index.php/APP/article/view/3407" target="_blank" >https://ojs.cvut.cz/ojs/index.php/APP/article/view/3407</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.14311/APP.2015.1.0057" target="_blank" >10.14311/APP.2015.1.0057</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On sampling based methods for the Dubins Traveling Salesman Problem with Neighborhoods

  • Original language description

    In this paper, we address the problem of path planning to visit a set of goal regions by Dubins vehicle, which is also known as the Dubins Traveling Salesman Problem with Neighborhoods (DTSPN). We propose a modification of the existing sampling-based approach to use an increasing number of samples per goal region and thus improve the solution quality if a more computational time is available. The performance of the proposed modified sampling-based algorithm has been compared with existing approaches forthe DTSPN and results of the quality of found solutions and the required computational time are presented.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP13-18316P" target="_blank" >GP13-18316P: Self-Organizing Maps for Multi-Goal Path Planning Tasks</a><br>

  • Continuities

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

Others

  • Publication year

    2015

  • 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

    ACTA POLYTECHNICA CTU PROCEEDINGS: PAIR'15 Student Conferences on Planning in Artificial Intelligence and Robotics

  • ISBN

  • ISSN

    2336-5382

  • e-ISSN

  • Number of pages

    5

  • Pages from-to

    57-61

  • Publisher name

    ČVUT

  • Place of publication

    Praha

  • Event location

    Písek

  • Event date

    Sep 7, 2015

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article