eess.SY Electrical Engineering and Systems Science
Systems and Control papers on arXiv
Track systems, control, estimation, and signal-oriented dynamics in eess.SY. A system class or control objective helps turn this broad engineering category into a targeted reading list.
1,569 papers indexed
Follow the whole category with the official eess.SY RSS feed, or use a personal filter to select keywords and authors. See the arXiv RSS feed guide for setup and the category guide for primary and cross-listed subjects.
Filter ideas for Systems & Control
How filters workPair an objective with the system you study, such as stability AND nonlinear. If your work also spans mathematical control, consider an OR category group that includes math.OC.
- Try filter
Model predictive control
Add a plant, constraint, or robustness term to isolate the methods relevant to your system.
Category eess.SY + abstract contains “model predictive control” - Try filter
State estimation
Add state, observer, or a system model to distinguish estimation from other uses of the term.
Category eess.SY + abstract contains “estimation”
Examples are starting points. Preview them before saving; keyword matches do not assess a paper’s quality. Recent papers below use the primary category; saved category filters also match cross-listed categories.
LATEST SUBMISSIONS
Recent Systems and Control papers
Brian Yarbrough, Jesse Wayment, Jingbo Wang, Philip E. Paré, Shreyas Sundaram
Abstract
We introduce Hyperlyve (Hyperplane Partitioned Lyapunov Verification and Enumeration), a framework for proving the asymptotic stability of nonlinear dynamical systems, including those with neural network controllers. Hyperlyve learns and formally certifies continuous piecewise-affine (CPA) neural Lyapunov functions within a counterexample-guided inductive synthesis (CEGIS) loop. Hyperlyve's key innovation is a parallel algorithm that enumerates the hyperplane arrangement formed by the ReLU activations of deep networks and certifies that Lyapunov conditions hold within each polyhedral region. We derive sound and complete regional tests to verify the asymptotic stability of the exact smooth dynamics (rather than a piecewise-linear approximation) within a compact domain of interest. Furthermore, we formally characterize the computational complexity of the CPA neural Lyapunov verification problem as co-NP-complete, filling a key gap in the literature. Empirical results demonstrate that Hyperlyve enumerates ReLU networks over 150-times faster than competing tools, which contributes to Hyperlyve proving the asymptotic stability of systems that are currently intractable for state-of-the-art verifiers.
Moh Kamalul Wafi
Abstract
This paper studies continuous-time distributed adaptive identification of unknown nonlinear systems over directed communication networks without requiring source or neighboring inputs to be shared. Each sensing node reconstructs the source state while adapting local estimates of the unknown linear and nonlinear dynamics using only locally available information and neighboring state estimates. A network-level error representation is derived to characterize the interaction among the communication topology, observer dynamics, parameter uncertainty, and nonlinear mismatch. Norm-based, structured Lyapunov, and robust LMI conditions are established to guarantee that the resulting coupling operator is Hurwitz. Unlike the corresponding discrete-time formulation, the proposed continuous-time adaptive laws do not require normalization. A Lyapunov analysis establishes boundedness of the adaptive parameters and asymptotic convergence of the estimation and source-tracking errors in the unperturbed case. Input-to-state stability is further established under bounded predictor mismatch and source disturbances. Numerical studies over star, cyclic, and path topologies support the theoretical results and demonstrate approximately linear computational scaling with the number of sensing nodes.
Amber He Wei, Shiyu Cheng, Andrew Clark, Bruno Sinopoli
Abstract
This paper develops a decentralized event-triggered topology-switching protocol that allows agents to disconnect from the communication network while preserving state safety and excluding Zeno behavior. We establish a robust barrier function condition that guarantees safety as long as the estimation error remains within a prescribed threshold. Each agent uses locally computable certificates to determine when to connect and disconnect from the network. The certificate construction improves scalability by reducing the complexity of topology-dependent computations from to , where is the number of agents. We formally prove that the protocol ensures the estimation error does not exceed the prescribed threshold and is non-Zeno. An alternating method computes an error-weighting matrix and a quadratic barrier function that guarantee safety under the proposed protocol. Finally, we evaluate the protocol on four interconnected microgrids. Compared with maintaining network connectivity at all times, the protocol reduces the time agents remain connected while keeping phase and frequency within their safe operating region.
Hassan Munif, Anthony Couthures, Vineeth Satheeskumar Varma, Samson Lasaulce, Irinel-Constantin Morarescu
Abstract
We study the preservation and propagation of public actions in networks whose agents hold continuous private opinions. Agents update their opinions from their neighbors' observed actions and express them through action rules whose thresholds differ across agents. We characterize groups of agents that preserve a given common action regardless of the outsiders' actions. We call such a group, paired with that action, a robust action cluster. We show that a group is a robust action cluster for that action if and only if each member places enough of its influence weight on the group, where the required influence depends on the member's own action rule. We further give a sufficient condition under which an agent outside the cluster permanently adopts the cluster's action, and we iterate it to obtain a cascade of agents that are guaranteed to adopt that action. Finally, numerical examples show that replacing heterogeneous thresholds by their mean can change both the propagation of an action and the presence of robust action clusters.
Julius Beerwerth, Julius Tischbein, Bassam Alrifaee
Abstract
Data-driven predictive control (DPC) predicts future outputs by combining recorded input-output trajectory data such that the combined trajectory approximately matches a measured initial trajectory and tracks a provided reference. This paper investigates to what extent and under which conditions DPC using data pooled across operating conditions retains the prediction accuracy of DPC using data from the current operating condition. In autonomous vehicle racing, the tire-road friction varies between racetrack sections and tire sets. If the initial trajectory and the recorded data originate from different frictions, prediction accuracy of DPC degrades. Ensuring the frictions match requires knowing the friction during recording and estimating the current friction explicitly. Instead, we pool data recorded at different frictions. We compare the prediction accuracy of DPC using data recorded under the current friction (matched), a different friction (mismatched) and data pooled from both frictions. We evaluate in simulation and small-scale vehicle experiments in the Cyber-Physical Mobility Lab (CPM Lab). Our results show that pooled data keep the multi-step root-mean-square prediction error within 1.5 times that of matched data, whereas mismatched data increase it by a factor of 2.2 to 3.4. To assess how this prediction accuracy carries over to control, we evaluate the tracking error from the raceline in closed loop. In simulation, DPC with pooled data tracks comparably to nonlinear model predictive control (13.7 cm versus 13.3 cm) and close to DPC with matched data in the CPM Lab, differing by 0.1 cm on the low-friction tires (1.6 cm versus 1.5 cm) and by 0.2 cm on the high-friction tires (0.9 cm versus 1.1 cm). DPC thus provides partial adaptation to varying friction, without a dedicated adaptation method.
Frequently asked questions
How do I get alerts for new Systems and Control papers on arXiv?
Create a filter for the eess.SY category — add keywords or authors to narrow it further if you like. Matching papers are delivered to a personal RSS feed, and optionally by immediate, daily, or weekly email digest.
Where does this Systems and Control paper data come from?
Paper metadata comes directly from arXiv through its official OAI-PMH feed, checked roughly every 15 minutes for new submissions in eess.SY and every other arXiv category.