Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Asymptotic agreement in distributed estimation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Borkar, V. ; Tata Institute for fundamental Research, Bangalore, India ; Varaiya, P.P.

Each of several agents updates his estimate of the same random variable whenever he makes a new observation or receives the estimate made by another agent. In turn, each agent transmits his estimate to a randomly chosen subset of the other agents. A subset of agents forms a communicating ring if for every pair \underline {m}, \underline {p} of ring members, there is a sequence of ring members \underline {m} = \underline {m}_{1}, \underline {m}_{2}, ... , \underline {m}_{n+1} = \underline {p} such that \underline {m}_{i} sends his estimate to \underline {m}_{i+1} infinitely often. If each ring member knows that he is a ring member, then the estimates of all the ring members asymptotically agree. However, this common limit can depend upon the order in which estimates are transmitted.

Published in:

Automatic Control, IEEE Transactions on  (Volume:27 ,  Issue: 3 )