ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
1.5k
Citations
106
Influential Citations
International Journal of Robust and Nonlinear Control
Venue
2006
Year
Abstract This paper describes a distributed coordination scheme with local information exchange for multiple vehicle systems. We introduce second‐order consensus protocols that take into account motions of the information states and their derivatives, extending first‐order protocols from the literature. We also derive necessary and sufficient conditions under which consensus can be reached in the context of unidirectional information exchange topologies. This work takes into account the general case where information flow may be unidirectional due to sensors with limited fields of view or vehicles with directed, power‐constrained communication links. Unlike the first‐order case, we show that having a (directed) spanning tree is a necessary rather than a sufficient condition for consensus seeking with second‐order dynamics. This work focuses on a formal analysis of information exchange topologies that permit second‐order consensus. Given its importance to the stability of the coordinated system, an analysis of the consensus term control gains is also presented, specifically the strength of the information states relative to their derivatives. As an illustrative example, consensus protocols are applied to coordinate the movements of multiple mobile robots. Copyright © 2006 John Wiley & Sons, Ltd.
This 2006 paper by Wei Ren and Ella Atkins is a seminal work in distributed multi-vehicle coordination, addressing a critical gap in consensus theory. While first-order consensus protocols were well-studied, real-world vehicles have second-order dynamics (position and velocity), making this extension essential for practical applications like drone swarms and autonomous ground vehicles. The paper's focus on unidirectional information exchange—common in sensor-limited or power-constrained systems—makes it particularly relevant for real-world deployments where communication links are not always bidirectional.
The paper's rigorous graph-theoretic analysis provides clear conditions for when consensus can be achieved, offering engineers actionable design guidelines. Its high citation count (1510) reflects its foundational role in multi-agent systems research.
The paper makes several key innovations:
The paper provides formal proofs rather than empirical benchmarks, but its key result is: for second-order consensus under directed graphs, the graph must contain a spanning tree AND the control gains must satisfy a condition involving the graph's eigenvalues. Specifically, the real parts of the eigenvalues of the Laplacian matrix must be positive and the gain ratio must be chosen to ensure all eigenvalues have negative real parts. The multi-robot example demonstrates that with appropriate gains, robots converge to a common velocity and maintain formation.
This work has had lasting impact on distributed control, formation flying, and sensor networks. It provided the theoretical foundation for later work on consensus with time delays, switching topologies, and heterogeneous agents. The paper's insights are now standard in textbooks on multi-agent systems and have been applied in autonomous vehicle coordination, satellite formation flying, and robotic swarm control.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba