Search arXiv⌕ Search

arXiv · 2611.02288

Charge-Balanced Control of Linear Systems: Controllability, Stabilizability, and Periodic Regulation

Abstract

Electrical neuromodulation is a therapeutic approach that regulates neural activity by delivering electrical currents to brain tissue to treat brain disorders, such as epilepsy and Parkinson's disease. A critical safety requirement is charge balance, which ensures zero net injected charge over each stimulation cycle. Despite its clinical importance, the implications of charge-balanced stimulation for system dynamics and control remain poorly understood. This article investigates the controllability, stabilizability, and regulation of discrete-time linear systems under charge-balanced input constraints, motivated by applications in electrical neuromodulation. We introduce novel notions of charge-balanced controllability and stabilizability and establish necessary and sufficient conditions for both properties. We further demonstrate that nonzero steady states cannot be maintained under charge-balanced inputs, motivating the introduction of charge-balanced periodic orbits as alternative control targets. We characterize the conditions under which convergence to such orbits is achievable and develop optimal feedback controllers to stabilize the origin and track optimal charge-balanced periodic orbits. Finally, we validate the proposed control framework using a Hodgkin-Huxley neuron model, demonstrating successful suppression of tonic spiking and highlighting the potential of our approach for controlling nonlinear dynamical systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jie Ruan, Zonglin Liu, Olaf Stursberg, Yuan Fan, Marcel van Gerven, Yuzhen Qin. 2026-11-01. Charge-Balanced Control of Linear Systems: Controllability, Stabilizability, and Periodic Regulation. https://arxiv.org/abs/2611.02288

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

KEEP EXPLORING

Related papers

Reinforcement Learning based Traffic Signal Control for Queue Minimization: From Lane-based to Laneless Traffic

Efficient traffic signal control (TSC) is essential for reducing congestion and delays. Traditional TSC methods struggle to capture the dynamics of laneless, heterogeneous traffic. We propose a reinforcement learning (RL) based adaptive TSC framework whose reward depends only on approach-level queue length, motivated by the difficulty of obtaining per-vehicle measurements in laneless traffic, and evaluate it using SUMO on a conventional lane-based, homogeneous (LBHO) intersection and on a non-orthogonal laneless, heterogeneous (LLHE) intersection. On the LBHO site, the lowest mean configuration has about 23\% lower mean queue length than a Dynamic Webster baseline, and the unselected Full-State configuration about 15\% lower. On the LLHE site, all RL configurations have 66-73\% lower mean queue length than a Dynamic Webster baseline under nominal demand, and 63--74\% lower under two higher-demand scenarios evaluated without retraining. Our algorithm also outperforms actuated control and a RESCO-DQN baseline on mean queue length. We additionally release a laneless, heterogeneous-vehicle SUMO framework integrated with RL based signal control, to our knowledge the first such open implementation on a current SUMO version.

eess.SY↗

A Deep State-Space Model Compression Method using Upper Bound on Output Error

We study deep state-space models (Deep SSMs) that contain linear quadratic-output (LQO) systems as internal blocks and present a compression method with a provable output error guarantee. We first derive an upper bound on the output error between two Deep SSMs and show that the bound can be expressed in terms of the $h^2$-error norms between the layerwise LQO systems. In particular, we show that reducing the $h^2$ approximation errors of the LQO systems placed in shallow layers is effective in reducing the derived upper bound on the output error. Next, we formulate an optimization problem for the derived upper bound and develop a gradient-based MOR method. In the numerical experiments, using the IMDb task from the LRA benchmark, we demonstrate the effectiveness of the proposed upper-bound-based compression method. In particular, we show that the number of trainable parameters can be reduced by approximately 60\% without retraining while maintaining the performance of the original model.

eess.SY↗

Safe Navigation in Cluttered Environments Via Spline-Based Harmonic Potential Fields

We provide a motion-planning framework for target reaching and obstacle avoidance in cluttered environments. Given a polyhedral decomposition of the feasible space, the agent is guided through a prescribed sequence of cells by a suitable control policy. For each cell, we construct a potential induced by a harmonic function on the unit disk whose Dirichlet boundary condition is represented by a cardinal B-spline curve. A detailed analysis of the curve periodicity, support, and control-point selection provides an explicit analytical construction of these potentials and the associated vector fields. We further characterize inter-cell control continuity and forward invariance of non-exit facets, and introduce a smoothed control law ensuring continuous switching between independently constructed neighboring cells. Numerical results illustrate that the resulting framework safely guides the agent along the prescribed cell sequence from the initial point to the target.

eess.SY↗