<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD with MathML3 v1.1 20151215//EN " "JATS-journalpublishing1-mathml3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="1.1" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="doi">10.17818/NM</journal-id>
      <journal-title-group>
        <journal-title xml:lang="hr">NAŠE MORE</journal-title>
        <journal-subtitle xml:lang="hr">znanstveni časopis za more i pomorstvo</journal-subtitle>
        <trans-title-group xml:lang="en">
          <trans-title>NASE MORE</trans-title>
          <trans-subtitle>International Journal of Maritime Science &amp; Technology</trans-subtitle>
        </trans-title-group>
        <abbrev-journal-title>Int. J. Marit. Sci. Tech. NASE MORE</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0469-6255</issn>
      <issn pub-type="epub">1848-6320</issn>
      <publisher>
        <publisher-name xml:lang="hr">Sveučilište u Dubrovniku</publisher-name>
        <publisher-name xml:lang="en">University of Dubrovnik</publisher-name>
        <publisher-loc>
          <addr-line>Branitelja Dubrovnika 29, 20000 Dubrovnik</addr-line>
        </publisher-loc>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.17818/NM/2024/1.4</article-id>
      <article-categories>
        <subj-group subj-group-type="heading" xml:lang="hr">
          <subject>Izvorni znanstveni članak</subject>
        </subj-group>
        <subj-group subj-group-type="heading" xml:lang="en">
          <subject>Original scientific paper</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title xml:lang="en">Maritime Data Mining for Marine Safety Based on Deep Learning: Southern Vietnam Case Study</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Pham</surname>
            <given-names>Tuan-Anh</given-names>
          </name>
          <email xlink:href="pta.maritime@gmail.com">pta.maritime@gmail.com</email>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Dang</surname>
            <given-names>Xuan-Kien</given-names>
          </name>
          <email xlink:href="kien.dang@ut.edu.vn">kien.dang@ut.edu.vn</email>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Koboević</surname>
            <given-names>Žarko</given-names>
          </name>
          <email xlink:href="zarko.koboevic@unidu.hr">zarko.koboevic@unidu.hr</email>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Do</surname>
            <given-names>Viet-Dung</given-names>
          </name>
          <email xlink:href="dungdv@ut.edu.vn">dungdv@ut.edu.vn</email>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Pham</surname>
            <given-names>Thi-Duyen Anh</given-names>
          </name>
          <email xlink:href="anh.pham@ut.edu.vn">anh.pham@ut.edu.vn</email>
        </contrib>
      </contrib-group>
      <pub-date>
        <day>12</day>
        <month>03</month>
        <year>2024</year>
      </pub-date>
      <volume>71</volume>
      <fpage>21</fpage>
      <lpage>29</lpage>
      <permissions>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
          <license-p>Attribution 4.0 International (CC BY 4.0)</license-p>
        </license>
        <license license-type="open-access" xml:lang="hr">
          <license-p>Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License https://creativecommons.org/licenses/by/4.0/    that allows others to share the work with an acknowledgment of the work’s authorship and initial publication in this journal. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.</license-p>
        </license>
        <license license-type="open-access" xml:lang="en">
          <license-p>Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License https://creativecommons.org/licenses/by/4.0/    that allows others to share the work with an acknowledgment of the work’s authorship and initial publication in this journal. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.</license-p>
        </license>
      </permissions>
      <abstract xml:lang="en">
        <p>High-speed passenger vessels, integrated river and sea vessels, container vessels, oil tankers, and other underwater vehicles operating in maritime traffic are among the types of vessels that must be equipped with AIS and VHF. The safety of navigation is one of the major problems in the maritime sector, particularly in Vietnam. Furthermore, marine traffic in the seaport zone is a common and difficult issue to manage in areas with a high volume of vessel traffic, mostly in places where the infrastructure supporting navigation is inadequately developed to meet the rapidly growing demands of the contemporary world. Therefore, it is necessary to create an integrated maritime management system to improve the efficiency of data exploitation and support maritime safety. To address this challenge, this study suggests a Maritime Traffic State Prediction (MTSP) model to predict traffic conditions in the channels where real-time data collection is insufficient in some specific locations. We recommend a deep learning method using Long Short-Term Memory (LSTM) networks to predict the safe path of the vessel in case of missing data segments. The findings have shown that the proposed approach encourages the mining of historical vessel data for maritime traffic, is ready to be applied, and can easily be implemented in a computer program or a web-based app.</p>
      </abstract>
      <kwd-group xml:lang="en">
        <kwd>maritime traffic state prediction</kwd>
        <kwd>data mining</kwd>
        <kwd>long short-term memory network</kwd>
        <kwd>navigational channels</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="introduction-uvod">
      <title>1. INTRODUCTION / <italic>Uvod</italic>
			</title>
      <p>Vessel performance, the caliber of the crew, the environment, management issues, etc., all have an impact on the complicated system of waterways in Vietnam. Waterway accidents can cause significant financial losses, casualties, and environmental damage. It is therefore essential to evaluate how safe the waterway traffic is. High-speed passenger vessels, integrated river and ocean-going vessels, container ships, and oil tankers are among the vessels that must now have AIS and VHF on board [<xref alt="1" rid="r1">1</xref>-
				<xref alt="2" rid="r2">2</xref>]. One of the main issues for the shipping industry, as well as for the security and economy of the entire globe, and Vietnam in particular, is vessel navigation. Some critical points and buoys in navigational channels are tagged with fake AIS signals for easy identification in crowded regions, i.e. in locations with high vessel traffic, particularly in places where navigation infrastructure is not adequately developed to fulfill the demands of the sea. The maritime traffic is a real challenge to handle with the increasing demand. The system for effectively gathering, integrating, and analyzing data relates to marine navigation. By using historical data mining approaches [<xref alt="3" rid="r3">3</xref>–
				<xref alt="4" rid="r4">4</xref>], the fundamental issues of anticipating vessel traffic situations along navigational channels were resolved. A prototype system is validated with the suggested fixes. The experimental findings demonstrate the viability and efficacy of the suggested techniques and use in practice. The recommendations for appropriate methods use historical data sources of AIS [<xref alt="5" rid="r5">5</xref>].
			</p>
      <p>Ship classes are becoming complex sensors as the digital revolution of the maritime industry continues to grow to support more energy-efficient marine and vessel operations and to meet the challenges of new legislation. The result of the combination of modern communication systems and advanced sensor technologies is significantly improved vessel connectivity, which allows for the collection and analysis of a large amount of operational data. Specifically, the synchronization and analysis of data from various sources will undoubtedly speed up decision-making for operators and improve vessel performance management in critical areas including energy and fuel management, emissions control, machinery and equipment monitoring, and route optimization. Thus, data mining will benefit the shipping sector by providing fresh insights and added value to improve decision-making, asset tracking, and fleet-wide optimal application, which is the main purpose of this study. With the aim to present a framework for analyzing historical vessel data in order to predict traffic conditions in the channels where real-time data collection is insufficient in certain areas, the main contributions of this work are as follows:</p>
      <list list-type="roman-lower">
        <list-item>
          <p>Presenting a solution to collect, integrate, and analyze data related to maritime traffic, then estimate the traffic status. The proposal is suitable for each navigational channel, thus increasing the accuracy and usefulness of the management information.</p>
        </list-item>
        <list-item>
          <p>Suggesting a Maritime Traffic State Prediction (MTSP) model that aims to help improve management systems and applications. We determine historical maritime traffic data from AIS for vessel kinematic information with MMSI vessel codes.</p>
        </list-item>
        <list-item>
          <p>Proposing the MTSP model based on Long Short-Term Memory (LSTM) Networks to predict the route of vessels in navigational channels in case of real-time data collection failure or discrete data loss. The evaluation results, which used the developed prototype and the collected data sources, were thoroughly analyzed to confirm the feasibility and effectiveness of the proposed methods. </p>
        </list-item>
      </list>
      <p>The rest of the paper is organized as follows: Section 2 describes an overview of the relevant contents; The related knowledge and problem formulation with the MTSP model based on LSTM network is covered in Section 3; Section 4 describes the results and evaluation of testing process. Finally, conclusions and a potential research direction for the study in the future are presented in Section 5.</p>
    </sec>
    <sec id="related-research-srodna-istraživanja">
      <title>2. RELATED RESEARCH / <italic>Srodna istraživanja</italic>
			</title>
      <sec id="overview-of-maritime-data-mining-connected-to-classification-and-analysis-algorithms-pregled-rudarenja-podataka-u-pomorstvu-povezanih-s-algoritmima-klasifikacije-i-analize">
        <title>2.1. Overview of maritime data mining connected to classification and analysis algorithms / <italic>Pregled rudarenja podataka u pomorstvu povezanih s algoritmima klasifikacije i analize</italic>
				</title>
        <graphic mimetype="image" mime-subtype="png" xlink:href="image1.png"/>
        <p>
				Figure
					1 Maritime traffic state prediction system
				</p>
        <p>
          <italic>
						Slika 1. Sustav za predviđanje stanja pomorskog prometa
					</italic>
        </p>
        <p>In maritime big data management, marine data is categorised into one or more given classes using classification models. These models are trained on a historical dataset with labels [<xref alt="6" rid="r6">6</xref>]. Assigning labels to data items is the process of classification. The goal of the classification challenge is to identify a variety model that allows the determination of the class to which the latest information belongs. In this section, we examine some modern analysis and application methods for processing maritime big data [<xref alt="6" rid="r6">6</xref>-
					<xref alt="19" rid="r19">19</xref>] as follows:
				</p>
        <list list-type="bullet">
          <list-item>
            <p><italic>Decision Tree Algorithm:</italic> A hierarchical category graph used in classification is called a decision tree, which is based on a series of rules and is a popular tool for data mining and classification, e.g. fuzzy-rough decision trees to learn about the behavior of vessel types [<xref alt="6" rid="r6">6</xref>]. The decision tree has the following classification model: First, the internal node is used for testing on an attribute; Second, the leaf node uses a label/description of a class label; And last but not least, the Branch from an internal node with the result of a test on the corresponding attribute.
						</p>
          </list-item>
          <list-item>
            <p><italic>Naive Bayes Algorithm</italic><bold>:</bold> Bayes' Theorem is a mathematical theorem that calculates the probability of the occurrence of a random event A given that the related event B has occurred. Naive Bayes Classification (NBC) is the algorithm based on probability calculation applying the Bayes theorem. This algorithm belongs to the Supervised Learning group and is an example of using Bayesian Networks from AIS data [<xref alt="7" rid="r7">7</xref>].
						</p>
          </list-item>
          <list-item>
            <p><italic>Support Vector Machine Algorithm
								<bold>: </bold>
							</italic>Support Vector Machine (SVM) is an algorithm that belongs to the Supervised Learning group that is used to divide classification data into separate groups [<xref alt="8" rid="r8">8</xref>-
							<xref alt="9" rid="r9">9</xref>]. Imagine we have a dataset consisting of blue and red points placed on the same plane. What about more complex datasets that cannot find a straight line to divide? We need to use an algorithm to map that data set into more dimensional space (
							<italic>n</italic> dimensions), thereby finding a hyperplane to divide [<xref alt="10" rid="r10">10</xref>-
							<xref alt="11" rid="r11">11</xref>]. Here, the author only introduces the SVM algorithm but does not go into it.
						</p>
          </list-item>
          <list-item>
            <p><italic>Random Forest Algorithm</italic><bold>:</bold> Random Forest (RF) is a set of ensemble models. The Random Forest model is very effective for classification problems because it mobilizes hundreds of smaller internal models with different rules at the same time to make the final decision [<xref alt="12" rid="r12">12</xref>]. The unit of RF is the decision tree algorithm, in the number of hundreds. Each decision tree is randomly generated from resampling (bootstrap, random sampling) and using only a small set of random features (random features), from all the variables in the data. In the final state, the RF model usually works very accurately, but in return, it is impossible to understand the working mechanism inside the model because the structure is too complicated.
						</p>
          </list-item>
          <list-item>
            <p><italic>Deep learning Algorithm:</italic> The Long Short-Term Memory (LSTM) network consists of memory blocks, each containing a cell state and three gates [<xref alt="18" rid="r18">18</xref>-
							<xref alt="19" rid="r19">19</xref>] including the input gate (controls how the input can change the cell state), the output port (sets which part of the cell state to output), and the forged gate (decides how much memory to keep).
						</p>
          </list-item>
        </list>
        <p><italic>Remark 1:</italic> Maritime data is collected from many different sources and does not have integrated links. Therefore, it is necessary to develop an integrated management system to improve the efficiency of data exploitation to support maritime safety, such as predicting the possibility of collisions and monitoring vessel mooring wharves.
				</p>
      </sec>
      <sec id="specific-time-series-data-based-ais-specifični-ais-temeljen-na-vremenskim-serijama-podataka">
        <title>2.2. Specific time-series data based AIS / <italic>Specifični AIS temeljen na vremenskim serijama podataka</italic>
				</title>
        <p>In particular, the vessel kinematic information, including latitude (lat), longitude (lon), speed over ground (SOG), and course over ground (COG), plays a critical role in evaluating optimal navigation routes, and predicting the future path of a vessel over specific time-series data based on relevant historical data requires analyzing an array of AIS data [<xref alt="13" rid="r13">13</xref>]. It is denoted by equations (1), (2), (3) [<xref alt="14" rid="r14">14</xref>-
					<xref alt="15" rid="r15">15</xref>]
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[X_{t} \triangleq \left\lbrack \text{lat},\text{lon},\text{SOG},\text{COG} \right\rbrack^{T}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>≜</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="true" form="prefix">[</mml:mo><mml:mtext mathvariant="normal">lat</mml:mtext><mml:mo>,</mml:mo><mml:mtext mathvariant="normal">lon</mml:mtext><mml:mo>,</mml:mo><mml:mtext mathvariant="normal">SOG</mml:mtext><mml:mo>,</mml:mo><mml:mtext mathvariant="normal">COG</mml:mtext><mml:mo stretchy="true" form="postfix">]</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></alternatives></inline-formula>(1)
				</p>
        <p>The vessel's historical path (The original AIS data for the MMSI vessel, code of 525100764, expressed by Southern Vietnam Maritime Safety Corporation), which is expressed in Table 1, is represented by a sequence of observation points <inline-formula><alternatives><tex-math><![CDATA[\{ X_{t_{0}},X_{t_{1}},\ldots,X_{t_{T}}\ \}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mo stretchy="false" form="prefix">{</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:msub><mml:mo>,</mml:mo><mml:mi>…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:msub><mml:mo stretchy="false" form="postfix">}</mml:mo></mml:mrow></mml:math></alternatives></inline-formula>, where <inline-formula><alternatives><tex-math><![CDATA[t_{i}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></alternatives></inline-formula> &lt; <inline-formula><alternatives><tex-math><![CDATA[t_{j}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></alternatives></inline-formula> if <inline-formula><alternatives><tex-math><![CDATA[i\  < \ j]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>&lt;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:math></alternatives></inline-formula>. Therefore, it is necessary to carry equally sampled observed data to obtain a series of <inline-formula><alternatives><tex-math><![CDATA[T + 1]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>T</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></alternatives></inline-formula> as follows:
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[X_{0:T} \triangleq \{ X_{t_{0}},X_{t_{0} + \mathrm{\Delta}t},X_{t_{0} + 2*\mathrm{\Delta}t}\ldots X_{t_{0} + T + \mathrm{\Delta}t}\}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>0</mml:mn><mml:mo>:</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:msub><mml:mo>≜</mml:mo><mml:mo stretchy="false" form="prefix">{</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>Δ</mml:mi></mml:mstyle><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mo>*</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>Δ</mml:mi></mml:mstyle><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mi>…</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>Δ</mml:mi></mml:mstyle><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false" form="postfix">}</mml:mo></mml:mrow></mml:math></alternatives></inline-formula>(2)
				</p>
        <p>The process of encoding complicated vessel motion data in this space feature poses a significant challenge. Therefore, the solution used is to expand the feature space by one higher dimension. The "four-hot" representation vector <inline-formula><alternatives><tex-math><![CDATA[h_{t}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></alternatives></inline-formula> is used to separate lat, lon, SOG, and COG data into <inline-formula><alternatives><tex-math><![CDATA[N_{\text{lat}},N_{\text{lon}},N_{\text{SOG}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mtext mathvariant="normal">lat</mml:mtext></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mtext mathvariant="normal">lon</mml:mtext></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mtext mathvariant="normal">SOG</mml:mtext></mml:msub></mml:mrow></mml:math></alternatives></inline-formula> and <inline-formula><alternatives><tex-math><![CDATA[N_{\text{COG}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>N</mml:mi><mml:mtext mathvariant="normal">COG</mml:mtext></mml:msub></mml:math></alternatives></inline-formula> bins [<xref alt="16" rid="r16">16</xref>], respectively. The vector <inline-formula><alternatives><tex-math><![CDATA[h_{t}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></alternatives></inline-formula> is expressed by
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[h_{t} \triangleq \left\lbrack 1_{t}^{\text{lat}},1_{t}^{\text{lon}},1_{t}^{\text{SOG}},1_{t}^{\text{COG}} \right\rbrack^{T}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>≜</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="true" form="prefix">[</mml:mo><mml:msubsup><mml:mn>1</mml:mn><mml:mi>t</mml:mi><mml:mtext mathvariant="normal">lat</mml:mtext></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mn>1</mml:mn><mml:mi>t</mml:mi><mml:mtext mathvariant="normal">lon</mml:mtext></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mn>1</mml:mn><mml:mi>t</mml:mi><mml:mtext mathvariant="normal">SOG</mml:mtext></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mn>1</mml:mn><mml:mi>t</mml:mi><mml:mtext mathvariant="normal">COG</mml:mtext></mml:msubsup><mml:mo stretchy="true" form="postfix">]</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></alternatives></inline-formula>(3)
				</p>
        <p>Table 1 The original AIS data sample for the MMSI vessel code of 525100764</p>
        <p>
          <italic>Tablica 1. Izvorni uzorak AIS podataka za MMSI brodski kod 525100764</italic>
        </p>
        <table-wrap>
          <table>
            <thead>
              <tr>
                <th>
                  <bold>Type</bold>
                </th>
                <th>
                  <bold>Second</bold>
                </th>
                <th>
                  <bold>Lon</bold>
                </th>
                <th>
                  <bold>Lat</bold>
                </th>
                <th>
                  <bold>Speed</bold>
                </th>
                <th>
                  <bold>Course</bold>
                </th>
                <th>
                  <bold>MMSI</bold>
                </th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.391.467</td>
                <td>1.032.744.333</td>
                <td>6.199.999.809</td>
                <td>2.060.000.038</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>107.040.435</td>
                <td>1.032.823</td>
                <td>5.5</td>
                <td>7.209.999.847</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>107.042.055</td>
                <td>1.032.815.667</td>
                <td>6</td>
                <td>1.024.000.015</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>10.704.332</td>
                <td>1.032.704.167</td>
                <td>6.099.999.905</td>
                <td>1.483.999.939</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>10.704.286</td>
                <td>1.031.946.333</td>
                <td>6</td>
                <td>168</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.437.683</td>
                <td>1.031.819.833</td>
                <td>5.599.999.905</td>
                <td>1.381.000.061</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>107.052.035</td>
                <td>1.031.199</td>
                <td>5.699.999.809</td>
                <td>172</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>10.705.498</td>
                <td>1.028.837.167</td>
                <td>4.900.000.095</td>
                <td>168</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.627.883</td>
                <td>1.025.852.167</td>
                <td>5.199.999.809</td>
                <td>1.551.999.969</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.657.667</td>
                <td>1.024.760.167</td>
                <td>6.900.000.095</td>
                <td>1.948.999.939</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.646.767</td>
                <td>1.023.462.333</td>
                <td>6.199.999.809</td>
                <td>1.756.000.061</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.620.417</td>
                <td>1.022.888.167</td>
                <td>7.900.000.095</td>
                <td>2.093.999.939</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.585.883</td>
                <td>10.223</td>
                <td>8.300.000.191</td>
                <td>2.196.999.969</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.558.233</td>
                <td>10.219.415</td>
                <td>7.699.999.809</td>
                <td>2.031.000.061</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.510.417</td>
                <td>1.021.187.833</td>
                <td>7.800.000.191</td>
                <td>211.5</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.486.367</td>
                <td>10.203.875</td>
                <td>7.400.000.095</td>
                <td>1.913.999.939</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.477.183</td>
                <td>1.019.983</td>
                <td>7.099.999.905</td>
                <td>1.858.999.939</td>
                <td>525100764</td>
              </tr>
              <tr>
                <td>3</td>
                <td>5</td>
                <td>1.070.472.883</td>
                <td>101.979</td>
                <td>7.400.000.095</td>
                <td>2.083.000.031</td>
                <td>525100764</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><italic>Remark 2:</italic> Depending on the weather and traffic, different features of vessels traveling along the comparable route will be observed. In case of dealing with large inertia vessels, and complex propulsion systems, it is necessary to predict the safe routes.
				</p>
      </sec>
    </sec>
    <sec id="problem-formulation-and-methods-definiranje-problema-i-metode">
      <title>3. PROBLEM FORMULATION AND METHODS / <italic>Definiranje problema i metode</italic>
			</title>
      <sec id="dynamic-visualization-of-the-vessel-movement-tracks-in-vungtau-port-dinamička-vizualizacija-putanja-kretanja-plovila-u-luci-vungtau">
        <title>3.1. Dynamic visualization of the vessel movement tracks in Vungtau port / <italic>Dinamička vizualizacija putanja kretanja plovila u luci Vungtau</italic>
				</title>
        <p>Nowadays, vessels are becoming complex sensors concentrated as the maritime industry's digital revolution gathers increasing volume to support more energy-efficient marine and vessel operations and support handling the challenges of new legislation. The result of the combination of modern communication systems and advanced sensor technologies is significantly improved vessel connectivity, which allows for the collection and analysis of a large amount of operational data. Specifically, the synchronization and analysis of data from various sources will undoubtedly speed up decision-making for operators and improve vessel performance management in critical areas including energy and fuel management, emissions control, machinery and equipment monitoring [<xref alt="17" rid="r17">17</xref>], and route optimization. Thus, data mining will benefit the shipping sector by providing fresh insights and added value to support improved decision-making, asset tracking, predicting, and fleet-wide optimal application. The methodology used in this study focused on mining maritime traffic from historical vessel data, and consists of two stages: data collection and classification in the first stage, together with the required measurement metrics; analysis, and prediction of marine traffic states using tools or algorithms in the second stage.
				</p>
        <graphic mimetype="image" mime-subtype="png" xlink:href="image2.png"/>
        <p>
					Figure 2 Dynamic visualization of the vessel movement tracks in Vungtau port 
				</p>
        <p>
          <italic>
						Slika 2. Dinamička vizualizacija putanja kretanja plovila u luci Vungtau
					</italic>
        </p>
        <p>Maritime traffic-related data is collected from various sources from existing fixed monitoring systems. As we know, static data, dynamic data, and auxiliary data are three types of data, based on the sample of data collection types. One of the sample data used in this paper is described in Table 2. For clarity, we used sample data of dense maps visualized for July 27, 2019, and Fig. 2 shows the dynamic visualization of the vessel movement in Vietnam's southern region. Obviously, the more data is collected, the greater the chances that the system will estimate traffic conditions timely and accurately. To be more precise, we use the vessel's dynamic visualization to estimate traffic circumstances almost in real-time. This allows us to provide suitable models for managing and predicting maritime traffic conditions, even when data segments are missing.</p>
        <p>Table 2 Classification of data collection</p>
        <p>
          <italic>Tablica 2. Klasifikacija prikupljanja podataka</italic>
        </p>
        <table-wrap>
          <table>
            <thead>
              <tr>
                <th>
                  <bold>Type</bold>
                </th>
                <th>
                  <bold>Contents</bold>
                </th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td>
                  <bold>Static data</bold>
                </td>
                <td>imo, mmsi, class, shipname, shiptype, callsign, length, beam, deadweight.</td>
              </tr>
              <tr>
                <td>
                  <bold>Dynamic data</bold>
                </td>
                <td>tagblock times (UTC), status (navigation status), lon (longitude), lat (latitude), SOG (speed), COG (course), heading, turnrate.</td>
              </tr>
              <tr>
                <td>
                  <bold>Auxiliary data</bold>
                </td>
                <td>band, destination (port), draught.</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Visualizing the initially collected AIS data helps the authors take an overview of the collected dataset. Consequently, the data preprocessing avoids missing data, which leads to the loss of the crucial features of the dataset. The authors determine the coordinate area in order to extract suitable data for the evaluation process based on the data visualization. In addition, data fields (such as ship name, call sign, and band) that do not affect the goals of training the prediction model are removed in order to increase processing speed. In this study, the visualization data array focuses on vessels with continuous paths and docking in the coastal area of Vung Tau City, with features of type and MMSI identifier and vessel dynamic data (lat, lon, SOG, and COG).</p>
        <p>The labeled data, which expressed the Fairway Maritime Traffic (FM-Traffic), may be used for prediction models in data mining techniques. The model assesses the FM-Traffic and channel conditions where time-series data is not available due to previous vessel data. Fig. 2 depicts the suggested structure for the marine traffic state prediction model, which is summerized as follows:</p>
        <list list-type="bullet">
          <list-item>
            <p>Step 1 – Summarizing dynamic data: This step conducts data pre-processing and labeling following the FM-Traffic, i.e., labels are in the set of (tag block times, lon, lat, SOG, COG, heading). As shown at the beginning of this section, the traffic conditions, including FM-Traffic, are already available in the historical vessel data. Concretely, the FM-Traffic can be calculated directly from velocity extracted from historical vessel data, or it could be the output of this data mining model (ref. Step 3);</p>
          </list-item>
          <list-item>
            <p>Step 2 – Proposing the MTPS model: As discussed, suitable mining data are named based on historical vessel data (i.e., the MF-Traffic data for the traffic conditions). The system becomes an experiment by applying deep learning algorithms;</p>
          </list-item>
          <list-item>
            <p>Step 3 - The DL algorithm proposal: The maritime traffic state prediction model proposed in Step 2 is applied to analyze the actual data to determine the label/FM-Traffic considering real-time data loss or discrete data loss.</p>
          </list-item>
        </list>
        <p>Upon obtaining the above-described generic structure (Fig. 1), we need to establish the most important data to efficiently train the model. The fact that the traffic in each channel differs and changes regularly is one of the problems here. For the spatial path, we divide the route network into channels based on the ENC, where each channel is short enough to take into account that the variance of traffic conditions at any location in a channel can be ignored. In terms of time, we divide the time into time frames based on which the collected data is integrated and analyzed. Following the data separation method mentioned above, this model is quite weightless and yet possible in practice. This basic format is simple enough that it can be collected and integrated with any device that uses VHF frequencies, as presented in our previous work [<xref alt="25" rid="r25">25</xref>].
				</p>
      </sec>
      <sec id="management-integration-system-integracijski-sustav-upravljanja">
        <title>3.2. Management integration system / <italic>Integracijski sustav upravljanja</italic>
				</title>
        <p>The management system consists of four main components, namely the API server, the application, the computing server, and the database server, as shown in Fig. 3 below:</p>
        <graphic mimetype="image" mime-subtype="png" xlink:href="image3.png"/>
        <p>
					Figure 3 Structure of the management system
				</p>
        <p>
          <italic>Slika 3. Struktura sustava upravljanja</italic>
        </p>
        <p><bold>API server:</bold> The core component of the system is the server, which processes user requests. The server is established in NodeJS – an open-source, cross-platform framework. When users request the application, the data is retrieved from the database, processed, and then sent back to the users. The request life cycle includes receiving and identifying user requests, validating data, and processing requests.
				</p>
        <p><bold>Computing server:</bold> The computing server processes the data submitted by users or the AIS. Hence, the computing server performs calculations to return the speed corresponding to the vessel’s navigation status on the application map. At the end of each cycle, the Computing Server will update the user's speed and reputation score. If for some routes there is no enough data to calculate the speed, the computing server will refer to other data sources from resource APIs to ensure that the vessel's navigational status is always fully displayed. Moreover, the directory structure of the computing server is almost identical to the directory structure of the API Server. The computing server only computes and stores data, while the API server defines the endpoint access points.
				</p>
        <p><bold>Database server:</bold> The database server has the task to store data from the AIS identifying information system and process and compute data on the system. As this is a real-time system with big data, the database must have the following features: easy access to vast information; the need for a geospatial database for the navigation system; and confidentiality to protect the vessel’s data.
				</p>
        <p><bold>Application:</bold> This application is expressed on an online platform that handles communication with users. The program allows users to view the status of vessels. Additionally, the application is responsible for determining the vessel's route and collecting data for communication with the API server.
				</p>
        <p>The system is architecturally constructed in a modular form with great flexibility, which enables scale growth with sensor stations (AIS, HMIS, etc.) and working positions (operation desk, training desk). At the same time, the system enables information-sharing interfaces with traffic management centers. Moreover, the system provides features suitable for each task defined based on the primary purpose of the user, including AIS subsystem, VHF, MIS, ENC, and Hydrometeorological data [<xref alt="24" rid="r24">24</xref>-
					<xref alt="25" rid="r25">25</xref>]. In conclusion, the general description of the system components demonstrates the relationship between the system utilization and each function, but in this study we focus on improving the application to support maritime safety.
				</p>
      </sec>
      <sec id="maritime-traffic-state-prediction-model-based-on-lstm-network-model-predviđanja-stanja-pomorskog-prometa-temeljen-na-lstm-mreži">
        <title>3.3. Maritime traffic state prediction model based on LSTM network / <italic>Model predviđanja stanja pomorskog prometa temeljen na LSTM mreži</italic>
				</title>
        <p>In the past ten years, concerns about maritime traffic safety and security have become evident due to the difficulties created by the increasing demand for additional vessels with greater capacity and velocity. To ensure the navigational safety, prevent collisions, and improve the effectiveness of vessel management, predicting the trajectory of vessels is essential. A relatively recent development for complex geographic applications is the addition of effective machine learning technologies to accurately predict trajectories. However, the complexity of the maritime environment and issues with data quality, particularly in the Vietnam Sea Port, which has a high density of vessels, hinder the reliable vessel trajectory predictions. On the other hand, with the system structure selected in Figure 3, the input data is processed and analyzed numerically, stored in Resource APIs, and then aggregated and filtered, with the data fields being separated. Subsequently, the 04 data fields (lat, lon, SOG, COG) selected for the prediction model are also the input data of the Maritime traffic state prediction model [<xref alt="25" rid="r25">25</xref>]. In addition, the MTSP model has not yet been implemented in any maritime management system in Vietnam, which motivates us to propose a solution based on the support of Deep Learning to provide the system with the following superior features. In this study, we suggest the MTSP model based on the LSTM network (LSTM is one of the deep learning algorithms as mentioned) to evaluate suitable paths for vessels along routes and experiments established on data collected from the AIS system through Resource APIs provided by Southern Vietnam Maritime Safety Corporation. The proposed model used for analyzing maritime traffic data has the following characteristics:
				</p>
        <list list-type="bullet">
          <list-item>
            <p>Highly accurate dynamic data analysis results due to direct processing in time-serial format with quick feature extraction;</p>
          </list-item>
          <list-item>
            <p>Standardized time-serial data sets with maritime traffic data collection systems facilitate the development of MTSP models;</p>
          </list-item>
          <list-item>
            <p>The LSTM algorithm has a 3-gate structure that enables the processing of multi-layered data feedback. This allows the algorithm to extract deeper data features than the normal RNN algorithm [<xref alt="26" rid="r26">26</xref>].
						</p>
          </list-item>
        </list>
        <p>The LSTM network sequentially computes the input vessel path data string <inline-formula><alternatives><tex-math><![CDATA[X_{l}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>X</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:math></alternatives></inline-formula> with the hidden vector <inline-formula><alternatives><tex-math><![CDATA[Η_{\mathcal{l}} \triangleq {\{ h_{t}\}}_{t = 1}^{\mathcal{l}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>Η</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub><mml:mo>≜</mml:mo><mml:msubsup><mml:mrow><mml:mo stretchy="false" form="prefix">{</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo stretchy="false" form="postfix">}</mml:mo></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msubsup></mml:mrow></mml:math></alternatives></inline-formula>, in which the memory cell corresponding to the input vector (at the current time step <inline-formula><alternatives><tex-math><![CDATA[x_{t}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></alternatives></inline-formula>) and the hidden state (at the previous time step <inline-formula><alternatives><tex-math><![CDATA[x_{t - 1}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>) update the hidden state inside <inline-formula><alternatives><tex-math><![CDATA[h_{t}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></alternatives></inline-formula> expressed by [<xref alt="20" rid="r20">20</xref>]
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[\begin{matrix}
    i_{t} = \sigma\left( U_{i}x_{t} + W_{i}h_{t - 1} + b_{i} \right) \\
    f_{t} = \sigma\left( U_{f}x_{t} + W_{f}h_{t - 1} + b_{f} \right) \\
    o_{t} = \sigma\left( U_{o}x_{t} + W_{o}h_{t - 1} + b_{o} \right) \\
    \end{matrix}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mtable><mml:mtr><mml:mtd columnalign="center"><mml:msub><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>σ</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>σ</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>f</mml:mi></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>f</mml:mi></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>f</mml:mi></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:msub><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>σ</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives></inline-formula>(4)
				</p>
        <p>where <inline-formula><alternatives><tex-math><![CDATA[\odot]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mo>⊙</mml:mo></mml:math></alternatives></inline-formula> represents the element product, <inline-formula><alternatives><tex-math><![CDATA[\sigma]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>σ</mml:mi></mml:math></alternatives></inline-formula> describes the sigmoid function, and <inline-formula><alternatives><tex-math><![CDATA[\tanh]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mo>tanh</mml:mo></mml:math></alternatives></inline-formula> is the hyperbolic tangent function. Besides, <inline-formula><alternatives><tex-math><![CDATA[i,\ f]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>f</mml:mi></mml:mrow></mml:math></alternatives></inline-formula> and <inline-formula><alternatives><tex-math><![CDATA[o]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>o</mml:mi></mml:math></alternatives></inline-formula> indicate the input gate, forget gate, and output gate, respectively. We get, <inline-formula><alternatives><tex-math><![CDATA[{\widetilde{c}}_{t}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mover><mml:mi>c</mml:mi><mml:mo accent="true">̃</mml:mo></mml:mover><mml:mi>t</mml:mi></mml:msub></mml:math></alternatives></inline-formula> and <inline-formula><alternatives><tex-math><![CDATA[c_{t}\text{\ ϵ\ }\mathbb{R}^{q}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mrow><mml:mtext mathvariant="normal"> ϵ </mml:mtext></mml:mrow><mml:msup><mml:mstyle mathvariant="double-struck"><mml:mi>ℝ</mml:mi></mml:mstyle><mml:mi>q</mml:mi></mml:msup></mml:mrow></mml:math></alternatives></inline-formula> express the cell input activation vector and cell state, defined as follows:
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[\begin{matrix}
    {\widetilde{c}}_{t} = tanh\left( U_{c}x_{t} + W_{c}h_{t - 1} + b_{c} \right) \\
    c_{t} = f_{t} \odot c_{t - 1} + i_{t} \odot {\widetilde{c}}_{t}\text{\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ } \\
    h_{t} = o_{t} \odot tanh\left( c_{t} \right),\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  \\
    \end{matrix}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mtable><mml:mtr><mml:mtd columnalign="center"><mml:msub><mml:mover><mml:mi>c</mml:mi><mml:mo accent="true">̃</mml:mo></mml:mover><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:msub><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>⊙</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>⊙</mml:mo><mml:msub><mml:mover><mml:mi>c</mml:mi><mml:mo accent="true">̃</mml:mo></mml:mover><mml:mi>t</mml:mi></mml:msub><mml:mrow/></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>⊙</mml:mo><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives></inline-formula>(5)
				</p>
        <p>The input weight matrices are represented by <inline-formula><alternatives><tex-math><![CDATA[W_{s}(W_{i},W_{f},W_{o},U_{c})\ ]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>f</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula>and <inline-formula><alternatives><tex-math><![CDATA[U_{s}(W_{i},W_{f},W_{o},W_{c})]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>f</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula>, with <inline-formula><alternatives><tex-math><![CDATA[b_{s}(b_{i},b_{f},b_{o},b_{c})]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>f</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> being the bias terms. The weight matrix subscript indicates the input-output connection. <inline-formula><alternatives><tex-math><![CDATA[W_{f}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>W</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:math></alternatives></inline-formula> is the implicit forgetting gate matrix, and <inline-formula><alternatives><tex-math><![CDATA[U_{f}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>U</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:math></alternatives></inline-formula> is the input-forgetting matrix. The encoder codes the vessel's kinematic state sequence <inline-formula><alternatives><tex-math><![CDATA[X_{\mathcal{l}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>X</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub></mml:math></alternatives></inline-formula> one state at a time into a hidden state sequence. We employ an encoder-decoder architecture to solve the prediction problem of mapping one data sequence to another, specifically defining the mapping function <inline-formula><alternatives><tex-math><![CDATA[F_{\mathcal{l,}h}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi><mml:mo>,</mml:mo></mml:mstyle><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The initial encoding function <inline-formula><alternatives><tex-math><![CDATA[E]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>E</mml:mi></mml:math></alternatives></inline-formula> is represented by [<xref alt="20" rid="r20">20</xref>]
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[H_{\mathcal{l}} = E\left( X_{\mathcal{l}};\theta_{E} \right)]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub><mml:mo>;</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mi>E</mml:mi></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:math></alternatives></inline-formula>(6)
				</p>
        <p>where <inline-formula><alternatives><tex-math><![CDATA[H_{\mathcal{l}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>H</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub></mml:math></alternatives></inline-formula> is the neural network parametrized by <inline-formula><alternatives><tex-math><![CDATA[\theta_{E}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>θ</mml:mi><mml:mi>E</mml:mi></mml:msub></mml:math></alternatives></inline-formula> that maps input sequence <inline-formula><alternatives><tex-math><![CDATA[X_{\mathcal{l}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>X</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub></mml:math></alternatives></inline-formula> to an internal representation data sequence <inline-formula><alternatives><tex-math><![CDATA[H_{\mathcal{l}} = \left\{ h_{t} \right\}_{t = 1}^{\mathcal{l}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo stretchy="true" form="prefix">{</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo stretchy="true" form="postfix">}</mml:mo></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msubsup></mml:mrow></mml:math></alternatives></inline-formula>. Each hidden state <inline-formula><alternatives><tex-math><![CDATA[h_{t} \in R^{2q}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>q</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></alternatives></inline-formula> combines bidirectional recurrent neural network (RNN) with a state of size <inline-formula><alternatives><tex-math><![CDATA[q]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>q</mml:mi></mml:math></alternatives></inline-formula>.
				</p>
        <p>The encoder layer computes the <inline-formula><alternatives><tex-math><![CDATA[H_{\mathcal{l}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>H</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub></mml:math></alternatives></inline-formula> representation of the input sequence, which created the context representation by the aggregation function. The decoder repeatedly uses this context representation to generate the output prediction. We use the average pooling over time (AVG) to reduce the sequence <inline-formula><alternatives><tex-math><![CDATA[H_{\mathcal{l}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>H</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub></mml:math></alternatives></inline-formula> to a single context vector as
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[z = col\left( z_{r} \right) \in \mathbb{R}^{2q}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>z</mml:mi><mml:mo>=</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>∈</mml:mo><mml:msup><mml:mstyle mathvariant="double-struck"><mml:mi>ℝ</mml:mi></mml:mstyle><mml:mrow><mml:mn>2</mml:mn><mml:mi>q</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></alternatives></inline-formula>, <inline-formula><alternatives><tex-math><![CDATA[r = 1,\ldots,2q]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>…</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mi>q</mml:mi></mml:mrow></mml:math></alternatives></inline-formula>(7)
				</p>
        <p>for computing the mean value of each hidden unit. Each context feature <inline-formula><alternatives><tex-math><![CDATA[z_{r}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:math></alternatives></inline-formula> is defined as
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[z_{r} = \frac{1}{\mathcal{l}}\sum_{t = 1}^{\mathcal{l}}{{{(H}_{\mathcal{l}})}_{r,t},}\ t\epsilon\{ 1,\ldots,\mathcal{l\}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:mfrac><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msubsup><mml:mrow><mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>H</mml:mi></mml:mrow><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mrow><mml:mi>t</mml:mi><mml:mi>ϵ</mml:mi><mml:mo stretchy="false" form="prefix">{</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>…</mml:mi><mml:mo>,</mml:mo><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi><mml:mo stretchy="false" form="postfix">}</mml:mo></mml:mstyle></mml:mrow></mml:math></alternatives></inline-formula>(8)
				</p>
        <p>The symbol <inline-formula><alternatives><tex-math><![CDATA[\theta_{D}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>θ</mml:mi><mml:mi>D</mml:mi></mml:msub></mml:math></alternatives></inline-formula> represents the parameterization of the autoregressive decoder function <inline-formula><alternatives><tex-math><![CDATA[D]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>D</mml:mi></mml:math></alternatives></inline-formula> to predict the future vessel path <inline-formula><alternatives><tex-math><![CDATA[{\widehat{y}}_{j}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mover><mml:mi>y</mml:mi><mml:mo accent="true">̂</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub></mml:math></alternatives></inline-formula> at each period <inline-formula><alternatives><tex-math><![CDATA[j]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>j</mml:mi></mml:math></alternatives></inline-formula> with the previous state <inline-formula><alternatives><tex-math><![CDATA[{\widehat{y}}_{j - 1}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mover><mml:mi>y</mml:mi><mml:mo accent="true">̂</mml:mo></mml:mover><mml:mrow><mml:mi>j</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> as follows [<xref alt="21" rid="r21">21</xref>]:
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[{\widehat{y}}_{j} = D\left( {\widehat{y}}_{j - 1},u_{j},z_{j},\psi,\theta_{D} \right)]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mover><mml:mi>y</mml:mi><mml:mo accent="true">̂</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>D</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mover><mml:mi>y</mml:mi><mml:mo accent="true">̂</mml:mo></mml:mover><mml:mrow><mml:mi>j</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>ψ</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mi>D</mml:mi></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:math></alternatives></inline-formula>(9)
				</p>
        <p>where <inline-formula><alternatives><tex-math><![CDATA[u_{j}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>u</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></alternatives></inline-formula> denotes the RNN hidden state with <inline-formula><alternatives><tex-math><![CDATA[\psi]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>ψ</mml:mi></mml:math></alternatives></inline-formula> being the planning descriptor and <inline-formula><alternatives><tex-math><![CDATA[z_{j}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></alternatives></inline-formula> being the context vector. Finally, the output prediction response <inline-formula><alternatives><tex-math><![CDATA[{\widehat{Y}}_{h}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mover><mml:mi>Y</mml:mi><mml:mo accent="true">̂</mml:mo></mml:mover><mml:mi>h</mml:mi></mml:msub></mml:math></alternatives></inline-formula> of length <inline-formula><alternatives><tex-math><![CDATA[h]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>h</mml:mi></mml:math></alternatives></inline-formula> is given by
				</p>
        <p><inline-formula><alternatives><tex-math><![CDATA[{\widehat{Y}}_{h} = F_{\mathcal{l,}h}\left( X_{\mathcal{l}},\ \psi \right),]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:msub><mml:mover><mml:mi>Y</mml:mi><mml:mo accent="true">̂</mml:mo></mml:mover><mml:mi>h</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi><mml:mo>,</mml:mo></mml:mstyle><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mstyle mathvariant="script"><mml:mi>𝓁</mml:mi></mml:mstyle></mml:msub><mml:mo>,</mml:mo><mml:mi>ψ</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> (10)
				</p>
        <p>To evaluate the quality of the prediction model response, the authors employ the root-mean-square-error (RMSE) [<xref alt="22" rid="r22">22</xref>-
					<xref alt="23" rid="r23">23</xref>] method to estimate the average error value of the squares between the predicted path <inline-formula><alternatives><tex-math><![CDATA[\widehat{Y_{h}}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mover><mml:msub><mml:mi>Y</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo accent="true">̂</mml:mo></mml:mover></mml:math></alternatives></inline-formula> and the actual path <inline-formula><alternatives><tex-math><![CDATA[Y_{i}]]></tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></alternatives></inline-formula>, which is defined as
				</p>
        <p>
          <inline-formula>
            <alternatives>
              <tex-math><![CDATA[RMSE = \sqrt{\frac{1}{n}\sum_{i = 1}^{n}{(Y_{i} - \widehat{Y_{h}})^{2}}}]]></tex-math>
              <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline">
                <mml:mrow>
                  <mml:mi>R</mml:mi>
                  <mml:mi>M</mml:mi>
                  <mml:mi>S</mml:mi>
                  <mml:mi>E</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:msqrt>
                    <mml:mrow>
                      <mml:mfrac>
                        <mml:mn>1</mml:mn>
                        <mml:mi>n</mml:mi>
                      </mml:mfrac>
                      <mml:msubsup>
                        <mml:mo>∑</mml:mo>
                        <mml:mrow>
                          <mml:mi>i</mml:mi>
                          <mml:mo>=</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                        <mml:mi>n</mml:mi>
                      </mml:msubsup>
                      <mml:mrow>
                        <mml:mo stretchy="false" form="prefix">(</mml:mo>
                        <mml:msub>
                          <mml:mi>Y</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                        <mml:mo>−</mml:mo>
                        <mml:mover>
                          <mml:msub>
                            <mml:mi>Y</mml:mi>
                            <mml:mi>h</mml:mi>
                          </mml:msub>
                          <mml:mo accent="true">̂</mml:mo>
                        </mml:mover>
                        <mml:msup>
                          <mml:mo stretchy="false" form="postfix">)</mml:mo>
                          <mml:mn>2</mml:mn>
                        </mml:msup>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msqrt>
                </mml:mrow>
              </mml:math>
            </alternatives>
          </inline-formula>
          <italic>(11)</italic>
        </p>
        <p>LSTMs initially tried to replicate human decision-making by utilizing machines to process large quantities of data. Advanced LSTM systems introduce autonomous vessels, which can operate independently without human intervention and have a lower mistake rate than human-operated vessels. Deep learning is gradually altering the maritime industry's traditional operational processes, especially in mining maritime traffic from vessel data as mentioned in this paper.</p>
      </sec>
    </sec>
    <sec id="results-and-evaluations-rezultati-i-procjene">
      <title>4. RESULTS AND EVALUATIONS / <italic>Rezultati i procjene</italic>
			</title>
      <sec id="lstm-network-lstm-mreža">
        <title>4.1. LSTM network / <italic>LSTM mreža</italic>
				</title>
        <graphic mimetype="image" mime-subtype="png" xlink:href="image5.png"/>
        <p>
					Figure 4 MTSP model based on LSTM network
				</p>
        <p>
          <italic>
						Slika 4. MTSP model temeljen na LSTM mreži
					</italic>
        </p>
        <p>In this work, we use an encoder-decoder architecture to implement an input-output mapping function to predict future pathways. Based on a sequence of monitored states and past data describing the relative path of the vessel, the LSTM neural network architecture consists of three main phases: encoder, aggregation function, and decoder illustrated in the vessel path prediction in Fig.4. Therefore, to predict the safe path of a vessel in the selected case study, we built the proposed MTSP model based on the LSTM network, which includes the following steps:</p>
        <list list-type="bullet">
          <list-item>
            <p>Step 1: Synthesizing decoded AIS data in the standard format *.CSV;</p>
          </list-item>
          <list-item>
            <p>Step 2: The preprocessing of the dataset removes error components during collection and arranges data over time;</p>
          </list-item>
          <list-item>
            <p>Step 3: Implementing visualization of the initial dataset to verify the characteristics of maritime vehicle paths;</p>
          </list-item>
          <list-item>
            <p>Step 4: Setting the dataset into a training and a validation set in a ratio of 8:2 using values in Table 1;</p>
          </list-item>
          <list-item>
            <p>Step 5: Standardizing and extracting features of the data set, starting with equation (1);</p>
          </list-item>
          <list-item>
            <p>Step 6: Training the prediction model by applying the LSTM algorithm for 50 epochs and evaluating the model's response using the optimal function (11);</p>
          </list-item>
          <list-item>
            <p>Step 7: Testing the MTSP model (Fig. 4) using historical data extracted from the VungTau seaport of the Southern Vietnam.</p>
          </list-item>
        </list>
        <p>This study employed the LSTM network to develop the path prediction model, executed in Python 3.6. The activity results are shown in Fig. 5, the setting up for 50 epochs training using a learning rate of 0.0005.</p>
        <graphic mimetype="image" mime-subtype="png" xlink:href="image6.png"/>
        <p>
					Figure 5 The regression and loss of LSTM network training process
					</p>
        <p>
          <italic>
						Slika 5. Regresija i gubitak procesa testiranja LSTM mreže
					</italic>
        </p>
      </sec>
      <sec id="case-study-experimental-results-eksperimentalni-rezultati-studije-slučaja">
        <title>4.2. Case study experimental results / <italic>Eksperimentalni rezultati studije slučaja</italic>
				</title>
        <p>The optimal values including regression value attained 0.001075 in training, and the loss value reaches 0.0000039103. Besides, a set of historical vessel data from the AIS system is used as input data for the training prediction model to provide a safety path, as shown in Fig. 6. Thus, Fig. 6a illustrates the route taken by a vessel while departing from the wharf and moving towards the sea with the MMSI code 636018224 (indicated by the light-red line). Similarly, the blue line in the figure shows the path followed by the vessel while arriving from the sea to the wharf with the MMSI code 574999621. Finally, the dataset for the same type of vessel visualizing the maritime traffic conditions in VungTau port is indicated in Fig. 6b with vessels Type-1 (on the left side) and Type-3 (on the right side). Finally, the case study experimental results are shown in detail in Fig. 7, the predicted path of the vessel (red line) tracking follows the historical path (blue line) of this vessel.</p>
        <graphic mimetype="image" mime-subtype="jpeg" xlink:href="image7.jpeg"/>
        <graphic mimetype="image" mime-subtype="jpeg" xlink:href="image8.jpeg"/>
        <p>a) The visualization samples of the historical vessel path visited (blue line) – exit (red line) from Vungtau Port ( based on AIS Data in 2019) / <italic>Uzorci vizualizacije povijesne putanje plovila (plava linija) – izlaz (crvena linija) luke Vungtau (na temelju AIS podataka 2019.)</italic>
					</p>
        <graphic mimetype="image" mime-subtype="jpeg" xlink:href="image9.jpeg"/>
        <graphic mimetype="image" mime-subtype="jpeg" xlink:href="image10.jpeg"/>
        <p>b) The visualizing sample sets of historical AIS data from vessels / <italic>Vizualizacija skupova uzoraka povijesnih AIS podataka s plovila</italic>
				</p>
        <p>
						Figure 6 Input data for the creation of a model to predict the path of a vessel in Vietnam's southern sea region
					</p>
        <p>
          <italic>Slika 6. Ulazni podaci za izradu modela za predviđanje putanje plovila u južnom morskom području Vijetnama</italic>
        </p>
        <p>The proposed model was tested for the cargo vessel traveling channel coming at VIETSOVPETRO wharf, where there is a complicated traffic situation with many vessel types. Based on historical data (blue line) of the same type moving along the channel, the LSTM prediction model extracts a safe path (red line) for the vessel to move in case of docking at the wharf. The case study experimental results are shown in detail in Fig. 7.</p>
        <graphic mimetype="image" mime-subtype="png" xlink:href="image11.png"/>
        <p>
					Figure 7 Predicted vessel path for arrival at VIETSOVPETRO wharfs in southern Vietnam
				</p>
        <p>
          <italic>
					Slika 7. Predviđena putanja plovila za dolazak na VIETSOVPETRO pristanište u južnom Vijetnamu
					</italic>
        </p>
      </sec>
      <sec id="evaluations-procjene">
        <title>4.3. Evaluations / <italic>Procjene</italic>
				</title>
        <p>In general, the system displays marine traffic data calculation and updating and indicates adequate reaction times with initial operation at Vungtau Port, Vietnam. Tests were carried out on using the proposed model from the collected and distributed traffic data as well as obtaining traffic information from the AIS system. The results (Figure 6 and Figure 7) outline the management integration system, which, once implemented, will enhance the operational efficiency of the region's specialist maritime management. The system serves the common benefit of the community and guarantees national security and defense in terms of financial efficiency. Therefore, determining its effectiveness is difficult. However, from a socioeconomic standpoint, the initiative has the following consequences: </p>
        <list list-type="bullet">
          <list-item>
            <p>Support for Maritime management system includes monitoring navigation in narrow channel locations, anchorage positions, berthing, and leaving the wharf; </p>
          </list-item>
          <list-item>
            <p>Support for maritime activity monitoring and management, tracking vessel position, the direction of movement, and speed of vessels.</p>
          </list-item>
        </list>
        <p>In the future, the model can develop new application features in ensuring maritime safety by predicting the possibility of collision, predicting the risk of running aground, determining the closest point of approach, monitoring cargo anchorage locations, monitoring and indicating current vessel status to reduce risks to vessel, property, and people, as well as environmental pollution hazards. The advanced and modern technologies in state management methods can be used to increase the attractiveness and competitiveness of the seaport system. In addition, it actively contributes to the gradual perfection of specialized management in the maritime sector through international conventions to which Vietnam is a signatory. To this end, the concerns highlighted in Remark 1 have been addressed and the issues thus resolved.</p>
      </sec>
    </sec>
    <sec id="conclusion-zaključak">
      <title>5. CONCLUSION / <italic>Zaključak</italic>
			</title>
      <p>This paper presents several algorithms, including Decision Tree, Naive Bayes, Random Forest, and selected LSTM to specify which model is most appropriate. We determine a new approach to predict vessel traffic conditions in navigational channels based on historical data from the AIS identification information system. We provided a framework for efficient collection, integration, and analysis of maritime traffic-related data to provide an accurate and timely status estimation. In addition, the problem of lack of data in some areas of the navigation channel is still one of the major challenges, and solving it by data mining method based on collected historical data is the solution. The recommended deep neural network algorithm can easily be integrated into a program that runs on a computer or web application to facilitate the mining of historical vessel data for marine traffic and is ready to be used through the application. In conclusion, synchronizing and improving maritime traffic is an issue that needs to be addressed, and this is a potential research direction for the study in the future.</p>
      <p><bold>Author Contributions:</bold> Xuan-Kien Dang: Conceptualization, Methodology, writing – review and editing; Tuan-Anh Pham: Data curation, formal analysis, numerical data calculation; Žarko Koboević: Review and editing; Viet-Dung Do: Data curation and computing, writing - original draft preparation. Thi-Duyen Anh Pham: Review and English editing.
			</p>
      <p><bold>Conflict of interest:</bold> The authors state that there is no conflict of interest.
			</p>
      <p><bold>Acknowledgement:</bold> The authors would like to thank the Artificial Intelligent Transportation LAB, the Ho Chi Minh City University of Transport and Maritime Department, University of Dubrovnik, Croatia for providing facilities and scientific and technical support.
			</p>
    </sec>
    <sec id="references-literatura">
      <title>REFERENCES / <italic>Literatura</italic>
			</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="r1">
        <label>1</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Dang, X. K., Tran, T. D., Tran, M. H., &amp; Pham, T. D. A.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2022</year>
          </date>
          <article-title>Inland Waterway Transport in Vietnam: Strategies to Improve Transportation Efficiency during COVID-19 Pandemic.</article-title>
          <source>IOP Conference Series. Earth and Environmental Science</source>
          <volume>1072</volume>
          <fpage>12006</fpage>
          <lpage>12012</lpage>
          <ext-link>https://doi.org/10.1088/1755-1315/1072/1/012006</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r2">
        <label>2</label>
        <mixed-citation publication-type="web">
          <source>The International Maritime Organization.</source>
          <date date-type="pub">
            <year>2022</year>
          </date>
          <source>AIS Transponders.</source>
          <comment>Retrieved from</comment>
          <ext-link>http://www.imo.org/en/OurWork/Safety/Navigation/Pages/AIS.aspx</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r3">
        <label>3</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Gudevada, V., Apon, A., &amp; Ding, J.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2017</year>
          </date>
          <article-title>Data Quality Considerations for Big Data and Machine Learning: Going Beyond Data Cleaning and Transformations.</article-title>
          <source>International Journal on Advances in Software</source>
          <volume>10</volume>
          <issue>1</issue>
          <fpage>1</fpage>
          <lpage>20</lpage>
        </mixed-citation>
      </ref>
      <ref id="r4">
        <label>4</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Liu, D., Rong, H., &amp; Guedes Soares, C.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2023</year>
          </date>
          <article-title>Shipping route modelling of AIS maritime traffic data at the approach to ports.</article-title>
          <source>Ocean Engineering</source>
          <volume>289</volume>
          <fpage>115868</fpage>
          <ext-link>https://doi.org/10.1016/j.oceaneng.2023.115868</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r5">
        <label>5</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Wang, X., &amp; Wang, W.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2024</year>
          </date>
          <article-title>Study on the maritime trade pattern and freight index in the post-epidemic era: Evidence based on dry bulk market Auto-matic Identification System (AIS) data.</article-title>
          <source>The Asian Journal of Shipping and Logistics</source>
          <volume>40</volume>
          <issue>1</issue>
          <fpage>1</fpage>
          <lpage>10</lpage>
          <ext-link>https://doi.org/10.1016/j.ajsl.2023.09.002</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r6">
        <label>6</label>
        <mixed-citation publication-type="chapter">
          <person-group>
            <string-name>Falcon, R., Abielmona, R., &amp; Blasch, E.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2014</year>
          </date>
          <chapter-title>Behavioral Learning of Vessel Types with Fuzzy Rough Decision Trees.</chapter-title>
          <source>FUSION 2014 – 17th International Conference on Information Fusion</source>
          <publisher-loc>Salamanca, Spain,</publisher-loc>
          <fpage>1</fpage>
          <lpage>8</lpage>
        </mixed-citation>
      </ref>
      <ref id="r7">
        <label>7</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Mascaro, S., Korb, K., &amp; Nicholson A.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2010</year>
          </date>
          <article-title>Learning Abnormal Vessel Behaviour from AIS Data with Bayesian Networks at Two Time Scales.</article-title>
          <source>Tracks a Journal of Artists Writings</source>
          <fpage>1</fpage>
          <lpage>34</lpage>
          <ext-link>https://doi.org/10.1016/j.ijar.2013.03.012</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r8">
        <label>8</label>
        <mixed-citation publication-type="chapter">
          <person-group>
            <string-name>Evgeniou, T., &amp; Pontil, M.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2001</year>
          </date>
          <chapter-title>Support Vector Machines: Theory and Applications.</chapter-title>
          <source>Conference: Machine Learning and Its Applications, Advanced Lectures</source>
          <date date-type="pub">
            <year>2049</year>
          </date>
          <fpage>249</fpage>
          <lpage>257</lpage>
          <ext-link>https://doi.org/ 10.1007/3-540-44673-7_12</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r9">
        <label>9</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Guyon, I., Weston, J., Barnhill, S., &amp; Vapnik, V.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2002</year>
          </date>
          <article-title>Gene selection for cancer classification using Support Vector Machines.</article-title>
          <source>Machine Learning</source>
          <volume>4613</volume>
          <fpage>389</fpage>
          <lpage>422</lpage>
          <ext-link>https://doi.org/10.1023/A:1012487302797</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r10">
        <label>10</label>
        <mixed-citation publication-type="chapter">
          <person-group>
            <string-name>Senthil, D., &amp; Suseendran, G.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2020</year>
          </date>
          <chapter-title>Sequence Mining-Based Support Vector Machine with Decision Tree Approach for Efficient Time Series Data Classification.</chapter-title>
          <source>Advances in Intelligent Systems and Computing,1016</source>
          <fpage>3</fpage>
          <lpage>17</lpage>
          <ext-link>https://doi.org/10.1007/978-981-13-9364-8_1</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r11">
        <label>11</label>
        <mixed-citation publication-type="book">
          <person-group>
            <string-name>Chih, W. H., Chih, C C., &amp; Chih, J. L.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2003</year>
          </date>
          <source>A Practical Guide to Support Vector Classification.</source>
          <publisher-name>Department of Computer Science National Taiwan University.</publisher-name>
          <publisher-loc>Taiwan.</publisher-loc>
        </mixed-citation>
      </ref>
      <ref id="r12">
        <label>12</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Nembrini, S., König, I. R., &amp; Wright, M. N.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2018</year>
          </date>
          <article-title>The revival of the Gini importance?.</article-title>
          <source>Bioinformatics</source>
          <volume>34</volume>
          <issue>21</issue>
          <fpage>3711</fpage>
          <lpage>3718</lpage>
          <ext-link>https://doi.org/10.1093/bioinformatics/bty373</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r13">
        <label>13</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Rong, H., Teixeira, A. P., &amp; Guedes Soares, C.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2019</year>
          </date>
          <article-title>Ship trajectory uncertainty prediction based on a Gaussian Process model.</article-title>
          <source>Ocean Engineering</source>
          <volume>182</volume>
          <fpage>499</fpage>
          <lpage>511</lpage>
          <ext-link>https://doi.org/10.1016/j.oceaneng.2019.04.024</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r14">
        <label>14</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>D. Nguyen, &amp; Fablet, R.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2024</year>
          </date>
          <article-title>A Transformer Network With Sparse Augmented Data Representation and Cross Entropy Loss for AIS-Based Vessel Trajectory Prediction.</article-title>
          <source>IEEE Access</source>
          <volume>12</volume>
          <fpage>21596</fpage>
          <lpage>21609</lpage>
          <ext-link>https://doi.org/10.1109/ACCESS.2024.3349957</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r15">
        <label>15</label>
        <mixed-citation publication-type="chapter">
          <person-group>
            <string-name>Bao, K., Shang, D., Wang, R., &amp; Ma, R.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2020</year>
          </date>
          <chapter-title>AIS big data framework for maritime safety supervision.</chapter-title>
          <source>Proceedings – 2020 International Conference on Robots and Intelligent Systems, ICRIS</source>
          <date date-type="pub">
            <year>2020</year>
          </date>
          <fpage>150</fpage>
          <lpage>153</lpage>
          <ext-link>https://doi.org/10.1109/ICRIS52159.2020.00045</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r16">
        <label>16</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Wang, S., Li, Y., &amp; Xing, H.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2023</year>
          </date>
          <article-title>A novel method for ship trajectory prediction in complex scenarios based on spatio-temporal features extraction of AIS data.</article-title>
          <source>Ocean Engineering</source>
          <volume>281</volume>
          <fpage>114846</fpage>
          <ext-link>https://doi.org/10.1016/j.oceaneng.2023.114846</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r17">
        <label>17</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Pedrielli, G., Xing, Y., Peh, J. H., Koh, K. W., &amp; Ng, S. H.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2020</year>
          </date>
          <article-title>A real time simulation optimization framework for vessel collision avoidance and the case of singapore strait.</article-title>
          <source>IEEE Transactions on Intelligent Transportation Systems</source>
          <volume>21</volume>
          <issue>3</issue>
          <fpage>1204</fpage>
          <lpage>1215</lpage>
          <ext-link>https://doi.org/10.1109/TITS.2019.2903824</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r18">
        <label>18</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Shi, W., Hu, L., Lin, Z., Zhang, L., Wu, J., &amp; Chai, W.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2023</year>
          </date>
          <article-title>Short-term motion prediction of floating offshore wind turbine based on muti-input LSTM neural network.</article-title>
          <source>Ocean Engineering</source>
          <volume>280</volume>
          <ext-link>https://doi.org/10.1016/j.oceaneng.2023.114558</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r19">
        <label>19</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Doğan, E.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2021</year>
          </date>
          <article-title>LSTM training set analysis and clustering model development for short-term traffic flow prediction.</article-title>
          <source>Neural Computing and Applications</source>
          <volume>33</volume>
          <issue>17</issue>
          <fpage>11175</fpage>
          <lpage>11188</lpage>
          <ext-link>https://doi.org/10.1007/s00521-020-05564-5</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r20">
        <label>20</label>
        <mixed-citation publication-type="chapter">
          <person-group>
            <string-name>Park, S. H., Kim, B., Kang, C. M., Chung, C. C., &amp; Choi, J. W.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2018</year>
          </date>
          <chapter-title>Sequence-to-Sequence Prediction of Vehicle Trajectory via LSTM Encoder-Decoder Architecture.</chapter-title>
          <source>2018 IEEE Intelligent Vehicles Symposium (IV).</source>
          <ext-link>https://doi.org/10.1109/IVS.2018.8500658</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r21">
        <label>21</label>
        <mixed-citation publication-type="chapter">
          <person-group>
            <string-name>Cho, K., Van Merriënboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., &amp; Bengio, Y.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2014</year>
          </date>
          <chapter-title>Learning phrase representations using RNN encoder-decoder for statistical machine translation.</chapter-title>
          <source>EMNLP 2014 – 2014 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference.</source>
          <fpage>1724</fpage>
          <lpage>1734</lpage>
          <ext-link>https://doi.org/10.3115/v1/d14-117</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r22">
        <label>22</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Panchal, F. S., &amp; Panchal, M.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2014</year>
          </date>
          <article-title>Review on Methods of Selecting Number of Hidden Nodes in Artificial Neural Network.</article-title>
          <source>International Journal of Computer Science and Mobile Computing</source>
          <volume>3</volume>
          <issue>11</issue>
          <fpage>455</fpage>
          <lpage>464</lpage>
        </mixed-citation>
      </ref>
      <ref id="r23">
        <label>23</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Wen, X., &amp; Li, W.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2023</year>
          </date>
          <article-title>Time Series Prediction Based on LSTM-Attention-LSTM Model.</article-title>
          <source>IEEE Access</source>
          <volume>11</volume>
          <fpage>48322</fpage>
          <lpage>48331</lpage>
          <ext-link>https://doi.org/10.1109/ACCESS.2023.3276628</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r24">
        <label>24</label>
        <mixed-citation publication-type="chapter">
          <person-group>
            <string-name>Le, V. T., Dang, X. K., Nguyen, D. H., Pham, T. D. A.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2020</year>
          </date>
          <chapter-title>A Novel Maritime Risk Assessment Model of Waterway Transportation Based on Takagi-Sugeno Fuzzy Logic: Vietnam Case Study.</chapter-title>
          <source>IOP Conference Series: Earth and Environmental Science</source>
          <fpage>1</fpage>
          <lpage>8</lpage>
          <ext-link>https://doi.org/10.1088/1755-1315/527/1/012001</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r25">
        <label>25</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Pham, T. A., Dang, X. K., &amp; Vo, N. S.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2022</year>
          </date>
          <article-title>Optimising Maritime Big Data by K-means Clustering with Mapreduce Model.</article-title>
          <source>Industrial Networks and Intelligent Systems. INISCOM</source>
          <date date-type="pub">
            <year>2022</year>
          </date>
          <fpage>136</fpage>
          <lpage>151</lpage>
          <ext-link>https://doi.org/10.1007/978-3-031-08878-0_10</ext-link>
        </mixed-citation>
      </ref>
      <ref id="r26">
        <label>26</label>
        <mixed-citation publication-type="journal">
          <person-group>
            <string-name>Li, H. H., Jiao, H., &amp; Yang, Z. L.</string-name>
          </person-group>
          <date date-type="pub">
            <year>2023</year>
          </date>
          <article-title>Ship trajectory prediction based on machine learning and deep learning: A systematic review and methods analysis.</article-title>
          <source>Engineering Applications of Artificial Intelligence</source>
          <volume>126107062</volume>
          <issue>107062</issue>
          <fpage>1</fpage>
          <lpage>21</lpage>
          <ext-link>https://doi.org/10.1016/j.engappai.2023.107062</ext-link>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>
