The Journal of Japan Institute of Navigation
Online ISSN : 2187-3275
Print ISSN : 0388-7405
ISSN-L : 0388-7405
Finding the Shortest Course of a Ship Based on Reinforcement Learning Algorithm
Kunihiko MITSUBORITakeshi KAMIOTakahiro TANAKA
Author information
JOURNAL FREE ACCESS

2004 Volume 110 Pages 9-18

Details
Abstract

Recently, great attention has been paid to the reinforcement learning (RL) algorithm in the fields of the artificial intelligence and the machine learning, as a tool to solve a class of the optimization problem. We try to construct the RL framework to find the shortest course of a ship in the following fundamental situations : (A) A ship goes on a restricted sea-area with the strong tidal current, such as the Kurushima strait. (B) Two ships go on a sea-area with no tidal current while each of them avoids the collision with the other. Q-learning algorithm, which is representative of the RL algorithm, is combined with the ship's motion equations through the quantization of their variables. Finally, the effectiveness of our framework is demonstrated with the model of the sea-area.

Content from these authors

この記事はクリエイティブ・コモンズ [表示 - 非営利 - 改変禁止 4.0 国際]ライセンスの下に提供されています。
https://creativecommons.org/licenses/by-nc-nd/4.0/deed.ja
Previous article Next article
feedback
Top