Transform-Invariant Generative Ray Path Sampling for Efficient Radio Propagation Modeling

TL;DR

This paper introduces a machine learning framework using Generative Flow Networks to efficiently sample radio propagation paths, significantly speeding up traditional ray tracing while maintaining accuracy in complex environments.

Contribution

The authors develop a novel ML-assisted sampling method with experience replay, exploration strategies, and physics-based masking to improve ray path sampling efficiency.

Findings

Achieves up to 10x speedup on GPU and 1000x on CPU compared to exhaustive search.

Maintains high accuracy and coverage in complex propagation environments.

Successfully uncovers complex radio propagation paths with reduced computational cost.

Abstract

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 power of the interaction order. This bottleneck limits its use in large-scale or real-time applications, forcing traditional tools to rely on heuristics to reduce the number of path candidates at the cost of potentially reduced accuracy. To overcome this limitation, we propose a comprehensive machine-learning-assisted framework that replaces exhaustive path searching with intelligent sampling via Generative Flow Networks. Applying such generative models to this domain presents significant 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 architectural components. First, we implement an \emph{experience replay buffer} to capture and retain rare valid paths. Second, we adopt a uniform exploratory policy to improve generalization and prevent the model from overfitting to simple geometries. Third, we apply a physics-based action masking strategy that filters out physically impossible paths before the model even considers them. As demonstrated in our experimental validation, the proposed model achieves substantial speedups over exhaustive search -- up to $10\times$ faster on GPU and $1000\times$ faster on CPU -- while maintaining high coverage accuracy and successfully uncovering complex propagation paths. The complete source code, tests, and tutorial are available at https://github.com/jeertmans/sampling-paths.