Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1706.02272

Handling Model and Implementation Uncertainties via an Adaptive Discrete Sliding Mode Controller Design

Mohammad Reza Amini·Mahdi Shahbakhti·Selina Pan·J. Karl Hedrick
View original source ↗Read source document ↗Export metadata ↓

Abstract

Analog-to-digital conversion (ADC) and uncertainties in modeling the plant dynamics are the main sources of imprecisions in the design cycle of model-based controllers. These implementation and model uncertainties should be addressed in the early stages of the controller design, otherwise they could lead to failure in the controller performance and consequently increase the time and cost required for completing the controller verification and validation (V&V) with more iterative loops. In this paper, a new control approach is developed based on a nonlinear discrete sliding mode controller (DSMC) formulation to mitigate the ADC imprecisions and model uncertainties. To this end, a DSMC design is developed against implementation imprecisions by incorporating the knowledge of ADC uncertainties on control inputs via an online uncertainty prediction and propagation mechanism. Next, a generic online adaptive law will be derived to compensate for the impact of an unknown parameter in the controller equations that is assumed to represent the model uncertainty. The final proposed controller is an integrated adaptive DSMC with robustness to implementation and model uncertainties that includes (i) an online ADC uncertainty mechanism, and (ii) an online adaptation law. The proposed adaptive control approach is evaluated on a nonlinear automotive engine control problem in real-time using a processor-in-the-loop (PIL) setup with an actual electronic control unit (ECU). The results reveal that the proposed adaptive control technique removes the uncertainty in the model fast, and significantly improves the robustness of the controllers to ADC imprecisions. This provides up to 60% improvement in the performance of the controller under implementation and model uncertainties compared to a baseline DSMC, in which there are no incorporated ADC imprecisions.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad Reza Amini, Mahdi Shahbakhti, Selina Pan, J. Karl Hedrick. 2017-06-07. Handling Model and Implementation Uncertainties via an Adaptive Discrete Sliding Mode Controller Design. https://doi.org/10.1115/dscc2016-9732

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

KEEP EXPLORING

Related papers

arXiv2026

On the stability of proximal operators in Wasserstein spaces under different notions of convexity

The proximal operator is a fundamental tool in variational analysis and optimization. In the setting of a Hilbert space, given a proper, lower semicontinuous convex functional, its proximal operator is non-expansive, that is, 1-Lipschitz continuous. In the Wasserstein setting, the contraction properties of this operator have been investigated from different perspectives by Carlen and Craig and by Adve and Mészáros, among others, and are not completely understood. In this paper, we study the stability properties of proximal maps, with a particular focus on non-expansivity, under various notions of convexity of the functional that can be considered in the Wasserstein space.

math.OC↗
arXiv2026

Symmetry-dependence in Rounding of a Convex Body

The symmetry measure of a convex body $S\subset\mathbb{R}^n$ is given by: $\mathrm{sym}(S):=\max\{α\ge0:\text{ there exists }x\in S\text{ such that }-α(S-x)\subseteq S-x\}$, where such an $x$ is called a Minkowski center. We prove that every convex body $S$ admits a $\sqrt{\frac{n}{\mathrm{sym}(S)}}$-rounding of $S$, namely, there exists an origin-centered ellipsoid $E$ and a center $c$ such that $E\subseteq S-c\subseteq\sqrt{\frac{n}{\mathrm{sym}(S)}}\,E$. This result was conjectured in 2005 by Belloni and Freund. As special cases, this recovers an $n$-rounding of $S$ (since $\mathrm{sym}(S)\ge\frac{1}{n}$), and a $\sqrt{n}$-rounding when $\mathrm{sym}(S)=1$. In the case when $S$ is a polytope given as the convex hull of points, the desired rounding is produced by a regularized minimum-volume covering ellipsoid problem where the regularization is with respect to the Minkowski center. Similarly, when $S$ is a polytope given as the intersection of halfspaces, such a rounding is produced by a regularized maximum-volume inscribed ellipsoid problem. In both of these cases, the rounding can be computed by first solving a linear optimization problem (to compute $\mathrm{sym}(S)$ and a Minkowski center), and then solving a convex optimization problem with a logarithmic determinant objective, second-order cone constraints, and one semidefinite cone constraint. We also show that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is nearly tight in its dependence on dimension and symmetry. When $\frac{n+1}{1+\mathrm{sym}(S)}$ is an integer, we show by explicit construction that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is tight. In the more general case, for every dimension $n$ and every admissible symmetry value, we construct a polytope $S$ for which every rounding factor is at least $\sqrt{\frac{2}{3}}\sqrt{\frac{n}{\mathrm{sym}(S)}}$.

math.OC↗
arXiv2026

Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities

We analyze a stochastic algorithm with Halpern-type anchoring for constrained convex-concave problems and monotone variational inequalities. This single-loop and single-call algorithm uses one unbiased sample of the gradient operator at every iteration, to be applicable to monotone games with noisy feedback. With $t$ denoting the iteration counter, we prove an anytime last-iterate convergence rate of $O(t^{-1/4})$ for both the gradient-mapping norm and restricted gap, bypassing the $O(t^{-1/5})$ constrained-anytime bottleneck in the literature. Specializing then to multi-point oracles, we use variance reduction to achieve the $O(t^{-1/2})$ rate with an anytime single-loop algorithm using $2$ samples per iteration. Our results allow constrained problems with a potentially unbounded feasible set; as well as a structured class of stochastic oracles whose variance need not be uniformly bounded.

math.OC↗