Abstract
This paper proposes a method to enables the generation of short-length routes with consideration of obstacle avoidance and significantly reduces the computation time compared to existing research for ocean route optimization. The reduced computation time allows recalculation of routes for autonomous vessel underway. By simulating the recalculation of four cases of the vessel underway that may require recalculation, this paper demonstrates that the proposed method can generate new and superior routes for the vessel that needs to change their routes due to certain factors.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
Since n = 20 can be implemented in the model based on the model on n = 50, n = 20 was not trained in this paper.
References
Aslam S, Michaelides MP, Herodotou H (2020) Internet of ships: a survey on architectures, emerging applications, and challenges. IEEE Internet Things J 7(10):9714–9727
Nihei Y, Nakada S, Hara N, Harada K, Saga R (2018) Quad-maran autonomous vessels and its application to oyster farms. In: Proceedings of the 61th Japan Joint automatic control conference, pp 83–89
Saga R, Liang Z, Hara N, Nihei Y (2020) Optimal route search based on multi-objective genetic algorithm for maritime navigation vessels. LNCS 12185:506–518
Kozono R, Tsurumi Y, Nihei Y, Saga R (2021) Information management system for small automatic navigation robot ships. LNCS 12766:419–428
Deb K, Agrawal S, Pratab A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II, Proc. of International conference on parallel problem solving from Nature, pp 849–858
Diya QZ, Habibollah H, Adnan MA (2017) Combination of k-means clustering with genetic algorithm: a review. Int J Appl Eng Res 12(24):14238–14245
Tsurumi Y, Saga R, Srinivasamurthy S, Nihei Y (2021) An improved optimized route selection method for a maritime navigation vessel. LNCS 12766:468–481
Tsurumi Y, Mingyao Ji R, Saga YN (2023) A research on the optimum patrol route for quad-maran automated vessel. J Jpn Soc Naval Archit Ocean Eng 37:57–67
Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. Adv Neural Inf Process Syst 2015:2692–2700
Sutskever I, Vinyals O, Le QV (2014) Sequence to sequence learning with neural networks. Adv Neural Inf Process Syst 2014:1–9
Bello I, Pham H, Le QV, Norouzi M, Bengio S (2017) Neural combinatorial optimization with reinforce learning. ICLR 2017:896
Kool W, Hoof HV, Welling M (2019) Attention, learn to solve routing problems! ICLR. https://openreview.net/forum?id=ByxBFsRqYm
Williams RJ (1992) Simple statistical gradient-following algorithm for connectionist reinforcement learning. Mach Learn 8:229–256
Gurobi optimizer reference manual (2018) http://www.gurobi.com
Applegate D et al (2006) Concorde TSP solver. http://www.math.uwaterloo.ca/tsp/concorde/
Reinelt G (1991) TSPLIB–A traveling salesman problem library. ORSA J Comput 3:376–384
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work was presented in part at the joint symposium of the 28th International Symposium on Artificial Life and Robotics, the 8th International Symposium on BioComplexity, and the 6th International Symposium on Swarm Behavior and Bio-Inspired Robotics (Beppu, Oita and Online, January 25–27, 2023).
Appendix
Appendix
Appendix: additional experiments on random obstacles and points at n = 100
About this article
Cite this article
Saga, R., Kozono, R., Tsurumi, Y. et al. Deep-reinforcement learning-based route planning with obstacle avoidance for autonomous vessels. Artif Life Robotics 29, 136–144 (2024). https://doi.org/10.1007/s10015-023-00909-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-023-00909-4