Stochastic Systems Group
Home Research Group Members Programs  
Demos Calendar Publications Mission Statement Alumni

SSG Seminar Abstract

Asymptotic Agreement and Message Passing Schemes

Sekhar Tatikonda
University of California at Berkeley

In multi-agent control there is often a need for distributed consensus on different system variables. These variables may include the state estimates and actions of the different agents. To achieve consensus, also called asymptotic agreement, the agents communicate messages amongst themselves.

Message-passing schemes are a class of algorithms that take advantage of the conditional independence properties of a joint measure to efficiently compute marginal statistics.

In this talk we discuss some connections between asymptotic agreement and message passing schemes.

Problems with this site should be emailed to