Results 181 to 190 of about 16,499 (231)
Some of the next articles are maybe not open access.
IEEE Transactions on Automatic Control, 2023
For a high-dimensional Kuramoto model with identical oscillators under a general digraph that has a directed spanning tree, although the exponential synchronization has been proved under some initial state constraints, exponential synchronization rates ...
S. Peng +4 more
semanticscholar +1 more source
For a high-dimensional Kuramoto model with identical oscillators under a general digraph that has a directed spanning tree, although the exponential synchronization has been proved under some initial state constraints, exponential synchronization rates ...
S. Peng +4 more
semanticscholar +1 more source
IEEE Transactions on Neural Networks and Learning Systems, 2022
In this article, we study the multicluster games over weight-balanced digraphs, where the cost functions of all players are nonsmooth. Besides, in the problem, not only are the decisions of all players constrained by heterogeneous local constraints but ...
Zhenhua Deng, Yangyang Liu
semanticscholar +1 more source
In this article, we study the multicluster games over weight-balanced digraphs, where the cost functions of all players are nonsmooth. Besides, in the problem, not only are the decisions of all players constrained by heterogeneous local constraints but ...
Zhenhua Deng, Yangyang Liu
semanticscholar +1 more source
IEEE Transactions on Cybernetics, 2021
Signed digraphs with both positive and negative weighted edges are widely applied to explain cooperative and competitive interactions arising from various social, biological, and physical systems.
Jinliang Shao +3 more
semanticscholar +1 more source
Signed digraphs with both positive and negative weighted edges are widely applied to explain cooperative and competitive interactions arising from various social, biological, and physical systems.
Jinliang Shao +3 more
semanticscholar +1 more source
Observer-Based Bipartite Containment Control for Singular Multi-Agent Systems Over Signed Digraphs
IEEE Transactions on Circuits and Systems Part 1: Regular Papers, 2021This paper aims at solving the bipartite containment problem for linear singular multi-agent systems (MASs) with multiple dynamic leaders over general signed digraphs, where each leader can be autonomous or dynamically evolving via interactions with its ...
Zhen-Hua Zhu +4 more
semanticscholar +1 more source
Distributed Optimal Control for Linear Multiagent Systems on General Digraphs
IEEE Transactions on Automatic Control, 2020This article is concerned with the distributed optimal control of multiagent systems (MASs) with general linear dynamics. The cooperative tracking model consisting of multiple followers and one leader is constructed.
Zhuo Zhang, Weisheng Yan, Huiping Li
semanticscholar +1 more source
Complex adjacency matrix and energy of digraphs
Linear and Multilinear Algebra, 2017Rashid Farooq, Juan Rada, Mehtab Khan
exaly +2 more sources
Mathematical Notes, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grigoryan, Alexander +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grigoryan, Alexander +2 more
openaire +1 more source
IEEE Transactions on Cybernetics, 2018
In this paper, a distributed resource allocation problem with nonsmooth local cost functions is considered, where the interaction among agents is depicted by strongly connected and weight-balanced digraphs.
Zhenhua Deng, Shu Liang, Yiguang Hong
semanticscholar +1 more source
In this paper, a distributed resource allocation problem with nonsmooth local cost functions is considered, where the interaction among agents is depicted by strongly connected and weight-balanced digraphs.
Zhenhua Deng, Shu Liang, Yiguang Hong
semanticscholar +1 more source
Journal of Graph Theory, 2014
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Stephan Dominique Andres +1 more
openaire +2 more sources
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Stephan Dominique Andres +1 more
openaire +2 more sources
Distributed nonconvex constrained optimization over time-varying digraphs
Mathematical programming, 2018This paper considers nonconvex distributed constrained optimization over networks, modeled as directed (possibly time-varying) graphs. We introduce the first algorithmic framework for the minimization of the sum of a smooth nonconvex (nonseparable ...
G. Scutari, Ying Sun
semanticscholar +1 more source