Search arXiv⌕ Search

arXiv subjects

Hao Jiang

Publications and source records attributed to Hao Jiang.

At least 55 records · Page 3Linked to original sources
arXiv2026

Joint Communication and Control Beamforming: A Closed-Loop Control Perspective

A joint communication and control (JCC) framework is proposed, where a base station (BS) simultaneously serves multiple communication users (CUs) and controls a physical plant in a closed loop. In the downlink, BS-generated control inputs are transmitted to and recovered at the plant, with wireless actuation distortion incorporated into the plant-state evolution. In the uplink, the plant state is reported to the BS and tracked by a Kalman filter (KF) for subsequent control-input generation. To characterize long-term control performance under communication-control interference, finite- and infinite-horizon linear quadratic Gaussian (LQG) costs are derived, directly linking beamforming design to plant-state evolution. JCC beamforming problems are then formulated for vector- and scalar-valued control inputs to minimize the infinite-horizon LQG cost subject to per-user communication signal-to-interference-plus-noise ratio (SINR) requirements. For the vector case, a second-order cone programming (SOCP)-based successive convex approximation method is developed for the resulting nonconvex problem. For the scalar case, a closed-form infinite-horizon LQG cost is derived, and the communication-control Pareto boundary is optimally characterized by an SOCP-based bisection method. Its optimality follows from the strict monotonicity of the scalar control cost with respect to the control SINR. Numerical results show that the derived costs closely match Monte Carlo simulations, the KF accurately tracks the ground-truth plant-state trajectory, and the proposed methods consistently outperform the zero-forcing benchmark. This confirms the benefit of balancing communication-control interference, especially with limited spatial degrees of freedom (DoFs).

eess.SP↗
arXiv2026

Finite-blocklength Fluid Antenna Systems

This paper investigates fluid antenna systems (FASs) subject to finite-blocklength (FBL) constraints, motivated by the strict reliability-latency and ultra-massive connectivity requirements of future wireless networks. While FAS performance has been widely studied in the asymptotic regime, its behavior under FBL remains largely unexplored. Our objective is to develop a unified set of analytical tools for evaluating FASs under FBL that remains applicable across different spatial-correlation models. First, to establish accurate benchmarks for non-orthogonal finite-length user signature design, we characterize both the average and the worst-case correlation coefficients via extreme value theory (EVT) and derive closed-form predictions of the achievable correlation levels. Second, taking block error rate (BLER) as the fundamental FBL metric, we study joint detection and decoding in FAS-assisted links and derive a closed-form BLER expression that is universally applicable across channel models. Additionally, we revisit outage probability (OP) in the FBL regime and obtain tractable OP characterizations for both FASs and conventional multiple fixed-position antenna (FPA) systems. In order to reduce the computational burden for multi-fold integrals in correlated fading models, we further propose a Taylor-expansion-assisted mean value theorem for integrals (MVTI), thus enabling efficient performance evaluation with marginal accuracy loss. Numerical results validate the analysis and reveal that even single-antenna FASs can have superior spatial diversity relative to conventional multi-FPA systems. Moreover, under both FBL and interference-limited environments, FASs provide improved energy, spectral, and hardware efficiencies, hence highlighting FAS as a promising enabler for next-generation wireless networks.

cs.IT↗
arXiv2026

A Survey of Pinching-Antenna Systems (PASS)

The pinching-antenna system (PASS), recently proposed as a flexible-antenna technology, has been regarded as a promising solution for several challenges in next-generation wireless networks. It provides large-scale antenna reconfiguration, establishes stable line-of-sight links, mitigates signal blockage, and exploits near-field advantages through its distinctive architecture. This article aims to present a comprehensive overview of the state of the art in PASS. The fundamental principles of PASS are first discussed, including its hardware architecture, circuit and physical models, and signal models. Several emerging PASS designs, such as segmented waveguide-enabled PASS (SWAN), center-fed PASS (C-PASS), and multi-mode PASS (M-PASS), are subsequently introduced, and their design features are discussed. In addition, the properties and promising applications of PASS for wireless sensing are reviewed. On this basis, recent progress in the performance analysis of PASS for both communications and sensing is surveyed, and the performance gains achieved by PASS are highlighted. Existing research contributions in optimization and machine learning are also summarized, with the practical challenges of beamforming and resource allocation being identified in relation to the unique transmission structure and propagation characteristics of PASS. Finally, several variants of PASS are presented, and key implementation challenges that remain open for future study are discussed.

eess.SP↗
arXiv2026

InfinityEdit: Infinite Video Editing with a Lightweight Edit-Ignition Adapter

With large pretrained models, existing methods have effectively improved instruction-based video editing. However, most of them rely on an in-place editing assumption. They align the edited video with the given source clip frame by frame over a fixed time span. This pattern fails for open-ended streams, e.g., restyling a live game or applying a camera move to an ongoing shot. In such cases, edits must extend to future frames as they arrive, rather than be applied to a static input clip. In this paper, we study this setting and name it infinite video editing: given a preceding segment and an edit request, a model must generate the next segment that continues the stream while applying the requested edit. This process repeats as an unbounded sequence of edit instructions arrives. This task brings two challenges: the edit must be a faithful continuation rather than a frame-wise rewrite, and generation quality must remain stable as edits accumulate. To address them, we first design a data-collection pipeline for infinite video editing. Based on the collected data, we propose InfinityEdit, a lightweight edit adapter that equips a streaming video generator with unbounded editing ability. The adapter contains three attention modules. History cross-attention guides the denoising frames using the input frames. Temporal causal self-attention keeps temporal cues flowing only from earlier frames to later ones. Edit cross-attention injects the edit request into generation. During inference, the adapter is activated only in the chunk where an edit request arrives. Subsequent chunks are generated by the original model with a reset anchor frame. This scheme applies the edit while preserving the original model's infinite generation ability. Extensive experiments show that InfinityEdit faithfully continues the stream under each edit, and stays stable over unbounded edit sequences.

cs.CV↗
arXiv2026

Frequency-Selective Pinching-Antenna Systems

An uplink pinching-antenna system (PASS) is considered, where a segmented dielectric waveguide is employed to serve multiple users and one pinching antenna (PA) is activated on each segment. Extensive waveguide deployment reduces user-to-PA path loss but also creates differential propagation delays among the PA-assisted paths spanning the large waveguide aperture. These delays are retained, and a Toeplitz block model is derived to characterize the resulting frequency-selective (FS) channel. For infinite-blocklength transmission, the achievable single-user rate and the multiuser sum-rates under joint and parallel decoding are characterized. For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate. The difference between the rates computed under the FF channel model and the exact FS channel model is referred to as the FF rate overestimation, and its dependence on the waveguide-aperture-induced delay spread is characterized. For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime. For finite-blocklength transmission, achievable rates are derived under a practical cyclic-prefix single-carrier frequency-domain equalization framework. An element-wise algorithm is developed to optimize FS-aware PA placement in both transmission regimes. The analytical findings demonstrate that differential delays across the extensively deployed waveguide can cause significant frequency selectivity and that the proposed FS-aware PA placement method substantially improves the achievable rate over placement based on the FF approximation, especially for large bandwidths and apertures.

eess.SP↗
arXiv2026

Impedance-Aware Zonal Port Activation for Fluid Antenna Arrays

Fluid antenna array (FAA) activation jointly determines the effective multi-user channel for precoding and the sparse physical aperture. Channel-oriented selection can concentrate high-gain ports and erode aperture quality, whereas geometry-oriented selection does not adapt to instantaneous channel state information (CSI). This paper formulates finite-port FAA activation as a rate--aperture--feasibility problem under an exact RF-chain budget. We propose impedance-aware zonal port activation (IA-ZPA), which couples compact CSI-conditioned port scoring with a checkerboard feasibility projection and inference-time mutual-impedance-aware selection. The learned scorer ranks ports, while the deterministic rule fixes the active aperture; a separate current-domain RZF backend then evaluates source-drive feasibility. Under a common induced-EMF protocol, IA-ZPA attains the largest constrained rate among the methods satisfying the prescribed mean-PSLL target with a substantially lower decision time than greedy selection.

cs.IT↗
arXiv2026

EM-Guided Graph Learning for Fluid Antenna Beamforming under Current-Domain Constraints

Fluid antenna arrays (FAAs) reconfigure a finite set of radiating ports within a prescribed aperture. In compact apertures, however, channel-driven placement may cluster ports, strengthen mutual coupling, degrade radiation conditioning, increase source-voltage demand, and produce uneven current loading. This paper studies downlink multi-user beamforming with jointly optimized port placement and current-domain transmission. An electromagnetic-guided graph network predicts port layouts from channel observations and refines them using geometric and mutual-impedance information. The training objective jointly considers communication performance and electromagnetic feasibility, while a common evaluation procedure is applied to all methods. The results show that, under a common feasibility standard, the proposed method provides a controllable tradeoff among communication rate, current loading, and configuration latency.

cs.IT↗
arXiv2026

SearchArt: Training Long-Horizon Search Agent with Scalable Synthetic and Verified Task

Recent advances in large language models (LLMs) have enabled search agents to autonomously tackle complex tasks across extended search and reasoning horizons. However, training effective search agents remains challenging due to the lack of scalable and long-horizon tasks, and the difficulty of evaluating and correcting intermediate reasoning and tool-use behaviors. We introduce SearchArt, a scalable framework for training long-horizon search agents through verification-driven task synthesis and a multi-stage post-training pipeline. SearchArt constructs large-scale datasets for complex search-, research- and user-oriented tasks by synthesizing diverse information-seeking QA pairs and corresponding search trajectories from web documents and automatically generated evidence graphs. To ensure the reliability of the synthesized data, we design a verification pipeline that jointly evaluates QA consistency, trajectory quality, and the relevance of retrieved evidence. The verified trajectories are subsequently used in a multi-stage training process comprising supervised fine-tuning and reinforcement learning-based policy optimization. Search agents trained with SearchArt exhibit adaptive search planning, iterative evidence aggregation, and complex reasoning over extended interaction horizons. Experimental results demonstrate that, with only (Qwen3.5-) 27B parameters, SearchArt scores 74.39 on BrowseComp-ZH, 70.06 on BrowseComp, and 52.55 on Deepresearch-bench, matching or surpassing frontier closed-source agents on both deepsearch and deepresearch benchmarks.

cs.IR↗
arXiv2026

Modeling and Performance Analysis for Fluid Antenna System Enabled UAV Near-Field Communications

Fluid antenna systems (FASs) offer a promising solution for unmanned aerial vehicle (UAV) air-to-ground (A2G) communications by enabling reconfigurable radiation characteristics. Addressing the limitations of traditional models in capturing the dynamic port configuration of FAS and the near-field nature of UAV communications, this paper proposes a dynamic port-reconfigurable near-field channel model for FAS-assisted UAV-to-mobile user (MU) links. Furthermore, we develop a FAS-adaptive subarray partition scheme utilizing a greedy strategy. By decomposing line-of-sight (LoS) and non-line-of-sight (NLoS) components and integrating UAV motion dynamics with FAS port activation states, the proposed model accurately characterizes the non-uniform spatial distribution of near-field channels. The subarray partition scheme dynamically groups active ports to satisfy near-field conditions while significantly reducing computational complexity, supported by a dynamic update algorithm that efficiently handles subarray adjustments during port switching. To avoid low effective gain and deep-fading ports in dense FAS configurations, a channel gain-based selection strategy is employed to prioritize high-gain ports. We derive and analyze the modeling accuracy and channel capacity, investigating the impact of FAS dimensions, port spacing, active port count, and UAV dynamics on system performance. Finally, the computational complexity of the subarray partition scheme is evaluated, verifying its advantages for real-time applications and providing a theoretical foundation for the design and analysis of FAS in dynamic scenarios.

cs.IT↗
arXiv2026

Generative Optimization for Incentivized Advertising with Global Level Constraints

Incentivized advertising allocates monetary or virtual rewards to drive user engagement, where a key challenge is optimizing continuous incentive magnitudes under strict global constraints. This problem is complicated by high-frequency interactions, delayed feedback, and non-Markovian user dynamics such as fatigue, which limit the effectiveness of existing uplift modeling and constrained reinforcement learning approaches. To address these challenges, we propose GOAL, a constraint-aware generative framework that formulates incentive allocation as a conditional sequence generation problem. GOAL directly generates incentive magnitudes conditioned on user histories and system-level global pressure, and integrates a hierarchical causal state encoder to capture both local behavioral dynamics and long-range dependencies. To enable flexible constraint control, we introduce \textbf{S}afe \textbf{C}onstrained \textbf{P}olicy \textbf{O}ptimization (SCPO), which learns a single generative policy that generalizes across a spectrum of ROI constraints without retraining. Experiments on large-scale real-world data and a synthetic fatigue-aware environment show that GOAL improves long-term revenue and user retention while substantially reducing ROI violation rates compared to strong baselines.

cs.LG↗
arXiv2026

Concurrent Prehensile and Nonprehensile Manipulation: A Practical Approach to Multi-Stage Dexterous Tasks

Dexterous hands enable concurrent prehensile and nonprehensile manipulation, such as holding one object while interacting with another, a capability essential for everyday tasks yet underexplored in robotics. Learning such long-horizon, contact-rich multi-stage behaviors is challenging because demonstrations are expensive to collect and end-to-end policies require substantial data to generalize across varied object geometries and placements. We present DexMulti, a sample-efficient approach for real-world dexterous multi-task manipulation that decomposes demonstrations into object-centric skills with well-defined temporal boundaries. Rather than learning monolithic policies, our method retrieves demonstrated skills based on current object geometry, aligns them to the observed object state using an uncertainty-aware estimator that tracks centroid and yaw, and executes them via a retrieve-align-execute paradigm. We evaluate on three multi-stage tasks requiring concurrent manipulation (Grasp + Pull, Grasp + Open, and Grasp + Grasp) across two dexterous hands (Allegro and LEAP) in over 1,000 real-world trials. Our approach achieves an average success rate of 66% on training objects with only 3-4 demonstrations per object, outperforming diffusion policy baselines by 2-3x while requiring far fewer demonstrations. Results demonstrate robust generalization to held-out objects and spatial variations up to +/-25 cm.

cs.RO↗
arXiv2026

Score-Based Turbo Message Passing for Plug-and-Play Compressive Imaging

Message-passing algorithms have been adapted for compressive imaging by incorporating various off-the-shelf image denoisers. However, these denoisers rely largely on generic or hand-crafted priors and often fall short in accurately capturing the complex statistical structure of natural images. As a result, traditional plug-and-play (PnP) methods often lead to suboptimal reconstruction, especially in highly underdetermined regimes. Recently, score-based generative models have emerged as a powerful framework for accurately characterizing sophisticated image distributions. Yet, their direct use for posterior sampling typically incurs prohibitive computational complexity. In this paper, by exploiting the close connection between score-based generative modeling and empirical Bayes denoising, we devise a message-passing framework that integrates a score-based minimum mean-squared error (MMSE) denoiser for compressive image recovery. The resulting algorithm, named score-based turbo message passing (STMP), combines the fast convergence of message passing with the expressive power of score-based generative priors. For practical systems with quantized measurements, we further propose quantized STMP (Q-STMP), which augments STMP with a component-wise MMSE dequantization module. We demonstrate that the asymptotic performance of STMP and Q-STMP can be accurately predicted by a set of state-evolution (SE) equations. Experiments on the FFHQ dataset demonstrate that STMP strikes a significantly better performance-complexity tradeoff compared with competing baselines, and that Q-STMP remains robust even under 1-bit quantization. Remarkably, both STMP and Q-STMP typically converge within 10 iterations.

cs.CV↗
arXiv2026

Interpretable Representation via LLM-Driven Generative Disentanglement for Local-Life Service Recommendation

While large language models (LLMs) have advanced ID-based recommendation through Semantic ID (SID) modeling, existing SID generation frameworks largely follow a single-representation-then-quantization paradigm. This design faces two bottlenecks: semantic entanglement mixes heterogeneous attributes, such as geography, brand, and category, causing information loss during quantization, low-quality SIDs, and severe collisions; moreover, black-box representation learning provides neither explicit attribute semantics nor clear geographic or semantic meanings for SID positions. These limitations weaken both retrieval reliability and the ability to diagnose or control SID generation. We propose Interpretable Representation via LLM-Driven Generative Disentanglement for Local-Life Service Recommendation (LGRID). LGRID introduces a generative disentanglement paradigm through an Encode -> Disentangle -> Align -> Quantize pipeline. It first uses joint LLM encoding to preserve cross-attribute geographic-semantic dependencies, rather than encoding fields independently. A Structured Disentangled Block then routes hidden states into attribute-aligned slots for geographic and semantic factors. Synergistic Alignment Learning makes these slots both generatively decodable and discriminative for retrieval, while Dual-Stream Residual Quantization separately discretizes the two streams into compact SIDs with explicit attribute correspondence. This design yields interpretable SIDs with positions grounded in item attributes and local-service semantics. Experiments on Kuaishou and Foursquare show that LGRID consistently outperforms strong SID baselines, achieving up to a 5.44 percent relative AUC gain. It also achieves over 99 percent attribute-decoding accuracy for coarse geographic fields and reduces the full-SID collision rate to 39.9 percent, compared with 97.0 percent for LGSID.

cs.IR↗
arXiv2026

Dual-Mode SERS and Colorimetric Sensor for Lung Cancer VOC-Biomarker Detection Using Hydrogel Patches

Hexanal, a volatile organic compound (VOC), is a potential biomarker for the early detection of lung cancer. In this study, we developed a dual-mode flexible biosensor that integrates surface-enhanced Raman scattering (SERS) and colorimetric detection for the quantitative analysis of hexanal in human exhaled breath. The biosensor employs Ag nanocubes wrapped with Co-Ni layered double hydroxide (AgNCs@Co-Ni LDH) as a functional matrix, offering both superior SERS enhancement and efficient VOC adsorption properties. To achieve selective detection, AgNCs@Co-Ni LDH were incorporated into agarose hydrogels along with 3-methyl-2-benzothiazolinone hydrazone (MBTH). The resulting MBTH-AgNCs@Co-Ni LDH/hydrogel-patch facilitate the oxidation of hexanal, enabling simultaneous colorimetric and SERS signal generation, while producing acrizine, a blue-colored reaction product. This hydrogel-based dual-mode sensing platform exhibits high selectivity, excellent stability, and precision in SERS-based hexanal detection. The detection limit for the SERS method was determined to be as low as 3.34x10-13 M. Furthermore, developed and optimized compact CNN-based multi-terminal intelligent recognition system for enhanced hydrogel-patch detection through AI-driven, portable, and real-time colorimetric analysis. Therefore, this work not only enables the effective detection of hexanal in the exhaled breath of suspected lung cancer patients, underscoring its potential for early lung cancer screening, but also establishes a foundation for the development of multimodal hydrogel biosensors for broader applications in disease diagnosis.

physics.med-ph↗
arXiv2026

Learned Blockwise Port Activation for Real Time Beamforming in Fluid Antenna Arrays

Fluid antenna arrays (FAAs), support multiuser downlink transmission by activating a subset of reconfigurable ports. The activation mask jointly determines the effective channel and the sparse radiating aperture, which requires a balance among sum rate, sidelobe suppression, hardware constraints, and online complexity. Channel driven selection can cluster active ports and increase sidelobes, whereas sidelobe oriented synthesis is typically channel independent and can sacrifice sum rate. This paper proposes learned blockwise port activation (L-BPA), for real time sidelobe aware FAA downlink beamforming. L-BPA activates a fixed number of ports in each aperture block, which supports grouped switching hardware and limits port clustering. A lightweight convolutional network scores ports using multiuser channel features, port coordinates, and user power statistics. Training combines blockwise straight through masks with a differentiable peak sidelobe level (PSLL), surrogate. During inference, learned scores are combined with multiscale geometric repulsion, followed by regularized zero forcing precoding over the reduced effective channel. L-BPA reduces the average PSLL by 3.26 dB relative to uniform sparse activation while achieving a slightly higher sum rate. It also reduces the PSLL by 8.13 dB and 10.10 dB relative to greedy and gain based selection, respectively, without iterative online search.

cs.IT↗
arXiv2026

AgentOmnia: Scaling Agentic Models for Full-Scenario Applications

Large language model agents have advanced rapidly, yet progress remains fragmented across domains, capabilities, task difficulty, and interaction settings. We frame this as full-scenario agentic scaling and present AgentOmnia, a framework coordinating task-space definition, data synthesis, post-training, evaluation, and improvement across To-Consumer (ToC), To-Business (ToB), and To-Employee (ToE) applications. An extensible Domain x Capability x Atomic Difficulty taxonomy aligns these stages and enables fine-grained diagnosis with OmniaBench. AgentOmnia combines bidirectional environment-task synthesis with tool-dependency, program-structured, and solver-based pipelines, constructing 5,018 stateful environments with 255,375 tools and 52,361 tasks. Programs, solvers, and verifiers provide correctness signals, while supervised fine-tuning, online agentic reinforcement learning, and a rollback curriculum support post-training. Evaluation failures translate into Product Requirement Documents (PRDs) for targeted self-evolution. Starting from Qwen3-30B-A3B-Thinking-2507, AgentOmnia raises the pass rate on the OmniaBench challenging subset from 9.16% to 37.11% and the macro-average across OmniaBench, $τ^2$-Bench, DeepPlanning, and VitaBench from 22.86% to 41.69%. Under a unified protocol,it leads the evaluated agentic post-trained baselines on OmniaBench and retains the highest four-benchmark macro-average. It also surpasses Qwen3-235B-A22B-Thinking-2507 on all four benchmarks and exceeds Qwen3.5-35B-A3B on the macro-average. Gains span three application splits, ten capability dimensions, eight atomic-difficulty factors, and 76 of 90 level-1 domains, indicating broad rather than category-specific improvement. A one-round study provides initial evidence for PRD-guided self-evolution, motivating validation at larger scales and in industrial settings.

cs.AI↗
arXiv2026

Electromagnetic-Aware Fluid Antenna Array

Fluid antenna arrays (FAAs) offer a promising means of exploiting spatial degrees of freedom through adaptive port positioning. However, most existing communication models treat antenna ports as independent channel samples and therefore overlook the electromagnetic coupling that fundamentally governs compact apertures. This paper develops an electromagnetic-aware current-domain framework for planar FAAs. The proposed model integrates position-dependent multiport impedance, mutual coupling, radiated and accepted power, source-voltage feasibility, and channel variations into a unified baseband-compatible description. The framework is implementation-agnostic: the closed-form half-wave-dipole model adopted in this paper is only one instance and can be replaced by full-wave, measured, or surrogate impedance and embedded-pattern models. Building on this framework, we formulate two optimization-oriented design problems. The first addresses single-beam superdirective beamforming through the joint optimization of port currents and positions under sidelobe, current, voltage, and geometry constraints. The second maximizes the multi-user weighted sum rate via current-domain precoding and position optimization under accepted-power, current, voltage, and spacing constraints. In both cases, the electromagnetic model is not applied as an after-design correction, but is incorporated directly into tractable alternating algorithms with convex current or precoding subproblems and reduced-gradient geometry updates. Simulation results demonstrate that, when properly modeled, mutual coupling can be exploited as a valuable design resource, enabling lower sidelobes and persistent sum-rate gains over fixed-grid and random fluid-antenna benchmarks.

cs.IT↗
arXiv2026

Conditional Generative Learning Enabled Wireless UAV Sensing and Tracking via Point Cloud Imaging

In this paper, we study an unmanned aerial vehicle (UAV) sensing and tracking problem, where a base station equipped with an antenna array continuously illuminates a flying UAV and exploits the reflected echoes for slot-wise point cloud imaging within its potential flight region. To accomplish this task, the imaging region for each slot is determined based on the prior of the historical UAV positions. Then, the UAV is represented by an electromagnetic point cloud in this region that contains its spatial information and electromagnetic properties (EPs), enabling the unified extraction of UAV position, attitude, and shape from the reconstructed point cloud. The EP point cloud imaging for the UAV based on echo signals is a complex inverse problem. To this end, we propose an Array-based Unified Generative UAV Sensing and Tracking (AUGUST) approach, which integrates a conditional channel encoding module and a generative decoding module. The encoding module incorporates position and signal-to-noise ratio embeddings to stabilize the UAV intrinsic feature extraction under fast UAV position and channel variations, and maps the encoded features to a latent space regularized by a learnable flow-based prior. The decoding module employs a diffusion model with a weighted training objective to reconstruct the UAV point cloud guided by the extracted features. The simulation results demonstrate that the reconstructed point clouds via the proposed AUGUST approach present higher fidelity compared to the benchmark schemes, thereby enabling a more accurate capture of the UAV attitude and shape information. The AUGUST approach also presents a substantial gain over the conventional model-based baseline in positioning performance.

eess.SP↗