On the controllability of nearest neighbor interconnections

By Herbert G. Tanner. IEEE Conference on Decision and Control, 2004

479 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/ac935be76588a5daeae222002d071116bd479ef6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Wei Ren
2. Guanrong Chen
3. Long Wang
4. Yongcan Cao
5. Wenwu Yu
6. Housheng Su
7. Yongnan Jia
8. Guangming Xie

Citations in the corpus

• Information consensus in multivehicle cooperative control (2007, background): “In [52], necessary and sufficient conditions are derived so that a collection of systems is controlled by a team leader.”
• Minimal Controllability Problems (2013, unknown): “trollability properties of networks [2], [3], [5], [9], [10], [12], [13]–[16], [21], [24], [27], [29], [34]–[36], [38] with similar”
• Leader–Follower Flocking of Multiple Robotic Fish (2015, background): “We suppose that for a follower, interconnection with the leader is unidirectional, while interconnection with the follower is bidirectional [18].”
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective (2009, background): “The controllability issue in leader-follower multi-agent systems was introduced in [36]”
• Multi-vehicle consensus with a time-varying reference state (2007, background): “In [23], necessary and sufficient conditions are derived so that a group of systems can be controlled by a team leader.”
• Containment Control in Mobile Networks (2008, methodology): “However, we will augment this control structure with the addition of leader-agents or anchor nodes [7].”
• Controllability of switching networks of multi‐agent systems (2012, background): “Proof The proof is similar to that of Tanner [26, Theorem IV.1].”
• Controllability of a Leader–Follower Dynamic Network With Switching Topology (2008, background): “In [9], Tanner studied the controllability of (1) in this case under special parameter conditions: wij = γi = 1 for all i, j.”
• Formation controllability of high-order linear time-invariant swarm systems (2010, methodology): “The popular first-order swarm system model with linear consensus algorithms studied extensively on consensus [14–17] or swarm system dynamics [23, 25, 27, 28] is a special case of the model depicted by (1).”
• Controllability of Weighted and Directed Networks with Nonidentical Node Dynamics (2013, background): “The controllability problem for a leader-follower multiagent systemwas proposed by Tanner [1], who formulated it as the classical controllability of a single-input linear system and then derived a necessary and sufficient algebraic condition in terms of the eigenvalues and eigenvectors of a submatri”
• Reaching a consensus via pinning control (2009, background): “In Tanner (2004) a similar problem was considered I This paper was not presented at any IFAC meeting.”
• Decentralized adaptive scheduling using consensus variables (2007, unknown): “Further, we consider specifically the case where we have an input only for node (or agent) k: In [11] a similar problem is considered using the idea of a leader node.”
• Control Principles of Complex Networks (2015, background): “First, linear systems offer an accurate model for some real problems, like consensus or agreement formation in multi-agent networks, where the state of each agent captures its opinion (Liu et al., 2008; Mesbahi and Egerstedt, 2010; Rahmani et al., 2009; Tanner, 2004).”
• Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks (2010, background): “The results are illustrated by computer simulations.”