Evidence map›Paper›PMID 41998136›Full record

ArticleScientific reports2026

Intelligent scheduling and resource allocation for urban air mobility networks based on graph neural networks.

Xiaoqi Xu, Yiyang Zhao, Peilong Zhang

Abstract read
In one paragraph

Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Xiaoqi XuSchool of Law and Business, Shaoyang University, Shaoyang, 422000, Hunan, China.
Yiyang ZhaoInstitute of Internet Industry, Tsinghua University, Beijing, 100000, China.
Peilong ZhangSchool of Law and Business, Shaoyang University, Shaoyang, 422000, Hunan, China. 17673205321@163.com.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Urban Air Mobility (UAM) represents a promising solution to metropolitan transportation challenges, yet efficient scheduling and resource allocation in large-scale UAM networks remain computationally intractable for traditional optimization methods. This paper proposes a hybrid scheduling framework that couples graph neural network prediction with deterministic constraint repair for UAM scheduling and resource allocation. We first develop a heterogeneous graph representation scheme that captures diverse network elements including vertiports, waypoints, and aircraft with their distinct attributes. A spatiotemporal graph attention network (ST-GAT) architecture is then constructed, integrating spatial topology awareness with temporal dynamics modeling through dual attention channels. Furthermore, an adaptive multi-objective optimization strategy is designed to balance throughput maximization, delay minimization, and energy efficiency while satisfying operational constraints. Experimental results on a simulated metropolitan UAM network demonstrate that the proposed method achieves 94.2% throughput under peak demand conditions with average delay of 4.1 min, outperforming genetic algorithm and simulated annealing baselines by 15.9% and 19.9% respectively. The integrated pipeline—comprising neural scheduling prediction and post-processing feasibility repair—maintains sub-second inference latency up to 250 concurrent aircraft and 60 vertiports, confirming its suitability for real-time operational deployment within the tested scale.

Indexed as

Graph neural networkIntelligent schedulingLow-altitude economyResource allocationSpatiotemporal attentionUrban air mobility

Identifiers

PMID41998136
PMCPMC13247220

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.