NetAgent: Agentic Wireless Base-Station Planning with Differentiable Propagation Optimization
Abstract
Reliable wireless service and quiet-zone protection depend on base-station placement. This is a constrained inverse-design problem in which sparse transmitter decisions are judged by the dense propagation fields they induce. Locations, power allocation, and station count interact: strengthening one region can illuminate another that should remain quiet. Electromagnetic simulation captures these effects but makes configuration search costly, while fast channel models miss local building geometry. A radio-map generator offers another route when transmitter locations are not prescribed: gradients of regional objectives shape a candidate field whose dominant peak identifies a deployable site. NetAgent trains a RadioDiff-based architecture without its original condition encoder and freezes the resulting radio-map prior. Short deterministic denoising allows joint optimization of spatial latents and source power weights; station coordinates are read from the optimized single-source fields. One shared multi-source optimization produces weight-ranked nested deployments, from which a constraint-first rule selects station count without separate searches. An agentic interface converts drawn or natural-language requests into validated regional constraints. On thirty OpenStreetMap-derived scenarios scored by an independent electromagnetic simulator, NetAgent Auto- reaches mean target attainment in s with stations on average, compared with for AutoBS and for a s exhaustive ray-tracing reference.
est. 32% chance this paper gets accepted at ICLR 2027.
What do you think this paper will get?
All positions stay anonymous.