Adaptive Surrogate-Assisted Optimal Sailboat Path Search Using Onboard Computers

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new surrogate-assisted dynamic programming based optimal path search algorithm – studied in the context of high-performance sailing – is shown to be both effective and (energy) efficient. The key elements in achieving this – the fast and accurate physics-based surrogate model, the integrated refinement of the solution space and simulation model fidelity, and the OpenCL-based spmd-parallelisation of the algorithm – are presented in detail. The included numerical results show the high accuracy of the surrogate model (relative approximation error medians smaller than 0.85 % ), its efficacy in terms of computing time reduction (from 39.2 to 45.4 times), and the high speedup of the parallel algorithm (from 5.5 to 54.2). Combining these effects gives (up to) 2461 times faster execution. The proposed approach can also be applied to other domains. It can be considered as a dynamic programming based optimal path planning framework parameterised by a problem specific (potentially variable-fidelity) cost-function evaluator (surrogate).

Cite

CITATION STYLE

APA

Dębski, R., & Dreżewski, R. (2022). Adaptive Surrogate-Assisted Optimal Sailboat Path Search Using Onboard Computers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13352 LNCS, pp. 355–368). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-08757-8_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free