SearcharxivSearch

arXiv · 1706.02272

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

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

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

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC