TY - GEN
T1 - Application of Quasi-Monte Carlo in Mine Countermeasure Simulations with a Stochastic Optimal Control Framework
AU - Blondeel, Philippe
AU - Van Utterbeeck, Filip
AU - Lauwens, Ben
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.
PY - 2026
Y1 - 2026
N2 - Modelling and simulating mine countermeasures search missions performed by autonomous vehicles equipped with a sensor capable of detecting mines at sea is a challenging endeavour. The output of our stochastic optimal control implementation consists of an optimal trajectory in a square domain for the autonomous vehicle such that the total mission time is minimized for a given residual risk of not detecting sea mines. We model this risk as an expected value integral. We found that upon completion of the simulation, the user requested residual risk is usually not satisfied. We solved this by implementing a relaxation strategy which consists of incrementally increasing the square search domain. We then combined this strategy with different quasi-Monte Carlo schemes used for solving the integral. We found that using a Rank-1 Lattice scheme yields a speedup up to a factor two with respect to the Monte Carlo scheme. We also present an implementation which allows us to compute a trajectory in a convex quadrilateral domain, as opposed to a square domain, and combine it with our relaxation strategy.
AB - Modelling and simulating mine countermeasures search missions performed by autonomous vehicles equipped with a sensor capable of detecting mines at sea is a challenging endeavour. The output of our stochastic optimal control implementation consists of an optimal trajectory in a square domain for the autonomous vehicle such that the total mission time is minimized for a given residual risk of not detecting sea mines. We model this risk as an expected value integral. We found that upon completion of the simulation, the user requested residual risk is usually not satisfied. We solved this by implementing a relaxation strategy which consists of incrementally increasing the square search domain. We then combined this strategy with different quasi-Monte Carlo schemes used for solving the integral. We found that using a Rank-1 Lattice scheme yields a speedup up to a factor two with respect to the Monte Carlo scheme. We also present an implementation which allows us to compute a trajectory in a convex quadrilateral domain, as opposed to a square domain, and combine it with our relaxation strategy.
KW - Mine countermeasures
KW - Quasi-Monte Carlo
KW - Stochastic optimal control
UR - https://www.scopus.com/pages/publications/105040333267
U2 - 10.1007/978-3-032-10590-5_8
DO - 10.1007/978-3-032-10590-5_8
M3 - Conference contribution
AN - SCOPUS:105040333267
SN - 9783032105899
T3 - Springer Proceedings in Mathematics and Statistics
SP - 189
EP - 217
BT - Monte Carlo and Quasi-Monte Carlo 2024 - MCQMC 2024
A2 - Lemieux, Christiane
A2 - Feng, Ben
PB - Springer
T2 - 16th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, MCQMC 2024
Y2 - 18 August 2024 through 23 August 2024
ER -