Metraipolis › archive › dc_beead005a404

A Joint Information-Theoretic and Graph Learning Framework for Sensor Placement and Macroscopic Traffic State Reconstruction — arXiv:2609.13212

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.13212
License (as archived): CC0-1.0
Archived: 2026-10-16T01:34:52.648Z
SHA-256 of the archived text: 5d0ae31014ec9a31c0addd2fa82d7c690a2852bf54ba83e4454002ed060ed59b
Stable URL of this page: https://metraipolis.com/documento/dc_beead005a404

How to cite

A Joint Information-Theoretic and Graph Learning Framework for Sensor Placement and Macroscopic Traffic State Reconstruction — arXiv:2609.13212 — arXiv (en), https://arxiv.org/abs/2609.13212 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_beead005a404 (Metraipolis archive dc_beead005a404, sha256 5d0ae31014ec9a31c0addd2fa82d7c690a2852bf54ba83e4454002ed060ed59b)

BibTeX

@misc{dcbeead005a404,
  title = {A Joint Information-Theoretic and Graph Learning Framework for Sensor Placement and Macroscopic Traffic State Reconstruction — arXiv:2609.13212},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13212},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_beead005a404; sha256 5d0ae31014ec9a31c0addd2fa82d7c690a2852bf54ba83e4454002ed060ed59b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13212. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Traffic sensor placement in large urban networks must balance traffic monitoring needs with limited installation, maintenance, and data-management budgets. This study develops a framework for preserving network-wide traffic information while reconstructing flow and density at unobserved links and the macroscopic fundamental diagram (MFD). The framework combines normalized mutual information (NMI) with Inductive Graph Neural Network Kriging (IGNNK). NMI quantifies lag-aware dependence between joint flow-density states, while a greedy algorithm selects sensors by balancing weighted information coverage against redundancy. An IGNNK-based bidirectional graph-diffusion model reconstructs unobserved link states and generates the MFD. The framework was evaluated against a principal component analysis (PCA) benchmark using seven hours of dynamic traffic assignment simulation data for the Chicago network, with 4,805 directed links and 420 one-minute intervals split into training, validation, and independent testing subsets. Reconstruction performance for both PCA and NMI-IGNNK varied substantially over the sensor ratios of 0.5% to 30%. PCA generally yielded lower root mean squared error (RMSE) over the 0.5%-3% range, but its errors were nonmonotonic and reached their minimum at 2%. At 3%, normalized joint RMSE was similar for PCA and NMI-IGNNK (0.100 and 0.105, respectively). NMI-IGNNK remained applicable up to 30% coverage and generally improved as coverage increased, reducing testing-subset normalized joint RMSE from 0.212 at 0.5% to 0.043 at 30%, with consistent trends over the complete analysis period. The framework integrates lag-aware, information-theoretic sensor placement based on joint flow-density states with directed graph-based reconstruction, enabling a broad range of sensor budgets in large-scale networks without strict limits on the number of sensors.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.IT).
Categorie arXiv: Signal Processing (eess.SP) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.13212 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T01:21:38.633Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).