All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 158 35 3
PDF Downloads 69 53 6

Minimum-Time Routing as an N-Stage Decision Process

R. ZoppoliIstituto di Elettrotecnica, Universit&agrave di Genova, Genova, Italy

Search for other papers by R. Zoppoli in
Current site
Google Scholar
PubMed
Close
Restricted access

Abstract

In this paper the problem of determining minimum-time ship routes is expressed as a discrete decision process in stochastic conditions, and is solved by dynamic programming.

Some models of such processes are considered. Their applicability depends on the amount of available meteorological information.

The salient features of the computer programs, operating experimentally aboard a motorship in normal service, are illustrated and example trajectories are presented.

Abstract

In this paper the problem of determining minimum-time ship routes is expressed as a discrete decision process in stochastic conditions, and is solved by dynamic programming.

Some models of such processes are considered. Their applicability depends on the amount of available meteorological information.

The salient features of the computer programs, operating experimentally aboard a motorship in normal service, are illustrated and example trajectories are presented.

Save