Search arXivSearch

arXiv · 2508.15616

Synthesis and SOS-based Stability Verification of a Neural-Network-Based Controller for a Two-wheeled Inverted Pendulum

Abstract

This work newly establishes the feasibility and practical value of a sum of squares (SOS)-based stability verification procedure for applied control problems utilizing neural-network-based controllers (NNCs). It successfully verifies closed-loop stability properties of a NNC synthesized using a generalizable procedure to imitate a robust, tube-based model predictive controller (MPC) for a two-wheeled inverted pendulum demonstrator system. This is achieved by first developing a state estimator and control-oriented model for the two-wheeled inverted pendulum. Next, this control-oriented model is used to synthesize a baseline linear-quadratic regulator (LQR) and a robust, tube-based MPC, which is computationally too demanding for real-time execution on the demonstrator system's embedded hardware. The generalizable synthesis procedure generates an NNC imitating the robust, tube-based MPC. Via an SOS-based stability verification procedure, a certificate of local asymptotic stability and a relevant inner estimate of the region of attraction (RoA) are obtained for the closed-loop system incorporating this NNC. Finally, experimental results on the physical two-wheeled inverted pendulum demonstrate that the NNC both stabilizes the system, and improves the control performance compared to the baseline LQR in both regulation and reference-tracking tasks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alvaro Detailleur, Dalim Wahby, Guillaume Ducard, Christopher Onder. 2025-08-21. Synthesis and SOS-based Stability Verification of a Neural-Network-Based Controller for a Two-wheeled Inverted Pendulum. https://arxiv.org/abs/2508.15616

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

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY