MINIMAL TIME VESSEL ROUTING IN A TIME-DEPENDENT ENVIRONMENT

In this paper, a general vessel performance model and a general constraint set are used to express the dynamics of a vessel traveling in a two-dimensional routing space. The objective is to minimize the total transition time for sailing from an origin to one or more destination locations with a known visiting sequence. Control variables are the power setting and the heading of the moving vehicle. Free and fixed departure time problems under dynamic constraints are considered. Elliptical bounds on the optimal state evolution are derived, and a pruning device is developed, both reducing the dimensionality of the problem. Simple examples illustrating the use of the algorithms are discussed.

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00490619
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 31 1990 12:00AM