VISIR-I: small vessels – least-time nautical routes using wave forecasts
Gianandrea Mannarini,Nadia Pinardi,Nadia Pinardi,Giovanni Coppini,Paolo Oddo,Alessandro Iafrati +5 more
Reads0
Chats0
TLDR
The optimal route may be longer in terms of miles sailed and yet it is faster and safer than the geodetic route between the same departure and arrival locations, which especially in case of extreme sea states can be much greater.Abstract:
. A new numerical model for the on-demand computation of optimal ship routes based on sea-state forecasts has been developed. The model, named VISIR (discoVerIng Safe and effIcient Routes) is designed to support decision-makers when planning a marine voyage. The first version of the system, VISIR-I, considers medium and small motor vessels with lengths of up to a few tens of metres and a displacement hull. The model is comprised of three components: a route optimization algorithm, a mechanical model of the ship, and a processor of the environmental fields. The optimization algorithm is based on a graph-search method with time-dependent edge weights. The algorithm is also able to compute a voluntary ship speed reduction. The ship model accounts for calm water and added wave resistance by making use of just the principal particulars of the vessel as input parameters. It also checks the optimal route for parametric roll, pure loss of stability, and surfriding/broaching-to hazard conditions. The processor of the environmental fields employs significant wave height, wave spectrum peak period, and wave direction forecast fields as input. The topological issues of coastal navigation (islands, peninsulas, narrow passages) are addressed. Examples of VISIR-I routes in the Mediterranean Sea are provided. The optimal route may be longer in terms of miles sailed and yet it is faster and safer than the geodetic route between the same departure and arrival locations. Time savings up to 2.7 % and route lengthening up to 3.2 % are found for the case studies analysed. However, there is no upper bound for the magnitude of the changes of such route metrics, which especially in case of extreme sea states can be much greater. Route diversions result from the safety constraints and the fact that the algorithm takes into account the full temporal evolution and spatial variability of the environmental fields.read more
Citations
More filters
Journal ArticleDOI
Successful Blue Economy Examples With an Emphasis on International Perspectives
Lu Wenhai,Caroline Cusack,Maria Baker,Wang Tao,Chen Mingbao,Kelli Paige,Zhang Xiaofan,Lisa A. Levin,Elva Escobar,Diva J. Amon,Yin Yue,Anja Reitz,Antonio Augusto Sepp Neves,Eleanor O’Rourke,Gianandrea Mannarini,Jay Pearlman,Jonathan Tinker,Kevin Horsburgh,Patrick Lehodey,Sylvie Pouliquen,Trine Dale,Zhao Peng,Yang Yu-feng +22 more
TL;DR: In this article, the authors present a case study of the blue economy in terms of management connotation, data access, monitoring, and product development, and provide an outlook for the future.
Journal ArticleDOI
A bibliometric analysis and systematic review of shipboard Decision Support Systems for accident prevention
TL;DR: An analysis indicates a relatively low level of technology readiness of tools and concepts presented in academic literature, which signifies a need to move beyond the conceptual stages toward demonstration and validation in realistic, operating environments.
Journal ArticleDOI
Ship weather routing optimization with dynamic constraints based on reliable synchronous roll prediction
TL;DR: In this article, a stability-related, dynamic route optimization constraint is presented in order to find a compromise between ship safety and economics of operation in a cross-ocean sailing.
Journal ArticleDOI
Zermelo's problem: Optimal point-to-point navigation in 2D turbulent flows using Reinforcement Learning
Luca Biferale,Fabio Bonaccorso,Michele Buzzicotti,Patricio Clark Di Leoni,Kristian Gustavsson +4 more
TL;DR: In this paper, an Actor-Critic RL algorithm is used to find quasi-optimal solutions for both time-independent and chaotically evolving flow configurations. But the authors do not consider the case of a vessel with a fixed slip velocity with fixed intensity, but variable direction and navigating in a 2D turbulent sea.
Journal ArticleDOI
Zermelo's problem: Optimal point-to-point navigation in 2D turbulent flows using reinforcement learning.
Luca Biferale,Fabio Bonaccorso,Fabio Bonaccorso,Michele Buzzicotti,P. Clark Di Leoni,P. Clark Di Leoni,Kristian Gustavsson +6 more
TL;DR: This work investigates Zermelo's problem by using a Reinforcement Learning (RL) approach for the case of a vessel that has a slip velocity with fixed intensity, Vs, but variable direction and navigating in a 2D turbulent sea, and shows how the RL approach is able to take advantage of the flow properties in order to reach the target.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
Multi-objective optimization using genetic algorithms: A tutorial
TL;DR: An overview and tutorial is presented describing genetic algorithms (GA) developed specifically for problems with multiple objectives that differ primarily from traditional GA by using specialized fitness functions and introducing methods to promote solution diversity.
Journal ArticleDOI
The Mathematical Theory of Optimal Processes
TL;DR: The Mathematical Theory of Optimal Processes (MTOP) as mentioned in this paper is a mathematical theory of optimal processes that is closely related to our approach to optimal process analysis, but with a different focus.
Journal ArticleDOI
Local adaptive mesh refinement for shock hydrodynamics
Marsha Berger,Phillip Colella +1 more
TL;DR: An automatic, adaptive mesh refinement strategy for solving hyperbolic conservation laws in two dimensions and how to organize the algorithm to minimize memory and CPU overhead is developed.
Book
Network Flows
TL;DR: The question the authors are trying to ask is: how many units of water can they send from the source to the sink per unit of time?