Search arXivSearch

SEARCH · Search arXiv

Results for “eess.AS”

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.

6,460 records · Page 3Linked to original sources

A Kalman Filter-Based Tracking Loop Design for Real-Time Aerospace GNSS Applications with Minimum Pull-Out Probability

Kalman filter-based (KF-based) tracking loops are a powerful alternative to traditional phase-locked loops (PLLs) for Global Navigation Satellite Systems (GNSS) signal tracking. The primary advantage of the KF is its ability to incorporate high-fidelity models for receiver dynamics and clock errors, allowing the loop to adapt optimally to signal conditions. However, this theoretical optimality is often compromised in practice by the processing delays inherent in real-time systems with hardware correlators, which existing KF formulations typically neglect. This paper introduces a Modified Kalman filter (mKF) that overcomes this limitation specifically for hardware-based architectures. By reformulating the measurement update to be consistent with the processing delays, the proposed mKF maintains optimality in a practical implementation. We further present a systematic method for tuning both the process noise covariance matrix and the correlation time, based on an analytical expression for the pull-out probability (POP), which is validated through Monte Carlo simulation. The mKF is then validated with a GNSS signal simulator, both by post-processing baseband samples and on a real-time GPS receiver with hardware correlators. A direct equivalence between the mKF and a one-delay Digital PLL (DPLL) is established entirely in the digital domain. At equal noise bandwidth, the mKF matches the DPLL's phase error variance while achieving lower error in the higher-order states. Moreover, the mKF sustains lock at bandwidths inaccessible to the optimal one-delay DPLL under the same dynamic stress, positioning the proposed architecture as a robust and noise-efficient solution for high-dynamic aerospace GNSS applications.

eess.SP

Comment on "Event-Triggered Stabilization of Linear Time-Delay Systems via Halanay-Type Inequality"

This comment revisits Lemma 1 in [1], which plays a central role in the event-triggered stabilization analysis developed therein. We identify technical gaps in the proof of the lemma and provide a corrected argument. In particular, careful treatment of the exponentially decaying term shows that its decay rate must be retained in the resulting convergence estimate. The statement of the original lemma, with the exponential decay rate determined by the minimum of the characteristic decay rate and the decay rate of this term, remains valid.

math.OC

What Selects, What Reconstructs: Repairing Exemplar-Based Complex-Spectrum Separation

Exemplar methods separate a mixture by picking one learned spectrum per source and deforming it until it explains the observation, making one deformation class both reconstructor and selector. We show that the second role is empty as soon as the class can interpolate: the rule then ranks candidates on its regulariser, a choice made before the data, and the estimates sum back to the mixture whichever candidate wins. The condition is a parameter count, so the diagnosis runs before any experiment. On free per-bin deformation of complex spectra it explains the observed pathologies at once: a criterion that ranks candidates by their loudness, and half an output that is a mask on the mixture rather than an exemplar. The same theorem prescribes the repair, a selection class poorer than the reconstruction class: one complex gain and one pure delay rank the candidates, and a local combination of the best-aligned atoms, fitted jointly in closed form, rebuilds them. On MUSDB18 against the exact ceiling of the masking class, the distance between the criterion and an oracle inside its own candidate pool falls under the rigid selector from 6.2-7.7 to 0.5-2.8 dB, though only 0.9-1.2 dB of that reaches the output, and the per-frame latency of the deployed rule by a factor of 47 to 806. One lock remains, quantified: atoms are scored against the mixture, so the score carries a term for the other source that absorbs the capacity the reconstruction class gains, leaving the output 10.0 dB under the ceiling. Ranking hypotheses by the residual of a fit free enough to interpolate ranks them on the regulariser alone.

eess.SP

Locating Power System Oscillation Sources by Extracting Interharmonics from Synchrophasor Data

Recent studies have shown that oscillating phasors arise from beating waves caused by interharmonics. This finding has led to an interharmonic-based oscillation source-location method. But waveform data needed for the method are less available than PMU synchrophasor data. This paper investigates whether interharmonics can be extracted directly from phasor data for similar applications. The results show that, for certain oscillation phenomena, phasor data can support interharmonic extraction and oscillation source location. Sensitivity studies have identified the requirements, and a cloud-based software tool is developed for PMU-based source location.

eess.SY

Learning neural controllers for nonlinear systems from data

This article addresses the problem of designing neural feedback controllers for unknown nonlinear systems. We propose an indirect data-driven framework that uses offline data to identify the system dynamics, upon which a neural feedback controller and a neural Lyapunov function are jointly synthesized. Input constraints are enforced by integrating a hard-saturation structure into the controller architecture. Robust synthesis conditions are derived to account for data perturbations during identification. Formal stability is certified by combining SMT verification with local Lyapunov analysis near the equilibrium. Numerical examples validate the effectiveness of the proposed framework.

eess.SY

When are selector control strategies optimal for constrained monotone systems?

This paper considers optimal control problems defined by a monotone dynamical system, a monotone cost, and monotone constraints. We identify families of such problems for which the optimal solution is bang-ride, i.e., that it always operates on the constraint boundaries and switches between a finite number of state-feedback controllers. This motivates the use of simpler policies, such as selector control, that can be designed without perfect models and full state measurements. The approach is successfully applied to several variations of the health-aware fast charging problem for lithium-ion batteries.

math.OC

Model-free fast charging of lithium-ion batteries by online gradient descent

A data-driven solution is provided for the fast-charging problem of lithium-ion batteries with multiple safety and aging constraints. The proposed method optimizes the charging current based on the observed history of measurable battery quantities, such as the input current, terminal voltage, and temperature. The proposed method does not need any detailed battery model or full-charging training episodes. The theoretical convergence is proven under mild conditions and is validated numerically on several linear and nonlinear battery models, including single-particle and equivalent-circuit models.

eess.SY

Sample Complexity of Linear Quadratic Regulator Without Initial Stability

Inspired by REINFORCE, we introduce a novel receding-horizon algorithm for the Linear Quadratic Regulator (LQR) problem with unknown dynamics. Unlike prior methods, our algorithm avoids reliance on two-point gradient estimates while maintaining the same order of sample complexity. Furthermore, it eliminates the restrictive requirement of starting with a stable initial policy, broadening its applicability. Beyond these improvements, we introduce a refined analysis of error propagation through the contraction of the Riccati operator under the Riemannian distance. This refinement leads to a better sample complexity and ensures improved convergence guarantees.

math.OC

A Data-Driven Koopman-Behavioral Distance for Nonlinear Dynamical Systems

Comparing nonlinear dynamical systems directly from trajectory data remains challenging because finite-horizon trajectory representations are generally coordinate dependent. Motivated by recent behavioral subspace approaches for linear systems, this paper introduces a Koopman-behavioral distance for nonlinear stochastic systems using multi-rollout trajectory data. State measurements are lifted through a common observable dictionary, and dominant lifted behavioral subspaces are compared using Grassmannian distances without explicit Koopman operator identification. We establish coordinate invariance, connection with recently proposed linear behavioral distances under exact lifted closure, and robustness to approximate closure. Numerical examples demonstrate coordinate invariance and parameter discrimination.

eess.SY

Low-Interference N-Continuous OFDM via Optimized Time-Domain Smoothing

A novel basis signal optimization method is proposed for reducing the interference in the N-continuous orthogonal frequency division multiplexing (NC-OFDM) system. Compared to conventional NC-OFDM, the proposed scheme is capable of improving the transmission performance while maintaining an identical sidelobe suppression performance imposed by the linear combination of two groups of basis signals. Our performance results demonstrate that with a low-complexity overhead, the proposed scheme is capable of striking a better trade-off among the bit error rate (BER), complexity, and the sidelobe suppression performance compared to its conventional counterparts.

eess.SP

Interpolation Conditions for Instant Data Consistency with Port-Hamiltonian Structure

We develop a data-driven framework for nonlinear port-Hamiltonian (pH) systems based on interpolation conditions to characterize consistency between observed data and structured dynamical models. Specifically, we derive necessary and sufficient conditions for the existence of a pH system with a smooth (convex) Hamiltonian instantly consistent with a given dataset, without requiring explicit parametrization. We further provide a semidefinite programming formulation to verify consistency with non-degenerate interconnection and dissipation structures. Our results provide a principled approach to assess instant data consistency with physical structure and pave the way for control design directly from data.

math.OC

32-point DFT Approximations Based on Minimal Frobenius Error and DFT Symmetries

This work introduces low-complexity, multiplierless approximations for the 32-point discrete Fourier transform. The proposed methods are obtained by minimizing the Frobenius error compared against the DFT matrix over a set of trivial multipliers. A row-wise, symmetry-constrained parameterization is employed to reduce the search space size, rendering the task computationally tractable. The resulting approximations could outperform the reference method in the literature according to energy-based error measurements. A sparse matrix factorization is provided for efficient computation; the arithmetic costs are 152 real additions and 34 bit-shifts only.

eess.SP

Multivariable Geometric Laplace Transform and Fault Detection in Distributed-Converter Lines

Monitoring a DC line with many distributed power converters is a genuinely spatio-temporal problem: the information about a localized fault travels along the whole conductor and reaches a few measurement points mixed with the dynamics of the line itself. This paper develops a two-dimensional geometric Laplace transform (t,x) -> (s_t,s_x) over a commutative subalgebra of the geometric algebra Cl(4,0), isomorphic to Segre's bicomplex numbers, in which two bivectors B_t and B_x act as independent imaginary units for the temporal and the spatial phase. Because the two phases live in algebraically distinguishable planes, a fault at position x_f leaves a transformed residual that factorizes as F_f(s_t) e^{-s_x x_f}: its temporal nature stays in the first factor and its location can be read as a geometric argument of the second. On this representation we build a transmission-line model of the converter line and its space-time dispersion relation, a distributed control by admittance shaping, including an exact treatment of discrete converter sites (spatial sampling, aliasing, and a per-converter droop realization that is exact on the sub-Nyquist band), and a fault diagnosis chain that detects, localizes and classifies injection-loss, shunt, sensor and local-controller faults, extends to multiple simultaneous faults with automatic order selection, and distinguishes the outage of a plant from a cable defect. As an integral object the transform is known in bicomplex analysis, and with a single independent variable it reduces to the complex Laplace transform; the contribution lies in its geometric embedding and in its operational use for fault diagnosis in distributed-converter networks. All results are reproduced by an accompanying open implementation.

eess.SY

Converse Barrier Certificates for Set-Based Stochastic Reach-Avoid Verification

Recent work established sufficient and necessary barrier-like conditions for infinite-horizon reach-avoid verification of stochastic discrete-time systems from a single initial state. Whether such a converse characterization extends to a set of initial states, however, remains open. In this paper, we answer this question affirmatively for compact initial sets. We consider a uniform reach-avoid specification requiring the reach-avoid probability to exceed a prescribed threshold for every initial state in a compact set. Under appropriate assumptions, including continuous system transitions, together with a strict uniform probability margin, we extend the pointwise converse characterization to the uniform setting.

eess.SY

On the Duality Between Quantized Time and States in Dynamic Simulation

This letter introduces a formal duality between discrete-time and quantized-state numerical methods. We interpret quantized state system (QSS) methods as integration schemes applied to a dual form of the system model, where time is seen as a state-dependent variable. This perspective enables the definition of novel QSS-based schemes inspired by classical time-integration techniques. As a proof of concept, we illustrate the idea by introducing a QSS Adams-Bashforth method applied to a test equation. We then move to demonstrate how the proposed approach can achieve notable performance improvements in realistic power system simulations.

eess.SY

From World Models to World Action Models: A Concise Tutorial for Robotics

Rather than providing an exhaustive survey, this paper presents a concise tutorial on world models and world action models for robotics. After reading the tutorial, readers should have a clear understanding of what constitutes a "world", how world models and world action models are defined, and what roles they play within robotic AI systems. The tutorial also develops a unified perspective for comparing representative approaches, such as World Labs' spatial intelligence models, Yann LeCun's JEPA framework, and NVIDIA's Cosmos platform, and clarifies how these models differ in their representations, predictive capabilities, and interaction mechanisms.

cs.RO

S$^3$F-Net: A Multi-Modal Approach to Medical Image Classification via Spatial-Spectral Summarizer Fusion Network

Convolutional Neural Networks have become a cornerstone of medical image analysis due to their proficiency in learning hierarchical spatial features. However, this focus on a single domain is inefficient at capturing global, holistic patterns and fails to explicitly model an image's frequency-domain characteristics. To address these challenges, we propose the Spatial-Spectral Summarizer Fusion Network (S$^3$F-Net), a dual-branch framework that learns from both spatial and spectral representations simultaneously. The S$^3$F-Net performs a fusion of a deep spatial CNN with our proposed shallow spectral encoder, SpectraNet. SpectraNet features the proposed SpectralFilter layer, which leverages the Convolution Theorem by applying a bank of learnable filters directly to an image's full Fourier spectrum via a computation-efficient element-wise multiplication. This allows the SpectralFilter layer to attain a global receptive field instantaneously, with its output being distilled by a lightweight summarizer network. We evaluate S$^3$F-Net across four medical imaging datasets spanning different modalities to validate its efficacy and generalizability. Our framework consistently and significantly outperforms its strong spatial-only baseline in all cases, with accuracy improvements of up to 5.13%. With a powerful Bilinear Fusion, S$^3$F-Net achieves a SOTA competitive accuracy of 98.76% on the BRISC2025 dataset. Concatenation Fusion performs better on the texture-dominant Chest X-Ray Pneumonia dataset, achieving 93.11% accuracy, surpassing many top-performing, much deeper models. Our explainability analysis also reveals that the S$^3$F-Net learns to dynamically adjust its reliance on each branch based on the input pathology. Our source code and pre-trained model weights are publicly available on GitHub at: https://github.com/Saiful185/S3F-Net.

eess.IV

Distributed Attraction-Repulsion Potential for Multi-Agent Formation Control

In this paper, a distributed multi-agent formation control driven by the gradient of the Lennard-Jones potential is analyzed. For collision-free initial data, we prove global well-posedness together with a uniform lower bound on all inter-agent distances, thereby excluding hard collisions. Taking the total energy as a Lyapunov function, LaSalle's invariance principle shows that every positive limit point is an equilibrium. Since trajectories remain uniformly away from collisions, the energy is analytic along the flow and an argument yields convergence to a single equilibrium modulo translations. Illustrative numerical examples are presented.

eess.SY