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”

Self-organizing map for orienteering problem with dubins vehicle

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

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

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Self-organizing map for orienteering problem with dubins vehicle

  • Original language description

    This paper reports on the application of the self-organizing map (SOM) to solve a novel generalization of the Orienteering Problem (OP) for curvature-constrained vehicles that is called the Dubins Orienteering Problem (DOP). Having a set of target locations, each with associated reward, and a given travel budget, the problem is to find the most valuable curvature-constrained path connecting the target locations such that the path does not exceed the travel budget. The proposed approach is based on two existing SOM-based approaches to solving the OP and Dubins Traveling Salesman Problem (Dubins TSP) that are further generalized to provide a solution of the more computational challenging DOP. DOP combines challenges of the combinatorial optimization of the OP and TSP to determine a subset of the most valuable targets and the optimal sequence of the waypoints to collect rewards of the targets together with the continuous optimization of determining headings of Dubins vehicle at the waypoints such that the total length of the curvature-constrained path is shorter than the given travel budget and the total sum of the collected rewards is maximized.

  • 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

    2017 12th International Workshop on Self-Organizing Maps and Learning Vector Quantization, Clustering and Data Visualization (WSOM)

  • ISBN

    978-1-5090-6638-4

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    125-132

  • Publisher name

    IEEE

  • Place of publication

    Marseille

  • Event location

    Nancy

  • Event date

    Jun 28, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000426979300018