Search arXivSearch

arXiv · 2603.16486

Mapping Austria's Natural Gas and Hydrogen Infrastructure Plans

Abstract

This paper presents a comprehensive, spatially disaggregated dataset of Austria's natural gas and hydrogen infrastructure towards 2040. The dataset covers the complete gas transmission and distribution networks down to the medium-pressure level and integrates hydrogen expansion plans from the Austrian Gas Grid Management. Transmission infrastructure is reconstructed from ENTSOG maps, converted into a topologically consistent graph representation, and enriched with technical attributes through automated spatial matching with open-source datasets such as OpenStreetMap and Global Energy Monitor. Distribution networks and infrastructure modifications are implemented using QGas, a newly developed GIS-based tool for graph-based infrastructure manipulation. To enable forward-looking energy system analyses, the dataset explicitly represents the stage-wise transition from natural gas to hydrogen infrastructure within a single dataset. Repurposed and newly constructed hydrogen pipelines are integrated within a unified network topology using node splitting and time dependent connector elements, enabling consistent modeling of parallel natural gas and hydrogen operation over time. The resulting dataset provides a detailed representation of Austria's gas and hydrogen infrastructure, including 586 natural gas pipeline segments (5000 km), 113 repurposed segments (1250 km), and 39 newly constructed hydrogen segments (820 km), connecting 720 nodes. Moreover, it includes a comprehensive set of gas demands, biogas production facilities, storage units, electrolyzers, and compressor elements, making it directly applicable for energy system optimization models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Quantschnig, Yannick Werner, Thomas Klatzer, Sonja Wogrin. 2026-03-17. Mapping Austria's Natural Gas and Hydrogen Infrastructure Plans. https://arxiv.org/abs/2603.16486

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC