18 research outputs found
A Framework to Control Functional Connectivity in the Human Brain
In this paper, we propose a framework to control brain-wide functional
connectivity by selectively acting on the brain's structure and parameters.
Functional connectivity, which measures the degree of correlation between
neural activities in different brain regions, can be used to distinguish
between healthy and certain diseased brain dynamics and, possibly, as a control
parameter to restore healthy functions. In this work, we use a collection of
interconnected Kuramoto oscillators to model oscillatory neural activity, and
show that functional connectivity is essentially regulated by the degree of
synchronization between different clusters of oscillators. Then, we propose a
minimally invasive method to correct the oscillators' interconnections and
frequencies to enforce arbitrary and stable synchronization patterns among the
oscillators and, consequently, a desired pattern of functional connectivity.
Additionally, we show that our synchronization-based framework is robust to
parameter mismatches and numerical inaccuracies, and validate it using a
realistic neurovascular model to simulate neural activity and functional
connectivity in the human brain.Comment: To appear in the proceedings of the 58th IEEE Conference on Decision
and Contro
A Unifying Framework for Strong Structural Controllability
This paper deals with strong structural controllability of linear systems. In
contrast to existing work, the structured systems studied in this paper have a
so-called zero/nonzero/arbitrary structure, which means that some of the
entries are equal to zero, some of the entries are arbitrary but nonzero, and
the remaining entries are arbitrary (zero or nonzero). We formalize this in
terms of pattern matrices whose entries are either fixed zero, arbitrary
nonzero, or arbitrary. We establish necessary and sufficient algebraic
conditions for strong structural controllability in terms of full rank tests of
certain pattern matrices. We also give a necessary and sufficient graph
theoretic condition for the full rank property of a given pattern matrix. This
graph theoretic condition makes use of a new color change rule that is
introduced in this paper. Based on these two results, we then establish a
necessary and sufficient graph theoretic condition for strong structural
controllability. Moreover, we relate our results to those that exists in the
literature, and explain how our results generalize previous work.Comment: 11 pages, 6 Figure
Controllability of multi-agent systems with input and communication delays
Distributed cooperative control of multi-agent systems is broadly applied in artificial intelligence in which time delay is of great concern because of its ubiquitous. This paper considers the controllability of leader-follower multi-agent systems with input and communication delays. For the first-order systems with input delay, neighbor-based protocol is adopted to realize the interactions among agents, yielding a system with delay existed in state and control input. New notions of interval controllability and interval structural controllability for the system are defined. Algebraic criterion is established for interval controllability, and graph-theoretic interpretation is put forward for the interval structural controllability. Results imply that input delay of the multi-agent systems has significant influence on the interval controllability and interval structural controllability. Corresponding conclusions are generalized to the first-order systems and the high-order ones with communication delays, respectively. Example is attached to illustrate the work
Strong Structural Controllability of Colored Structured Systems
This paper deals with strong structural controllability of linear structured
systems in which the system matrices are given by zero/nonzero/arbitrary
pattern matrices. Instead of assuming that the nonzero and arbitrary entries of
the system matrices can take their values completely independently, this paper
allows equality constraints on these entries, in the sense that {\em a priori}
given entries in the system matrices are restricted to take arbitrary but
identical values. To formalize this general class of structured systems, we
introduce the concepts of colored pattern matrices and colored structured
systems. The main contribution of this paper is that it generalizes both the
classical results on strong structural controllability of structured systems as
well as recent results on controllability of systems defined on colored graphs.
In this paper, we will establish both algebraic and graph-theoretic conditions
for strong structural controllability of this more general class of structured
systems.Comment: 8 pages, 5 figure