Abstract

This paper presents a multiobjective optimization approach for path planning of autonomous surface vehicles (ASVs). A unique feature of the technique is the unification of the Convention on the International Regulations for Preventing Collisions at Sea (COLREGs) with good seamanship’s practice along with hierarchical (rather than simultaneous) inclusion of objectives. The requirements of collision avoidance are formulated as mathematical inequalities and constraints in the optimization framework and thus collision-free manoeuvres and COLREGs-compliant behaviours are provided in a seafarer-like way. Specific expert knowledge is also taken into account when designing the multiobjective optimization algorithm. For example, good seamanship reveals that if allowed, an evasive manoeuvre with course changes is always preferred over one with speed changes in practical maritime navigation. As a result, a hierarchical sorting rule is designed to prioritize the objective of course/speed change preference over other objectives such as path length and path smoothness, and then incorporated into a specific evolutionary algorithm called hierarchical multiobjective particle swarm optimization (H-MOPSO) algorithm. The H-MOPSO algorithm solves the real-time path planning problem through finding solutions of the formulated optimization problem. The effectiveness of the proposed H-MOPSO algorithm is demonstrated through both desktop and high-fidelity networked bridge simulations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.