Pages that link to "Item:Q2917806"
From MaRDI portal
The following pages link to Graph-theoretic characterization of controllability for multi-agent systems (Q2917806):
Displaying 17 items.
- Deviation bounds in multi-agent systems described by undirected graphs (Q259447) (← links)
- Controllability of the multi-agent system modeled by the threshold graph with one repeated degree (Q345017) (← links)
- Leader localization in multi-agent systems subject to failure: a graph-theoretic approach (Q642928) (← links)
- A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol (Q963798) (← links)
- Controllability of multiagent systems with a directed tree (Q1664635) (← links)
- Multi-agent control: a graph-theoretic perspective (Q2070030) (← links)
- Strong targeted controllability of multi-agent systems with time-varying topologies over finite fields (Q2151928) (← links)
- A new perspective to algebraic characterization on controllability of multiagent systems (Q2173707) (← links)
- Input addition and leader selection for the controllability of graph-based systems (Q2350792) (← links)
- Almost equitable partitions and new necessary conditions for network controllability (Q2407159) (← links)
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control (Q2448429) (← links)
- Controllability of undirected graphs (Q2451704) (← links)
- Almost equitable partitions and controllability of leader-follower multi-agent systems (Q2665380) (← links)
- Graph-theoretic characterisations of structural controllability for multi-agent system with switching topology (Q2871703) (← links)
- Controllability of multi-agent systems under directed topology (Q3133844) (← links)
- Controllability of multiagent systems based on path and cycle graphs (Q3134174) (← links)
- Unified understanding and new results of controllability model of multi‐agent systems (Q6082762) (← links)
