INSPIRE-GNN: Intelligent Sensor Placement to Improve Sparse Bicycling Network Prediction via Reinforcement Learning Boosted Graph Neural Networks
On the map: Deep reinforcement learning methods → RL for games and combinatorial optimization
Abstract (arXiv)
Accurate link-level bicycling volume estimation is essential for sustainable urban transportation planning. However, many cities face significant challenges of high data sparsity due to limited bicycling count sensor coverage. To address this issue, we propose INSPIRE-GNN, a novel Reinforcement Learning (RL)-boosted hybrid Graph Neural Network (GNN) framework designed to optimize sensor placement and improve link-level bicycling volume estimation in data-sparse environments. INSPIRE-GNN integrates Graph Convolutional Networks (GCN) and Graph Attention Networks (GAT) with a Deep Q-Network (DQN)-based RL agent, enabling a data-driven strategic selection of sensor locations to maximize estimation performance. Applied to Melbourne's bicycling network, comprising 15,933 road segments with sensor coverage on only 141 road segments (99% sparsity) - INSPIRE-GNN demonstrates significant improvements in volume estimation by strategically selecting additional sensor locations in deployments of 50, 100, 200 and 500 sensors. Our framework outperforms traditional heuristic methods for sensor placement such as betweenness centrality, closeness centrality, observed bicycling activity and random placement, across key metrics such as Mean Squared Error (MSE), Root Mean Squared Error (RMSE) and Mean Absolute Error (MAE). Furthermore, our experiments benchmark INSPIRE-GNN against standard machine learning and deep learning models in the bicycle volume estimation performance, underscoring its effectiveness. Our proposed framework provides transport planners actionable insights to effectively expand sensor networks, optimize sensor placement and maximize volume estimation accuracy and reliability of bicycling data for informed transportation planning decisions.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in RL for games and combinatorial optimization, one of 15 directions in Deep reinforcement learning methods. Builds on 10 of its 61 references that are in the map. First posted on arXiv 31 Jul 2025.
Builds on
10 of 61 references.
Closest ancestors · 1
Same direction, newest first
- 2024Graph Reinforcement Learning for Combinatorial Optimization: A Survey and Unifying Perspective9 Apr
Other references · 9
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2017Graph Attention Networkscited by 8,923
- 2016Layer Normalizationcited by 5,669
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2018T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Predictioncited by 401
- 2018GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphscited by 165
- 2020Deep Reinforcement Learning for Intelligent Transportation Systems: A Surveycited by 98
- 2017Adaptive Traffic Signal Control: Deep Reinforcement Learning Algorithm with Experience Replay and Target Networkcited by 16
- 2020Optimizing sensors placement in complex networks for localization of hidden signal source: A reviewcited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2024HGFF: A Deep Reinforcement Learning Framework for Lifetime Maximization in Wireless Sensor Networks
- 2024Acceleration Algorithms in GNNs: A Survey
- 2025RIDGECUT: Learning Graph Partitioning with Rings and Wedges
- 2024Discovering Cyclists' Visual Preferences Through Shared Bike Trajectories and Street View Images Using Inverse Reinforcement Learning
- 2025NaviGNN: Multi-Agent Reinforcement Learning and Graph Neural Network for Sustainable Mobility in Futuristic Smart Cities
- 2024Single- vs. Dual-Policy Reinforcement Learning for Dynamic Bike Rebalancing
- 2026Graph-Conditioned Mixture of Graph Neural Network Experts for Traffic Forecasting
- 2024GREAT: A Graph Edge Attention Network for the Electric Vehicle Routing Problem with Asymmetric Costs