Bi-objective maritime route planning in pirate-infested waters

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00236620" target="_blank" >RIV/68407700:21230/15:00236620 - isvavai.cz</a>

Výsledek na webu

<a href="http://repository.am.szczecin.pl/handle/123456789/770" target="_blank" >http://repository.am.szczecin.pl/handle/123456789/770</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.17402/046" target="_blank" >10.17402/046</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Bi-objective maritime route planning in pirate-infested waters

Popis výsledku v původním jazyce

Contemporary maritime shipping is subject to a large number of constraints given by tight shipping schedules and very low margins. Additionally, problematic areas with increased security needs dynamically changing in time, combined with seasonal oceanographic and meteorological conditions pose a challenging voyage planning problem. In this work we present a risk-aware voyage planner taking into account spatio-temporal environmental conditions. The planner is based on a graph-based search algorithm A*. We discretize the required area into a graph, we store various layers of information into the edges of the graph (such as risk and weather conditions) in a form of numeric weights and we define a bi-objective planning problem with a tradeoff between security and duration of the voyage. The nature of the algorithm guarantees a complete and optimal solution in a form of an optimized voyage with respect to the criterion function composed of the two weighted components, i.e, duration and secu

Název v anglickém jazyce

Bi-objective maritime route planning in pirate-infested waters

Popis výsledku anglicky

Contemporary maritime shipping is subject to a large number of constraints given by tight shipping schedules and very low margins. Additionally, problematic areas with increased security needs dynamically changing in time, combined with seasonal oceanographic and meteorological conditions pose a challenging voyage planning problem. In this work we present a risk-aware voyage planner taking into account spatio-temporal environmental conditions. The planner is based on a graph-based search algorithm A*. We discretize the required area into a graph, we store various layers of information into the edges of the graph (such as risk and weather conditions) in a form of numeric weights and we define a bi-objective planning problem with a tradeoff between security and duration of the voyage. The nature of the algorithm guarantees a complete and optimal solution in a form of an optimized voyage with respect to the criterion function composed of the two weighted components, i.e, duration and secu

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GP13-18316P" target="_blank" >GP13-18316P: Samo-organizující se sítě v robotických úlohách plánování cesty přes více cílů</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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 periodika

Scientific Journals of the Maritime University of Szczecin

ISSN

2392-0378

e-ISSN

—

Svazek periodika

43

Číslo periodika v rámci svazku

115

Stát vydavatele periodika

PL - Polská republika

Počet stran výsledku

10

Strana od-do

115-124

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—