A Browser-Native Digital Test Range for Benchmarking 4D Ocean-Glider Planning Algorithms
Edward Holmberg, Elias Ioup, Mahdi Abdelguerfi · N/A · 2026
Framework
N/A
License
N/A
Stars
N/A
Summary
Repeated in-situ evaluation of ocean-glider planners requires scarce vehicles, operators, deployment and recovery resources, and ocean conditions that cannot be reset for competing algorithms.
Abstract Summary
Key Points
- Repeated in-situ evaluation of ocean-glider planners requires scarce vehicles, operators, deployment and recovery resources, and ocean conditions that cannot be reset for competing algorithms.
- We present a guided, installation-free browser-native digital test range that transforms a selected region into a reproducible four-dimensional experiment.
- The system leads users from regional domain selection through mission-scoped bathymetry, time/depth forcing, science objectives, optional task decomposition, route specification, current-advected execution, observation generation, and scoring.
- Its primary contribution is a common plan-to-observation contract unifying vehicle, sensing, and evaluator assumptions across manual routes, transparent built-in algorithms, and imported classical or learned-planner outputs, while exported artifacts form dataset-ready records.
- A controlled Observing System Simulation Experiment (OSSE) evaluates five classical planners in two episodes, three deterministic seeds, and a calibrated 60-hour horizon.
Guided Digital Test-Range Workflow
Figure 1 summarizes the information boundary. The interface guides a user through Bathymetry $\rightarrow$ Currents $\rightarrow$ Science $\rightarrow$ Segments $\rightarrow$ Routes $\rightarrow$ Mission $\rightarrow$ Simulate $\rightarrow$ Validate . Table I identifies the principal choices and persisted object at each stage. A geographic bounding box defines the broad analysis domain.
Mission Execution and Evaluation
The mission contract fixes deployment and recovery, clock, fleet, vehicle speed, dive policy, waypoint acceptance, dwell, clearance, observation schedule, and evaluation.
The active benchmark engine advances the vehicle using mission-scale current-advection kinematics, where $\mathbf{v}_{g}$ is ground-relative velocity, $\mathbf{v}_{w}$ is commanded through-water velocity, and $\mathbf{v}_{c}$ is current sampled at the executed state.
Controlled Benchmark Design and Results
Two deterministic episodes represent a cross-shelf front (CSF) and a depth-shear eddy (DSE). Each contains georeferenced bathymetry, masks, three current times and depths, a hidden scalar reference, prior, uncertainty, and sampling value. The one-glider mission uses through-water speed $0.42\text{\,}\mathrm{m}\,\mathrm{s}^{-1}$, a 30-minute step, and 121 states over 60 hours.
Scientific Qualification and Reproducibility
The operational space is scientifically traceable and component-qualified for simulation. Here, component-qualified means that individual data, computation, information-boundary, and browser-execution contracts have supporting evidence; this confirms bounded execution within the idealized simulator.
Table IV separates verification, calibration, field-referenced auditing, reference-model portability, and benchmark inference.
Sources and Demonstrations
Figures are reproduced from Holmberg et al. See the full paper for experimental details and the project page, when the paper links one, for demonstrations and videos.
Related Papers
Aim Short to Reach Far: Your Frozen World Model Can Plan Better Than You Think
Xvyuan Liu, Jianjie Fang, Chen Gao et al.
Planners built on visual world models commonly score each predicted outcome by its distance to the encoded goal image. We show that this target can limit control even with exact dynamics and globally optimal short-horizon search: reaching a goal may require actions that initially move away from it.
Compact Latent Coordination for Autonomous Vehicles at Unsignalized Intersections
Gil Lifshits, Igal Bilik, Gilad Katz
Coordinating autonomous vehicles at unsignalized intersections remains a critical challenge for multi-agent reinforcement learning (MARL) systems, which typically struggle with combinatorial action spaces, reliance on privileged information, or rigid agent designs.
D3DWA: Adaptive Weight and Prediction-Horizon for Dynamic Window Approach via Dueling Double Deep Q-Network
Zahra Jooyandeh, Masato Kobayashi, Yuki Uranishi
The Dynamic Window Approach (DWA) is widely used for local navigation, but its performance depends strongly on parameters that are typically fixed before navigation.
Dexterity from Supervised Play
Botao He, Yiming Dou, Yiannis Aloimonos et al.
How can robots autonomously collect the contact-rich experience needed to learn dexterous manipulation?