Lingtao Xue
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lingtao Xue has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Xuewen Dong
School of Computer Science & Technology, Xidian University, Xi’an 710071, China
8 shared publications - Gang Xiao
National Key Laboratory for Complex Systems Simulation, Beijing 100101, China
6 shared publications - Xinyu Hu
School of Systems Science and Engineering, Sun Yat-sen University, Guangzhou 510275, China
4 shared publications - Yuanyuan Zhang
National Key Laboratory for Complex Systems Simulation, Beijing 100101, China
4 shared publications Xinyu Hu
Sun Yat-sen University
3 shared publications- Yulong Shen
Xidian University
3 shared publications
Latest Publications
- Open Access
- 17 August 2026
- Published by MDPI AG in Electronics
- Vol. 15 (16) , 3661
Scene-Adaptive Task Offloading in Heterogeneous Edge Networks via Graph Neural Network-Enhanced Deep Reinforcement Learning
Efficient task offloading in UAV-assisted heterogeneous mobile edge computing (MEC) networks is increasingly challenged by the co-existence of operationally distinct workload scenarios—including high-demand bursts, resource-constrained periods, and balanced operational states—each demanding fundamentally different assignment strategies. In such networks, mobile executor nodes (e.g., UAVs or vehicle-mounted edge servers) must be dispatched to the vicinity of geographically distributed tasks, making assignment decisions jointly dependent on node mobility, the quality of sensing data, and dynamic resource availability. Conventional approaches based on combinatorial optimization with fixed parameters or greedy heuristics fail to adapt to these varying conditions, leading to resource depletion under sequential workloads or underutilization under high-demand bursts. To address these limitations, this paper proposes SAGE (Scene-Adaptive Graph-Enhanced offloading), a task-offloading framework that combines a heterogeneous graph neural network (HeteroGNN) with a dueling double DQN meta-controller and a mixed-integer linear programming (MILP) solver. At the state-representation level, a heterogeneous bipartite graph is constructed over mobile executor nodes and tasks, with type-specific projection layers encoding the semantic features of each node type and three-dimensional edge features—comprising task success probability, normalized service distance, and link quality—integrated via edge-gated message passing. At the decision level, the meta-controller perceives the current workload scenario through a seven-dimensional situational state vector fused with the graph embedding, selects an appropriate offloading strategy from a learned discrete action space, and drives the MILP solver to perform task-chain assignment under the selected configuration. Experiments on 60 fixed evaluation episodes spanning three representative workload scenarios demonstrate that SAGE achieves an overall reward improvement of 15.9% over the best fixed-strategy baseline, reduces the resource depletion rate to 16.7%, and maintains a high-priority task completion rate of 84.7%. Particularly under resource-constrained conditions, SAGE reduces the reward deficit by 72.3% relative to the best fixed strategy (from to ), demonstrating strong scene-adaptive decision-making capability.- 17 August 2026
- Published by MDPI AG in Electronics
- Vol. 15 (16) , 3661
Open AccessScene-Adaptive Task Offloading in Heterogeneous Edge Networks via Graph Neural Network-Enhanced Deep Reinforcement Learning
Efficient task offloading in UAV-assisted heterogeneous mobile edge computing (MEC) networks is increasingly challenged by the co-existence of operationally distinct workload scenarios—including high-demand bursts, resource-constrained periods, and balanced operational states—each demanding fundamentally different assignment strategies. In such networks, mobile executor nodes (e.g., UAVs or vehicle-mounted edge servers) must be dispatched to the vicinity of geographically distributed tasks, making assignment decisions jointly dependent on node mobility, the quality of sensing data, and dynamic resource availability. Conventional approaches based on combinatorial optimization with fixed parameters or greedy heuristics fail to adapt to these varying conditions, leading to resource depletion under sequential workloads or underutilization under high-demand bursts. To address these limitations, this paper proposes SAGE (Scene-Adaptive Graph-Enhanced offloading), a task-offloading framework that combines a heterogeneous graph neural network (HeteroGNN) with a dueling double DQN meta-controller and a mixed-integer linear programming (MILP) solver. At the state-representation level, a heterogeneous bipartite graph is constructed over mobile executor nodes and tasks, with type-specific projection layers encoding the semantic features of each node type and three-dimensional edge features—comprising task success probability, normalized service distance, and link quality—integrated via edge-gated message passing. At the decision level, the meta-controller perceives the current workload scenario through a seven-dimensional situational state vector fused with the graph embedding, selects an appropriate offloading strategy from a learned discrete action space, and drives the MILP solver to perform task-chain assignment under the selected configuration. Experiments on 60 fixed evaluation episodes spanning three representative workload scenarios demonstrate that SAGE achieves an overall reward improvement of 15.9% over the best fixed-strategy baseline, reduces the resource depletion rate to 16.7%, and maintains a high-priority task completion rate of 84.7%. Particularly under resource-constrained conditions, SAGE reduces the reward deficit by 72.3% relative to the best fixed strategy (from to ), demonstrating strong scene-adaptive decision-making capability. - 19 July 2026
- Published by Springer Nature
- p. 332-346
Communication-Aware Intelligent Cooperative Search for Multi-UAV Systems in Blocked Regions
- 19 July 2026
- Published by Springer Nature
- p. 332-346
Communication-Aware Intelligent Cooperative Search for Multi-UAV Systems in Blocked Regions
- 2 June 2026
- Published by Springer Nature
- p. 884-897
Accelerating UAV Swarm C2 Optimization via Neural-Enhanced Mixed-Integer Programming
- 2 June 2026
- Published by Springer Nature
- p. 884-897
Accelerating UAV Swarm C2 Optimization via Neural-Enhanced Mixed-Integer Programming
- Open Access
- 17 May 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (10) , 1722
A Dynamic Markov Reformulation of the Colonel Blotto Game Under Terminal Payoffs
The Colonel Blotto game is a classical model of competitive resource allocation, but equilibrium computation becomes difficult in heterogeneous and asymmetric instances. In this research, we study a finite-horizon dynamic reformulation in which players allocate resources sequentially over publicly observed stages, while the payoff depends only on terminal cumulative allocations. The purpose of the reformulation is not to change the primitive objective, but to represent the same terminal-payoff problem as a zero-sum Markov game. We first show that the dynamic formulation admits a pathwise payoff-equivalent Markov representation through telescoping rewards. Under a known finite horizon, costless carryover, and terminal-only payoff evaluation, the dynamic game and the corresponding static Blotto game have the same minimax value at every reachable continuation state. This is a value-equivalence result; it does not imply a one-to-one correspondence between static and dynamic equilibrium strategy sets. The proof is based on terminal-deferral upper and lower bounds for the two players. We also study action-independent geometric termination, for which the discounted telescoping return coincides exactly with the expected stopped terminal payoff, and we provide a probability-controlled mismatch bound for truncated stopping rules. Numerical finite-grid experiments illustrate the value identity and report residual diagnostics. The results clarify when sequential Markov representations preserve the original Blotto objective and when additional primitives, such as carryover depreciation or primitive flow payoffs, require separate analysis.
- 17 May 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (10) , 1722
Open AccessA Dynamic Markov Reformulation of the Colonel Blotto Game Under Terminal Payoffs
The Colonel Blotto game is a classical model of competitive resource allocation, but equilibrium computation becomes difficult in heterogeneous and asymmetric instances. In this research, we study a finite-horizon dynamic reformulation in which players allocate resources sequentially over publicly observed stages, while the payoff depends only on terminal cumulative allocations. The purpose of the reformulation is not to change the primitive objective, but to represent the same terminal-payoff problem as a zero-sum Markov game. We first show that the dynamic formulation admits a pathwise payoff-equivalent Markov representation through telescoping rewards. Under a known finite horizon, costless carryover, and terminal-only payoff evaluation, the dynamic game and the corresponding static Blotto game have the same minimax value at every reachable continuation state. This is a value-equivalence result; it does not imply a one-to-one correspondence between static and dynamic equilibrium strategy sets. The proof is based on terminal-deferral upper and lower bounds for the two players. We also study action-independent geometric termination, for which the discounted telescoping return coincides exactly with the expected stopped terminal payoff, and we provide a probability-controlled mismatch bound for truncated stopping rules. Numerical finite-grid experiments illustrate the value identity and report residual diagnostics. The results clarify when sequential Markov representations preserve the original Blotto objective and when additional primitives, such as carryover depreciation or primitive flow payoffs, require separate analysis.
- Open Access
- 29 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1500
Heterogeneous Multidimensional Colonel Blotto: Framework and Equilibrium Structure
Classical Colonel Blotto models predict smooth and monotone allocation patterns under a homogeneous-resource benchmark. This paper studies how heterogeneous technologies and partially irreversible deployment reshape equilibrium structure through a unifying reduced-form mechanism, which we call the induced cost geometry. In the compatible linear case developed in the main text, heterogeneous technologies and irreversibility generate battlefield-specific effective marginal costs , where is the endogenous shadow price of the global budget. We distinguish results that rely on this compatible linear representation from those that extend directly to the more general lower-envelope induced cost object. The induced cost object serves as the central organizing device for the equilibrium analysis and yields three main structural implications. First, under binding budgets, equilibrium effort can be sparse: positive effort is concentrated on battlefields whose effective marginal costs remain sufficiently low relative to their values, generating selective participation even under smooth contest success functions. Second, within a class of local fixed-support equilibrium configurations with binding budgets, an increase in a battlefield’s value can reduce equilibrium effort on that battlefield via the shadow-price channel—a mechanism-identification result for a specific structural regime rather than a general comparative-statics claim. Third, along durability paths, contestability and equilibrium support can exhibit discrete regime changes generated by technology switching within a finite lower-envelope cost structure. We develop a unified reduced-form characterization of equilibrium structure via induced costs and KKT conditions, highlighting how induced cost geometry reshapes both the intensive and extensive margins of strategic allocation within the equilibrium regimes characterized in the paper.- 29 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1500
Open AccessHeterogeneous Multidimensional Colonel Blotto: Framework and Equilibrium Structure
Classical Colonel Blotto models predict smooth and monotone allocation patterns under a homogeneous-resource benchmark. This paper studies how heterogeneous technologies and partially irreversible deployment reshape equilibrium structure through a unifying reduced-form mechanism, which we call the induced cost geometry. In the compatible linear case developed in the main text, heterogeneous technologies and irreversibility generate battlefield-specific effective marginal costs , where is the endogenous shadow price of the global budget. We distinguish results that rely on this compatible linear representation from those that extend directly to the more general lower-envelope induced cost object. The induced cost object serves as the central organizing device for the equilibrium analysis and yields three main structural implications. First, under binding budgets, equilibrium effort can be sparse: positive effort is concentrated on battlefields whose effective marginal costs remain sufficiently low relative to their values, generating selective participation even under smooth contest success functions. Second, within a class of local fixed-support equilibrium configurations with binding budgets, an increase in a battlefield’s value can reduce equilibrium effort on that battlefield via the shadow-price channel—a mechanism-identification result for a specific structural regime rather than a general comparative-statics claim. Third, along durability paths, contestability and equilibrium support can exhibit discrete regime changes generated by technology switching within a finite lower-envelope cost structure. We develop a unified reduced-form characterization of equilibrium structure via induced costs and KKT conditions, highlighting how induced cost geometry reshapes both the intensive and extensive margins of strategic allocation within the equilibrium regimes characterized in the paper. - Open Access
- 29 April 2026
- Published by MDPI AG in Electronics
- Vol. 15 (9) , 1875
AoI- and DS-Enhanced Cooperative Search for Multi-UAV Systems Under Spatially Structured Communication Constraints
Multi-UAV cooperative search is important for applications such as target reconnaissance, environmental monitoring, and emergency response. In practice, communication is often spatially heterogeneous due to terrain occlusion and environmental interference, which may delay information sharing and weaken coordination efficiency when UAVs traverse communication-blocked areas. To address this issue, we propose an Age of Information (AoI)- and Dempster–Shafer (DS)-enhanced cooperative search framework for multi-UAV systems under spatially structured communication constraints. Specifically, a DS belief map is introduced to fuse uncertain observations, while AoI is used to characterize the freshness of delayed information. An AoI-aware update mechanism further integrates buffered observations into the global belief map after communication recovery. The search process is then formulated as a communication-aware multi-agent sequential decision-making problem and solved using reinforcement learning. To demonstrate the generality of the proposed framework, we instantiate it with Proximal Policy Optimization (PPO), Multi-Agent Proximal Policy Optimization (MAPPO), and Q-value Mixing Network (QMIX). Experimental results show that the proposed framework consistently outperforms the baseline methods under heterogeneous environments and different communication conditions. Among all variants, AoI-DS-MAPPO achieves the best overall performance, improving average reward, success rate, and the number of detected targets by 26.13%, 24.32%, and 3.65%, respectively, while reducing episode length by 31.96% relative to the strongest baseline.
- 29 April 2026
- Published by MDPI AG in Electronics
- Vol. 15 (9) , 1875
Open AccessAoI- and DS-Enhanced Cooperative Search for Multi-UAV Systems Under Spatially Structured Communication Constraints
Multi-UAV cooperative search is important for applications such as target reconnaissance, environmental monitoring, and emergency response. In practice, communication is often spatially heterogeneous due to terrain occlusion and environmental interference, which may delay information sharing and weaken coordination efficiency when UAVs traverse communication-blocked areas. To address this issue, we propose an Age of Information (AoI)- and Dempster–Shafer (DS)-enhanced cooperative search framework for multi-UAV systems under spatially structured communication constraints. Specifically, a DS belief map is introduced to fuse uncertain observations, while AoI is used to characterize the freshness of delayed information. An AoI-aware update mechanism further integrates buffered observations into the global belief map after communication recovery. The search process is then formulated as a communication-aware multi-agent sequential decision-making problem and solved using reinforcement learning. To demonstrate the generality of the proposed framework, we instantiate it with Proximal Policy Optimization (PPO), Multi-Agent Proximal Policy Optimization (MAPPO), and Q-value Mixing Network (QMIX). Experimental results show that the proposed framework consistently outperforms the baseline methods under heterogeneous environments and different communication conditions. Among all variants, AoI-DS-MAPPO achieves the best overall performance, improving average reward, success rate, and the number of detected targets by 26.13%, 24.32%, and 3.65%, respectively, while reducing episode length by 31.96% relative to the strongest baseline.
- Open Access
Addressing Compatibility Challenges in Multi-Cloud Services: A Markov Chain-Based Service Recommendation Framework
Service recommendation aims to assist users in selecting appropriate services according to their requirements while ensuring seamless compatibility in modern cloud and edge computing environments. In dynamic multi-cloud scenarios, services are typically deployed across heterogeneous cloud platforms and are frequently reconfigured. However, most existing service recommendation approaches primarily focus on static compatibility aspects, such as service interfaces or communication protocols, while overlooking the dynamic characteristics of service interactions. However, several limitations can be identified. First, the lack of effective mechanisms for quantifying service compatibility in dynamic cloud environments often leads to degraded system efficiency. Second, the absence of dedicated multi-cloud service compatibility quantification methodologies restricts recommendation accuracy. Third, insufficient mathematical analysis with respect to uniqueness, feasibility, and correctness may result in unstable evaluation outcomes and additional computational overhead. To overcome these limitations, this paper presents McCom, a multi-cloud service recommendation framework designed to quantify service compatibility performance and address the aforementioned challenges. First, a novel Markov chain-based compatibility quantification model is developed to characterize service interactions in dynamic multi-cloud environments. By exploiting the homogeneity, irreducibility, and convergence properties of Markov chains, the proposed model enables stable and reliable compatibility assessment. Second, a multi-cloud compatibility quantification strategy is introduced to mitigate interference arising from complex service pools through refined filtering and sketching mechanisms. Third, a series of mathematical proofs are provided to rigorously demonstrate the feasibility, correctness, and uniqueness of the proposed quantification method. Extensive simulation results indicate that the proposed framework achieves significant performance improvements, including enhancements in recommendation quality (14.44% in F1 score), reductions in latency (40.68%), and increases in accuracy (50.85%), compared with existing state-of-the-art approaches.
Open AccessAddressing Compatibility Challenges in Multi-Cloud Services: A Markov Chain-Based Service Recommendation Framework
Service recommendation aims to assist users in selecting appropriate services according to their requirements while ensuring seamless compatibility in modern cloud and edge computing environments. In dynamic multi-cloud scenarios, services are typically deployed across heterogeneous cloud platforms and are frequently reconfigured. However, most existing service recommendation approaches primarily focus on static compatibility aspects, such as service interfaces or communication protocols, while overlooking the dynamic characteristics of service interactions. However, several limitations can be identified. First, the lack of effective mechanisms for quantifying service compatibility in dynamic cloud environments often leads to degraded system efficiency. Second, the absence of dedicated multi-cloud service compatibility quantification methodologies restricts recommendation accuracy. Third, insufficient mathematical analysis with respect to uniqueness, feasibility, and correctness may result in unstable evaluation outcomes and additional computational overhead. To overcome these limitations, this paper presents McCom, a multi-cloud service recommendation framework designed to quantify service compatibility performance and address the aforementioned challenges. First, a novel Markov chain-based compatibility quantification model is developed to characterize service interactions in dynamic multi-cloud environments. By exploiting the homogeneity, irreducibility, and convergence properties of Markov chains, the proposed model enables stable and reliable compatibility assessment. Second, a multi-cloud compatibility quantification strategy is introduced to mitigate interference arising from complex service pools through refined filtering and sketching mechanisms. Third, a series of mathematical proofs are provided to rigorously demonstrate the feasibility, correctness, and uniqueness of the proposed quantification method. Extensive simulation results indicate that the proposed framework achieves significant performance improvements, including enhancements in recommendation quality (14.44% in F1 score), reductions in latency (40.68%), and increases in accuracy (50.85%), compared with existing state-of-the-art approaches.
- Open Access
- 4 January 2026
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 10 (1) , 17
CBR2: A Case-Based Reasoning Framework with Dual Retrieval Guidance for Few-Shot KBQA
Recent advances in large language models (LLMs) have driven substantial progress in knowledge base question answering (KBQA), particularly under few-shot settings. However, symbolic program generation remains challenging due to its strict structural constraints and high sensitivity to generation errors. Existing few-shot methods often rely on multi-turn strategies, such as rule-based step-by-step reasoning or iterative self-correction, which introduce additional latency and exacerbate error propagation. We present CBR2, a case-based reasoning framework with dual retrieval guidance for single-pass symbolic program generation. Instead of generating programs interactively, CBR2 constructs a unified structure-aware prompt that integrates two complementary types of retrieval: (1) structured knowledge from ontologies and factual triples, and (2) reasoning exemplars retrieved via semantic and function-level similarity. A lightweight similarity model is trained to retrieve structurally aligned programs, enabling effective transfer of abstract reasoning patterns. Experiments on KQA Pro and MetaQA demonstrate that CBR2 achieves significant improvements in both accuracy and syntactic robustness. Specifically on KQA Pro, it boosts Hits@1 from 72.70% to 82.13% and reduces syntax errors by 25%, surpassing the previous few-shot state-of-the-art.
- 4 January 2026
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 10 (1) , 17
Open AccessCBR2: A Case-Based Reasoning Framework with Dual Retrieval Guidance for Few-Shot KBQA
Recent advances in large language models (LLMs) have driven substantial progress in knowledge base question answering (KBQA), particularly under few-shot settings. However, symbolic program generation remains challenging due to its strict structural constraints and high sensitivity to generation errors. Existing few-shot methods often rely on multi-turn strategies, such as rule-based step-by-step reasoning or iterative self-correction, which introduce additional latency and exacerbate error propagation. We present CBR2, a case-based reasoning framework with dual retrieval guidance for single-pass symbolic program generation. Instead of generating programs interactively, CBR2 constructs a unified structure-aware prompt that integrates two complementary types of retrieval: (1) structured knowledge from ontologies and factual triples, and (2) reasoning exemplars retrieved via semantic and function-level similarity. A lightweight similarity model is trained to retrieve structurally aligned programs, enabling effective transfer of abstract reasoning patterns. Experiments on KQA Pro and MetaQA demonstrate that CBR2 achieves significant improvements in both accuracy and syntactic robustness. Specifically on KQA Pro, it boosts Hits@1 from 72.70% to 82.13% and reduces syntax errors by 25%, surpassing the previous few-shot state-of-the-art.
- Open Access
- 16 November 2025
- Published by MDPI AG in Electronics
- Vol. 14 (22) , 4468
A Robust and Adaptive Service Recommendation Framework for Distinct Behavioral Services in Dynamic Multi-Cloud Environments
Effective service recommendation is essential in multi-cloud environments, directly influencing system performance, resource utilization, and service composition quality. However, existing methods often overlook key issues: (i) the inability to identify distinct behavioral services (DBS), leading to inaccurate or inefficient recommendations; (ii) the neglect of temporal dynamics in service behaviors, which results in unstable or outdated decisions; and (iii) the lack of effective strategies for handling cold-start and data sparsity, causing incomplete or biased scoring. To address these challenges, this study proposes a behavior-aware recommendation framework that explicitly integrates DBS characteristics. First, three types of DBS are defined and identified through a two-phase topology-based detection algorithm. Second, a sliding window with role-stability judgment is introduced to capture behavioral evolution and ensure consistent role labeling. Third, a Markov-based scoring model is designed to propagate compatibility scores across the invocation topology, enabling infrequently invoked services to obtain nonzero scores during early iterations. Extensive simulations demonstrate notable gains in accuracy and robustness, showing a 22.85% improvement in precision and a 41.69% improvement in F1-score, effectively mitigating cold-start and sparsity challenges.
- 16 November 2025
- Published by MDPI AG in Electronics
- Vol. 14 (22) , 4468
Open AccessA Robust and Adaptive Service Recommendation Framework for Distinct Behavioral Services in Dynamic Multi-Cloud Environments
Effective service recommendation is essential in multi-cloud environments, directly influencing system performance, resource utilization, and service composition quality. However, existing methods often overlook key issues: (i) the inability to identify distinct behavioral services (DBS), leading to inaccurate or inefficient recommendations; (ii) the neglect of temporal dynamics in service behaviors, which results in unstable or outdated decisions; and (iii) the lack of effective strategies for handling cold-start and data sparsity, causing incomplete or biased scoring. To address these challenges, this study proposes a behavior-aware recommendation framework that explicitly integrates DBS characteristics. First, three types of DBS are defined and identified through a two-phase topology-based detection algorithm. Second, a sliding window with role-stability judgment is introduced to capture behavioral evolution and ensure consistent role labeling. Third, a Markov-based scoring model is designed to propagate compatibility scores across the invocation topology, enabling infrequently invoked services to obtain nonzero scores during early iterations. Extensive simulations demonstrate notable gains in accuracy and robustness, showing a 22.85% improvement in precision and a 41.69% improvement in F1-score, effectively mitigating cold-start and sparsity challenges.