arXiv subjects

Bo Ai

Publications and source records attributed to Bo Ai.

At least 19 recordsLinked to original sources

arXiv2026

A Hybrid Model-Assisted Approach for Path Loss Prediction in Suburban Scenarios

Accurate path loss prediction is crucial for wireless network planning and optimization in suburban environments with complex terrain variation and diverse land cover. This paper proposes a model assisted hybrid path loss prediction method that introduces an environment adaptive compensation on top of the classic close-in free-space reference distance (CI) path loss model. By jointly predicting the path loss exponent and a compensation term, the proposed approach dynamically adjusts the empirical trend. To improve the effectiveness of environmental representation, three environmental image organization schemes are constructed and evaluated. Experiments on measurement data collected in Pingtan Island show that the proposed method outperforms the CI model and a conventional model assisted baseline, achieving a test root mean square error of 4.04 dB.

eess.SP↗

arXiv2026

An OTFS Waveform-Based Delay-Doppler Domain Channel Measurement Method for High-Mobility Scenarios

Channel measurements are the prerequisite for applying emerging transmission technologies and designing communication systems. Conventional time or frequency domain channel measurement methods cannot directly obtain Doppler information induced by high-mobility scenarios. The channel spreading function (CSF) simultaneously captures delay and Doppler information while naturally characterizing the propagation environment in the delay-Doppler (DD) domain. However, DD domain channel measurement methods remain underexplored. This paper presents an orthogonal time frequency space (OTFS) waveform-based DD domain channel measurement method for high-mobility scenarios. A native OTFS waveform, employed as the sounding signal, is designed for the first time, and its sounding capability is comprehensively analyzed. Next, we detail the methodology of DD domain channel measurement, including synchronization and CSF estimation. To enhance measurement precision, a joint fractional delay and Doppler shift estimation algorithm is proposed, and the overall performance of the proposed method is evaluated. Subsequently, a practical DD domain channel measurement system is established, followed by system calibration and verification. Finally, DD domain channel measurements are conducted in vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) scenarios. Measurement results, including the CSF and other small-scale fading characteristics, confirm the effectiveness of the proposed method and offer valuable insights for advancing research on high-mobility communications.

eess.SP↗

arXiv2026

Secure Coverage Enhancement in Aerial Reconfigurable Intelligent Surface-Assisted High-Speed Train Communication Systems

High-speed trains (HSTs) have become a prominent means of transportation, requiring high data rates and reliable communication services for HST passengers. However, the wireless channels in HST communication systems are susceptible to various security threats, including eavesdropping. Addressing these security concerns is therefore of critical importance. One promising technology for enhancing security is the integration of a reconfigurable intelligent surface (RIS) on an unmanned aerial vehicle, referred to as an aerial reconfigurable intelligent surface (ARIS). This technology offers significant potential for improving wireless network performance, though it also introduces unique challenges in terms of physical layer security (PLS). This paper investigates the PLS of ARIS-aided HST communication systems. A problem of maximizing the weighted sum secrecy rate is formulated by jointly optimizing the active beamforming at the base station (BS) and the phase shift at the ARIS, subject to constrains on the BS transmit power and the unit modulus of the ARIS reflecting coefficient. To address this problem, a joint optimization algorithm is proposed using the block coordinate descent method. Specifically, the problem is decomposed into two subproblems: active beamforming design and ARIS phase shift optimization. The active beamforming is optimally designed via the successive convex approximation technique, while the ARIS phase shift is efficiently updated using the alternating direction method of multipliers technique. Simulation results demonstrate the rapid convergence of the proposed algorithm, which achieves a higher secrecy rate compared to existing methods in the literature.

cs.IT↗

arXiv2026

Rapid Embodiment Adaptation for Quadrupedal Locomotion

Humans readily adapt their movements as their bodies change through aging, injury, or load carrying, but learning-based robot policies often break when hardware properties shift. We introduce an online embodiment adaptation framework for quadrupedal locomotion that infers embodiment parameters from short interaction histories and conditions control on the inferred hardware state. Our method pairs a generalist policy trained under embodiment randomization with a lightweight adaptation module that identifies physical changes within half a second. We evaluate two representative forms of embodiment variation: joint-range constraints and trunk-mass changes, corresponding to joint-level kinematic degradation and body-level dynamic variation. In simulation, the module accurately estimates these changes and enables closed-loop control that substantially outperforms policies conditioned directly on interaction history. On a real Unitree Go2 robot, our system maintains stable locomotion under severe instances of the evaluated changes, including a fully locked leg and a 5 kg payload, where non-adaptive methods fail. These results demonstrate the practicality of explicit online embodiment identification for rapid adaptation to joint-limit and payload-mass changes, and provide a step toward handling broader forms of uncertain, degraded, or changing robot hardware.

cs.RO↗

arXiv2026

TALSC: Timeliness-Aware Large-Small VLM Collaboration for Infrastructure-Assisted Autonomous Driving

The deployment of Vision-Language Models (VLMs) in autonomous driving (AD) systems is constrained by on-board computing power, restricting vehicles to small VLMs (SVLMs) with limited perception and reasoning capabilities. Infrastructure-assisted AD alleviates this resource constraint by enabling collaboration with large VLMs (LVLMs) at edge servers. However, in dynamic vehicular environments, the utility of sensory data for downstream tasks decays rapidly, making timeliness of information a critical concern. To balance the accuracy gains of LVLMs with their latency-induced timeliness degradation, we develop a Timeliness-Aware Large-Small VLM Collaboration (TALSC) framework. Specifically, we first model the Age of Information (AoI) evolution for VLM inference and characterize the coupling among AoI, token length, and task performance to formulate a general timeliness metric. Building on this, we propose the TALSC online scheduling algorithm. Since scheduling decisions have a delayed impact on future timeliness metric and the output token number is unknown at scheduling time, we design a Lyapunov drift-plus-estimated-penalty algorithm and provides a guaranteed performance. In simulation, we first conduct a case study to derive a fitted timeliness metric based on nuScenes dataset, and further show that TALSC outperforms baselines under various communication and computing settings, achieving up to a 12.6\% normalized improvement in Micro-F1 score compared with the best-performing baseline.

cs.DC↗

arXiv2026

Scaling Cross-Embodiment World Models for Dexterous Manipulation

Cross-embodiment learning seeks to build generalist robots that learn from and operate across diverse morphologies, but differences in kinematics and action spaces hinder data sharing and control transfer. We ask: What structure can be shared across embodiments despite these differences? We argue that the physical interactions they induce can be modeled in a shared geometric space, allowing world models to provide a common interface for learning and control. To realize this idea, we represent human and robot hands as sets of 3D particles and define actions as end-effector particle displacement fields. This representation abstracts away embodiment-specific joint spaces while preserving the geometry and motion relevant to physical interaction. We train a graph-based world model on random interaction data from diverse simulated robot hands and real human hands, and integrate it with model-predictive control for deployment on new hardware. Experiments on rigid and deformable manipulation reveal three findings: increasing the diversity of training embodiments improves generalization to unseen hands; appropriately combining simulated and real-world data outperforms either source alone; and the same learned model enables effective control on robotic hands with distinct kinematics and degrees of freedom. These results position particle-based world models as a shared interface for learning from and for heterogeneous embodiments.

cs.RO↗

arXiv2026

LEOSTP: A Spatio-Temporal Traffic Prediction Framework for LEO Satellite Networks

With the evolution of next-generation mobile communication networks and the commercial boom of Low Earth Orbit (LEO) satellites, globally covered satellite networks are gradually becoming a crucial infrastructure for massive user access and seamless connectivity. Accurate traffic prediction is crucial for maintaining the quality of service (QoS) and resource allocation efficiency in satellite networks. However, existing methods struggle to effectively address the three major challenges of LEO networks: highly complex temporal dynamics caused by satellite cross-regional movement, multivariate dependencies in multi-satellite collaboration, and strong spatial heterogeneity driven by user distribution, human activity intensity, and local geographic environments. In this article, we propose a LEO Satellite Traffic Predictor (LEOSTP) framework, a diffusion model-based end-to-end model that forecasts future satellite traffic by jointly leveraging historical traffic patterns and contextual characteristics of the corresponding service regions. The framework consists of two core modules: 1) The general traffic feature extractor module combines the diffusion process with a Transformer architecture to model the multi-scale temporal features of the traffic itself. 2) The external condition encoder module integrates geographic semantic information such as population distribution, point-of-interest (POI) distribution, and local time into the prediction process through a Transformer-based encoder. In this way, the model captures the deep correlation between the external environment and traffic dynamics. Experimental results based on large-scale simulated constellation data show that LEOSTP significantly outperforms traditional statistical models such as ARIMA and SVR, and classical sequence models including LSTM and Transformer, in prediction accuracy.

cs.IT↗

arXiv2026

Center-Fed Pinching Antenna System for Uplink Environment Sensing

A center-fed pinching antenna system (C-PASS)-enabled uplink environment sensing framework is proposed. Through the center-fed framework, doubled degrees of freedom is achieved compared to conventional end-fed PASS. Based on this, we consider an uplink sensing scenario, in which a linear inverse model is developed to reconstruct the environment through signals scattered by the environment object. In the proposed framework, the distance between the feed points for stable separation of the received signals is characterized in closed form. Furthermore, Ziv-Zakai bound (ZZB) expressions for the mean-squared reconstruction error are derived for C-PASS and end-fed PASS. Based on these theoretical results, it can be proved that C-PASS achieves a strictly lower reconstruction error bound than conventional PASS for uplink environment sensing. Finally, numerical results validate the accuracy of the derived ZZB expressions and 1) demonstrate that C-PASS provides more stable separation of the received signals, and 2) confirm the consistent performance advantages of C-PASS.

cs.IT↗

arXiv2026

Delay-Doppler Domain Channel Measurements and Modeling in High-Speed Railways

As next-generation wireless communication systems need to be able to operate in high-frequency bands and high-mobility scenarios, delay-Doppler (DD) domain multicarrier (DDMC) modulation schemes, such as orthogonal time frequency space (OTFS), demonstrate superior reliability over orthogonal frequency division multiplexing (OFDM). Accurate DD domain channel modeling is essential for DDMC system design. However, since traditional channel modeling approaches are mainly confined to time, frequency, and space domains, the principles of DD domain channel modeling remain poorly studied. To address this issue, we propose a systematic DD domain channel measurement and modeling methodology in high-speed railway (HSR) scenarios. First, we design a DD domain channel measurement method based on the long-term evolution for railway (LTE-R) system. Second, for DD domain channel modeling, we investigate quasi-stationary interval, statistical power modeling of multipath components, and particularly, the quasi-invariant intervals of DD domain channel fading coefficients. Third, via LTE-R measurements at 371 km/h, taking the quasi-stationary interval as the decision criterion, we establish DD domain channel models under different channel time-varying conditions in HSR scenarios. Fourth, the accuracy of proposed DD domain channel models is validated via bit error rate comparison of OTFS transmission. In addition, simulation verifies that in HSR scenario, the quasi-invariant interval of DD domain channel fading coefficient is on millisecond (ms) order of magnitude, which is much smaller than the quasi-stationary interval length on 100 ms order of magnitude. This study could provide theoretical guidance for DD domain modeling in high-mobility environments, supporting future DDMC and integrated sensing and communication designs for 6G and beyond.

eess.SP↗

arXiv2026

Robust Driving Control for Autonomous Vehicles: An Intelligent General-sum Constrained Adversarial Reinforcement Learning Approach

Deep reinforcement learning (DRL) has demonstrated remarkable success in developing autonomous driving policies. However, its vulnerability to adversarial attacks remains a critical barrier to real-world deployment. Although existing robust methods have achieved success, they still suffer from three key issues: (i) these methods are trained against myopic adversarial attacks, limiting their abilities to respond to more strategic threats, (ii) they have trouble causing truly safety-critical events (e.g., collisions), but instead often result in minor consequences, and (iii) these methods can introduce learning instability and policy drift during training due to the lack of robust constraints. To address these issues, we propose Intelligent General-sum Constrained Adversarial Reinforcement Learning (IGCARL), a novel robust autonomous driving approach that consists of a strategic targeted adversary and a robust driving agent. The strategic targeted adversary is designed to leverage the temporal decision-making capabilities of DRL to execute strategically coordinated multi-step attacks. In addition, it explicitly focuses on inducing safety-critical events by adopting a general-sum objective. The robust driving agent learns by interacting with the adversary to develop a robust autonomous driving policy against adversarial attacks. To ensure stable learning in adversarial environments and to mitigate policy drift caused by attacks, the agent is optimized under a constrained formulation. Extensive experiments show that IGCARL improves the success rate by at least 27.9% over state-of-the-art methods, demonstrating superior robustness to adversarial attacks and enhancing the safety and reliability of DRL-based autonomous driving.

cs.LG↗

arXiv2026

AnyHand: A Large-Scale Synthetic Dataset for RGB(-D) Hand Pose Estimation

We present AnyHand, a large-scale synthetic dataset designed to advance the state of the art in 3D hand pose estimation. While recent works with foundation approaches have shown that scaling training data markedly improves hand pose estimation, existing real-world datasets are limited in coverage, and prior synthetic datasets rarely provide occlusions, arm details, and aligned depth together at scale. To address this bottleneck, our proposed AnyHand contains 2.5M single-hand and 4.1M hand-object interaction RGB-D images, with rich geometric annotations. We show that extending the original training data recipes of existing RGB baselines with AnyHand yields significant gains on multiple benchmarks (FreiHAND and HO-3D), even when keeping the architectures and training schemes fixed. Together with extensive ablations on the scale and composition of the training data setups, these results suggest that training data diversity and quality are as critical as scale for advancing hand pose estimation. We further examine the utility of AnyHand's aligned depth maps in the appendix, showing that scaling RGB-D supervision with AnyHand allows a lightweight depth-fusion variant of existing RGB baselines to outperform prior RGB-D methods.

cs.CV↗

arXiv2026

Dual-Waveguide Pinching Antennas for PLS: Parallel Placement or Orthogonal Placement?

Pinching antennas (PAs), as an emerging flexible-antenna technology, enables movable PAs deployed along waveguides to customize channel conditions over a large scale. This paper investigates an application of PAs to enable physical-layer security (PLS) by enlarging the channel condition diversity between legitimate users (LUs) and eavesdroppers (Eves). Particularly, we focus on the dual-waveguide scenario, where the two waveguides employs multiple PAs to serve multiple LUs in the presence of an Eve. Specifically, we consider two waveguide placement strategies, i.e., parallel placement and orthogonal placement. Meanwhile, we incorporate two channel models, i.e., in-waveguide phase shifts, and in-waveguide phase shifts and attenuation. We formulate the secure sum rate (SSR) and secure energy efficiency (SEE) maximization problems, and propose a two-stage algorithm to solve them. The first stage adopts a particle swarm optimization (PSO) method with an improved feasibility module, termed FeaPSO, for PA placement, and the second stage employs the successive convex approximate (SCA) method to optimize beamforming and artificial noise vectors. Furthermore, we conduct numerical comparisons between the two placement strategies in terms of average performance and a special case where an Eve is positioned in front of LUs. Numerical results validate the effectiveness of the proposed algorithm and demonstrate that PAs can significantly improve both SSR and SEE. Additionally, the necessity of orthogonal waveguide placement is explicitly verified.

eess.SP↗

arXiv2026

BERT4beam: Large AI Model Enabled Generalized Beamforming Optimization

Artificial intelligence (AI) is anticipated to emerge as a pivotal enabler for the forthcoming sixth-generation (6G) wireless communication systems. However, current research efforts regarding large AI models for wireless communications primarily focus on fine-tuning pre-trained large language models (LLMs) for specific tasks. This paper investigates the large-scale AI model designed for beamforming optimization to adapt and generalize to diverse tasks defined by system utilities and scales. We propose a novel framework based on bidirectional encoder representations from transformers (BERT), termed BERT4beam. We aim to formulate the beamforming optimization problem as a token-level sequence learning task, perform tokenization of the channel state information, construct the BERT model, and conduct task-specific pre-training and fine-tuning strategies. Based on the framework, we propose two BERT-based approaches for single-task and multi-task beamforming optimization, respectively. Both approaches are generalizable for varying user scales. Moreover, the former can adapt to varying system utilities and antenna configurations by re-configuring the input and output module of the BERT model, while the latter, termed UBERT, can directly generalize to diverse tasks, due to a finer-grained tokenization strategy. Extensive simulation results demonstrate that the two proposed approaches can achieve near-optimal performance and outperform existing AI models across various beamforming optimization tasks, showcasing strong adaptability and generalizability.

eess.SY↗

arXiv2026

GNN-Enabled Robust Hybrid Beamforming with Score-Based CSI Generation and Denoising

Accurate Channel State Information (CSI) is critical for Hybrid Beamforming (HBF) tasks. However, obtaining high-resolution CSI remains challenging in practical wireless communication systems. To address this issue, we propose to utilize Graph Neural Networks (GNNs) and score-based generative models to enable robust HBF under imperfect CSI conditions. Firstly, we develop the Hybrid Message Graph Attention Network (HMGAT) which updates both node and edge features through node-level and edge-level message passing. Secondly, we design a Bidirectional Encoder Representations from Transformers (BERT)-based Noise Conditional Score Network (NCSN) to learn the distribution of high-resolution CSI, facilitating CSI generation and data augmentation to further improve HMGAT's performance. Finally, we present a Denoising Score Network (DSN) framework and its instantiation, termed DeBERT, which can denoise imperfect CSI under arbitrary channel error levels, thereby facilitating robust HBF. Experiments on DeepMIMO urban datasets demonstrate the proposed models' superior generalization, scalability, and robustness across various HBF tasks with perfect and imperfect CSI.

eess.SY↗

arXiv2026

ComHymba: Low-Complexity Domain-Informed Foundation Model for Wireless Communications

Wireless foundation models are a promising route to unify channel reconstruction, sensing, and beam management in future wireless communication systems, but existing designs often inherit LLM-style Transformers with quadratic token complexity and weak integration of propagation priors. This paper proposes ComHymba, a domain-informed wireless foundation model built on an asymmetric masked autoencoder for large-scale self-supervised pre-training on Channel State Information (CSI). ComHymba introduces (i) 3D spatio-temporal-frequency patchification with rotary positional embedding, (ii) domain-informed masking strategies that emulate realistic CSI sparsity and fading patterns, and (iii) a decoupled amplitude--phase weighted objective tailored to channel statistics. Architecturally, we employ Hymba blocks that fuse windowed self-attention with state space models (SSMs), enabling linear-time modeling with respect to the overall channel input size. Experiments on eight downstream tasks spanning channel state information reconstruction, environmental sensing, and beam management show consistent accuracy gains over strong task-specific baselines, together with up to a $3.3\times$ inference speedup versus Transformer backbones. Overall, ComHymba provides a scalable and efficient backbone for AI-native physical-layer intelligence.

eess.SP↗

arXiv2026

GELATO: Generative Entropy- and Lyapunov-based Adaptive Token Offloading for Device-Edge Speculative LLM Inference

The recent growth of on-device Large Language Model (LLM) inference has driven significant interest in device-edge collaborative LLM inference. As a promising architecture, Speculative Decoding (SD) is increasingly adopted where a lightweight draft model rapidly generates candidate tokens to be verified by a powerful target model. However, a fundamental challenge lies in achieving per-token resource scheduling to effectively adapt SD paradigm to resource-constrained edge environment. This paper proposes a Generative Entropy- and Lyapunov-based Adaptive Token Offloading framework, named GELATO, to maximize decoding throughput under energy constraints in a device-edge collaborative SD system. Specifically, an outer drift-plus-penalty loop makes online decisions to establish a reference drafting budget, managing long-term energy-throughput trade-off. Further, a nested entropy-driven generation mechanism executes early exiting to adapt to per-token dynamic generative uncertainty. Theoretical analysis establishes a rigorous performance bound on long-term throughput for GELATO. Extensive evaluations demonstrate that GELATO achieves a globally optimal tradeoff, outperforming state-of-the-art distributed SD architectures by 64.98% in token throughput and reducing energy consumption by 47.47% under resource-constrained environments, while preserving LLM decoding quality.

cs.NI↗

arXiv2026

Delay-Doppler Domain Signal Processing Aided OFDM (DD-a-OFDM) for 6G and Beyond

High-mobility scenarios will be a critical part of 6G systems. Since the widely deployed orthogonal frequency division multiplexing (OFDM) waveform suffers from subcarrier orthogonality loss under severe Doppler spread, delay-Doppler domain multi-carrier (DDMC) modulation systems, such as orthogonal time frequency space (OTFS), have been extensively studied. While OTFS can exploit time-frequency (TF) domain channel diversity, it faces challenges including high receiver complexity and inflexible TF resource allocation, making OFDM still the most promising waveform for 6G. In this article, we propose a DD domain signal processing-aided OFDM (DD-a-OFDM) scheme to enhance OFDM performance based on DDMC research insights. First, we design a DD-a-OFDM system structure, retaining the classical OFDM transceiver while incorporating DD domain channel estimation and TF domain equalization. Second, we detail DD domain channel estimation using discrete TF pilots and prove that TF domain inter-carrier interference (ICI) could be transformed into DD domain Gaussian interference. Third, we derive closed-form Cramér-Rao lower bounds (CRLBs) for DD domain channel estimation. Fourth, we develop maximum likelihood (ML) and peak detection-based channel estimators, along with a corresponding TF domain equalizer. Numerical results verify the proposed design, showing that DD-a-OFDM reduces the bit-error rate (BER) compared to classical OFDM and outperforms OTFS in channel estimation accuracy with lower pilot overhead.

eess.SP↗

arXiv2026

Spectral- and Energy-efficient Multi-BS Multi-RIS Pinching-antenna Systems: A GNN-based Approach

This paper investigates coordinated downlink transmission in a multi-base station (multi-BS) multi-reconfigurable intelligent surface (multi-RIS)-assisted pinching-antenna (PA) system, where each user equipment (UE) is associated with a single BS and each BS is equipped with movable PAs deployed on parallel waveguides. We formulate sum rate (SR) and energy efficiency (EE) maximization problems by jointly optimizing PA placement, RIS phase shifts, transmit beamforming, and BS-UE association under constraints of inter-PA spacing, power budget, and unit-modulus phase shift. To address the resulting highly coupled mixed-variable problem, we propose a three-stage graph neural network (GNN) that integrates heterogeneous and homogeneous graph representations and is trained end-to-end in an unsupervised manner. Extensive numerical results demonstrate that the proposed three-stage GNN consistently outperforms representative system and learning baselines, generalizes well to unseen numbers of UEs, RISs, and BSs, and maintains millisecond-level inference time. Besides, the results validate the effectiveness of the proposed design from both system and architectural perspectives. Moreover, PAs are shown to enhance SR and EE, and the performance gain is enlarged with increasing number of PAs.

eess.SP↗