Related Experiment Video
Updated: Dec 27, 2025

WheelCon: A Wheel Control-Based Gaming Platform for Studying Human Sensorimotor Control
Published on: August 15, 2020
The Complexity in Complete Graphic Characterizations of Multiagent Controllability
Abstract:
Establishing the graph-based criterion for the selection of any location and any number of leaders is the main difficulty in the complete graphic characterization of multiagent controllability. This greatly increases the complexity of the study, compared with the results derived for only one or several classes of leaders. Through a detailed analysis of graphs of six nodes, this article presents a systematic design and identification process for the complete graphic characterization by taking advantage of controllability destructive nodes. The topologies obtained by the proposed method allow directly determining controllability at the network topology level. The results are not only applicable to any leader's selection but also reveal the difficulty and complexity in the study of complete controllability graphic characterizations. Moreover, by comparing graphs composed of five and six nodes, the results reveal the graph-theory-based controllability complexity caused by adding only one node. Finally, results are derived to show how to design topology structures to ensure the controllability under any selection of leaders.
Related Concept Videos
Multi-input and Multi-variable systems
In the absence of...
Hierarchy of Motor Control
Constraints and Statical Determinacy
Controller Configurations
Control-system compensation involves various configurations, most commonly series or cascade compensation, in which the controller...
Control System Problem
When forming a closed-loop system, issues can arise if the poles cross into the unstable region, leading to potential...
Ladder Diagrams: Complexation Equilibria
The formation constant, K1, for the formation of Cd(NH3)2+ complex from cadmium and ammonia is 3.55 × 102. Log K1 (i.e. pNH3) is 2.55, and...

