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.
Get Involved with AMS
45 Beacon Street
Boston, MA 02108-3693
1200 New York Ave NW
Washington, DC 200005-3928
Character limit 500/500