اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAnalysis of explicit and implicit discrete-time equivalent-control based sliding mode controllers
255
0
0.0
(
0
)
تأليف
Olivier Huber
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Different time-discretization methods for equivalent-control based sliding mode control (ECB-SMC) are presented. A new discrete-time sliding mode control scheme is proposed for linear time-invariant (LTI) systems. It is error-free in the discretization of the equivalent part of the control input. Results from simulations using the various discretized SMC schemes are shown, with and without perturbations. They illustrate the different behaviours that can be observed. Stability results for the proposed scheme are derived.
قيم البحث
اقرأ أيضاً
In this paper, we present Lyapunov-based {color{black}time varying} controllers for {color{black}fast} stabilization of a perturbed chain of integrators with bounded uncertainties. We refer to such controllers as {color{black}time varying} higher ord
er sliding mode controllers since they are designed for nonlinear Single-Input-Single-Output (SISO) systems with bounded uncertainties such that the uncertainty bounds are unknown. %{color{blue} OLD: Our main result states that, given any neighborhood $varepsilon$ of the origin, we determine a controller insuring, for every uncertainty bounds, that every trajectory of the corresponding closed loop system enters $varepsilon$ and eventually remains there. Furthermore, based on the homogeneity property, a new asymptotic accuracy, which depends on the size of $varepsilon$, is presented.} We provide a time varying control feedback law insuring verifying the following: there exists a family $(D(t))_{tgeq 0}$ of time varying open sets decreasing to the origin as $t$ tends to infinity, such that, for any unknown uncertainty bounds and trajectory $z(cdot)$ of the corresponding system, there exists a positive positve $t_z$ for which $z(t_z)in D(t_z)$ and $z(t)in D(t)$ for $tgeq t_z$. %enters convergence in finite time of all the trajectories to a time varying domain $D(t)$ shrinking to the origin and their maintenance there. Hence, since the function $eta(t)$ tends to zero, this leads the asymptotic convergence of all the trajectories to zero. The effectiveness of these controllers is illustrated through simulations.
There has been substantial progress recently in understanding toy problems of purely implicit signaling. These are problems where the source and the channel are implicit -- the message is generated endogenously by the system, and the plant itself is
used as a channel. In this paper, we explore how implicit and explicit communication can be used synergistically to reduce control costs. The setting is an extension of Witsenhausens counterexample where a rate-limited external channel connects the two controllers. Using a semi-deterministic version of the problem, we arrive at a binning-based strategy that can outperform the best known strategies by an arbitrarily large factor. We also show that our binning-based strategy attains within a constant factor of the optimal cost for an asymptotically infinite-length version of the problem uniformly over all problem parameters and all rates on the external channel. For the scalar case, although our results yield approximate optimality for each fixed rate, we are unable to prove approximately-optimality uniformly over all rates.
We study predictive control in a setting where the dynamics are time-varying and linear, and the costs are time-varying and well-conditioned. At each time step, the controller receives the exact predictions of costs, dynamics, and disturbances for th
e future $k$ time steps. We show that when the prediction window $k$ is sufficiently large, predictive control is input-to-state stable and achieves a dynamic regret of $O(lambda^k T)$, where $lambda < 1$ is a positive constant. This is the first dynamic regret bound on the predictive control of linear time-varying systems. Under more assumptions on the terminal costs, we also show that predictive control obtains the first competitive bound for the control of linear time-varying systems: $1 + O(lambda^k)$. Our results are derived using a novel proof framework based on a perturbation bound that characterizes how a small change to the system parameters impacts the optimal trajectory.
In this paper, a full-bridge boost power converter topology is studied for power factor control, using output high order sliding mode control. The AC/DC converters are used for charging the battery and super-capacitor in hybrid electric vehicles from
the utility. The proposed control forces the input currents to track the desired values, which can controls the output voltage while keeping the power factor close to one. Super-twisting sliding mode observer is employed to estimate the input currents and load resistance only from the measurement of output voltage. Lyapunov analysis shows the asymptotic convergence of the closed loop system to zero. Simulation results show the effectiveness and robustness of the proposed controller.
In order to certify performance and safety, feedback control requires precise characterization of sensor errors. In this paper, we provide guarantees on such feedback systems when sensors are characterized by solving a supervised learning problem. We
show a uniform error bound on nonparametric kernel regression under a dynamically-achievable dense sampling scheme. This allows for a finite-time convergence rate on the sub-optimality of using the regressor in closed-loop for waypoint tracking. We demonstrate our results in simulation with simplified unmanned aerial vehicle and autonomous driving examples.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
