pith. sign in

arxiv: 1209.2194 · v5 · pith:P5YAXXLUnew · submitted 2012-09-11 · 🧮 math.OC · cs.LG· cs.MA· cs.SY

Cooperative learning in multi-agent systems from intermittent measurements

classification 🧮 math.OC cs.LGcs.MAcs.SY
keywords learningmeasurementsintermittentnoisyprotocoltime-varyingcooperativedistributed
0
0 comments X
read the original abstract

Motivated by the problem of tracking a direction in a decentralized way, we consider the general problem of cooperative learning in multi-agent systems with time-varying connectivity and intermittent measurements. We propose a distributed learning protocol capable of learning an unknown vector $\mu$ from noisy measurements made independently by autonomous nodes. Our protocol is completely distributed and able to cope with the time-varying, unpredictable, and noisy nature of inter-agent communication, and intermittent noisy measurements of $\mu$. Our main result bounds the learning speed of our protocol in terms of the size and combinatorial features of the (time-varying) networks connecting the nodes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.