Optimal Transport-based Permutation-Invariant Bayesian Optimization of Offshore Wind Farm Layouts
Quick Take
The study introduces a Permutation-Invariant Bayesian Optimization (PIBO) method for optimizing offshore wind farm layouts, leveraging Optimal Transport theory. PIBO significantly outperforms traditional Bayesian Optimization by improving layout efficiency and reducing computation time by approximately 50%. This advancement is crucial for optimizing energy production from wind farms with identical turbines.
Key Points
- PIBO optimizes offshore wind farm layouts using Optimal Transport theory.
- Reduces computation time by approximately 50% compared to traditional Bayesian Optimization.
- Improves layout efficiency for identical wind turbines without affecting energy production.
- Addresses optimization over layouts, distinguishing it from point-cloud optimization.
Article Content
From source RSS / original summaryarXiv:2606. 00009v1 Announce Type: new Abstract: Bayesian Optimization (BO) is widely and successfully adopted for solving optimization problems having an expensive-to-evaluate, black-box, and non-convex objective function. However, the vanilla BO algorithm is not able to exploit possible symmetries characterizing the target problem.
An intuitive case is given by optimal location problems, whose decision variables refer to a finite set of points within a continuous space, with the order of points not affecting the value of the objective function. We refer to this setting as optimization over layouts to distinguish from optimization over point-clouds where, instead, the order of points counts.
As an instance of optimization over layouts we consider a real-life industrial-relevant application, that is the optimization of the layout of an offshore wind farm: given identical wind turbines, switching any pair of them has not any effect on the annual energy production. Based on Optimal Transport theory, we propose a Permutation-Invariant BO approach, namely PIBO, proved to provide better wind farm layouts when compared to the vanilla BO approach while cutting computation time roughly in half.
Reader Mode unavailable (could not extract clean content).
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →MindGames Arena Generalization Track: In2AI Solution with Delayed Per-Step Reward Attribution
The In2AI solution introduces delayed per-step reward attribution for training language model agents in multi-agent environments, achieving top performance on the MindGames Arena benchmark at NeurIPS 2025. An 8-billion-parameter model outperformed larger proprietary systems, including GPT-5, in competitive play, demonstrating enhanced stability and sample efficiency in reinforcement learning.
