arXiv · 2607.19831
Optimal Sensor Placement via Graph-constrained Flow Matching
Abstract
Optimal sensor placement is a fundamental problem in graph signal processing (GSP), where a limited number of sensors are deployed to reconstruct a continuous signal field. Existing GSP methods rely on combinatorial optimization over discretized graphs, resulting in high computational cost and sensor locations restricted to graph vertices. We reformulate sensor placement as a continuous-space generative modeling problem. An offline GSP optimization routine first generates training samples of optimal sensor configurations, from which a flow matching (FM) model learns their distribution. At inference, the learned velocity field directly generates continuous sensor coordinates, eliminating online combinatorial optimization. We further develop a permutation-invariant conditional generation framework for deployment with fixed anchor sensors. Experiments on a realistic radio propagation simulator demonstrate the effectiveness of the proposed framework for sensor placement.
Explore related subjects
Keep this discovery
Feng Ji, Jingyang Dai, Wee Peng Tay, Sirajudeen Gulam Razul. 2026-07-22. Optimal Sensor Placement via Graph-constrained Flow Matching. https://arxiv.org/abs/2607.19831
Cite the original work for its findings. Save a collection to share your selection of sources.