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 solution of the Dubins touring problem

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00315446" target="_blank" >RIV/68407700:21230/17:00315446 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    On solution of the Dubins touring problem

  • Original language description

    The Dubins traveling salesman problem (DTSP) combines the combinatorial optimization of the optimal sequence of waypoints to visit the required target locations with the continuous optimization to determine the optimal headings at the waypoints. Existing decoupled approaches to the DTSP are based on an independent solution of the sequencing part as the Euclidean TSP and finding the optimal headings of the waypoints in the sequence. In this work, we focus on the determination of the optimal headings in a given sequence of waypoints and formulate the problem as the Dubins touring problem (DTP). The DTP can be solved by a uniform sampling of possible headings; however, we propose a new informed sampling strategy to find approximate solution of the DTP. Based on the presented results, the proposed algorithm quickly converges to a high-quality solution, which is less than 0.1% from the optimum. Besides, the proposed approach also improves the solution of the DTSP, and its feasibility has been experimentally verified in a real practical deployment.

  • 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

    <a href="/en/project/GA16-24206S" target="_blank" >GA16-24206S: Efficient Information Gathering with Dubins Vehicles in Persistent Monitoring and Surveillance Missions</a><br>

  • Continuities

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

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

    000426455100032