Emergency landing aware surveillance planning for fixed-wing planes

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Emergency landing aware surveillance planning for fixed-wing planes

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Emergency landing aware surveillance planning for fixed-wing planes

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA19-20238S" target="_blank" >GA19-20238S: Multi-robotické monitorování dynamických prostředí</a><br>

Návaznosti

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

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

2019 European Conference on Mobile Robots (ECMR)

ISBN

978-1-7281-3605-9

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

—

Název nakladatele

IEEE

Místo vydání

St. Paul, Minnesota

Místo konání akce

Prague

Datum konání akce

4. 8. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—