Searcharxiv⌕ Search

subject

cs.SY

cs.SY: explore 409 source-linked works published from 2017 to 2026, with original documents and citations.

This collection is a preview while coverage and quality are evaluated.

Search within this collection

Coverage and selection

Includes records with this source-supplied label or an explicit phrase match in their metadata. Matches indicate a mention, not proof that a paper uses a method or tests a material. Source versions are consolidated by DOI.

Sources: arxiv. Collection updated 2026-09-16. Counts describe this index, not the complete source archives.

Neural 3D Object Reconstruction with Small-Scale Unmanned Aerial Vehicles

Miniaturized Uncrewed Aerial Vehicles (UAVs) can access indoor and hard-to-reach spaces, but severe constraints on payload and autonomy have limited their use in demanding tasks such as high-quality 3D reconstruction. We introduce a novel system architecture that enables autonomous, high-fidelity 3D scanning of static objects with sub-100 gram UAVs. Our core innovation lies in a closed-loop active viewpoint selection framework specifically tailored for ultra-constrained micro-platforms, advancing beyond standard static or offline active reconstruction methods. The framework establishes a dual-reconstruction pipeline that creates a real-time (RT) feedback loop between data capture and flight control. A near-RT process uses Structure-from-Motion (SfM) to generate an instantaneous point-cloud of the object. A systematic trajectory adaptation algorithm analyzes the model quality on the fly and dynamically adapts the UAV's trajectory based on parameterized spatial partitioning to intelligently capture new images of poorly covered areas, ensuring comprehensive acquisition. For the final, high-fidelity output, a non-RT pipeline employs a Neural Radiance Fields (NeRF)-based Neural 3D Reconstruction (N3DR) approach, fusing SfM-derived camera poses with precise external location data, evaluated across both radio-based Ultra Wideband (UWB) and visual motion-capture setups, to correct sensor noise and achieve superior accuracy. We implemented and validated this architecture using Crazyflie 2.1 UAVs. Our experiments, conducted in both single- and multi-UAV configurations show that algorithmic dynamic trajectory adaptation consistently improves reconstruction quality over static flight paths. This work demonstrates a scalable and autonomous solution that unlocks the potential of miniaturized UAVs for fine-grained 3D reconstruction, a capability previously reserved for much larger platforms.

cs.RO↗

Spatiotemporal Continual Federated Learning for Agentic Multi-UAV Edge Networks: Mitigating Catastrophic Forgetting

This paper addresses multi-objective conflicts and catastrophic forgetting in uncrewed aerial vehicle (UAV) networks across dynamic spatiotemporal environments. Conventional multi-agent reinforcement learning (MARL) algorithms suffer from severe policy degradation during sequential task transitions. We propose a spatiotemporal continual federated learning (SCFL) framework driven by the group-decoupled multi-agent proximal policy optimization (G-MAPPO) algorithm. SCFL incorporates a three-stage geometric alignment mechanism: it resolves local gradient conflicts via group-decoupled policy optimization (GDPO), mitigates spatial Non-Independent and Identically Distributed (non-IID) client drift through adaptive cosine aggregation, and suppresses inter-task interference via global temporal orthogonal projection without raw experience replay. Evaluations show that SCFL achieves superior robustness over federated baselines, maintaining spatial service reliability above 0.95 and a load balancing index of approximately 0.95 during non-stationary transitions. A longitudinal self-degradation analysis further shows that SCFL preserves historical knowledge with near-zero performance variation in spatial reliability and QoS under moderate loads from 40 to 120 users, while revealing its operating boundary under extreme congestion with 140 users due to hard projection constraints. The framework provides a scalable, communication-efficient approach for autonomous aerial network orchestration.

cs.NI↗

Performance Guarantees for Data-Driven Sequential Decision-Making

The solutions to many sequential decision-making problems are characterized by dynamic programming and Bellman's principle of optimality. However, due to the inherent complexity of solving Bellman's equation exactly, there has been significant interest in developing various approximate dynamic programming (ADP) schemes to obtain near-optimal solutions. A fundamental question that arises is: how close are the objective values produced by ADP schemes relative to the true optimal objective values? In this paper, we develop a general framework that provides performance guarantees for ADP schemes in the form of ratio bounds. Specifically, we show that the objective value under an ADP scheme is at least a computable fraction of the optimal value. We further demonstrate the applicability of our theoretical framework through several applications: data-driven robot path planning, pendulum stabilization, and multi-agent sensor coverage.

eess.SY↗

Emission reduction potential of freeway stop-and-go wave smoothing

The real-world potential of stop-and-go wave smoothing at scale remains largely unquantified. Smoothing freeway waves requires opening a gap large enough for them to dissipate, but that gap is often impractically large. We propose a counterfactual wave-smoothing benchmark that reconstructs a smooth, feasible trajectory from each empirical trajectory by solving a quadratic program with fixed boundary conditions and a maximum-gap constraint, and we use the MOVES model to estimate the resulting emission reduction potential. Applying the framework to nine weeks of weekday peak-period data from the I-24 MOTION testbed, which exhibits rich day-to-day variation in wave dynamics, we find meaningful potential for passenger cars under a 0.1-mile maximum-gap constraint: average CO2 reductions of 9.80% to 14.08% across lanes, with 12.94% to 25.70% in CO, 24.29% to 29.76% in HC, and 29.40% to 36.03% in NOx. Trucks emerge as particularly attractive targets, showing roughly twice the reduction potential of passenger cars.

eess.SY↗

Temporal Property-driven Design Space Exploration with Reinforcement Learning for Cyber-Physical Systems

Design-space exploration of configurable Cyber-Physical Systems (CPS) requires executable evaluation when design choices affect timing, fault propagation, recovery behavior, and temporal-property satisfaction. Repeated stochastic executions make exhaustive exploration impractical for large design spaces. This paper presents a temporal-property-driven CPS design workflow using Reinforcement Learning (RL). At design time, the RL agent selects subsystem alternatives to assemble a candidate system model. The model is then evaluated through simulation, during which online temporal-property monitors observe runtime traces and produce functional-property violation indicators. These indicators are combined with evaluated non-functional terms for budget, recoverability, sustained compliance, and operational use to calculate the reward used for subsequent candidate selection. The workflow is evaluated on a methane-sensitive mine-pump CPS. The corresponding executable case-study model is provided as additional contribution. RL-guided search identifies the highest-reward design observed in the experiments after 26 episodes (corresponds to 130 executable simulations). These designs were reached with fewer simulations than surrogate-guided Bayesian Optimization and population-based Genetic Algorithm baselines under the same executable model and reward formulation. Ablation study results indicate that value-based feedback and reuse of previous simulation traces contribute to this reduction.

eess.SY↗

Relative-Degree Wall Restricts Passivity-Based Stability Analysis in Inverter-Dominant Grids

This letter reveals a fundamental limitation of passivity-based distributed stability analysis in power systems. Under the standard formulation, passivity certification inherently imposes a relative-degree compatibility constraint that excludes many high-fidelity inverter dynamic models (e.g., those that include electromagnetic transients). Potential extensions of passivity frameworks are discussed to break this limitation.

eess.SY↗

The De Cock--De Moor Conjecture: Proof, Normal Form, and Indefinite Angles

De Cock and De Moor conjectured that two matrices built from the solutions of three coupled Lyapunov equations always share their eigenvalues, an identity linking principal angles between model subspaces with the canonical correlations between the past and future of a stochastic process. The conjecture was recorded as Problem 9.1 of \emph{Unsolved Problems in Mathematical Systems and Control Theory}. We prove it under the natural nonresonance condition, without stability or diagonalizability, and show that the two matrices are similar. The proof exposes a Cauchy-matrix structure created by the rank-one perturbation and reduces the problem to rational interpolation, and the main theorem has also been verified in the Lean~4 proof assistant. The same structure gives a normal form that depends only on the poles and zeros of the model. Off the stable set the eigenvalues become squared cosines of angles in an indefinite metric. We prove an inertia theorem for them and show that reflecting a pole or a zero across the unit circle acts on the angles by a principal pivot transform. For several inputs and outputs, where the conjecture fails, we identify the subspaces whose angles do give the canonical correlations. We also relate our approach to the independent proof of Gillberg and Löfberg.

math.OC↗

Linear Coding of LTI Sources Over Vector Gaussian Channels: A Majorization Approach

We study the design of linear time-invariant (LTI) encoder-decoder pairs for transmitting the state of a discrete-time LTI vector source over power-constrained parallel Gaussian channels with feedback. Two types of power constraints are considered. Under individual subchannel power constraints, a necessary and sufficient condition for designing an encoder-decoder pair that achieves bounded estimation error covariance (EEC) is established via two coupled majorization inequalities involving the subchannel signal-to-noise ratios and the antistable poles of the source. Under total channel power constraint, we derive the minimum total power required for a feasible encoder-decoder design by exploiting partial-order progamming under majorization order. An analytical optimal power allocation is obtained for the case of equal noise variances, which admits a water-filling interpretation; for general noise case, a sequential water-filling algorithm is developed. Our results reveal that the difficulty of transmitting a discrete-time LTI source via LTI coding is governed not only by its topological entropy, but also by the evenness of the log-magnitudes of its antistable poles. The design methods for feasible encoder-decoder pairs are also provided.

cs.IT↗

Stimulated Oscillations in Renewable Energy Integrated Power Systems - Part II: Methodology of Oscillation Mitigation

As presented in Part I of this series, closely located poles can produce high-amplitude oscillations even under small perturba-tions, which are referred to as stimulated oscillations. As the second installment of this series, this paper develops a method-ology for stimulated oscillation mitigation. Firstly, the logical relationship between system stability and oscillation risk is in-vestigated, clarifying that stability is neither a necessary nor a sufficient condition for oscillation risk. Secondly, the dominant factors affecting the pole and zero position on the complex plane, as well as their effectiveness and limitations are analyzed. For feedback control systems in particular, the influence of feedback paths on the pole-zero distribution of closed-loop systems is ana-lyzed. On this basis, a methodology for stimulated oscillation mitigation is proposed. Combined with the reduced-order trans-fer function of systems with closely separated poles, the order relation and configuration of poles and zeros for the feedback path transfer function, together with the criteria for gain selec-tion, are elaborated. Finally, a parameter tuning scheme for the poles, zeros and gain of the feedback path transfer function is presented. The proposed methodology for stimulated oscillation mitigation based on feedback control is not restricted to specific devices and can serve as a methodological reference for the design of diverse oscillation suppression schemes.

eess.SY↗

Adaptive Finite-Time Position-Force Control of Teleoperation Systems With Time-Varying Delays Using a Liquid State Machine Uncertainty Estimator

Teleoperation systems are increasingly used in medical, rehabilitation, and remote manipulation applications, where accurate position/force tracking and stable interaction are essential. In such applications, the remote environment may exhibit viscoelasticity, frictional memory, contact transitions, and other dynamic interaction effects, causing the system response to depend not only on the current state but also on its previous evolution. This history dependence, together with communication delays and uncertain nonlinear dynamics, makes accurate uncertainty compensation particularly challenging. Conventional feedforward neural approximators do not inherently retain temporal information, while fully recurrent architectures may introduce additional computational and online training complexity. To address this limitation, this article introduces the first application of a liquid state machine (LSM) to bilateral teleoperation control. A finite-time adaptive controller is developed using a hybrid position/force auxiliary error system with velocity and force filters, while the LSM is employed to estimate uncertain dynamics by exploiting its intrinsic temporal processing and fading-memory capabilities with a simple adaptation mechanism. Closed-loop stability and finite-time convergence are established through a Lyapunov--Krasovskii framework. Simulations in spring--damper and generalized Maxwell viscoelastic environments demonstrate improved position and force tracking and lower mean execution time compared with an RBFNN-based controller.

eess.SY↗

Conformal Prediction Regions for Continuous-Time Trajectories under Random Sampling

Uncertainty quantification for continuous-time trajectories is a prerequisite in many safety-critical engineering domains. However, a major challenge in data-driven uncertainty quantification is that calibration trajectories are sampled only at discrete, often sparse, and random intervals. Standard conformal prediction methods typically fail to provide guarantees in between sampling times. In this work, we introduce a new technique to obtain valid conformal prediction regions for continuous-time trajectories that are sampled at discrete and possibly random times. To accomplish this goal, we make three contributions: (1) we provide an algorithm that leverages regularity properties of the underlying trajectories to obtain valid prediction regions in between samples, (2) we provide methods that estimate valid bounds on the aforementioned regularity properties from an additional high-frequency calibration dataset, and (3) we introduce and compare several algorithms to deal with random sampling times. Finally, we present experiments where we validate that our methods achieve valid coverage across the entire continuous trajectory.

eess.SY↗

Asynchronous Cooperative Online Learning for Multi-Robot Control under Computational Delays

Ensuring the safe operation of multi-agent systems (MASs) under uncertain environments is crucial for cooperative robotic, where external disturbances and inaccurate dynamic models can significantly compromise performance and reliability. To address this challenge, calibrated machine learning models, particularly Gaussian process (GP) regression, are extensively employed due to their interpretable performance quantification. As the interconnected communication of MASs facilitates cooperative learning, agents are able to enhance learning performance by exchanging local GP inferences with their neighbors and aggregating the received information via distributed GP strategies. However, variations in computational power and prediction tasks among agents inevitably lead to heterogeneous computational delays and differences in query points, which are often overlooked in existing aggregation methods. To overcome these limitations, this work proposes an asynchronous cooperative learning strategy that explicitly accounts for prediction accuracy, query point variations and delay effects. Additionally, a distributed control law based on an adjoint MAS is developed to ensure the desired control performance. Simulations on unmanned surface vehicles validate the effectiveness of the proposed approach, demonstrating substantial improvements in both learning and control performance compared to the state-of-the-art approaches.

cs.LG↗

A Small-Gain-Like Framework for Large-Signal Stability Evaluation of Multi-Converter Systems

The increasing penetration of grid-connected converters has greatly altered the large-signal behavior of power systems. Their angle dynamics, shaped by diverse control algorithms and coupled through complex circuit interactions, pose substantial challenges to large-signal stability evaluation of multi-converter systems. To resolve this issue, the small-gain theorem, which characterizes the dissipation capability of interconnected systems (the small-gain-like property) via the individual dissipation capabilities of subsystems, is introduced to investigate transient angle motions in multi-converter systems. A large-signal model involving a set of interconnected relative angle motions is first developed, and the small-gain-like property is then established for multi-converter systems within certain angle limits, which further enables the construction of Lyapunov functions. Based on this, an ellipsoidal forward-invariant region is identified inside the angle-limit region, which serves as an effective estimate of the large-signal stability region for multi-converter systems. The method is further applied to a paralleled system and a four-converter system, where the large-signal stability boundaries are explicitly computed and subsequently validated through experiments. The proposed small-gain-like based large-signal stability evaluation method enables quantitative stability assessment in multi-converter systems with diverse control algorithms, which may provide a scalable framework for large-signal stability evaluation and parameter design in modern power systems.

eess.SY↗

Event-triggered Control and Online Learning for Networked Systems under Computational Delays

Online learning-based control is a promising approach to control uncertain systems, where unknown components are identified during operation to improve control performance. However, resource-intensive online learning algorithms introduce non-negligible computational delays, especially when executed on systems with limited local computational resources. To mitigate this, an in-network online learning-based control structure is employed by deploying the learning-based controller on a remote computation node and connecting it via a communication channel. In this paper, control performance guarantee is first established by deriving tracking error bound for the in-network control architecture, while accounting for computational delays. The derived tracking error bound allows for diverse communication and computation strategies under a specific condition, including time-/event-triggered mechanisms. Additionally, the trade-off between communication and computation performances is shown for a given desired control performance. Furthermore, to enhance the efficiency in both communication and computation, an efficient control framework with an asynchronous event-triggered mechanism in both control and online learning is devised under the existence of computational delay. The proposed event-triggered strategy is proven to achieve the same control performance as time-triggered scenario while excluding Zeno behavior. Finally, we derive an explicit expression of the proposed event-trigger condition for exponentially stabilizable systems, and demonstrate its effectiveness through simulations.

cs.LG↗

Reciprocal-Manifold Annealed KKT Flows for Constrained Optimization: Application to the Nonconvex AC Optimal Power Flow

Safety-critical optimization applications, such as real-time power system operation, maintain feasibility at every intermediate step, not merely at convergence. Existing approaches either violate constraints mid-solve (interior-point methods) or enforce feasibility through per-instant quadratic programming subproblems with cubic computational cost and unbounded worst-case execution time. We propose a continuous-time optimization framework for smooth constrained nonlinear problems that preserves feasibility throughout the optimization process without requiring projection operators, quadratic programming subproblems, or other per-iteration optimization routines. The method is built around a reciprocal multiplier manifold, which establishes an explicit relationship between inequality constraints and their associated Lagrange multipliers. By designing a continuous multiplier update law, the manifold is shown to remain forward invariant, while the resulting dynamics are equivalent to continuous-time logarithmic barrier gradient descent. The proposed framework naturally extends to multiple inequality constraints, equality constraints, nonconvex feasible sets, and infeasible initial conditions. The method is further enhanced through an augmented Uzawa flow that eliminates oscillatory transients commonly observed in classical primal-dual saddle-point dynamics. The effectiveness of the proposed approach is applied to the AC Optimal Power Flow problem of IEEE 9-bus and IEEE 57-bus systems. Numerical results show convergence to solutions within 0.4\% of the benchmark optimum while maintaining strict feasibility of all constraints. A computational complexity analysis shows that the proposed dynamics reduce the per-step computational cost from cubic to linear complexity. Finally, dynamic tracking studies under time-varying operating conditions demonstrate reliable feasibility preservation.

math.OC↗

On the Number of Observation Nodes in Recurrent Neural Networks with Linear Threshold and ReLU Functions

This paper investigates how node update rules and admissible state domains affect the minimum number of observation nodes required for global finite-horizon observability in recurrent neural networks with linear-threshold and ReLU update functions. Over a common binary state domain, we construct a class of $K$-linear-threshold ($K$-LT) networks whose initial states can be uniquely reconstructed from the finite output trajectory of a single observation node. We further establish a dynamical equivalence between binary-valued $K$-ReLU networks and $K$-AND Boolean networks, which transfers existing class-level observation-node bounds to binary-valued $K$-ReLU networks. For nonnegative-valued ReLU networks, the observability problem reduces to the classical linear-system setting whenever the relevant pre-activations remain nonnegative. For general real-valued ReLU networks, we prove that global finite-horizon observability requires at least $n/2$ observation nodes when no restriction is imposed on the number of state variables involved in each node update. This lower bound is tight when $n=2K$, for which we construct a $K$-ReLU network observable from exactly $K$ nodes. These results show that both update rules and state domains fundamentally affect extremal observation requirements: temporal evolution can concentrate finite-state information into a single measured trajectory, whereas activation-induced rank loss creates an intrinsic sensor lower bound in continuous-state ReLU networks.

eess.SY↗

Successive design of backstepping observers for parabolic PDE-ODE systems and its duality to state feedback stabilization

The paper introduces a successive backstepping observer design for strictly feedforward parabolic PDE-ODE systems, in which the coupling structure determines the order of error stabilization and the corresponding transformations. First, a transformation based on a virtual measurement stabilizes the ODE observer error subsystem, which is most distal from the measurement, while decoupling it from the PDE error state. Second, a Volterra integral transformation is employed to stabilize the PDE error subsystem and to map the overall error dynamics into a cascade of exponentially stable ODE and PDE subsystems. The design is shown to be dual to a recently proposed multi-step state feedback design for parabolic PDE-ODE systems in strict feedback form, thus explaining the structure of the presented observer design.

math.OC↗

Identification of $dq$-Asymmetric Impedances as Complex Transfer Functions Using a Single Arbitrary Excitation

Cross-coupling between the $dq$ coordinates makes the identification of asymmetric grid impedances a challenging problem, particularly near the fundamental frequency where the asymmetric coupling is strongest. Existing schemes usually handle it either by perturbing the two coordinates sequentially, which lengthens the measurement, or by using a time-domain method with a global parametric model whose order must be tuned. This paper develops a single-shot active non-parametric frequency-domain method that avoids both. The equivalent impedance is parameterized by a pair of single-input single-output complex transfer functions. Each spectral line is fitted with a local rational model; the leakage and transient contributions are estimated, so that neither periodic steady-state excitation nor repeated excitation cycles are required. We give the exact finite-time discrete Fourier transform relation for the conjugate-coupled complex-signal model, and analyse the distortion that a stationary-frame filter placed ahead of the Park transform imposes on the identified pair. The method is validated on a controller hardware-in-the-loop platform against an analytically derived small-signal model, for a symmetric grid and for the same grid with an added grid-following converter that renders it asymmetric. Both complex transfer functions and all four real transfer functions of the $dq$ impedance are recovered over a wide band from a single one-second record of a random excitation, at 1 Hz resolution.

eess.SP↗
Compare source metadata on this page
WorkPublishedSource identifierSource
Neural 3D Object Reconstruction with Small-Scale Unmanned Aerial Vehicles2026-08-302509.12458arxiv
Spatiotemporal Continual Federated Learning for Agentic Multi-UAV Edge Networks: Mitigating Catastrophic Forgetting2026-08-302601.21861arxiv
Performance Guarantees for Data-Driven Sequential Decision-Making2026-09-162603.20553arxiv
Emission reduction potential of freeway stop-and-go wave smoothing2026-08-302603.21476arxiv
Temporal Property-driven Design Space Exploration with Reinforcement Learning for Cyber-Physical Systems2026-08-302608.23440arxiv
Relative-Degree Wall Restricts Passivity-Based Stability Analysis in Inverter-Dominant Grids2026-08-302608.29474arxiv
The De Cock--De Moor Conjecture: Proof, Normal Form, and Indefinite Angles2026-10-102608.29479arxiv
Linear Coding of LTI Sources Over Vector Gaussian Channels: A Majorization Approach2026-08-302608.29511arxiv
Stimulated Oscillations in Renewable Energy Integrated Power Systems - Part II: Methodology of Oscillation Mitigation2026-08-302608.29518arxiv
Adaptive Finite-Time Position-Force Control of Teleoperation Systems With Time-Varying Delays Using a Liquid State Machine Uncertainty Estimator2026-08-302608.29544arxiv
Conformal Prediction Regions for Continuous-Time Trajectories under Random Sampling2026-08-302608.29559arxiv
Asynchronous Cooperative Online Learning for Multi-Robot Control under Computational Delays2026-08-302608.29562arxiv
A Small-Gain-Like Framework for Large-Signal Stability Evaluation of Multi-Converter Systems2026-08-302608.29570arxiv
Event-triggered Control and Online Learning for Networked Systems under Computational Delays2026-08-302608.29576arxiv
Reciprocal-Manifold Annealed KKT Flows for Constrained Optimization: Application to the Nonconvex AC Optimal Power Flow2026-08-302608.29628arxiv
On the Number of Observation Nodes in Recurrent Neural Networks with Linear Threshold and ReLU Functions2026-08-302608.29650arxiv
Successive design of backstepping observers for parabolic PDE-ODE systems and its duality to state feedback stabilization2026-08-302608.29693arxiv
Identification of $dq$-Asymmetric Impedances as Complex Transfer Functions Using a Single Arbitrary Excitation2026-08-302608.29740arxiv

These are bibliographic comparisons, not experimental rankings. Follow the original document for methods and conditions.