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”

Data Collection Planning with Dubins Airplane Model and Limited Travel Budget

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Data Collection Planning with Dubins Airplane Model and Limited Travel Budget

  • Original language description

    In this paper, we address the data collection planning problem for fixed-wing unmanned aircraft vehicle (UAV) with a limited travel budget. We formulate the problem as a variant of the Orienteering Problem (OP) in which the Dubins airplane model is utilized to extend the problem into the three-dimensional space and curvature-constrained vehicles. The proposed Dubins Airplane Orienteering Problem (DA-OP) stands to find the most rewarding data collection trajectory visiting a subset of the given target locations while the trajectory does not exceed the limited travel budget. Contrary to the original OP formulation, the proposed DA-OP combines not only the combinatorial part of determining a subset of the targets to be visited together with determining the sequence to visited them, but it also includes challenges related to continuous optimization in finding the shortest trajectory for Dubins airplane vehicle. The problem is addressed by sampling possible approaching angles to the targets, and a solution is found by the Randomized Variable Neighborhood Search (RVNS) method. A feasibility of the proposed solution is demonstrated by an empirical evaluation on modified benchmarks for the OP instances to the scenarios with varying altitude of the targets.

  • 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

    328-333

  • 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

    000426455100062