IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v93y1997i1d10.1023_a1022693600078.html
   My bibliography  Save this article

Collision Avoidance by a Ship with a Moving Obstacle: Computation of Feasible Command Strategies

Author

Listed:
  • Y. Yavin

    (University of Pretoria)

  • C. Frangos

    (University of Pretoria)

  • T. Miloh

    (Tel Aviv University)

  • G. Zilman

    (Tel Aviv University)

Abstract

A ship moving from a point A to a point B detects a moving small obstacle at close range. Hence, the ship has to perform a maneuver to avoid collision with the moving obstacle. Using a realistic model of a tanker ship, a method is proposed for computing feasible rudder command strategies for performing the collision-avoidance maneuver.

Suggested Citation

  • Y. Yavin & C. Frangos & T. Miloh & G. Zilman, 1997. "Collision Avoidance by a Ship with a Moving Obstacle: Computation of Feasible Command Strategies," Journal of Optimization Theory and Applications, Springer, vol. 93(1), pages 53-66, April.
  • Handle: RePEc:spr:joptap:v:93:y:1997:i:1:d:10.1023_a:1022693600078
    DOI: 10.1023/A:1022693600078
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022693600078
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1022693600078?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A. Miele & T. Wang & C. S. Chao & J. B. Dabney, 1999. "Optimal Control of a Ship for Course Change and Sidestep Maneuvers," Journal of Optimization Theory and Applications, Springer, vol. 103(2), pages 259-282, November.
    2. A. Miele & T. Wang, 2006. "Optimal Trajectories and Guidance Schemes for Ship Collision Avoidance," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 1-21, April.
    3. A. Miele & T. Wang & C. S. Chao & J. B. Dabney, 1999. "Optimal Control of a Ship for Collision Avoidance Maneuvers," Journal of Optimization Theory and Applications, Springer, vol. 103(3), pages 495-519, December.
    4. A. Miele & T. Wang, 2005. "Maximin Approach to the Ship Collision Avoidance Problem via Multiple-Subarc Sequential Gradient-Restoration Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 124(1), pages 29-53, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:93:y:1997:i:1:d:10.1023_a:1022693600078. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.