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 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%3A00236819" target="_blank" >RIV/68407700:21230/15:00236819 - isvavai.cz</a>

  • Result on the web

    <a href="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7353945" target="_blank" >http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7353945</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    On the Dubins Traveling Salesman Problem with Neighborhoods

  • Original language description

    In this paper, we address the problem of optimal path planning to visit a set of regions by Dubins vehicle, which is also known as the Dubins Traveling Salesman Problem with Neighborhoods (DTSPN). This problem can be tackled by a transformation to othervariants of the TSP or evolutionary algorithms. We address the DTSPN as a problem to find Dubins path to visit a given sequence of regions and propose a simple iterative optimization procedure to find Dubins path visiting the regions. The proposed approach allows to efficiently solve the DTSPN and based on the presented comparison with existing approaches, the proposed algorithm provides solutions of competitive quality to the evolutionary techniques while it is significantly less computationally demanding.

  • 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

    IROS 2015: Proceedings IEEE/RSJ International Conference on Inteligent Robots and Systems

  • ISBN

    978-1-4799-9994-1

  • ISSN

    2153-0858

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    4029-4034

  • Publisher name

    IEEE Computer Society

  • Place of publication

    Los Alamitos

  • Event location

    Hamburg

  • Event date

    Sep 28, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000371885404031