کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
7151719 1462302 2016 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Almost sure convergence of extremum seeking algorithm using stochastic perturbation
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
Almost sure convergence of extremum seeking algorithm using stochastic perturbation
چکیده انگلیسی
This paper presents an extremum seeking (ES) algorithm where the perturbation signal is a martingale difference sequence (m.d.s.) with a vanishing variance. The measurement noise at the plant output is modeled by a superposition of deterministic component, and a non-stationary colored noise signal. The optimizing set point of the uncertain reference-to-output equilibrium map is estimated by a stochastic approximation (SA)-type algorithm. The algorithm has a vanishing gain sequence dependent on the set point estimates. By utilizing powerful tools of the martingale convergence theory it is proved that with probability one the set point estimates converge to the optimizing equilibrium point, in spite of the presence of a measurement noise. This result is derived without requiring boundedness or any prior condition on the set point estimates.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Systems & Control Letters - Volume 94, August 2016, Pages 133-141
نویسندگان
, ,