The Numerical Solution of Minimum Time Maneuvering Problems by a NLP Method

• Ohtsu Kohei

  東京海洋大学海洋工学部

Bibliographic Information

Other Title

• 非線形計画法による最短時間操船の数値解法
• ヒセンケイ ケイカクホウ ニ ヨル サイタン ジカンソウセン ノ スウチカイホウ

Abstract

It is a great concerning problem for a mariner to know how maneuvering method is the best for his ship. Moreover it is also important for a ship builder in the meaning how the designed ship shows the maneuvering performance in full conditions. A minimum time maneuvering yields an answer about this problem. The minimum time maneuvering problem of ship can be formulated as two point boundary problem. The author has solved this non linear problem using the Sequential Conjugate Gradient-Restoration Algorithm (SCGRA) by Wu and Miel. This numerical method was a powerful solving method. However, a tedious programming method was needed. In this paper, the author proposes to treat this problem in a non linear programming formulation. According to this, our problem is transformed to more easy one and we can solve the transformed one by using a general Non Linear Programming (NLP) package. In this paper, the author solves a minimum time changing course problem and a Williamson's turning (man over board) one which are described by non linear mathematical maneuvering model.

Journal

• Journal of the Society of Naval Architects of Japan

  Journal of the Society of Naval Architects of Japan 2004 (196), 99-104, 2004

  The Japan Society of Naval Architects and Ocean Engineers

Details

• CRID: 1390001204095964928
• NII Article ID: 10014498215
• NII Book ID: AN00194094
• DOI: 10.2534/jjasnaoe1968.2004.196_99
• ISSN: 18842070
• ISSN: 05148499
• NDL BIB ID: 7265178
• Web Site: http://id.ndl.go.jp/bib/7265178
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I7265178
• Data Source:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• Abstract License Flag: Disallowed