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

Uloženo v:
Podrobná bibliografie
Vydáno v:2016 IEEE 55th Conference on Decision and Control (CDC) s. 2620 - 2625
Hlavní autoři: Fullmer, Daniel, Ji Liu, Stephen Morse, A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2016
Témata:
Autonomous agents
Conferences
Convergence
Distributed algorithms
Nickel
Real-time systems
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its estimate of the fixed point at its own event times, by utilizing estimates generated by each of its neighbors. Neighbor relations are characterized by a time-dependent directed graph N(t) whose vertices correspond to agents and whose arcs depict neighbor relations.
DOI:10.1109/CDC.2016.7798657