B
Brian D. O. Anderson
Researcher at Australian National University
Publications - 1120
Citations - 50069
Brian D. O. Anderson is an academic researcher from Australian National University. The author has contributed to research in topics: Linear system & Control theory. The author has an hindex of 96, co-authored 1107 publications receiving 47104 citations. Previous affiliations of Brian D. O. Anderson include University of Newcastle & Eindhoven University of Technology.
Papers
More filters
Proceedings ArticleDOI
Deterministic gossiping with a periodic protocol
TL;DR: A sequence of allowable gossips between pairs of agents in a group is complete if the gossip graph which the sequence generates is a connected spanning subgraph of the graph of all allowable gossip pairs; such a sequence is minimally complete if there is no shorter sequence which is complete.
Journal ArticleDOI
Understanding Error Propagation in Multihop Sensor Network Localization
TL;DR: The quantitative relationship among sensor localization errors, minimal hop counts from sensors to anchors, the sensor density, and the noise level of distance measurements reflects the properties of error propagation and is greatly helpful to the design and deployment of large-scale sensor networks.
Journal ArticleDOI
Applications of the Poincare-Hopf Theorem: Epidemic Models and Lotka-Volterra Systems
TL;DR: The classical Poincare--Hopf Theorem from differential topology is used to derive a result on a sufficient condition on the Jacobian for the existence of a unique equilibrium for the system, which is in fact locally exponentially stable.
Journal ArticleDOI
On the Existence of H Matrices
Elementary operations for the reorganization of minimally persistent formations
TL;DR: In this article, the authors study the construction and transformation of two-dimensional minimally persistent graphs and propose different types of directed graph operations allowing one to sequen- tially build any persistent graph (i.e., persistent graph with a minimal number of edges for a given number of vertices).