Searcharxiv⌕ Search

arXiv · 2610.35613

Graph-Convolutional Reinforcement Learning for Finite-Time Stabilization of a Chaotic Chua Circuit via Unified Flexible Terminal Sliding-Mode Control

Abstract

This paper introduces a graph convolutional reinforcement learning framework for the finite-time stabilization of chaotic dynamics in a physical Chua circuit. The circuit is modeled directly in terms of capacitor voltages, inductor current, and physical component parameters. This preserves the connection between the mathematical model and the underlying electrical system. A unified, flexible terminal sliding-mode controller is developed to achieve stabilization within a finite time in the presence of uncertainties in the lumped model, external disturbances, and bounded control inputs. The controller incorporates state-dependent nonlinear exponents to provide flexible convergence characteristics while avoiding singular terms near equilibrium. To minimize dependence on manual controller tuning, the admissible controller parameters are optimized using an actor-critic reinforcement learning scheme with a graph convolutional network that leverages the circuit dynamics' coupling structure. The learned parameters are constrained to the ranges required by the theoretical stability conditions. Numerical experiments demonstrate the rapid suppression of chaotic oscillations and the finite-time convergence of the state and sliding variables while respecting the prescribed input-saturation limits. Compared to a reference control method, the proposed approach reduces the IAE, ISE, ITAE, and ITSE by 56.27\,\%, 56.40\,\%, 61.69\,\%, and 64.70\,\%, respectively. These results suggest that graph-based reinforcement learning can effectively tune parameters while retaining the robustness and analytical structure of the underlying sliding-mode controller.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hooman Fatoorehchi, Majid Roohi, Rasmus Kold, Matthias Ehrhardt, Andreas Basse-O'Connor, Sebastian Nis Bay Villadsen, Philip L. Fosbøl. 2026-10-26. Graph-Convolutional Reinforcement Learning for Finite-Time Stabilization of a Chaotic Chua Circuit via Unified Flexible Terminal Sliding-Mode Control. https://arxiv.org/abs/2610.35613

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Topological Pressure of Discontinuous Potentials and Variational Principle for Flows

Let $X$ be a compact metric space and $Φ=\{φ_t\}_{t\in\mathbb{R}}$ be a continuous flow on $X$. We introduce two types of topological pressure for family of discontinuous potentials $a=\{a_t\}_{t>0}$. First, define the topological pressure of family of measurable potentials $a=\{a_t\}_{t>0}$ on a subset $Z$ for flow and proof its invariant principle. The second topological pressure is defined on a invariant subset having a nested family of subsets, we also proof its invariant principle.

math.DS↗

The Radon--Nikodym topography of acyclic measured graphs

The classical Adams dichotomy [Ada90] characterizes amenability of probability-measure-preserving treed equivalence relations in terms of the ends of a given treeing. We extend this dichotomy to the measure-class-preserving (mcp) setting by analyzing the Radon--Nikodym topography of an acyclic mcp Borel graph, i.e., the interaction between the graph geometry and the associated Radon--Nikodym cocycle. In the general mcp setting one must count not all ends, but only the nonvanishing ends: those ends which have positive upper cocycle-weight. More precisely, we prove that a locally countable acyclic mcp graph is amenable if and only if a.e. component has at most two nonvanishing ends, while it is nowhere amenable exactly when a.e. component has a nonempty perfect closed set of nonvanishing ends. At the heart of our analysis lies the study of acyclic countable-to-one Borel functions. Our critical result is that, outside of the essentially two-ended setting, all back ends in a.e. orbit are vanishing and have cocycle-finite geodesics. We also give several characterizations, including topographical and cocycle-free, of essential one-endedness of such functions, and show that the number of barytropic ends controls the essential number of ends. Our proofs utilize mass transport, end selection, and the notion of the Radon--Nikodym core for acyclic mcp graphs, a new concept that serves as a guiding framework for our topographical analysis.

math.DS↗

The extended future cover and desynchronization of sofic shifts

The paper describes a cover of the future cover of a sofic shift which is canonical in the same way as the future cover itself. In some cases the cover is isomorphic to the future cover and in other it is a genuine extension. The extended future cover is then used to introduce and describe the desynchronization of sofic shifts.

math.DS↗