Brian D. O. Anderson

TL;DR: The main contributions of this paper are first to characterize the classes of periodic gossip sequences which have the same convergence rate and second to prove that if the graph of allowable gossips is a tree with each edge restricted to gossiping once per period, the convergence rate is quite surprisingly, fixed and invariant over all possible periodic gossip sequence the graph allows.

TL;DR: This work proposes a control law of the form of a decentralized gradient flow that evolves on a configuration manifold for agents in ℝd such that collisions among the agents do not occur and establishes lower bounds for the number of critical formations.

TL;DR: This paper considers the problem of localizing multiple agents, e.g. unmanned aerial vehicles, robots, etc., moving in two-dimensional space when the known data comprise 1) the inter-agent distances, and 2) the angle subtended at each agent by lines drawn from two landmarks at known positions.

TL;DR: A new H"~ control design method is proposed that somehow captures the useful properties of the IMC design method but can be used for both stable or unstable plants (LTI, SISO) in a coherent framework.