Related papers: Controllability and Accessibility on Graphs for Bi…
The present paper shows that the bounded control set of a linear system on a connected Lie group $G$ contains all the bounded orbits of the system. As a consequence, its closure is the continuous image of the cartesian product of the set of…
In this work, we explore edge direction, transitivity, and connectedness of Cayley graphs of gyrogroups. More specifically, we find conditions for a Cayley graph of a gyrogroup to be undirected, transitive, and connected. We also show a…
In control theory, researchers need to understand a system's local and global behaviors in relation to its initial conditions. When discussing observability, the main focus is on the ability to analyze the system using an output space…
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…
We consider the set of bimodal linear systems consisting of two linear dynamics acting on each side of a given hyperplane, assuming continuity along the separating hyperplane. Focusing on the unobservable planar ones, we obtain a simple…
Bidirected graphs are a common generalisation of directed graphs where arcs can also be incoming to both their incident nodes, or outgoing from both their incident nodes. Such arcs allow a walk to change direction. Some algorithms can…
Various controllability conditions have been obtained by researchers for heterogeneous networked systems with linear dynamics. However, the literature for nonlinear, heterogeneous networked systems is comparatively less. In this paper we…
The purpose of this paper is to describe explicitly the solution for linear control systems on Lie groups. In case of linear control systems with inner derivations, the solution is given basically by the product of the exponential of the…
There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality…
This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed…
In this article, we give a condition for the global controllability of affine nonlinear control systems with drifts on Euclidean spaces. Under regularity assumptions, the condition is necessary and sufficient in the codimension-1 and…
In this paper, we study linear control systems with positive bounded orbits. We show that the existence of positive bounded orbits imposes strong algebraic and topological constraints on the state space. In fact, a linear control system has…
Let $G$ be a graph on $n$ vertices with adjacency matrix $A$, and let $\mathbf{1}$ be the all-ones vector. We call $G$ controllable if the set of vectors $\mathbf{1}, A\mathbf{1}, \dots, A^{n-1}\mathbf{1}$ spans the whole space…
In this paper we extend the results on controllability of linear systems obtained in "Controllability of linear systems on solvable Lie groups", from solvable Lie groups to Lie groups with finite semisimple center.
Although ubiquitous, interactions of groups of individuals (e.g., modern messaging applications, group meetings, or even a parliament discussion) are not yet thoroughly studied. Frequently, single-groups are modeled as critical-mass…
In this paper, the target controllability of multiagent systems under directed weighted topology is studied. A graph partition is constructed, in which part of the nodes are divided into different cells, which are selected as leaders. The…
In this paper, we study the target controllability problem of networked dynamical systems, in which we are tasked to steer a subset of network states towards a desired objective. More specifically, we derive necessary and sufficient…
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…
The paper puts forward sufficient conditions for local controllability of a control dynamical system. The results obtained are meaningful in the case when the linear approximation to this system is not completely controllable. As a…
Identifying the nodes that must be directly controlled to steer a network along a desired trajectory remains an open problem for digraphs, and even more so for hypergraphs. In this manuscript, we investigate network systems coupled via…