arXiv:2605.16191cs.CLcond-mat.other2026-05

用AI自动生成高效三维光伏结构,突破平面太阳能板效率瓶颈。

Optimized Three-Dimensional Photovoltaic Structures with LLM guided Tree Search

论文配图:Optimized Three-Dimensional Photovoltaic Structures with LLM guided Tree Search
图 1 · 摘自论文原文
  • 结合代码代理与大模型树搜索,自动优化光伏结构设计
  • 发现多组更优方案,实现无自遮挡、最优天顶追踪的高效布局
  • 通过物理约束迭代修复,避免算法奖励欺骗问题

我们展示如何利用AI编程系统生成新的科学假设。将通用代码代理(Google的AntiGravity)与基于大模型的树搜索算法(Empirical Research Assistance / ERA)结合,自主生成高效三维光伏(3DPV)结构,克服中纬度地区平面太阳能板的性能损失。这些结构通过全天候优化朝向太阳角度来提升发电效率,本文以单日性能优化为例。工作始于使用AntiGravity复现文献计算,证明3DPV能量密度远超静态平面光伏板。以此为基础开展大规模树搜索,评估昼夜能量产出。初始搜索得到看似更高效的解,但源于算法奖励劫持——如非物理解构的悬浮独立层级和光学求解器离散化漏洞。为此,我们设计迭代流程:代码代理不断为物理引擎添加约束以消除奖励欺骗。去除奖励劫持后,ERA发现多组满足不同约束条件的改进设计,包括固定集光面积下的最优解、实现天顶追踪并避免自遮挡的结构。该方法为可通过评分函数实证评估的问题提供强大科学发现平台。

原文摘要 · Abstract (English)

We present a case study for how AI coding systems can be used to generate novel scientific hypotheses. We combine a generic coding agent (Google's AntiGravity) with an LLM-driven tree search algorithm (Empirical Research Assistance / ERA) to autonomously generate high-efficiency three-dimensional photovoltaic (3DPV) structures that overcome losses limiting flat solar panels at mid-latitudes. These structures operate by presenting favorable angles to the sun throughout the day, and for illustrative purposes we focus on optimizing performance for a single solar day. Our workflow begins by using AntiGravity to reproduce calculations \cite{bernardi2012solar} showing that 3DPV can have energy densities much higher than stationary flat PV panels. We use these initial designs as the starting point for large scale tree search, where we seek improved solutions and score them for their diurnal yield. The initial tree search leads to nominally more efficient solutions, yet they are caused by algorithmic reward hacking, arising from non-physical design features such as structurally levitating disconnected tiers and exploitations of the discretizations in the optics solver. To counteract this, we develop a workflow where the coding agent iteratively patches the physics engine with constraints to eliminate reward hacking. With reward-hacking eliminated, ERA discovers a series of designs with various constraints and improved performance, including optimal designs with different fixed collector areas, optimizing zenith tracking and avoiding self shadowing. Combining coding agents with tree search (ERA) provides a powerful platform for scientific discovery, for problems whose solutions can be empirically evaluated with a score function.

光伏优化AI科研结构设计树搜索

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。