用生成模型智能采样射线路径,大幅加速无线传播建模。
Transform-Invariant Generative Ray Path Sampling for Efficient Radio Propagation Modeling
- 用生成流网络替代穷举搜索,智能采样有效路径。
- 在理想街谷场景下比穷举快10倍(GPU)至100倍(CPU)。
- 适合需要实时或大规模部署的无线网络仿真场景。
射线追踪已成为精确无线传播建模的标准方法,但其计算复杂度随物体数量的幂次增长,导致高阶交互路径搜索成本呈指数级上升,限制了在大规模或实时应用中的使用。传统工具常依赖启发式方法减少路径候选,牺牲精度以换取效率。为此,我们提出一种机器学习辅助框架,利用生成流网络将穷举搜索替换为智能采样。该领域存在稀疏奖励问题,尤其在复杂环境中高阶交互路径稀少,易导致训练失败或产生平凡解。为此,框架引入三项关键设计:第一,经验回放缓冲区保留罕见有效路径;第二,均匀探索策略提升泛化能力,防止对简单几何过拟合;第三,基于物理的动作掩码机制在模型评估前剔除物理上不可能的路径。在理想街谷场景验证中,该模型实现显著加速——GPU上最高提速10倍,CPU上达100倍,同时保持高覆盖率准确率,并成功发现复杂传播路径。但在真实曼哈顿街道结构的分布外测试中,模型在不同城市形态间的泛化能力仍受限,需提升模型容量或改进训练策略。源代码、测试及教程见https://github.com/jeertmans/sampling-paths。
原文摘要 · Abstract (English)
Ray tracing has become a standard for accurate radio propagation modeling, but suffers from exponential computational complexity, as the number of candidate paths scales with the number of objects raised to the interaction order. This bottleneck limits its use in large-scale or real-time applications, forcing traditional tools to rely on heuristics that reduce path candidates at the cost of potentially reduced accuracy. To overcome this limitation, we propose a machine-learning-assisted framework that replaces exhaustive path searching with intelligent sampling via Generative Flow Networks. Applying these generative models to this domain presents challenges, particularly sparse rewards due to the rarity of valid paths, which can lead to convergence failures and trivial solutions when evaluating high-order interactions in complex environments. To ensure robust learning and efficient exploration, our framework incorporates three key components. First, an \emph{experience replay buffer} captures and retains rare valid paths. Second, a uniform exploratory policy improves generalization and prevents overfitting to simple geometries. Third, a physics-based action masking strategy filters out physically impossible paths before the model considers them. Validated on idealized street-canyon scenarios, our model achieves substantial speedups over exhaustive search -- up to $10\times$ faster on GPU and $100\times$ faster on CPU -- while maintaining high coverage accuracy and successfully uncovering complex propagation paths. However, out-of-distribution evaluations on real-world Manhattan street geometries reveal that generalizing to substantially different urban morphologies requires further advancement in model capacity or alternative training strategies. Source code, tests, and a tutorial are available at https://github.com/jeertmans/sampling-paths.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。