An asynchronous 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 M i : R n → R n assuming that each map is a paracontraction. The common fixed point is asynchronously computed in real time by m agents assuming each agent i knows only M i , the current esti...

Celý popis

Podrobná bibliografia

Vydané v:	2016 IEEE 55th Conference on Decision and Control (CDC) s. 2620 - 2625
Hlavní autori:	Fullmer, Daniel, Ji Liu, Stephen Morse, A.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2016
Predmet:	Autonomous agents Conferences Convergence Distributed algorithms Nickel Real-time systems
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!