SEARCH · Searcharxiv

Search Searcharxiv

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21Linked to original sources

arXiv2026

Beyond sensitivity: mechanism-resolved error budgets for designing quantum sensors

Quantum sensors are specified by a headline sensitivity, yet applications also demand accuracy and reliability. The dominant limiter of one metric is often known, but no method resolves how interacting mechanisms combine into a signed, per-mechanism budget for each metric. We introduce a framework that computes a sensor's sensitivity, accuracy, and robustness from one open-system simulation and attributes each to its limiting mechanism. For a nitrogen-vacancy diamond ensemble the attribution inverts across metrics: dephasing limits sensitivity, the thermal ground-state shift limits accuracy, and optical leakage limits robustness. At identical sensitivity the recovered-field bias spans $8$ to $1500$\,nT, so tuning to sensitivity alone can miss the accuracy target by two orders of magnitude. The same modeling transfers to a cesium optically pumped magnetometer recording a human magnetocardiogram. As a digital twin, it predicts the gain from addressing each limiter, so sensors can be designed to the required metrics.

quant-ph↗

arXiv2026

Targeted Power System Frequency Attack via the Selection of Maliciously Controlled Inverters

This paper studies how an adversary can execute a power system frequency attack by choosing the most effective subset of inverter-based resources (IBRs) as malicious control nodes. During the attack, the adversary controls the attacking devices to destabilize a group of designated target generators. The attack is designed by introducing an unstable oscillatory mode whose eigenvector has large components at the target generators and small components at the compromised IBRs. We formalize the optimal attacker selection problem and present an equivalent mixed-integer quadratically constrained program (MIQCP). To address this combinatorial nonconvex problem, we develop two heuristic algorithms by introducing a ranking metric. The attack process is demonstrated on a modified WSCC 179-bus system, with results verified through nonlinear dynamic simulations. We show that the proposed heuristics find optimal attacking sets in a majority of evaluated scenarios while significantly reducing the required computational time. Scenarios from the ACTIVSg500 system are used to further support our results. Finally, we discuss how selecting different eigenvalues, targets, and numbers of compromised devices impact the attack's severity.

eess.SY↗

arXiv2026

An Enclosed Mode Is a Gauge Choice: Topology Relative to Reach in Certified Code World Models

A code world model accepted by a sampling gate can be exactly right on everything the gate can see and arbitrarily wrong beyond it. We characterize what a certified model can know, and what its errors can cost, when the omission is an annular freeze mode enclosing an unreachable interior. The gate quotient makes the question precise: acceptance-with-certainty determines the model exactly on the reachable query set; beyond reach is gauge. On a minimal ring instrument we prove the extreme case (a wrong-topology filled-disc artifact unfalsifiable by any sampling gate and bitwise harmless at play) and measure, with LLM synthesis across three model families, how one knob (a channel of width gamma) walks the same artifact through three regimes: unfalsifiable-and-harmless, falsifiable-and-costly, and instantly falsified. Three principles organize the empirics. First, danger is topology relative to reach: a channel the planner can use collapses the blind model's exploitation (play cost 1.09 to ~0 over a knee at gamma ~ 0.1), while a hidden channel with the same first Betti number keeps it at full strength (1.12). Second, repair is parameter-bound and sensor-bound: no family recovers the region from outside evidence; from inside, models pose the right topology but cannot pin its parameters, and the posed topology tracks the guiding persistent-homology summary's wrong beta_1 (a sensor with a measured geometric resolution limit), not the truth. Third, mitigation must match the error's dimension and direction: point fences fail against the one-dimensional boundary, a dimension-matched persisted fence collapses exploitation to a two-lesson transient (0.999 to 0.058), and the dual freedom certificate collapses the invented-mode failure symmetrically (1.769 to 0.029). In n dimensions the shell makes misidentification near-certain while the danger stays fully exploitable: the two axes are independent.

cs.LG↗

arXiv2026

RoboPhys-3D: A Comprehensive Embodied World Model Evaluation via 3D Reconstruction

Video world models increasingly serve as data engines, action planners, and simulators for embodied AI, but conventional embodied world model (EWM) benchmarks lack a unified 3D-grounded protocol for establishing whether generated rollouts preserve the underlying 3D scene state or translate into executable actions. We introduce RoboPhys-3D, a 3D-grounded EWM benchmark built on RoboTwin 2.0, covering 50 manipulation tasks across four regimes, with 5,000 episodes and 25,000 multi-view ground-truth videos. A defining feature of RoboPhys-3D is that generated and ground-truth videos are processed through the same 3D reconstruction pipeline, enabling reconstruction-induced error to be distinguished from generation-induced error. The RoboPhys-3D benchmark organizes 50 complementary metrics into 18 sub-dimensions across four levels: pixel-level fidelity, 3D geometry consistency, state-level understanding, and task-level completeness. We further introduce Average Full Score, a hierarchical score averaging all 50 metrics for comprehensive evaluation, and RoboPhyscore, a compact task-aligned score averaging the metrics most strongly correlated with task success. Among the four representative video world models, Cosmos 3 achieves the highest RoboPhyscore (0.6330, 92.7% of ground truth), while state- and execution-grounded metrics reveal substantial failures that perceptual and vision-language model-based judgments fail to capture. RoboPhyscore further exhibits strong agreement with human evaluation (Pearson r = 0.9761 and Spearman \r{ho} = 0.8962), demonstrating the importance of grounded, execution-aware evaluation for EWM capability.

cs.RO↗

arXiv2026

Adversarial Calibration Attack on Autonomous Vehicles

Autonomous vehicles (AVs) rely on accurate camera-LiDAR calibration for multimodal sensor fusion. In practice, calibration can drift due to vibration, temperature variation, or minor sensor displacement, motivating online calibration algorithms that detect and correct misalignment at runtime while allowing the vehicle to continue operating without a factory visit. Existing AV attacks largely assume correct calibration. We instead identify online sensor calibration as a new attack plane. A corrupted calibration update can persist across subsequent fusion operations, causing system-wide errors that propagate from perception to planning and control. We present Adversarial Calibration Attack (ACA), the first physical attack against camera-LiDAR online calibration. Using a single adversarial poster, ACA first spoofs the miscalibration detector to trigger the calibration process and then steers the calibration estimator toward an incorrect transformation. A unified optimization jointly designs the poster's geometry and texture for both objectives. We evaluate ACA across benchmark datasets, simulation, and physical experiments. On benchmark datasets such as KITTI and nuScenes, ACA induces up to 33.9 degrees mean rotational calibration error, thereby severely degrading object detection. In the CARLA simulator, the attack causes a collision when the corrupted calibration is accepted in vulnerable scenarios crafted by the attacker. On a real Husky robot, a printed adversarial poster successfully reproduces the calibration error. These results demonstrate that online calibration is a practical and safety-critical attack surface for AVs.

cs.RO↗

arXiv2026

Hybrid Offline-Online Multi-Agent Decision Transformers for Wireless Resource Management

This paper develops a hybrid offline-online multi-agent reinforcement learning framework based on decision transformers. The policy is first pretrained offline via supervised sequence modeling of trajectories generated by existing policies, providing a safe and sample-efficient initialization. It is then fine-tuned online using a hybrid objective that incorporates critic-guided gradients, enabling performance improvements beyond the offline policy. To facilitate stable offline-to-online transfer and effective multi-agent coordination, the framework incorporates return-weighted sampling, a critic conditioned on neighbors' actions, and neighborhood-correlated exploration. The approach is fully distributed: both training and execution rely only on local observations and limited information exchange among neighboring agents. Evaluations with dynamic traffic arrivals in two settings: (i) joint scheduling and power allocation and (ii) coordinated beamforming, show that the proposed method achieves quality-of-service (QoS) performance comparable to centralized methods. Moreover, when pretrained on lower-quality datasets, online fine-tuning is also observed to surpass the initial offline policy. These results demonstrate a promising learning-based alternative for wireless resource management.

eess.SY↗

arXiv2026

Adaptive RIS-aided Communications through ML-based Generation of Phase Masks

Reconfigurable Intelligent Surfaces (RISs) are an attractive technology for Millimeter Wave (mmWave) communications due to their ability to passively reflect incident signals. However, current implementations of RIS rely on performing computationally-intensive algorithms offline to generate phase masks, which are stored as a codebook on the embedded microcontroller on the RIS. The codebook size is restricted by the embedded microcontroller's storage capacity, which limits the ability of the RIS to adapt to evolving channel conditions and deployment scenarios. In this demo, we showcase an Machine Learning (ML)-based solution for dynamically generating new phase masks during runtime. Our approach leverages a ML model deployed on the microcontroller for approximating the output of a phase mask generation algorithm, responding to new inputs while remaining smaller than a codebook.

eess.SY↗

arXiv2026

Modeling of Network Constraints in Large-scale Capacity Expansion Optimization of Power Grids

Capacity expansion modeling plays a critical role in optimizing the deployment of new generation, storage, and transmission, typically at national and regional levels. To support long-term planning, these models consider a large set of energy technologies and policies, along with decades of weather and demand data. Realistic capacity expansion models thus become high-dimensional optimization problems, with hundreds of millions of variables and constraints, which are challenging to solve. A common strategy to address this complexity is to omit non-linear, non-convex AC optimal power flow (ACOPF) constraints and instead use linearized power balance equations or transport formulations. While these simplifications improve tractability, they limit our understanding of how power flow and the physical properties of power networks impact investment decisions across generation, storage, and transmission infrastructure. This paper addresses this gap by extending the GenX capacity expansion model to incorporate fixed point theorem-based network constraints. These embed ACOPF-based considerations while maintaining the tractability of the planning model, nearly preserving the dimensionality of the transport formulation and incurring only modest runtime increases. This approach is much cheaper than embedding ACOPF directly, making it appropriate for large-scale capacity planning problems. We compare our approach to the original transport-based GenX model as well as a non-linear, non-convex version that incorporates the full ACOPF constraints, for a case study of the ISO New England grid.

math.OC↗

arXiv2026

Designing, Deployment and Field Testing of C2Stack for Networked Intelligent Software-Defined UAVs

Unmanned Aerial Vehicles (UAVs) are emerging as critical enablers of next-generation wireless networking and autonomous systems. Despite their potential, deploying and testing networked UAV systems in real-world environments remains challenging, largely due to the absence of well-developed, end-to-end, ready-to-use protocol stacks. To fill this gap, we present C2Stack, a configurable protocol stack and experimental framework designed for real-time control, evaluation, and optimization of UAV networks. C2Stack incorporates a modular control plane, referred to as the~C2Stack Network Operating System (CNOS), alongside a programmable data plane that exposes APIs for cross-layer algorithm development, digital twin integration, and autonomous swarm control. In this article, we share our experience with the deployment and testing of C2Stack. We implemented C2Stack on a custom UAV swarm platform that integrates multiprocessor system-on-chip (MPSoC) radios with Intel NUC computing modules, enabling interoperability with various RF front ends. Field trials were conducted in both netted environments and large-scale outdoor test ranges, focusing on two representative use cases: (i) network utility maximization through online reinforcement learning, and (ii) collaborative interference source localization. The experiments demonstrate the feasibility of real-time, data-driven optimization in dynamic aerial environments, while also revealing practical challenges in field deployments of networked UAV systems, including power constraints, sensing limitations, and deployment logistics. We have made C2Stack source code available to the community under the MIT License, with the goal of establishing it as a foundational framework for experimental research on intelligent networked aerial systems.

eess.SY↗

arXiv2026

SIMPNet: Spatial-Informed Motion Planning Network

Current robotic manipulators require fast and efficient motion-planning algorithms to operate in cluttered environments. State-of-the-art sampling-based motion planners struggle to scale to high-dimensional configuration spaces and are inefficient in complex environments. This inefficiency arises because these planners utilize either uniform or hand-crafted sampling heuristics within the configuration space. To address these challenges, we present the Spatial-informed Motion Planning Network (SIMPNet). SIMPNet consists of a stochastic graph neural network (GNN)-based sampling heuristic for informed sampling within the configuration space. The sampling heuristic of SIMPNet encodes the workspace embedding into the configuration space through a cross-attention mechanism. It encodes the manipulator's kinematic structure into a graph, which is used to generate informed samples within the framework of sampling-based motion planning algorithms. We have evaluated the performance of SIMPNet using a UR5e robotic manipulator operating within simple and complex workspaces, comparing it against baseline state-of-the-art motion planners. The evaluation results show the effectiveness and advantages of the proposed planner compared to the baseline planners. Project website: \href{https://davoodsz.github.io/simpnet/}{https://davoodsz.github.io/simpnet/}

cs.RO↗

arXiv2026

A Reproducible Method for Mapping Electricity Transmission Infrastructure for Space Weather Risk Assessment

Space weather risk assessment is constrained by the lack of available asset information needed to model geomagnetically induced currents (GICs) in electricity transmission infrastructure. We propose a systematic method that enables risk analysts to collect their own open-source substation data. Using a web browser platform for annotation, we convert OpenStreetMap (OSM) substation locations into high-resolution, component-level mappings of electricity transmission assets. We convert an initial 1,313 high-voltage (>=230 kV) substations to 52,273 components using low-altitude, satellite, and Street View imagery accessed through Google Earth, identifying 7,949 transformers. Compared to the OSM baseline, this approach provides detailed insights on voltage levels and substation configurations. We then construct a geospatial GIC network for the Tennessee Valley Authority (TVA) region, comparing May 2024 results with the University of Illinois Urbana-Champaign 150-bus (UIUC150) synthetic network and with measured ground GICs at 13 monitoring devices. The transformer types at unannotated substations and the grounding resistances are unknown, so we sample both across a Monte Carlo ensemble. This gives a median TVA 95th-percentile peak ground GIC of 29.1 A, with a 90 percent confidence interval of 23.9-36.1 A. The UIUC150 network yields a 95th-percentile peak ground GIC of 35.8 A under the same forcing, falling within this interval, and the modeled time series broadly capture the temporal morphology of the geomagnetic storm at the monitoring sites. This method shows promise for spatially explicit, screening-level GIC assessment without requiring access to operator data.

physics.geo-ph↗

arXiv2026

Constrained Parameter Update Law for Adaptive Control

In this paper, constrained parameter update laws for adaptive control are developed using barrier constraints. An interpretation of the parameter update law from a constrained optimization problem, in which a regularized Barrier saddle function is formulated to incorporate parameter constraints using inverse and logarithmic barrier functions from interior-point methods. The resulting constrained update law is integrated with an adaptive trajectory tracking controller, enabling online learning of the unknown system model parameters. Forward invariance of the parameter estimate is established and Lyapunov stability of the closed-loop system with the constrained parameter update law is derived. The effectiveness of the proposed constrained adaptive control law is demonstrated through simulations, which validate its ability to maintain parameter estimates within prescribed bounds while ensuring convergence to the true parameter values and achieving steady state tracking performance.

math.OC↗

arXiv2026

Scaling WiFi Sensing for Ubiquitous Home Monitoring: Lessons from Real-World Deployment on Millions of Devices

WiFi-based home monitoring offers compelling advantages over traditional camera and sensor solutions by leveraging existing wireless infrastructure for contactless, privacy-preserving and through-the-wall detection. This paper presents insights from developing and deploying a WiFi-based human monitoring system across real-world residential environments, addressing the gap between academic research and practical deployment. Through a two-year study involving 280 edge devices across 15 homes in 11 U.S. states, collecting over 4 million motion samples, we identify and address four critical deployment challenges previously underexplored in academic settings: (1) false positives from non-human motion sources (pets, robots) that degrade system reliability, (2) hardware heterogeneity in commercial IoT devices causing inconsistent CSI quality, (3) signal interference in multi-user environments limiting individual tracking capabilities, and (4) computational and bandwidth constraints preventing real-time edge processing. The deployed system integrates a biomechanics-based classifier that reduces non-human false alarms from 63.1\% to 8.4\%, a multi-layer sensing quality metric validating device suitability without environment-specific calibration, proximity-based multi-user detection leveraging distributed IoT devices, and a hybrid edge-cloud architecture with ACF-based compression achieving 99.72\% data reduction. The integrated system achieves 92.61\% human motion detection accuracy across diverse uncontrolled home environments. We have successfully deployed home monitoring technology on millions of WiFi routers nationwide and smart IoT devices (e.g., bulbs, plugs) worldwide, demonstrating its viability for large-scale real-world applications. We share these findings to guide future research toward deployable WiFi sensing systems.

eess.SP↗

arXiv2026

On Distributed Control of Continuum Swarms: Local Controllers as Differential Operators

We study the problem of distributed control of large-scale robotic swarms which can be modeled as continuum densities evolving under the continuity equation. We propose a formalization of distributed controllers as (generally nonlinear) spatial differential operators, in which control inputs depend only on local information about the state and environment. This perspective yields a fully local, PDE-based framework for analysis and design. We apply this framework to the problem of stabilizing a swarm density around an arbitrary target density, and investigate fundamental limitations of low-spatial-order distributed controllers in achieving this goal. In particular, we show that controllers which act in a purely pointwise manner are incompatible with natural system symmetries and strong forms of stability, and must rely on mixing-type behavior to achieve stabilization. In contrast, we present a simple first-order control law which achieves stabilization and enjoys substantially stronger properties.

eess.SY↗

arXiv2026

Competitive One-Step-Ahead Control of Friedkin--Johnsen Networks: Potential Games, Stability, and the Price of Competition

This paper studies competitive one-step-ahead control of Friedkin-Johnsen networks with overlapping player influence. The one-step interaction is an exact potential game with a unique Nash equilibrium obtained from a symmetric positive-definite system. Sequential best-response sweeps converge for every frozen network state, parallel sweeps obey an exact Jacobi condition (and always converge with two players), and one-sweep implementations require an augmented state-action stability test. For marginal networks, a signed left-right damping condition is sufficient for exact-equilibrium stability and becomes a sharp first-order instability test when its sign is reversed. A resolvent identity clarifies the feedback geometry, while a control-aware centrality identifies the goal conflicts that matter most. We characterize attainable equilibria under unconstrained, convex, and sparse goal restrictions and give a closed form for the same-state welfare loss caused by competition. Numerical examples verify the stability thresholds, geometry, and welfare predictions.

eess.SY↗

arXiv2026

From Generation to Discovery: Diffusion Mutation Kernels for Circuit and Physical Design

Generation and discovery are different problems. A generative model trained on valid artifacts reproduces a distribution, whereas discovery must produce artifacts that lie outside the observed corpus, satisfy hard structural constraints, and improve on established designs under evaluation that the model cannot influence. We introduce a diffusion-based discovery framework. Unlike conventional generative models that sample from learned distributions, it learns transition operators that transform existing artifacts into new candidates. Controlled partial re-noising followed by denoising defines a diffusion mutation kernel, a learned transition distribution that preserves the structural regularities of feasible designs while moving between regions of the design space. The learned model supplies feasibility structure only, and all correctness and performance judgments remain with external engineering tools. Intermediate diffusion trajectories are additionally monitored under a conformal risk budget so that unpromising candidates are discarded before expensive evaluation. We evaluate the framework on three electronic design spaces, an environment that supplies rigorous non-differentiable evaluators in the form of simulation, formal equivalence checking, and industrial physical implementation. The framework discovers 32-bit prefix adders that are formally verified equivalent to addition over all 2^64 input pairs and reduce delay by 17% and area by 18% relative to Kogge-Stone under a placed-and-timed flow; seven independently re-simulated amplifier topologies absent from the training corpus, spanning gains of 21.9-66.1 dB and bandwidths of 72.9 kHz-207 MHz; and macro placements on held-out netlists reaching 0.68x wirelength of an industrial placer.

eess.SY↗

arXiv2026

Horizon-Dependent Tube MPC for Elliptical-Orbit Rendezvous Under Mass Uncertainty

A spacecraft closing on a target from three hundred kilometres to contact flies one guidance law across five orders of magnitude of range, and a controller that is provably safe at close range can lose that guarantee completely at long range while continuing to fly as though nothing were wrong. This paper derives the range at which the guarantee lapses and uses it as a design rule. The bound compares the prediction model's own linearisation error against the disturbance set the controller was built to reject, and needs only the sampling period, the orbit and that disturbance bound, so it can be evaluated before any simulation. On a Mars Sample Return approach it disqualifies the homing phase, where most of the propellant is spent, and clears the other two. Re-posing the disqualified phase in relative orbital elements restores the guarantee; re-posing a phase the rule already clears, in a frame two orders of magnitude more accurate, changes propellant by under a tenth of one per cent, and it is that second prediction that makes the rule falsifiable rather than descriptive. The constraint tightening also ties the prediction horizon to feasibility, so the horizon search limit becomes a mission parameter rather than a solver setting. Against a reimplementation of a published benchmark that reproduces its propellant to within one per cent, over five hundred dispersed Monte Carlo transfers per case on matched seeds, the controller saves 29% of the propellant on a circular target orbit and 40% on an eccentric one, docking inside the 0.20 m capture requirement on essentially every draw at a median miss near 5 cm. Two results run the other way: the saving is bought with time of flight and computation, and it comes from what the guarantee demanded of the terminal condition rather than from better disturbance rejection. Recursive feasibility and asymptotic stability are not claimed.

eess.SY↗

arXiv2026

Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming

Generalized disjunctive programming (GDP) expresses mixed discrete-continuous decisions through Boolean indicators and disjunctions, and can be systematically solved via a library of methods proposed in the literature. The recent InfiniteGDP abstraction lifts this modeling layer to continuous domains such as time, space, and uncertainty, but only the big-M and hull reformulations, the two endpoints of the relaxation spectrum, have been generalized to the infinite setting. This work closes this gap by generalizing four other GDP solution methods to infinite-dimensional optimization: the multiple big-M reformulation, P-split reformulation, cutting plane reformulation, and the logic-based outer approximation algorithm. It further proposes MBM-GP, a novel Gaussian-process variant of multiple big-M that learns the big-M function over the infinite domain from a small subset of the subproblem solves. Moreover, these approaches are implemented in the Julia package InfiniteDisjunctiveProgramming.jl. The methods are benchmarked on case studies arising in dynamic and stochastic optimization. The results demonstrate how the generalized solution methods can outperform big-M and hull, with MBM-GP retaining the tightness of multiple big-M at a fraction of its reformulation cost.

math.OC↗