A Multiobjective Optimization Approach for COLREGs-Compliant Path Planning of Autonomous Surface Vehicles Verified on Networked Bridge Simulators
Bibliographic record
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.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".