OPTIMUM SUBMARINE ROUTING II COMPUTATIONAL ROUTINES.

Abstract

Computing an optimum route for a submarine is studied. Typical functions representing the listening devices were used. It was found that in some cases several extremals existed and it was necessary to set up tests for the Legendre and Weierstrass conditions. The problem is further complicated by the fact that the optimum control-variables may lie on the boundary of the region of allowed values and further routines must be adjoined for this. Further, corners may occur and in particular the control may move discontinuously from a boundary point to an interior point or vice versa. The routines were made up to effect a compromise between the need for accuracy and reasonable computational time.

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1966
Accession Number
AD0489093

Entities

People

  • George D. Schmieg

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Accuracy
  • Boundaries
  • Naval Vessels
  • Naval Vessels (Combatant)
  • Ships
  • Submarines
  • Underwater Vehicles

Readers

  • Approximation Theory.
  • Educational Psychology
  • Graph Algorithms and Convex Optimization.