Pages that link to "Item:Q5190248"

The following pages link to Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective (Q5190248):

Displaying 50 items.

• Deviation bounds in multi-agent systems described by undirected graphs (Q259447) (← links)
• Controllability of networked MIMO systems (Q286356) (← links)
• Group controllability of discrete-time multi-agent systems (Q326187) (← links)
• Controller architectures: tradeoffs between performance and structure (Q328177) (← links)
• Nodes selection strategy in cooperative tracking problem (Q340644) (← links)
• Controllability of the multi-agent system modeled by the threshold graph with one repeated degree (Q345017) (← links)
• Leaders in multi-agent controllability under consensus algorithm and tree topology (Q360669) (← links)
• Decentralized stabilizability of multi-agent systems under fixed and switching topologies (Q385431) (← links)
• Controllability and observability of coordinated linear systems (Q417570) (← links)
• Manipulability of leader-follower networks with the rigid-link approximation (Q462329) (← links)
• Adaptive coordinated tracking of multi-agent systems with quantized information (Q473423) (← links)
• Controllability of weighted and directed networks with nonidentical node dynamics (Q473594) (← links)
• Sparse stabilization of dynamical systems driven by attraction and avoidance forces (Q480050) (← links)
• Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
• Stabilization of bilinear sparse matrix control systems using periodic inputs (Q510123) (← links)
• Data based identification and prediction of nonlinear and complex dynamical systems (Q521774) (← links)
• Switching controllability of discrete-time multi-agent systems with multiple leaders and time-delays (Q529959) (← links)
• Consensus of linear multi-agent systems with reduced-order observer-based protocols (Q553379) (← links)
• Leader localization in multi-agent systems subject to failure: a graph-theoretic approach (Q642928) (← links)
• Transfer function representation of cyclic consensus systems (Q644260) (← links)
• The single-input minimal controllability problem for structured systems (Q893991) (← links)
• On the complexity of the constrained input selection problem for structural linear systems (Q901120) (← links)
• A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol (Q963798) (← links)
• Leader-following consensus of multi-agent systems under fixed and switching topologies (Q984746) (← links)
• Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks (Q985276) (← links)
• Diffusion inspires selection of pinning nodes in pinning control (Q1619138) (← links)
• Optimizing the controllability of arbitrary networks with genetic algorithm (Q1619203) (← links)
• On quantitatively measuring controllability of complex networks (Q1620604) (← links)
• Learning and sparse control of multiagent systems (Q1620866) (← links)
• Leader selection for strong structural controllability of single-integrator multi-agent systems (Q1621105) (← links)
• Maximizing the smallest eigenvalue of a symmetric matrix: a submodular optimization approach (Q1626929) (← links)
• Dominant eigenvalue minimization with trace preserving diagonal perturbation: subset design problem (Q1640253) (← links)
• Controllability of multi-agent systems with directed and weighted signed networks (Q1647440) (← links)
• Group controllability of two-time-scale multi-agent networks (Q1661972) (← links)
• Constructing a controllable graph under edge constraints (Q1680674) (← links)
• Symmetry reduction for dynamic programming (Q1716553) (← links)
• Target control and source estimation metrics for dynamical networks (Q1737672) (← links)
• Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms (Q1737769) (← links)
• Performance of leader-follower multi-agent systems in directed networks (Q1749414) (← links)
• Second-order controllability of two-time-scale multi-agent systems (Q2008203) (← links)
• Disturbance decoupling problem for multi-agent systems: a graph topological approach (Q2018578) (← links)
• Structural controllability of networked relative coupling systems (Q2021293) (← links)
• The impact of graph symmetry on the number of driver nodes in complex networks (Q2027437) (← links)
• Eigenvectors and controllability of non-Hermitian random matrices and directed graphs (Q2042849) (← links)
• \(\mathcal{H}_\infty\) network optimization for edge consensus (Q2068543) (← links)
• Multi-agent control: a graph-theoretic perspective (Q2070030) (← links)
• Strong structural controllability of networks: comparison of bounds using distances and zero forcing (Q2097717) (← links)
• Observability-blocking control using sparser and regional feedback for network synchronization processes (Q2097741) (← links)
• Edge controllability of signed networks (Q2103670) (← links)
• A consensus protocol considering Lipschitz constant and communication topology condition of high-order nonlinear multi-agent systems (Q2137399) (← links)