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”

Emergency landing aware surveillance planning for fixed-wing planes

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00336168" target="_blank" >RIV/68407700:21230/19:00336168 - isvavai.cz</a>

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/8870933" target="_blank" >https://ieeexplore.ieee.org/document/8870933</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Emergency landing aware surveillance planning for fixed-wing planes

  • Original language description

    In this paper, we introduce the Emergency Landing Aware Surveillance Planning (ELASP) problem that stands to find the shortest feasible trajectory to visit a given set of locations while considering a loss of thrust may happen to the vehicle at any time. Two main challenges can be identified in ELASP. First, the ELASP is a planning problem to determine a feasible close-loop trajectory visiting all given locations such that the total trajectory length is minimized, which is a variant of the traveling salesman problem. The second challenge arises from the safety constraints to determine the cost-efficient trajectory such that its altitude is sufficiently high to guarantee a gliding emergency landing to a nearby airport from any point of the trajectory. Methods to address these challenges individually already exist, but the proposed approach enables to combine the existing methods to address both challenges at the same time and returns a safe, feasible, and cost-efficient multi-goal trajectory for the curvature-constrained vehicle.

  • 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/GA19-20238S" target="_blank" >GA19-20238S: Multi-Robot Persistent Monitoring of Dynamic Environments</a><br>

  • Continuities

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

Others

  • Publication year

    2019

  • 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

    2019 European Conference on Mobile Robots (ECMR)

  • ISBN

    978-1-7281-3605-9

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

  • Publisher name

    IEEE

  • Place of publication

    St. Paul, Minnesota

  • Event location

    Prague

  • Event date

    Aug 4, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article