# Intelligent Ship Scheduling and Path Planning Method for Maritime Emergency Rescue
## 5 Conclusions  
Aimed at the practical application scenario of an emergency rescue center receiving rescue messages and dispatching emergency rescue vessels to the incident area for rescue, this paper proposes an intelligent ship scheduling and path planning method for the whole process of maritime emergency rescue operation. The work of this paper is summarized below:  
* For the task planning stage in the process of maritime emergency rescue, through the improved A* algorithm, taking the longitude and latitude coordinates of the observation area as inputs and considering the ship's own performance, current status, and external environmental constraints, the large-scale navigation route of the search and rescue vessels is planned in advance to meet the needs of the search and rescue vessels to allow them to rush to the incident area quickly and safely. The experimental results show that the proposed algorithm can generate large-scale measurement action  
\begin{table}
\begin{tabular}{c c c} \hline \hline
**Algorithm** & **Path Length/Nautical Mails** & **Number of Turns/Times** & **Average Turn Angle/(\({}^{\circ}\))** \\ \hline Regular A* algorithm & 35.4 & 6 & 30.7 \\ Algorithm of this article & 29.6 & 4 & 29.3 \\ \hline \hline \end{tabular}
\end{table}
Table 4: Experimental results of conventional A * algorithm and algorithm proposed in this paper.  
\begin{table}
\begin{tabular}{c c c} \hline \hline
**Algorithm** & **Path Length/Nautical Mails** & **Area Coverage/\%** \\ \hline Differential evolution algorithm & 47.8 & 82.1 \\ Algorithm of this article & 43.2 & 93.4 \\ \hline \hline \end{tabular}
\end{table}
Table 5: Experimental results of differential evolution algorithm and algorithm proposed in this paper.  
plans that meet the task requirements. Compared with the traditional A* algorithm, the proposed algorithm can reduce the sailing distance and turning frequency and improve the navigation efficiency and safety.
* For the regional search and rescue stage in the process of maritime emergency rescue, the full coverage path planning algorithm is used to plan the search route with the goal of reaching the full coverage of the search area as soon as possible. By updating the route and Angle of the ship's navigation in real time, the needs of the search and rescue vessels, which need to search the incident area efficiently and without going missing, are met. The experimental results show that compared with the differential evolution algorithm, the proposed algorithm has shorter path plans and greater regional coverage, which provides obvious advantages in terms of path planning efficiency.  
In summary, intelligent ship scheduling and path planning for maritime emergency rescue tasks is an effective method which is helpful for improving the efficiency and safety of ships in maritime search and rescue activities. Future research could further optimize and improve this method to ensure it can adapt to more complex maritime environments and mission requirements and provide more intelligent and efficient solutions for the planning of maritime emergency rescue missions.  
Conceptualization, W.Y. and Z.W.; methodology, W.Y. and H.L.; software, W.Y. and S.D.; resources, W.Y.; data curation, M.Z.; writing--original draft preparation, W.Y.; writing--review and editing, Z.W.; supervision, H.L. All authors have read and agreed to the published version of the manuscript.  
This research received no external funding.  
The research data is currently unavailable due to privacy or ethical restrictions.  
The authors declare no conflict of interest.