Joris Verhagen

Ignacio Torroba, David Dorner, Victor Nan Fernandez-Ayala et al.

Field robotics research in maritime and space domains is constrained by a persistent gap between low-cost, low-fidelity simulation and costly offshore experimentation. Instrumented water tanks partially bridge this gap but often provide limited sensing, restricted experimental capabilities, and weak integration with simulation tools. To address these limitations, we present Marinarium, a modular, standalone experimental facility that provides a cost-effective intermediate testbed between simulation and field deployment. Marinarium combines a fully instrumented underwater and aerial operational volume with motion capture (MoCap), a retractable roof enabling both sheltered and open-air operation, a digital twin implemented in SMaRCSim, and direct integration with a planar space robotics laboratory, enabling both maritime and underwater space-analog experimentation. We present the design rationale of the facility and validate its capabilities through four representative studies in field robotics: (i) data-driven system identification of underwater vehicle dynamics; (ii) heterogeneous multi-domain robotic rendezvous; (iii) sim-to-real transfer for underwater robotics using learned dynamics residuals; and (iv) cross-domain validation of spacecraft autonomy using underwater surrogates. Together, these studies demonstrate that Marinarium enables reproducible, instrumented experimentation across multiple field robotics challenges that would otherwise require costly offshore deployments or be impractical to investigate using simulation alone.

Matti Vahs, Joris Verhagen, Jana Tumova

Partially Observable Markov Decision Processes (POMDPs) provide a principled framework for robot decision-making under uncertainty. Solving reach-avoid POMDPs, however, requires coordinating three distinct behaviors: goal reaching, safety, and active information gathering to reduce uncertainty. Existing online POMDP solvers attempt to address all three within a single belief tree search, but this unified approach struggles with the conflicting time scales inherent to these objectives. We propose a layered, certificate-based control architecture that operates directly in belief space, decoupling goal reaching, information gathering, and safety into modular components. We introduce Belief Control Lyapunov Functions (BCLFs) that formalize information gathering as a Lyapunov convergence problem in belief space, and show how they can be learned via reinforcement learning. For safety, we develop Belief Control Barrier Functions (BCBFs) that leverage conformal prediction to provide probabilistic safety guarantees over finite horizons. The resulting control synthesis reduces to lightweight quadratic programs solvable in real time, even for non-Gaussian belief representations with dimension $>10^4$. Experiments in simulation and on a space-robotics platform demonstrate real-time performance and improved safety and task success compared to state-of-the-art constrained POMDP solvers.

Jana Tumova, Joris Verhagen, Matti Vahs

As robots move from controlled environments into real-world settings, it becomes increasingly crucial to ensure that they perform as expected. A key step toward that goal is a rigorous specification of the desired robot behavior, capturing intricate temporal, spatial, and logical requirements. Complementing this, plan and control synthesis methods are needed to fulfill these specifications with provable guarantees. This manuscript presents temporal logics - particularly linear and signal temporal logic - as expressive specification languages for robot behavior over time. We then discuss principles of formal synthesis, from discrete graph- and game-based approaches to sampling-based motion planning, trajectory optimization, and control-certificate-based synthesis. Finally, we outline challenges in deploying formal synthesis in real-world robotics, emphasizing the interplay between modeling fidelity, computational tractability, and the types of rigorous guarantees that can be achieved.