Minimum Time Sailing Boat Path Algorithm

نویسندگان

چکیده

An iterative procedure to solve the nonlinear problem of fastest-path sailing vessel routing in an environment with variable winds and currents is proposed. In a vessel, primary control pointing (heading) (assuming that sails are chosen trimmed optimally). Sailing highly when considering environmental factors, such as currents, behavior boat, given weather conditions (i.e., polar diagrams predict how fast one can sail, vessel's relative true wind speed). The key algorithmic contribution this article algorithm for graphs nonconvex edge costs depend on weather, current, boat polars. illustrative scenario, idealized attributes, real-world parameters generated by numerical current prediction models, simulated tested compare proposed against open-source software validated active sailors. Preliminary results from simulation setups follows: 1) path comparable available; 2) exploiting often unused but significant impactor surface incorporating leeway into planning enables higher fidelity guidance faster shorter time) routes, comparing freely available baseline.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Near-Minimum-Time Motion Planning of Manipulators along Specified Path

The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

متن کامل

Minimum K-Path Vertex using Pruning Algorithm

For a directed graph G with vertex set V we call a subset C ₵ V a k-(All-) Path Cover if C contains a node from any path consisting of k nodes. This paper considers the problem of constructing small k-Path Covers in the context of road networks with millions of nodes and edges. In many application scenarios the set C and its induced overlay graph constitute a very compact synopsis of G which is...

متن کامل

near-minimum-time motion planning of manipulators along specified path

the large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. most of this computational burden is due to calculation of switching points. in this paper a learning algorithm is proposed for finding the switching points. the method, which can be used for both ...

متن کامل

Visual search, movement behaviour and boat control during the windward mark rounding in sailing.

In search of key-performance predictors in sailing, we examined to what degree visual search, movement behaviour and boat control contribute to skilled performance while rounding the windward mark. To this end, we analysed 62 windward mark roundings sailed without opponents and 40 windward mark roundings sailed with opponents while competing in small regattas. Across conditions, results reveale...

متن کامل

Selection of the Racing Multihull Sailing Boat Equipment by the Ahp Method – a Case Study

The paper aims at presenting the optimal selection of the deck equipment for the racing multihull sailing boat using a novel methodology based on the modified wind loads design and the AHP method. The determination of the modified wind load design due to the mass of the crew on the side hull is essential because of possible greater stability moments. The load obtained in such a way has been com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Journal of Oceanic Engineering

سال: 2023

ISSN: ['1558-1691', '0364-9059', '2373-7786']

DOI: https://doi.org/10.1109/joe.2022.3227985