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.

ProxPI: Proximal Prior Injection for Sampling-Based MPC under Learned-Prior Mismatch

Combining learned policies with model predictive control can leverage learned task priors while retaining online adaptation to new objectives and constraints, but performance degrades when the policy is out of distribution. In policy-guided model predictive path integral (MPPI) control, a policy-centered warm-start approach centers the sampling distribution on the policy output. When the prior is mismatched, centering the sampling distribution on the policy output restricts exploration around an unsuitable solution and prevents recovery toward the task optimum. We propose Proximal Prior Injection (ProxPI), which retains nominal-centered MPPI sampling and incorporates the policy through a soft proximity cost. This matches the in-distribution performance of existing prior-injection schemes while enabling the optimizer to escape an inaccurate policy and recover vanilla MPPI-level performance. We theoretically show that re-centering on the prior discards the optimizer's correction at every update, whereas nominal-centered sampling retains it and converges to a solution set by both the task cost and the prior, and that this failure is not removed by a larger rollout budget. Simulations and real-robot experiments demonstrate robust performance under both in-distribution and out-of-distribution tasks.

cs.RO↗

Accelerating Reinforcement Learning via MPC Solver-Gradient Guidance for Weights-varying MPC

In Model Predictive Control (MPC), cost-function weights shape closed-loop behavior, yet changing conditions often make fixed parametrizations suboptimal and motivate context-dependent online adaptation. Learning such policies is difficult because behavior depends implicitly on numerical MPC solutions, producing nonlinear, potentially nonsmooth, long-horizon dependencies on policy parameters. This creates a bias-variance tradeoff: Reinforcement Learning (RL) optimizes realized closed-loop return from environment samples but is sample-inefficient, whereas Gradient-Based Policy Learning (GB-PL) uses low-variance solver gradients from differentiable MPC to optimize surrogate losses on predicted trajectories but can be biased under model mismatch. We propose Solver-Gradient Guided Reinforcement Learning (SG-RL), a solver-sensitivity augmentation for RL-based online MPC cost-weight adaptation. SG-RL keeps sampled closed-loop return as the objective and uses bounded solver-derived gradients as auxiliary guidance to improve stability and sample efficiency. We instantiate SG-RL in Proximal Policy Optimization (PPO) with four modular algorithms that inject solver-gradient guidance into actor-update scaling, policy loss, advantage estimation, and value-function learning. On two full-scale autonomous racing platforms with intentional model mismatch, SG-RL reaches PPO's best closed-loop return with up to 70.6% fewer samples, outperforms GB-PL baselines by at least 54% in closed-loop return, and generalizes zero-shot to unseen environments.

cs.RO↗

Geometric Fixed-Time Sliding Mode Control for Constrained Attitude Tracking on $\mathrm{SO}(3)$

This paper studies constrained spacecraft attitude tracking on the Riemannian configuration manifold $\mathrm{SO}(3)$ in the presence of multiple attitude pointing constraints and matched external disturbances. To address this, an attitude potential function is proposed intrinsically on $\mathrm{SO}(3)$, and its key properties are established using intrinsic geometric analysis. Under mild conditions, the potential function is shown to admit a unique nondegenerate minimum at the desired attitude over the admissible subset of $\mathrm{SO}(3)$, defined by excluding the forbidden attitude regions as well as a measure-zero set, thereby ensuring a well-posed constrained attitude tracking problem. A Riemannian Hessian analysis shows that the Hessian of the potential function is locally uniform positive definite in an open neighborhood of the desired attitude, thereby establishing local strong convexity. A nonsingular fixed-time geometric sliding manifold is proposed using the Riemannian gradient of the potential function, leading to a geometric fixed-time sliding-mode-based constrained attitude control law. It is shown that, for every initial attitude in the admissible subset, the closed-loop state trajectory evolves on $\mathrm{SO}(3)\times\mathbb{R}^3$, with the attitude remaining in the admissible subset throughout the maneuver, while the state converges to a sufficiently small compact neighborhood of the desired equilibrium in a prescribed fixed time. Numerical simulations validate the proposed control approach and illustrate the theoretical results.

eess.SY↗

How Much Training is Needed with a Digital Twin?

The following paper addresses how much pilot training is needed when a digital twin (DT) of the wireless radio channel is available to aid a wireless communication system with a channel estimation task. The DT of a wireless channel is widely expected to reduce the pilot overhead of channel estimation, following the informal rule that \emph{``the more accurate the twin, the fewer pilots are needed.''} This trade-off, however, has only ever been demonstrated empirically and never quantified. We close this gap by treating the DT as a complementary measurement of the channel that the receiver fuses with its pilot observations in the physical world. Consequently, fusing the physical and digital worlds through the best linear unbiased estimator, we derive a DT-aided Cramér-Rao bound, and from it a \emph{pilot-equivalence law} that converts DT fidelity into an equivalent number of training symbols. For a biased twin unknown to the estimator, we obtain the exact mismatch threshold beyond which trusting the DT is worse than ignoring it. We quantify how much training is needed with the DT to attain a desired mean square error on channel estimation. Particular cases are discussed to tell when training in the physical world can be completely bypassed. We finally translate these results into a block-fading achievable rate whose optimal training length is the unique root of a single equation, and identify the DT fidelity above which pilot training can be dispensed with altogether. Extensive numerical results corroborate closed-form expression and reveal that the value of a DT is largest at finite signal-to-noise ratio and vanishes in both the low- and high-SNR limits.

eess.SP↗

Constructive Port-Hamiltonian Energy Shaping Design of Dispatchable Virtual Oscillators in Grid-Forming Converters

Port-Hamiltonian (PH) theory offers a passivity-based framework for grid-forming control, yet conventional dispatchable virtual oscillator control (dVOC) does not naturally admit a dissipative PH realization, since its amplitude egulation, synchronization, and power dispatch are inherently coupled without a unified energy interpretation. This paper formulates the outer-loop dynamics as a dissipative PH system, thereby unifying amplitude regulation, synchronization, and power dispatch within one energy structure. The formulation rests on the key property that logistic-type radial regulation, characterized by an inherent saturation-like nonlinearity, permits an exact gradient decomposition compatible with the quadratic energy storage. On this basis, a unified shaped Hamiltonian is constructed, which encapsulates both amplitude restoration and power dispatch. Radial gain matching derived from this Hamiltonian yields explicit closed-form arameter inequalities that guarantee almost-global asymptotic stability and local exponential convergence. Moreover, tuning the power-error weighting coefficient actively shapes the energy landscape, thereby eliminating the undesirable low-voltage power-flow solution from the stationary set and ensuring convergence to the desired high-voltage equilibrium point. The Hessian singularity condition further provides the critical weight threshold that guarantees uniqueness of the high-voltage equilibrium. Numerical simulations validate the proposed method.

eess.SY↗

Exact Risk-Complexity Laws for Projective Boundaries in Scenario Optimization and Distribution-Free Certification

Scenario optimization, conformal prediction, and related distribution-free certification methods use finite samples to construct decisions or prediction sets with violation-risk guarantees for fresh observations. In several classical settings, the conditional violation risk follows an exact beta law, whose tail has a beta-binomial representation and whose parameter is a support, calibration, or compression dimension. This paper identifies the deterministic boundary mechanism behind these formulas and derives the corresponding law when the observed boundary size is random. A decision rule is represented by an acceptance set for future observations, together with a boundary map selecting the sample points responsible for that set. The resulting pair is called a {\em proper projective boundary scheme} when held-out samples are accepted precisely if the full-sample boundary is retained, and accepted non-boundary samples can be deleted without changing that boundary. For every such scheme, the conditional law of the violation risk given the observed boundary size is determined by the boundary's cross-sample complexity profile. A stable profile yields the usual beta law, whereas a varying profile produces an exact profile correction. The framework covers scalar order-statistic calibration, support-reconstructive scenario programs, cascaded support-removal certificates, coordinatewise envelopes, and Pareto-frontier calibration with vector scores. It also yields conditional probabilistic certificates and a no-go result explaining why observed complexity alone is insufficient.

eess.SY↗

Equivalent DQ Sequence-Domain Model of Unbalanced Three-Phase Passive Elements for Power Converter Controllers

Equivalent dq0 models of three-phase passive impedances are widely used for the design of three-phase inverter and rectifier controllers in the synchronous frame. However, these equivalent models assume that the impedance in each phase are the same, which is not always applicable. The fact that the impedance in each phase is different, generates second order harmonic content in the dq0 components, which hinders the advantages of the dq0 transformation. To avoid the second harmonic in these scenarios, it is possible to use the Fortescue's theorem to represent any asymmetrical set of three-phase signals as a linear combination of three symmetrical sequences. In the literature, only a few works have attempted to derive the equivalent model of unbalanced three-phase passive elements in the sequence domain, and none is able to account for the interaction between the zero sequence and the positive and negative sequences. This work presents the derivation of the equivalent dq sequence-domain model of unbalanced three-phase passive elements both analytically and with an intuitive graphical approach. Experimental results are shown to validate the proposed models.

eess.SY↗

Blackbox Small-Signal Modeling of Grid-Connected Inverters in Asymmetrical Power Grids

Power electronic converters are envisaged to be key enablers of modern electric power distribution systems. Grid-connected three-phase inverters are widely used in Smart Grids and microgrids, but also in standard grids. They provide controllability and dynamic decoupling capabilities, which are fundamental in the integration of renewable sources and storage systems and in specialized applications such as FACTS. Nevertheless, power electronics-based systems can exhibit dynamic interactions, which may lead to power quality issues. Although the electrical model of each element of these systems is important for their system-level analysis, they are rarely available. Blackbox modeling strategies are useful for obtaining behavioral models of commercial electronic converters. Most blackbox modeling strategies are focused on dc-dc electronic converters; however, some works have extended these concepts to three-phase converters by means of the dq framework, under the assumption of symmetrical and balanced conditions. This work proposes a new structure in the sequence domain to represent the dynamic behavior of grid-connected commercial converters in asymmetrical conditions. Experimental tests have been performed on a three-phase inverter to identify its blackbox model and its performance has been validated during an asymmetric voltage sag.

eess.SY↗

Generalized Semi-Infinite Programming for Robust Optimal Control with Decision-Dependent Uncertainty

Generalized semi-infinite programs (GSIPs) arise in robust optimal control whenever the admissible uncertainty depends on the state or controls. Existing GSIP methods either impose restrictive structural assumptions or require global optimization that scales poorly to control problems. We present a general framework that reformulates any GSIP with mild regularity as an existence-constrained semi-infinite program, smoothing its disjunctive feasibility condition into differentiable existence constraints over a fixed index superset. The resulting program is solved by established adaptive discretization (cutting-plane) methods using only off-the-shelf nonlinear-programming solvers, and converges under standard assumptions. Treating the state trajectory as part of the uncertainty extends the framework to robust nonlinear optimal control with state-dependent uncertainty. We demonstrate it on a nonconvex benchmark GSIP and a satellite de-tumbling problem with dynamically varying inertia.

math.OC↗

Stability of Droop-Controlled Low-Frequency Transmission Lines

Low-Frequency AC (LFAC) transmission systems employing power converters are being considered for a varity of applications. This work studies the small-signal stability of an LFAC transmission line controlled by the Droop Control Strategy. Eigenvalue Analysis is used to determine how the controller droop gains, operating frequency, transmission line parameters, and the operating point affect system stability. The results show that the overall system's dynamic is governed by the sum of the droop gains of the AC/AC converters. Analytical results that give insights on how the different system's parameters affect the critical stability point are presented. The results indicate that system stability is affected by the line's length, the line's R/X ratio, operating frequency and voltage.

eess.SY↗

Curriculum-Guided Reinforcement Learning for Energy-Efficient UAV-ISAC in Post-Disaster Search-and-Rescue Operations

Uncrewed aerial vehicles (UAVs) are promising platforms for integrated sensing and communication (ISAC), but their limited onboard energy creates a strong coupling among sensing accuracy, communication quality, and propulsion cost. This paper proposes a curriculum-guided soft actor-critic (CG-SAC) framework with propulsion-aware reward shaping for energy-efficient UAV-ISAC, jointly optimizing the 3D trajectory, communication-sensing power split, and per-user power allocation. A rotary-wing propulsion model is incorporated to derive a closed-form propulsion-economic cruising speed, which is used to construct a propulsion-aware speed-shaping term within a normalized composite reward together with navigation, node-visiting, energy-efficiency, and constraint-penalty terms. A log-linear curriculum progressively tightens the communication, sensing, and proximity requirements during training. Across 2000 randomized scenarios, CG-SAC achieves an average energy efficiency of 0.72 Mbits/J, substantially outperforming the evaluated DRL baselines. Among successfully completed missions, it requires 107.6 steps on average, corresponding to a 66%--82% reduction in flight steps relative to the baselines. Crucially, the learned policy exhibits mission-aware speed adaptation by decelerating near service points and accelerating during transit, while achieving a 99.6% communication-rate satisfaction ratio at service instants. Ablation results further demonstrate the complementary roles of the reward components in balancing mission feasibility and energy efficiency.

cs.NI↗

Physics-informed Learning for Orbital Uncertainty Propagation with Error Bounds

The Fokker-Planck partial differential equation (FP-PDE) governs uncertainty evolution in stochastic dynamical systems. In orbital dynamics, solving the FP-PDE is challenging because of nonlinear motion, high-dimensional states, and large space-time domains. We develop a physics-informed neural network (PINN) approach that approximates the FP-PDE solution as a single space-time probability density, while also quantifying its worst-case approximation error. This approach is, in principle, independent of the choice of state coordinates and neural network architecture. Specifically, to enforce probability density function (PDF) properties into the neural network, we design a Physics-informed Gaussian mixture model (PINN-GMM). Then a companion error PINN learns the dynamics of the approximation error and yields time-dependent bounds that define an ambiguity set of PDFs. This ambiguity set enables rigorous computation of upper and lower bounds on event probabilities through tractable linear programs. Numerical studies on illustrative 1D examples and several 4D--6D orbital test cases demonstrate accurate uncertainty propagation, correct and informative error bounds, and improved reliability over common uncertainty-propagation baseline methods (Gaussian approximation, unscented transform, and Gaussian mixture model). Constructing the PINN-GMM requires offline training, making it costlier than the baseline approximations; once trained, however, a single forward pass returns the density at any time in sub-millisecond time $(0.16~\mathrm{ms}$ in our implementation).

physics.comp-ph↗

A Control Co-Design Framework to Optimize Sustainability with Application to Microgrid-Driven Data Centers

This work studies the optimization of physical plant characteristics and controller parameters for sustainability. Environmental sustainability is strongly correlated with the development and operation of energy systems, with data centers as the preeminent modern example. Data centers, and the grid technologies that provide their power, consume nonnegligible amounts of global energy and pose a risk to increase greenhouse gas (GHG) emissions and electronic waste. Addressing such issues requires improved plant design and control strategies, often approached through optimization-based methods. However, there are noticeable gaps regarding data center and microgrid design: (i) simultaneous optimization of plant and controller features is rarely explored, and (ii) sustainability criteria are not emphasized. This work addresses these gaps by establishing a generalized, sustainability-centric control co-design (CCD) framework for energy systems. Uniquely, the CCD framework defines and categorizes sustainability metrics into three lifecycle stages - manufacturing, operation, and disposal - supporting optimization and comparative analysis of the metrics for different design options. To exemplify its use, the CCD framework is applied to a microgrid-driven data center system, providing a family of sustainability metrics correlated to plant and controller parameters. The analysis enabled by the framework provides insights into the CCD of microgrids and data centers, such as that GHG-equivalent emissions from manufacturing of components can dwarf those generated during operation of the system. The system designs identified by the proposed framework show substantial improvements to environmental sustainability categories as compared to designs identified through baseline procedures.

eess.SY↗

Quantum-Based k-Coverage Optimization for UAV-Aided Search and Rescue Missions

In large-scale disaster scenarios, rapid localization of missing persons is a critical challenge for search-and-rescue (SAR) operations. Unmanned aerial vehicles (UAVs) equipped with radio frequency (RF) receivers can support RF-based localization by collecting signals emitted from mobile devices at spatially distributed sensing locations. This paper addresses the resulting waypoint-selection problem: determining a minimum set of UAV waypoints that provides at least threefold coverage of every potential target location. We formulate this task as an extended k-coverage problem that independently defines the UAV-navigable and target regions, and derive an exact-penalty quadratic unconstrained binary optimization (QUBO) formulation with a sufficient penalty condition that preserves feasibility and minimum waypoint cardinality. The QUBO is mapped to an Ising-form cost Hamiltonian and evaluated using the quantum approximate optimization algorithm (QAOA) on both a noise-free simulator and IBM's 127-qubit Eagle processor. On the tested simulator instances, QAOA recovers the known minimum-cardinality solutions. Across the rectangular hardware test cases, the mean 3-coverage ratio exceeded 95%. In the campus-scale evaluation, ten hardware executions achieved 99.3% mean 3-coverage with a 90% feasible-run rate, while the shortest feasible flight path was up to 37.0% shorter than those of the deterministic grid-based baselines. Additional comparisons with classical optimization and learning-based baselines are provided, together with computational and quantum-resource analyses for larger generated instances. These results establish an exact QUBO representation for RF-based SAR waypoint selection and characterize its implementation on current gate-based quantum hardware.

eess.SY↗

Situation Awareness for Intelligent Data Distribution in Connected Vehicles

The limitations of on-board sensors and blind spots caused by occlusion cause the reduction of perception quality in autonomous vehicles. In such cases, cooperative perception provides additional data via Vehicle-to-Everything communication to enhance local perception, causing a large volume of data transmission. The vehicle can focus on acquiring and utilizing relevant data according to the prevailing road context by identifying the current traffic situation. To achieve this, we propose a concept for the situation identification of the vehicle using Bird's-Eye-View images. Firstly, the situation around the vehicle is identified using object detection with semantic segmentation, followed by understanding the context of the traffic using a situation identification module consisting of an open-source projective transformation network Cam2BEV and a situation identification neural network. The concept was evaluated and validated by running the software on the CARLA simulator using the in-built RGB camera and the semantic segmentation camera. Additionally, the portability of the situation identification module for real-world applications was verified on Cityscapes and nuScenes urban driving datasets. Overall, the proposed situation identification approach enables efficient sensor data management by prioritizing relevant data to the current traffic situation. The source code is available in the following link: https://github.com/akshaynarla/DySi_Select

cs.RO↗

LMI Properties and Applications in Systems, Stability, and Control Theory

Linear matrix inequalities (LMIs) commonly appear in systems, stability, and control applications. Many analysis and synthesis problems in these areas can be solved as feasibility or optimization problems subject to LMI constraints. Although most well-known LMI properties and manipulation tricks, such as the Schur complement and the congruence transformation, can be found in standard references, many useful LMI properties are scattered throughout the literature. The purpose of this document is to collect and organize properties, tricks, and applications related to LMIs from a number of references together in a single document. In this sense, the document can be thought of as an "LMI encyclopedia" or "LMI cookbook." Proofs of the properties presented in this document are not included when they can be found in the cited references in the interest of brevity. Illustrative examples are included whenever necessary to fully explain a certain property. Multiple equivalent forms of LMIs are often presented to give the reader a choice of which form may be best suited for a particular problem at hand. The equivalency of some of the LMIs in this document may be straightforward to more experienced readers, but the authors believe that some readers may benefit from the presentation of multiple equivalent LMIs.

eess.SY↗

Local Identifiability of Networks with Nonlinear Node Dynamics

We study the identifiability of nonlinear network systems with partial excitation and partial measurement when the network dynamics is linear on the edges and nonlinear on the nodes. We assume that the graph topology and the nonlinear functions at the node level are known, and we aim to identify the weight matrix of the graph. Our main result is that, for almost all static analytic nonlinearities that cross the origin, directed graphs are generically locally identifiable if and only if at least one node is excited in every source component of the condensation graph and at least one node is measured in every sink component. This holds even when all other nodes remain unexcited and unmeasured and stands in sharp contrast to most findings on network identifiability requiring measurement and/or excitation of each node. The result applies to homogeneous feed-forward and recurrent artificial neural networks and generalizes previous literature by considering a broader class of activations and architectures.

math.OC↗

Self-Healing Hybrid Control as a Proxy for Detection and Mitigation of Sensor Attacks in Cooperative Driving

We propose a real-time hybrid controller scheme to detect and mitigate False-Data Injection (FDI) attacks on Cooperative Adaptive Cruise Control (CACC). Our method uses sensor redundancy to create equivalent controller realizations, each driven by distinct sensor subsets but producing identical control inputs when no attack occurs. By comparing control signals and measurements via majority voting, the scheme identifies compromised sensors in real-time and switches to a healthy controller, even under unconstrained attacker switching. The hybrid controller utilizes attack-dependent flow and jump sets, and resets the states of compromised controllers, resulting in a self-healing architecture. Simulation results demonstrate the effectiveness of this approach.

eess.SY↗
Compare source metadata on this page
WorkPublishedSource identifierSource
ProxPI: Proximal Prior Injection for Sampling-Based MPC under Learned-Prior Mismatch2026-09-012609.00941arxiv
Accelerating Reinforcement Learning via MPC Solver-Gradient Guidance for Weights-varying MPC2026-09-012609.01061arxiv
Geometric Fixed-Time Sliding Mode Control for Constrained Attitude Tracking on $\mathrm{SO}(3)$2026-09-012609.01211arxiv
How Much Training is Needed with a Digital Twin?2026-09-012609.01220arxiv
Constructive Port-Hamiltonian Energy Shaping Design of Dispatchable Virtual Oscillators in Grid-Forming Converters2026-09-012609.01349arxiv
Exact Risk-Complexity Laws for Projective Boundaries in Scenario Optimization and Distribution-Free Certification2026-09-012609.01355arxiv
Equivalent DQ Sequence-Domain Model of Unbalanced Three-Phase Passive Elements for Power Converter Controllers2026-09-012609.01396arxiv
Blackbox Small-Signal Modeling of Grid-Connected Inverters in Asymmetrical Power Grids2026-09-012609.01411arxiv
Generalized Semi-Infinite Programming for Robust Optimal Control with Decision-Dependent Uncertainty2026-09-012609.01538arxiv
Stability of Droop-Controlled Low-Frequency Transmission Lines2026-09-012609.01571arxiv
Curriculum-Guided Reinforcement Learning for Energy-Efficient UAV-ISAC in Post-Disaster Search-and-Rescue Operations2026-09-012609.01764arxiv
Physics-informed Learning for Orbital Uncertainty Propagation with Error Bounds2026-09-012609.01881arxiv
A Control Co-Design Framework to Optimize Sustainability with Application to Microgrid-Driven Data Centers2026-09-012609.01912arxiv
Quantum-Based k-Coverage Optimization for UAV-Aided Search and Rescue Missions2026-09-012609.01930arxiv
Situation Awareness for Intelligent Data Distribution in Connected Vehicles2026-09-012609.05521arxiv
LMI Properties and Applications in Systems, Stability, and Control Theory2026-08-311903.08599arxiv
Local Identifiability of Networks with Nonlinear Node Dynamics2026-08-312412.08472arxiv
Self-Healing Hybrid Control as a Proxy for Detection and Mitigation of Sensor Attacks in Cooperative Driving2026-08-312504.05958arxiv

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