کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5002371 1368452 2016 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions
ترجمه فارسی عنوان
یک الگوریتم توزیع شده برای محاسبه یک نقطه ثابت مشترک از یک خانواده از پاراککنی
کلمات کلیدی
الگوریتم توزیع شده، پارک کنتراسیون، غیر خطی،
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مکانیک محاسباتی
چکیده انگلیسی
A distributed algorithm is described for finding a common fixed point of a family of m > 1 nonlinear maps Mi : IRn → IRn assuming that each map is a paracontraction and that such a common fixed point exists. The common fixed point is simultaneously computed by m agents assuming each agent i knows only Mi, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its estimate of the fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-dependent directed graph ℕ(t) whose vertices correspond to agents and whose arcs depict neighbor relations. It is shown that for any family of paracontractions Mi, i ϵ {1,2,..., m} which has at least one common fixed point, and any sequence of strongly connected neighbor graphs ℕ(t),t = 1,2,..., the algorithm causes all agent estimates to converge to a common fixed point.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: IFAC-PapersOnLine - Volume 49, Issue 18, 2016, Pages 552-557
نویسندگان
, , ,