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!
Abstract 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.
AbstractList 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.
Author Fullmer, Daniel
Ji Liu
Stephen Morse, A.
Author_xml – sequence: 1
  givenname: Daniel
  surname: Fullmer
  fullname: Fullmer, Daniel
  email: daniel.fullmer@yale.edu
  organization: Dept. of Electr. Eng., Yale Univ., New Haven, NY, USA
– sequence: 2
  surname: Ji Liu
  fullname: Ji Liu
  email: jiliu@illinois.edu
  organization: Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
– sequence: 3
  givenname: A.
  surname: Stephen Morse
  fullname: Stephen Morse, A.
  email: as.morse@yale.edu
  organization: Dept. of Electr. Eng., Yale Univ., New Haven, NY, USA
BookMark eNotjz1rwzAYhFVohibtHuiiP2BXiqKvMbgfKQS6ZA-vZSkW2JKRZaj_fR2a5e7hOA5ujR5DDBahLSUlpUS_Ve9VuSNUlFJqJbh8QGvKiSZUMamfUHsIGMY5mDbFEKcRN37MyddTtg2G7hqTz22PXUzYxH6Ysg9XDDfuY8DO_y61IfqQcXRL7qD33XzjARKYGPKi2ccwPqOVg260L3ffoPPnx7k6Fqefr-_qcCq8JrlgRDfCkL3iQM3eSWk0lxqolUztRM2pkjWzxFjKjTDMKkYYNCCNaKSjDtgGvf7PemvtZUi-hzRf7t_ZH26UVTY
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/CDC.2016.7798657
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1509018379
9781509018376
EndPage 2625
ExternalDocumentID 7798657
Genre orig-research
GroupedDBID 6IE
6IH
CBEJK
RIE
RIO
ID FETCH-LOGICAL-i90t-309d6c0485a1c4f77c9579a1e73826b5187b3e0ce15c6c3e8303ada7c6d7f1fa3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:38:19 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-309d6c0485a1c4f77c9579a1e73826b5187b3e0ce15c6c3e8303ada7c6d7f1fa3
PageCount 6
ParticipantIDs ieee_primary_7798657
PublicationCentury 2000
PublicationDate 2016-Dec.
PublicationDateYYYYMMDD 2016-12-01
PublicationDate_xml – month: 12
  year: 2016
  text: 2016-Dec.
PublicationDecade 2010
PublicationTitle 2016 IEEE 55th Conference on Decision and Control (CDC)
PublicationTitleAbbrev CDC
PublicationYear 2016
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.726073
Snippet 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...
SourceID ieee
SourceType Publisher
StartPage 2620
SubjectTerms Autonomous agents
Conferences
Convergence
Distributed algorithms
Nickel
Real-time systems
Title An asynchronous distributed algorithm for computing a common fixed point of a family of paracontractions
URI https://ieeexplore.ieee.org/document/7798657
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDI62iQMnQBvirRw40q0PGqdHNJg4oGmHHXabUsdllaCdtm6Cf4_TjiEkLtzcKFWlOI77xfZnIW7DxDchRo42VFkGKGnm6Si1_BjGfCaHoBp2_RcYj_Vslkxa4m5fC0NEdfIZ9Z1Yx_JtiRt3VTYASLSKoS3aAKqp1fqOPPrJYPg4dKlaqr-b9qtfSu0uRkf_-9Cx6P3U3cnJ3qOciBYVXbF4KKRZfxboaGwZp0vruG5dmyqy0ry9lgzvF--Sfz4l1i0a-FVpnMw7TGb5B09blnlRyTLj8eZGw8mO9bvOVG9qG9Y9MR09TYfP3q4_gpcnfuVFfmIVsgXGJsD7DABdyM0EBBFjhjQONKQR-UhBjAoj0uytjDWAykIWZCY6FZ2iLOhMyBQQDGTEJk5sxIG2DLhD8jUaG4DCc9F1izRfNgwY8936XPw9fCkOnR6apI8r0alWG7oWB7it8vXqplbbF9Ocnfc
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLbGQIIToA3xJgeOdOtjjdsjGqAhxrTDDrtNaeKySdBOW4fg3-O0YwiJCzc3SlUpjuN-sf0Z4NqPXeXrwNKGSsMAJUmdKEgMP_ohn8k-yopdv4-DQTQex8Ma3GxqYYioTD6jlhXLWL7J9cpelbUR40iGuAXbYafju1W11nfs0Y3b3buuTdaSrfXEXx1TSofxsP-_Tx1A86fyTgw3PuUQapQ1YHqbCbX8zLQlsmWkLoxlu7WNqsgI9fqSM8Cfvgn-_RS6bNLArwplZd5jIp198LR5PssKkac8Xt1pWNnyfpe56lV1w7IJo4f7UbfnrDskOLPYLZzAjY3UbIOh8nQnRdQ26KY8woBRQxJ6ESYBuZq8UEsdUMT-ShmFWhpMvVQFR1DP8oyOQSSoUWFKbOTEZuxFhiG3T26klfFQ6hNo2EWazCsOjMl6fU7_Hr6C3d7ouT_pPw6ezmDP6qRKATmHerFY0QXs6Pditlxclir8AjS-oT4
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2016+IEEE+55th+Conference+on+Decision+and+Control+%28CDC%29&rft.atitle=An+asynchronous+distributed+algorithm+for+computing+a+common+fixed+point+of+a+family+of+paracontractions&rft.au=Fullmer%2C+Daniel&rft.au=Ji+Liu&rft.au=Stephen+Morse%2C+A.&rft.date=2016-12-01&rft.pub=IEEE&rft.spage=2620&rft.epage=2625&rft_id=info:doi/10.1109%2FCDC.2016.7798657&rft.externalDocID=7798657