Minimum-Time Routing as an N-Stage Decision Process

View More View Less
  • 1 Istituto di Elettrotecnica, Universit&agrave di Genova, Genova, Italy
© Get Permissions
Full 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